mirror of
https://github.com/Zeal-Operating-System/ZealOS.git
synced 2024-12-29 16:56:30 +00:00
103 lines
8.9 KiB
HTML
Executable file
103 lines
8.9 KiB
HTML
Executable file
<!DOCTYPE HTML>
|
|
<html>
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html;charset=US-ASCII">
|
|
<meta name="generator" content="ZealOS V0.05">
|
|
<style type="text/css">
|
|
body {background-color:#000000;}
|
|
.cF0{color:#ffffff;background-color:#000000;}
|
|
.cF1{color:#3465a4;background-color:#000000;}
|
|
.cF2{color:#4e9a06;background-color:#000000;}
|
|
.cF3{color:#06989a;background-color:#000000;}
|
|
.cF4{color:#a24444;background-color:#000000;}
|
|
.cF5{color:#75507b;background-color:#000000;}
|
|
.cF6{color:#ce982f;background-color:#000000;}
|
|
.cF7{color:#bcc0b9;background-color:#000000;}
|
|
.cF8{color:#555753;background-color:#000000;}
|
|
.cF9{color:#729fcf;background-color:#000000;}
|
|
.cFA{color:#82bc49;background-color:#000000;}
|
|
.cFB{color:#34e2e2;background-color:#000000;}
|
|
.cFC{color:#ac3535;background-color:#000000;}
|
|
.cFD{color:#ad7fa8;background-color:#000000;}
|
|
.cFE{color:#fce94f;background-color:#000000;}
|
|
.cFF{color:#000000;background-color:#000000;}
|
|
</style>
|
|
</head>
|
|
<body>
|
|
<pre style="font-family:courier;font-size:10pt">
|
|
<a name="l1"></a><span class=cF2>//This takes an input file of doubles and makes a sorted output file.</span><span class=cF0>
|
|
<a name="l2"></a>
|
|
<a name="l3"></a></span><span class=cF5>Cd</span><span class=cF0>(</span><span class=cF3>__DIR__</span><span class=cF0>);;
|
|
<a name="l4"></a>
|
|
<a name="l5"></a></span><span class=cF9>I64</span><span class=cF0> Compare(</span><span class=cF1>F64</span><span class=cF0> e1, </span><span class=cF1>F64</span><span class=cF0> e2)
|
|
<a name="l6"></a>{
|
|
<a name="l7"></a> </span><span class=cF1>return</span><span class=cF0> </span><span class=cF5>Sign</span><span class=cF0>(e1 - e2);
|
|
<a name="l8"></a>}
|
|
<a name="l9"></a>
|
|
<a name="l10"></a></span><span class=cF1>U0</span><span class=cF0> F64FileSortTXT(</span><span class=cF1>U8</span><span class=cF0> *in_name,</span><span class=cF1>U8</span><span class=cF0> *out_name)
|
|
<a name="l11"></a>{
|
|
<a name="l12"></a> </span><span class=cF9>CCompCtrl</span><span class=cF0> *cc;
|
|
<a name="l13"></a> </span><span class=cF9>I64</span><span class=cF0> i, n;
|
|
<a name="l14"></a> </span><span class=cF1>F64</span><span class=cF0> *a;
|
|
<a name="l15"></a> </span><span class=cF9>CDoc</span><span class=cF0> *doc;
|
|
<a name="l16"></a>
|
|
<a name="l17"></a> </span><span class=cF2>//Pass1: Count the number of F64s.</span><span class=cF0>
|
|
<a name="l18"></a> n = </span><span class=cFE>0</span><span class=cF0>;
|
|
<a name="l19"></a> cc = </span><span class=cF5>CompCtrlNew</span><span class=cF0>(</span><span class=cF5>MStrPrint</span><span class=cF7>(</span><span class=cF6>"#include \"%s\""</span><span class=cF0>, in_name</span><span class=cF7>)</span><span class=cF0>);
|
|
<a name="l20"></a> </span><span class=cF1>while</span><span class=cF0> (</span><span class=cF5>Lex</span><span class=cF7>(</span><span class=cF0>cc</span><span class=cF7>)</span><span class=cF0>)
|
|
<a name="l21"></a> </span><span class=cF1>if</span><span class=cF0> (cc->token == </span><span class=cF3>TK_F64</span><span class=cF0>)
|
|
<a name="l22"></a> n++;
|
|
<a name="l23"></a> </span><span class=cF5>CompCtrlDel</span><span class=cF0>(cc);
|
|
<a name="l24"></a>
|
|
<a name="l25"></a> a = </span><span class=cF5>MAlloc</span><span class=cF0>(n * </span><span class=cF1>sizeof</span><span class=cF7>(</span><span class=cF1>F64</span><span class=cF7>)</span><span class=cF0>);
|
|
<a name="l26"></a>
|
|
<a name="l27"></a> </span><span class=cF2>//Pass2: Read F64s.</span><span class=cF0>
|
|
<a name="l28"></a> i = </span><span class=cFE>0</span><span class=cF0>;
|
|
<a name="l29"></a> cc = </span><span class=cF5>CompCtrlNew</span><span class=cF0>(</span><span class=cF5>MStrPrint</span><span class=cF7>(</span><span class=cF6>"#include \"%s\""</span><span class=cF0>, in_name</span><span class=cF7>)</span><span class=cF0>);
|
|
<a name="l30"></a> </span><span class=cF1>while</span><span class=cF0> (</span><span class=cF5>Lex</span><span class=cF7>(</span><span class=cF0>cc</span><span class=cF7>)</span><span class=cF0>)
|
|
<a name="l31"></a> </span><span class=cF1>if</span><span class=cF0> (cc->token == </span><span class=cF3>TK_F64</span><span class=cF0>)
|
|
<a name="l32"></a> a[i++] = cc->cur_f64;
|
|
<a name="l33"></a> </span><span class=cF5>CompCtrlDel</span><span class=cF0>(cc);
|
|
<a name="l34"></a>
|
|
<a name="l35"></a> </span><span class=cF5>QuickSortI64</span><span class=cF0>(a, n, &Compare); </span><span class=cF2>//Sort 64-bit sized values</span><span class=cF0>
|
|
<a name="l36"></a>
|
|
<a name="l37"></a> </span><span class=cF2>//Save</span><span class=cF0>
|
|
<a name="l38"></a> doc = </span><span class=cF5>DocNew</span><span class=cF0>(out_name);
|
|
<a name="l39"></a> </span><span class=cF5>DocPrint</span><span class=cF0>(doc, </span><span class=cF6>"//This is sorted.\n"</span><span class=cF0>);
|
|
<a name="l40"></a> </span><span class=cF1>for</span><span class=cF0> (i = </span><span class=cFE>0</span><span class=cF0>; i < n; i++)
|
|
<a name="l41"></a> </span><span class=cF5>DocPrint</span><span class=cF0>(doc, </span><span class=cF6>"%12.6f\n"</span><span class=cF0>, a[i]);
|
|
<a name="l42"></a> </span><span class=cF5>DocWrite</span><span class=cF0>(doc);
|
|
<a name="l43"></a> </span><span class=cF5>DocDel</span><span class=cF0>(doc);
|
|
<a name="l44"></a>
|
|
<a name="l45"></a> </span><span class=cF5>Free</span><span class=cF0>(a);
|
|
<a name="l46"></a>}
|
|
<a name="l47"></a>F64FileSortTXT(</span><span class=cF6>"~/DemoUnsortedF64.DD"</span><span class=cF0>, </span><span class=cF6>"~/DemoSortedF64.DD"</span><span class=cF0>);
|
|
<a name="l48"></a></span><span class=cF5>Type</span><span class=cF0>(</span><span class=cF6>"~/DemoUnsortedF64.DD"</span><span class=cF0>);
|
|
<a name="l49"></a></span><span class=cF5>Type</span><span class=cF0>(</span><span class=cF6>"~/DemoSortedF64.DD"</span><span class=cF0>);
|
|
<a name="l50"></a>
|
|
<a name="l51"></a></span><span class=cF1>U0</span><span class=cF0> F64FileSortDAT(</span><span class=cF1>U8</span><span class=cF0> *in_name, </span><span class=cF1>U8</span><span class=cF0> *out_name)
|
|
<a name="l52"></a>{</span><span class=cF2>//</span><span class=cF4><u>File/CFile</u></span><span class=cF2>, </span><a href="https://www.tomawezome.github.io/ZealOS/Demo/Disk/DataBase.html#l1"><span class=cF4>::/Demo/Disk/DataBase.CC</span></a><span class=cF0>
|
|
<a name="l53"></a> </span><span class=cF9>I64</span><span class=cF0> size;
|
|
<a name="l54"></a> </span><span class=cF1>F64</span><span class=cF0> *a = </span><span class=cF5>FileRead</span><span class=cF0>(in_name, &size);
|
|
<a name="l55"></a>
|
|
<a name="l56"></a> </span><span class=cF5>QuickSortI64</span><span class=cF0>(a,size / </span><span class=cF1>sizeof</span><span class=cF7>(</span><span class=cF1>F64</span><span class=cF7>)</span><span class=cF0>, &Compare); </span><span class=cF2>//Sort 64-bit sized values</span><span class=cF0>
|
|
<a name="l57"></a> </span><span class=cF5>FileWrite</span><span class=cF0>(out_name, a, size);
|
|
<a name="l58"></a> </span><span class=cF5>Free</span><span class=cF0>(a);
|
|
<a name="l59"></a>}
|
|
<a name="l60"></a>F64FileSortDAT(</span><span class=cF6>"~/DemoUnsortedF64.DATA"</span><span class=cF0>, </span><span class=cF6>"~/DemoSortedF64.DATA"</span><span class=cF0>);
|
|
<a name="l61"></a>
|
|
<a name="l62"></a></span><span class=cF1>U0</span><span class=cF0> F64FileDumpDAT(</span><span class=cF1>U8</span><span class=cF0> *in_name)
|
|
<a name="l63"></a>{</span><span class=cF2>//</span><span class=cF4><u>File/CFile</u></span><span class=cF2>, </span><a href="https://www.tomawezome.github.io/ZealOS/Demo/Disk/DataBase.html#l1"><span class=cF4>::/Demo/Disk/DataBase.CC</span></a><span class=cF0>
|
|
<a name="l64"></a> </span><span class=cF9>I64</span><span class=cF0> i, n, size;
|
|
<a name="l65"></a> </span><span class=cF1>F64</span><span class=cF0> *a = </span><span class=cF5>FileRead</span><span class=cF0>(in_name, &size);
|
|
<a name="l66"></a>
|
|
<a name="l67"></a> n = size / </span><span class=cF1>sizeof</span><span class=cF0>(</span><span class=cF1>F64</span><span class=cF0>);
|
|
<a name="l68"></a> </span><span class=cF6>"%s\n"</span><span class=cF0>, in_name;
|
|
<a name="l69"></a> </span><span class=cF1>for</span><span class=cF0> (i = </span><span class=cFE>0</span><span class=cF0>; i < n; i++)
|
|
<a name="l70"></a> </span><span class=cF6>"%12.6f\n"</span><span class=cF0>, a[i];
|
|
<a name="l71"></a> </span><span class=cF5>Free</span><span class=cF0>(a);
|
|
<a name="l72"></a>}
|
|
<a name="l73"></a>F64FileDumpDAT(</span><span class=cF6>"~/DemoUnsortedF64.DATA"</span><span class=cF0>);
|
|
<a name="l74"></a>F64FileDumpDAT(</span><span class=cF6>"~/DemoSortedF64.DATA"</span><span class=cF0>);
|
|
</span></pre></body>
|
|
</html>
|