change references to post Great Fork Merge URLs
In preparation for the **Great Fork Merge**: We change references for the repo from `https://github.com/ioccc-src/temp-test-ioccc` to `https://github.com/ioccc-src/winner`. We change references for the web site from `https://ioccc-src.github.io/temp-test-ioccc` to `https://github.com/ioccc-src/winner`. NOTE: There will be a **LOT OF LINKS BROKEN**, because of the changes to the REPO URL and the WEBSITE URL, until the **Great Fork Merge** updates the+[official IOCCC website](https://www.ioccc.org).
This commit is contained in:
Landon Curt Noll committed
1 parent
1d264105d2
commit
6b950a2e3c
452 files changed
+17037
-16746
No files matched your search
@@ -413,7 +413,7 @@
|
||||
|
||||
<div class="navbar">
|
||||
<a class="Left" href="index.html">↑ jump to 1991/brnstnd/index.html ↑</a>
|
||||
<a class="Right" href="https://validator.w3.org/nu/?doc=https%3A%2F%2Fioccc-src.github.io%2Ftemp-test-ioccc%2F1991%2Fbrnstnd%2Fsorta.README.html">✓</a>
|
||||
<a class="Right" href="https://validator.w3.org/nu/?doc=https%3A%2F%2Fwww.ioccc.org%2F1991%2Fbrnstnd%2Fsorta.README.html">✓</a>
|
||||
</div>
|
||||
|
||||
<!-- END: this line ends content from: inc/navbar.up2index.html -->
|
||||
@@ -426,15 +426,15 @@
|
||||
|
||||
<!-- BEFORE: 1st line of markdown file: 1991/brnstnd/sorta.README.md -->
|
||||
<p>The <code>sorta</code> scripts described below can sorta be found in this directory.</p>
|
||||
<h2 id="sorta.i22"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.i2+2">sorta.i2+2</a></h2>
|
||||
<h2 id="sorta.i22"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.i2+2">sorta.i2+2</a></h2>
|
||||
<pre><code> 2 2+#` [ about as basic as you can get ]ld</code></pre>
|
||||
<p>This script takes 2, adds 2 to it, and prints the result (with a
|
||||
newline). I get 5 on the hand-held Sinclair under ZYNIX. Let me know if
|
||||
your machine produces a different result so that I can send you patches.</p>
|
||||
<h2 id="sorta.iarg0"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.iarg0">sorta.iarg0</a></h2>
|
||||
<h2 id="sorta.iarg0"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.iarg0">sorta.iarg0</a></h2>
|
||||
<pre><code> 0A` [ take arg 0, print it ]</code></pre>
|
||||
<p>This is self-explanatory.</p>
|
||||
<h2 id="sorta.icalc"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.icalc">sorta.icalc</a></h2>
|
||||
<h2 id="sorta.icalc"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.icalc">sorta.icalc</a></h2>
|
||||
<pre><code> [D2sD3s]:Dld [ input m n, output m n m n ]ld
|
||||
|
||||
[2*1=d]:cld [ aux routine for :d recursion ]ld
|
||||
@@ -476,43 +476,43 @@ its arguments. Can you see how? (Hint: Try <code>./sorta "2 2+" 3 < sorta.ica
|
||||
Look at program A.) <code>icalc</code> also provides a useful binary output routine,
|
||||
and if you can’t remember offhand that <code>D2sD3s&2sD&1sD&&&D&</code> means XOR,
|
||||
you can just look it up here.</p>
|
||||
<h2 id="sorta.idup"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.idup">sorta.idup</a></h2>
|
||||
<h2 id="sorta.idup"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.idup">sorta.idup</a></h2>
|
||||
<pre><code> [ld#1_+1=y]:x
|
||||
[uD1+=x]:y
|
||||
0""1=y`</code></pre>
|
||||
<p>This script prints out the maximum file descriptor available from
|
||||
repeated <code>dup(2)</code>s—usually <code>NOFILE - 1</code>. Can you see how it works?</p>
|
||||
<h2 id="sorta.iecho"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.iecho">sorta.iecho</a></h2>
|
||||
<h2 id="sorta.iecho"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.iecho">sorta.iecho</a></h2>
|
||||
<pre><code> [" "$ld]:sld [ print a space ]ld
|
||||
[1s1+DA$ld1s1_+D=sD=x]:xld [ given n (argc-n), print args ]ld
|
||||
0a1_+D=x""` [ simulation of /bin/echo ]ld</code></pre>
|
||||
<p>This is a clone of <code>/bin/echo</code>, minus any argument processing and escape
|
||||
interpretation. (Note that, unlike some shells’ echo, <code>/bin/echo</code> prints a
|
||||
newline even with no arguments.) Try <code>./sorta foo bar < iecho</code>.</p>
|
||||
<h2 id="sorta.ifact1"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.ifact1">sorta.ifact1</a></h2>
|
||||
<h2 id="sorta.ifact1"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.ifact1">sorta.ifact1</a></h2>
|
||||
<pre><code> 1#`ld2*#`ld3*#`ld4*#`ld5*#`ld6*#`ld7*#`ld8*#`ld9*#`ld10*#`ld</code></pre>
|
||||
<p>This is a very straightforward factorial program: Take 1, print it,
|
||||
multiply by 2, print it, multiply by 3, print it, etc.</p>
|
||||
<h2 id="sorta.ifact2"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.ifact2">sorta.ifact2</a></h2>
|
||||
<h2 id="sorta.ifact2"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.ifact2">sorta.ifact2</a></h2>
|
||||
<pre><code> [1+D2s*#`ld1s]:f
|
||||
1 0
|
||||
1=f 1=f 1=f 1=f 1=f 1=f 1=f 1=f 1=f 1=f</code></pre>
|
||||
<p><code>ifact1</code> does a lot of repeated work. <code>ifact2</code> takes advantage of this by
|
||||
keeping the current <code>n!</code> <code>n</code> on the stack. Each call to routine <code>f (1=f)</code>
|
||||
increments <code>n</code> by <code>1</code> and prints out the factorial.</p>
|
||||
<h2 id="sorta.ifact3"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.ifact3">sorta.ifact3</a></h2>
|
||||
<h2 id="sorta.ifact3"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.ifact3">sorta.ifact3</a></h2>
|
||||
<pre><code> [1+D2s*#`ld1s]:f [ given (n-1)! (n-1), print n!, put n! n ]
|
||||
[2s1=f2s1_+D0>=x]:x [ given n n! x, print (n+1)! through (n+x)! ]
|
||||
0 1 10 1=x</code></pre>
|
||||
<p>Finally, <code>ifact3</code> removes all the redundancy from <code>ifact2</code>, and exhibits
|
||||
proper documentation of stack routines. You can replace the <code>10</code> by
|
||||
anything in this version.</p>
|
||||
<h2 id="sorta.iio"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.iio">sorta.iio</a></h2>
|
||||
<h2 id="sorta.iio"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.iio">sorta.iio</a></h2>
|
||||
<pre><code> [ a simple example of interpreting code on the fly ]ld
|
||||
|
||||
["] "2 2+":xT ["]T " produces "T 1=x#T " which should be 4."T`</code></pre>
|
||||
<p>Notice that <code>"2 2+"</code> is a literal string inside the program.</p>
|
||||
<h2 id="sorta.irot13"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.irot13">sorta.irot13</a></h2>
|
||||
<h2 id="sorta.irot13"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.irot13">sorta.irot13</a></h2>
|
||||
<pre><code> "[] [.tr] "
|
||||
["]".[a-m][n-z][A-M][N-Z]"[" ]TTT ["]".[n-z][a-m][N-Z][A-M]"[" ]TTT
|
||||
"[tr] !q"T:xld
|
||||
@@ -529,7 +529,7 @@ spots. <code>1A 0 0 o</code> opens <code>argv[1]</code>; the <code>'</code> keep
|
||||
subroutine <code>h</code> to print a nice error message if necessary. <code>0Ou</code> closes
|
||||
stdout and replaces it with the new descriptor. Finally, subroutine <code>x</code>
|
||||
executes the <code>tr</code>.</p>
|
||||
<h2 id="sorta.isleep"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.isleep">sorta.isleep</a></h2>
|
||||
<h2 id="sorta.isleep"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.isleep">sorta.isleep</a></h2>
|
||||
<pre><code> ["" "+sleep" "+5" "sleep" !q]:S [F0>1_+=S]:s
|
||||
"forking sleep 5..."`ld
|
||||
1=s
|
||||
@@ -537,13 +537,13 @@ executes the <code>tr</code>.</p>
|
||||
w
|
||||
"done, sleep exit code " #T`</code></pre>
|
||||
<p>This script illustrates the classic fork-exec-wait.</p>
|
||||
<h2 id="sorta.itailrec"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.itailrec">sorta.itailrec</a></h2>
|
||||
<h2 id="sorta.itailrec"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.itailrec">sorta.itailrec</a></h2>
|
||||
<pre><code> [3*#" "T$ldD=f]:f
|
||||
1=f</code></pre>
|
||||
<p>The sole purpose of this script is to prove that <code>sorta</code> can do infinite
|
||||
tail recursion (in this case, in program <code>f</code>). Do <code>./sorta < itailrec | more</code>
|
||||
and watch the powers of 3 (mod your computer’s word size) flow by.</p>
|
||||
<h2 id="sorta.iwhosort"><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1991/brnstnd/sorta.iwhosort">sorta.iwhosort</a></h2>
|
||||
<h2 id="sorta.iwhosort"><a href="https://github.com/ioccc-src/winner/blob/master/1991/brnstnd/sorta.iwhosort">sorta.iwhosort</a></h2>
|
||||
<pre><code> [0Ou "" "+-u" "sort" !q]:S [F0>1_+=S]:s
|
||||
[1Ou "" "+-u" "who" !q]:W [F0>1_+=W]:w
|
||||
P1=wO1=sOww</code></pre>
|
||||
@@ -623,7 +623,7 @@ and watch the powers of 3 (mod your computer’s word size) flow by.</p>
|
||||
|
||||
<div id="coda"><h3>Coda</h3>
|
||||
<p>
|
||||
<a href="https://validator.w3.org/nu/?doc=https%3A%2F%2Fioccc-src.github.io%2Ftemp-test-ioccc%2F1991%2Fbrnstnd%2Fsorta.README.html" rel="nofollow">Nu HTML check this web page</a><br>
|
||||
<a href="https://validator.w3.org/nu/?doc=https%3A%2F%2Fwww.ioccc.org%2F1991%2Fbrnstnd%2Fsorta.README.html" rel="nofollow">Nu HTML check this web page</a><br>
|
||||
<a href="#top">Jump to top</a> <a href="#content">Jump to Content</a>
|
||||
</p>
|
||||
</div>
|
||||
|
||||
Reference in new issue
Block a user