fix more broken markdown links
We fix more markdown links in markdown files that refer to files internally to the web site. Added tmp tools to find and print various markdown links: * `tmp/md-links.sh` - print all markdown links * `tmp/md-token-links.sh` - print all markdown links that start with a **%%TOKEN%%** * `tmp/md-local-links.sh` - print all markdown links to a local file * `tmp/md-link-paths.sh` - print local file paths referenced in markdown links Fixed a number of markdown formatting problems with `thanks-for-help.md`. Fixed markdown links to files in `thanks-for-help.md`. Improved heading levels in `thanks-for-help.md`, and made entry sections consistent. Changed all markdown links that end in "))" to end in a better way. Explained in `markdown.md` why we are avoiding markdown links that end in "))". Ran `make www` to perform the above. TODO: Fix stuff we broke by mistake doing the above. TODO: Fix more broken markdown links.
This commit is contained in:
1 parent
60960e1650
commit
4f95e3f3d6
174 files changed
+4008
-2029
No files matched your search
+1
-1
@@ -56,7 +56,7 @@ But don't ignore the other winning entries! There are games, utilities,
|
||||
eye candy, calculators and graphical tools to explore.
|
||||
|
||||
This year, Yusuke Endoh won with two entries, one of which
|
||||
([endoh1](endoh1/index.html)) won the special Honorable mention award. Eight of
|
||||
([endoh1](endoh1/index.html) entry) won the special Honorable mention award. Eight of
|
||||
the winning entries were from people who won in previous years.
|
||||
|
||||
This year we had a number of authors from Asia. We saw our second
|
||||
|
||||
@@ -35,7 +35,7 @@ For more detailed information see [2012 blakely bugs](../../bugs.html#2012_blake
|
||||
Several IOCCC themes ([RPN
|
||||
calculator](https://en.wikipedia.org/wiki/Reverse_Polish_notation), animated
|
||||
[GIF](https://en.wikipedia.org/wiki/GIF) generator, [ray
|
||||
tracing](https://en.wikipedia.org/wiki/Ray_tracing_(graphics))) in one package!
|
||||
tracing](https://en.wikipedia.org/wiki/Ray_tracing_(graphics)) graphics) in one package!
|
||||
Very impressive!
|
||||
|
||||
The checkerboard pattern in the output can be broken. Could you figure out how?
|
||||
@@ -49,7 +49,7 @@ Larger GIF files confuse some image viewers.
|
||||
|
||||
This program renders a generic
|
||||
[RPN](https://en.wikipedia.org/wiki/Reverse_Polish_notation) expression in
|
||||
[ray-traced](https://en.wikipedia.org/wiki/Ray_tracing_(graphics)) animated
|
||||
[ray-traced](https://en.wikipedia.org/wiki/Ray_tracing_(graphics)) animated
|
||||
[GIF](https://en.wikipedia.org/wiki/GIF) form. The expression in spatial
|
||||
variables `x` and `y` is specified on the command-line with the required
|
||||
resolution, and an animated GIF showing a fly-around of the resulting surface is
|
||||
|
||||
@@ -411,7 +411,7 @@ Location: <a href="../../location.html#GB">GB</a> - <em>United Kingdom of Great
|
||||
<p>Several IOCCC themes (<a href="https://en.wikipedia.org/wiki/Reverse_Polish_notation">RPN
|
||||
calculator</a>, animated
|
||||
<a href="https://en.wikipedia.org/wiki/GIF">GIF</a> generator, <a href="https://en.wikipedia.org/wiki/Ray_tracing_(graphics)">ray
|
||||
tracing</a>) in one package!
|
||||
tracing</a> graphics) in one package!
|
||||
Very impressive!</p>
|
||||
<p>The checkerboard pattern in the output can be broken. Could you figure out how?</p>
|
||||
<p>Larger GIF files confuse some image viewers.</p>
|
||||
|
||||
@@ -108,8 +108,8 @@ be `"`` ` ``cat deckmyn.c`` ` ``"`.
|
||||
The second command line argument is the music itself. This is, again, a string,
|
||||
not a file name. All music signs are entered as tokens of exactly 3 characters.
|
||||
The code is very sensitive to bad spacing! So for instance, if you use a file to
|
||||
write the music (e.g. [example\_greensleeves](%%REPO_URL%%/2012/deckmyn/example_greensleeves)), you should
|
||||
keep in mind that newline is also a character!
|
||||
write the music (e.g., [example\_greensleeves](%%REPO_URL%%/2012/deckmyn/example_greensleeves) file),
|
||||
you should keep in mind that newline is also a character!
|
||||
|
||||
|
||||
### Internals
|
||||
|
||||
@@ -452,8 +452,8 @@ be <code>"``</code> <code>cat deckmyn.c</code> <code>``"</code>.</p>
|
||||
<p>The second command line argument is the music itself. This is, again, a string,
|
||||
not a file name. All music signs are entered as tokens of exactly 3 characters.
|
||||
The code is very sensitive to bad spacing! So for instance, if you use a file to
|
||||
write the music (e.g. <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/deckmyn/example_greensleeves">example_greensleeves</a>), you should
|
||||
keep in mind that newline is also a character!</p>
|
||||
write the music (e.g., <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/deckmyn/example_greensleeves">example_greensleeves</a> file),
|
||||
you should keep in mind that newline is also a character!</p>
|
||||
<h3 id="internals">Internals</h3>
|
||||
<p>To minimise the memory footprint, this program has <em>no variable declarations at
|
||||
all</em>, except for the arguments to <code>main()</code>. The only available memory space is
|
||||
|
||||
@@ -291,8 +291,8 @@ casting) it to an integer-type variable.
|
||||
|
||||
[pour-out.txt](%%REPO_URL%%/2012/endoh1/pour-out.txt) pours you a cup of tea.
|
||||
|
||||
[tanada.txt](%%REPO_URL%%/2012/endoh1/tanada.txt) simulates "Terrace farming". ("Tanada" means a "[terraced rice
|
||||
fields](https://en.wikipedia.org/wiki/Terrace_(earthworks))" in Japanese.)
|
||||
[tanada.txt](%%REPO_URL%%/2012/endoh1/tanada.txt) simulates "Terrace farming". ("Tanada" means a
|
||||
"[terraced rice](https://en.wikipedia.org/wiki/Terrace_(earthworks) fields)" in Japanese.)
|
||||
|
||||
[clock.txt](%%REPO_URL%%/2012/endoh1/clock.txt) is a "water" clock created by HAMANO Tsukasa.
|
||||
|
||||
|
||||
@@ -570,8 +570,8 @@ casting) it to an integer-type variable.</p>
|
||||
<p><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/endoh1/logo.txt">logo.txt</a> is a source of the logo in this remark file.</p>
|
||||
<p><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/endoh1/column.txt">column.txt</a> is a water column collapse, which is a popular demo of SPH.</p>
|
||||
<p><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/endoh1/pour-out.txt">pour-out.txt</a> pours you a cup of tea.</p>
|
||||
<p><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/endoh1/tanada.txt">tanada.txt</a> simulates “Terrace farming”. (“Tanada” means a “<a href="https://en.wikipedia.org/wiki/Terrace_(earthworks)">terraced rice
|
||||
fields</a>” in Japanese.)</p>
|
||||
<p><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/endoh1/tanada.txt">tanada.txt</a> simulates “Terrace farming”. (“Tanada” means a
|
||||
“<a href="https://en.wikipedia.org/wiki/Terrace_(earthworks)%20fields">terraced rice</a>” in Japanese.)</p>
|
||||
<p><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/endoh1/clock.txt">clock.txt</a> is a “water” clock created by HAMANO Tsukasa.</p>
|
||||
<p>Other <code>*.txt</code> files are from the judges.</p>
|
||||
<p><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/endoh1/endoh1_color.c">endoh1_color.c</a> is a variant that shows the density by using terminal 256
|
||||
|
||||
@@ -34,7 +34,7 @@ and:
|
||||
## Judges' remarks:
|
||||
|
||||
A
|
||||
[pi](https://en.wikipedia.org/wiki/Pi)/[e](https://en.wikipedia.org/wiki/E_(mathematical_constant))
|
||||
[pi](https://en.wikipedia.org/wiki/Pi)/[e](https://en.wikipedia.org/wiki/E_(mathematical_constant))
|
||||
printing quasi-[quine](https://en.wikipedia.org/wiki/Quine_(computing) in [ASCII
|
||||
art](https://en.wikipedia.org/wiki/ASCII_art) with a compressed font in it; what
|
||||
else to wish for in this program? [Virtual
|
||||
@@ -47,7 +47,7 @@ Yeah, "Again". Sorry. But I don't feel guilty or uncomfortable.
|
||||
|
||||
This entry is based on 'over-used themes' such as self reproducing
|
||||
program and [pi](https://en.wikipedia.org/wiki/Pi) or
|
||||
[e](https://en.wikipedia.org/wiki/E_(mathematical_constant))) computation. I
|
||||
[e](https://en.wikipedia.org/wiki/E_(mathematical_constant() computation. I
|
||||
know you're tired of them.
|
||||
|
||||
But have you ever seen them **all-in-one**?
|
||||
@@ -65,18 +65,18 @@ This program generates a new program in the shape of the Greek letter
|
||||
|
||||
One more thing... When you give a command line argument `e` to the
|
||||
first program, the generated one will compute [Napier's
|
||||
constant](https://en.wikipedia.org/wiki/E_(mathematical_constant)))
|
||||
constant](https://en.wikipedia.org/wiki/E_(mathematical_constant))
|
||||
rather than pi.
|
||||
|
||||
|
||||
### Obfuscation
|
||||
|
||||
This program itself is in the shape of a
|
||||
[spigot](https://en.wikipedia.org/wiki/Tap_(valve)). This is derived as an
|
||||
[spigot](https://en.wikipedia.org/wiki/Tap_(valve)). This is derived as an
|
||||
analogy with [spigot algorithm](https://en.wikipedia.org/wiki/Spigot_algorithm)
|
||||
which infinitely computes the value of a mathematical constant such as
|
||||
[pi](https://en.wikipedia.org/wiki/Pi) or
|
||||
[e](https://en.wikipedia.org/wiki/E_(mathematical_constant)).
|
||||
[e](https://en.wikipedia.org/wiki/E_(mathematical_constant)).
|
||||
|
||||
The two sets of programs, `314*.c` and `271*.c`, are almost the same
|
||||
except their shape and constant computational part. I tailored the
|
||||
@@ -85,7 +85,7 @@ tweaking the computational order and adding meaningless code fragments.
|
||||
|
||||
On the other hand, to make it fit inside one screen (80 x 25), my program is
|
||||
shortened properly, more than it looks. (As you may know,
|
||||
[quines](https://en.wikipedia.org/wiki/Quine_(computing)) need to make its
|
||||
[quines](https://en.wikipedia.org/wiki/Quine_(computing)) need to make its
|
||||
program size doubled.) For example, this program involves 3x5 bitmap font data
|
||||
of ten characters (`0` -- `9`), as just 20 bytes: `G1%xJ{;Q7wunmuGuu%uu`. We
|
||||
can decode character `n` as `275*s[n+10] - 8*s[n] - 8`. I solved the system of
|
||||
|
||||
@@ -421,7 +421,7 @@ machine</a> emulation?</p>
|
||||
<p>Yeah, “Again”. Sorry. But I don’t feel guilty or uncomfortable.</p>
|
||||
<p>This entry is based on ‘over-used themes’ such as self reproducing
|
||||
program and <a href="https://en.wikipedia.org/wiki/Pi">pi</a> or
|
||||
<a href="https://en.wikipedia.org/wiki/E_(mathematical_constant)">e</a>) computation. I
|
||||
<a href="https://en.wikipedia.org/wiki/E_(mathematical_constant(">e</a> computation. I
|
||||
know you’re tired of them.</p>
|
||||
<p>But have you ever seen them <strong>all-in-one</strong>?</p>
|
||||
<h3 id="what-it-is">What it is</h3>
|
||||
@@ -436,7 +436,7 @@ know you’re tired of them.</p>
|
||||
</ul>
|
||||
<p>One more thing… When you give a command line argument <code>e</code> to the
|
||||
first program, the generated one will compute <a href="https://en.wikipedia.org/wiki/E_(mathematical_constant)">Napier’s
|
||||
constant</a>)
|
||||
constant</a>
|
||||
rather than pi.</p>
|
||||
<h3 id="obfuscation">Obfuscation</h3>
|
||||
<p>This program itself is in the shape of a
|
||||
|
||||
@@ -65,7 +65,7 @@ confused.
|
||||
|
||||
The results can be viewed with Acrobat Reader,
|
||||
[evince](http://en.wikipedia.org/wiki/Evince) and Apple's
|
||||
[Preview](https://en.wikipedia.org/wiki/Preview_(macOS)).
|
||||
[Preview](https://en.wikipedia.org/wiki/Preview_(macOS)).
|
||||
|
||||
The updated version can also be viewed using Ghostscript.
|
||||
|
||||
|
||||
+1
-1
@@ -421,7 +421,7 @@ very likely say <a href="http://bit.ly/R6ALpK">wow</a> as we did!</p></li>
|
||||
<p>But don’t ignore the other winning entries! There are games, utilities,
|
||||
eye candy, calculators and graphical tools to explore.</p>
|
||||
<p>This year, Yusuke Endoh won with two entries, one of which
|
||||
(<a href="endoh1/index.html">endoh1</a>) won the special Honorable mention award. Eight of
|
||||
(<a href="endoh1/index.html">endoh1</a> entry) won the special Honorable mention award. Eight of
|
||||
the winning entries were from people who won in previous years.</p>
|
||||
<p>This year we had a number of authors from Asia. We saw our second
|
||||
authors from China and first from Korea. We are pleased to see
|
||||
|
||||
@@ -153,7 +153,7 @@ Output code has these features:
|
||||
* Uses a fairly efficient encoding scheme, better than `uuencode` for
|
||||
files larger than ~13K, and better than `base64` for files larger
|
||||
than 20K.
|
||||
* Encryption with [ISAAC](https://en.wikipedia.org/wiki/ISAAC_(cipher)), a
|
||||
* Encryption with [ISAAC](https://en.wikipedia.org/wiki/ISAAC_(cipher)), a
|
||||
cryptographically secure pseudorandom number generator.
|
||||
* Trivial 3 language polyglot.
|
||||
|
||||
|
||||
@@ -71,8 +71,8 @@ representation in lambda calculus), and translates the evaluated result back
|
||||
into a stream of bits to be output.
|
||||
|
||||
Lambda is encoded as 00, application as 01, and the variable bound by the `n`th
|
||||
enclosing lambda (denoted `n` in so-called [De Bruijn
|
||||
notation](https://en.wikipedia.org/wiki/De_Bruijn_notation)) as `1^{n}0`.
|
||||
enclosing lambda (denoted `n` in so-called [De Bruijn](https://en.wikipedia.org/wiki/De_Bruijn_notation)
|
||||
notation) as `1^{n}0`.
|
||||
That's all there is to
|
||||
[BLC](https://tromp.github.io/cl/Binary_lambda_calculus.html)!
|
||||
|
||||
@@ -110,8 +110,8 @@ The size of the term space is fixed at compile time with `-DA`.
|
||||
|
||||
### A half byte `cat`
|
||||
|
||||
The shortest (closed) lambda calculus term is `\x x (\ 1` in [De Bruijn
|
||||
notation](https://en.wikipedia.org/wiki/De_Bruijn_notation)) which is the
|
||||
The shortest (closed) lambda calculus term is `\x x (\ 1` in
|
||||
[De Bruijn](https://en.wikipedia.org/wiki/De_Bruijn_notation) notation which is the
|
||||
identity function. When its encoding `0010` is fed into the universal machine,
|
||||
it will simply copy the input to the output (well, not that simply, since each
|
||||
byte is smashed to bits and rebuilt from scratch). Voila: a half byte cat:
|
||||
|
||||
@@ -435,8 +435,8 @@ the remainder of input (translated to a lazy list of
|
||||
representation in lambda calculus), and translates the evaluated result back
|
||||
into a stream of bits to be output.</p>
|
||||
<p>Lambda is encoded as 00, application as 01, and the variable bound by the <code>n</code>th
|
||||
enclosing lambda (denoted <code>n</code> in so-called <a href="https://en.wikipedia.org/wiki/De_Bruijn_notation">De Bruijn
|
||||
notation</a>) as <code>1^{n}0</code>.
|
||||
enclosing lambda (denoted <code>n</code> in so-called <a href="https://en.wikipedia.org/wiki/De_Bruijn_notation">De Bruijn</a>
|
||||
notation) as <code>1^{n}0</code>.
|
||||
That’s all there is to
|
||||
<a href="https://tromp.github.io/cl/Binary_lambda_calculus.html">BLC</a>!</p>
|
||||
<p>For example the encoding of lambda term <code>S = \x \y \z (x z) (y z)</code>,
|
||||
@@ -459,8 +459,8 @@ bit of input, and using characters <code>0</code> and <code>1</code> for output.
|
||||
1,2,3,4,8,9: result not in list form</code></pre>
|
||||
<p>The size of the term space is fixed at compile time with <code>-DA</code>.</p>
|
||||
<h3 id="a-half-byte-cat">A half byte <code>cat</code></h3>
|
||||
<p>The shortest (closed) lambda calculus term is <code>\x x (\ 1</code> in <a href="https://en.wikipedia.org/wiki/De_Bruijn_notation">De Bruijn
|
||||
notation</a>) which is the
|
||||
<p>The shortest (closed) lambda calculus term is <code>\x x (\ 1</code> in
|
||||
<a href="https://en.wikipedia.org/wiki/De_Bruijn_notation">De Bruijn</a> notation which is the
|
||||
identity function. When its encoding <code>0010</code> is fed into the universal machine,
|
||||
it will simply copy the input to the output (well, not that simply, since each
|
||||
byte is smashed to bits and rebuilt from scratch). Voila: a half byte cat:</p>
|
||||
|
||||
@@ -31,7 +31,7 @@ will not detect multiple issues.
|
||||
|
||||
## Alternate code:
|
||||
|
||||
The alternate code, [zeitak.alt.c](z%%REPO_URL%%/2012/zeitak/eitak.alt.c), is a version that was slightly
|
||||
The alternate code, [zeitak.alt.c](%%REPO_URL%%/2012/zeitak/zeitak.alt.c), is a version that was slightly
|
||||
deobfuscated by the author. You may find reading it helpful in your attempt to
|
||||
understand this extremely subtle entry.
|
||||
|
||||
|
||||
@@ -411,7 +411,7 @@ text files that are not code.</p>
|
||||
<p>NOTE: the program prints an error and exits on the first nesting error so it
|
||||
will not detect multiple issues.</p>
|
||||
<h2 id="alternate-code">Alternate code:</h2>
|
||||
<p>The alternate code, <a href="zhttps://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/zeitak/eitak.alt.c">zeitak.alt.c</a>, is a version that was slightly
|
||||
<p>The alternate code, <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/zeitak/zeitak.alt.c">zeitak.alt.c</a>, is a version that was slightly
|
||||
deobfuscated by the author. You may find reading it helpful in your attempt to
|
||||
understand this extremely subtle entry.</p>
|
||||
<h3 id="alternate-build">Alternate build:</h3>
|
||||
|
||||
Reference in new issue
Block a user