mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

force use of pandoc version >= 3.1.12.2

Browse Source 
The `bin/pandoc-wrapper.sh` tool will verify that the ssytem
has a recent enough version of `pandoc(1)`.

We explain why we insist on `pandoc(1)`. version >= 3.1.12.2
in comments where the $PANDOC_MIN_VERSION is set.

Added `--wrap=preserve` as a default argument to `pandoc(1)`.
While this change will impact every HTML file generated,
we believe this will improve the ability of someone to look
at the generated HTML and correlate with the original markdown.

Changed `bin/pandoc-wrapper.sh` VERSION from "1.4.2 2024-03-17"
to "1.4.3 2024-03-18".

Performed `make www` to achieve all of the above and to generate
HTML using the new  `--wrap=preserve` `pandoc(1)` mode.
This commit is contained in:
Landon Curt Noll committed 2024-03-18 01:26:39 -07:00
1 parent 9eb7a54e9f
commit b0b212acb1
402 files changed
+37061 -55132
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2015/mills2/index.html
+85 -122
View File
@@ -129,9 +129,9 @@
<h2 id="author"><a name="author"></a>Author:</h2>
<ul>
<li>Name: <a href="../../authors.html#Christopher_Mills">Christopher
Mills</a><br> Location: <a href="../../location.html#US">US</a> -
<em>United States of America</em> (<em>United States</em>) <br><br></li>
<li>Name: <a href="../../authors.html#Christopher_Mills">Christopher Mills</a><br>
Location: <a href="../../location.html#US">US</a> - <em>United States of America</em> (<em>United States</em>)
<br><br></li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-author.sh -->
@@ -144,159 +144,122 @@ Mills</a><br> Location: <a href="../../location.html#US">US</a> -
<h3 id="bugs-and-misfeatures">Bugs and (Mis)features:</h3>
<p>The current status of this entry is:</p>
<pre><code>STATUS: INABIAF - please **DO NOT** fix</code></pre>
<p>For more detailed information see <a
href="../../bugs.html#2015_mills2">2015 mills2 bugs</a>.</p>
<p>For more detailed information see <a href="../../bugs.html#2015_mills2">2015 mills2 bugs</a>.</p>
<h2 id="to-use">To use:</h2>
<div class="sourceCode" id="cb3"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb3-1"><a href="#cb3-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./prog</span> compressed_file.Z</span></code></pre></div>
<h2 id="try">Try:</h2>
<div class="sourceCode" id="cb4"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb4-1"><a href="#cb4-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./try.sh</span></span></code></pre></div>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>Without ASCII art, the source code of this entry would have been
exactly 256 bytes. Compared to <a
href="../../years.html#1990_jaw">1990/jaw</a>, it is very impressive,
even taking into account the missing <code>atob</code> functionality.
Now we wish for a <code>compress(1)</code>-like compressor using a
similar idea.</p>
<p>Without ASCII art, the source code of this entry would have been exactly 256
bytes. Compared to <a href="../../years.html#1990_jaw">1990/jaw</a>, it is very
impressive, even taking into account the missing <code>atob</code> functionality. Now we wish
for a <code>compress(1)</code>-like compressor using a similar idea.</p>
<p>Why is the sad smiley on line 12 in that particular place?</p>
<div class="sourceCode" id="cb5"><pre class="sourceCode c"><code class="sourceCode c"><span id="cb5-1"><a href="#cb5-1" aria-hidden="true" tabindex="-1"></a> c<span class="op">=</span><span class="dv">0</span><span class="op">)</span> <span class="op">:(</span> O</span></code></pre></div>
<h2 id="authors-remarks">Author’s remarks:</h2>
<h3 id="the-program">The Program</h3>
<p>This program is an implementation of the unix <code>zcat(1)</code>
command for printing compressed files that have been created by the
<code>compress(1)</code> command.</p>
<p>The adaptive <a
href="https://en.wikipedia.org/wiki/Lempel–Ziv–Welch">LZW</a>
compression employed by <code>compress(1)</code> usually requires a
fairly large amount of memory to build the decompression tables (in
fact, <code>compress(1)</code> has a command-line option to control the
size of the decompression tables, since some of the early systems to
which it was ported (*cough*<a
href="https://computerhistory.org/blog/microsoft-ms-dos-early-source-code/?key=microsoft-ms-dos-early-source-code">MS-DOS</a>*cough*)
did not have enough memory to use the full 16-bit codes). This version
has no large static or dynamic tables. It is able to decompress 16-bit
files using a single function and a few <code>int</code>s.</p>
<p>To run the program, take an existing compressed file and pass it to
the program on the command line. On the odd chance you don’t have
<code>compress(1)</code> hanging about on your system, I’ve provided
compressed copies of this year’s IOCCC rules and guidelines files. To
print them, just do</p>
<p>This program is an implementation of the unix <code>zcat(1)</code> command for printing
compressed files that have been created by the <code>compress(1)</code> command.</p>
<p>The adaptive <a href="https://en.wikipedia.org/wiki/Lempel–Ziv–Welch">LZW</a> compression
employed by <code>compress(1)</code> usually requires a fairly large amount of memory to
build the decompression tables (in fact, <code>compress(1)</code> has a command-line option
to control the size of the decompression tables, since some of the early systems
to which it was ported
(*cough*<a href="https://computerhistory.org/blog/microsoft-ms-dos-early-source-code/?key=microsoft-ms-dos-early-source-code">MS-DOS</a>*cough*)
did not have enough memory to use the full 16-bit codes). This version has no
large static or dynamic tables. It is able to decompress 16-bit files using a
single function and a few <code>int</code>s.</p>
<p>To run the program, take an existing compressed file and pass it to the program
on the command line. On the odd chance you don’t have <code>compress(1)</code> hanging about
on your system, I’ve provided compressed copies of this year’s IOCCC rules
and guidelines files. To print them, just do</p>
<div class="sourceCode" id="cb6"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb6-1"><a href="#cb6-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./prog</span> ioccc_guidelines.txt.Z</span>
<span id="cb6-2"><a href="#cb6-2" aria-hidden="true" tabindex="-1"></a><span class="ex">./prog</span> ioccc_rules.txt.Z</span></code></pre></div>
<h3 id="the-details">The Details</h3>
<p>The basic cleverness here comes from realizing that the compressed
data is itself an encoded version of the code dictionary. When the
encoder sees an input string that is not in its dictionary, it emits the
code corresponding to the longest prefix that is in the dictionary and
adds a new entry consisting of that code followed by the next input
character. This means that when the decoder wants to know how to decode
a code, it just needs to find the spot in the code-stream where the
encoder added that entry to the dictionary. The code at that spot is the
prefix, and the first character of the following code is the suffix.
Decoding then just becomes recursion, to follow the chain of prefixes
and suffix characters.</p>
<p>Of course, it’s not nearly that simple. Finding the code in the
stream is complicated by several issues:</p>
<p>The basic cleverness here comes from realizing that the compressed data is
itself an encoded version of the code dictionary. When the encoder sees
an input string that is not in its dictionary, it emits the code corresponding
to the longest prefix that is in the dictionary and adds a new entry consisting
of that code followed by the next input character. This means that when the
decoder wants to know how to decode a code, it just needs to find the spot in
the code-stream where the encoder added that entry to the dictionary. The
code at that spot is the prefix, and the first character of the following code
is the suffix. Decoding then just becomes recursion, to follow the chain of
prefixes and suffix characters.</p>
<p>Of course, it’s not nearly that simple. Finding the code in the stream is
complicated by several issues:</p>
<ul>
<li>Codes are at bit offsets within the stream, and must be
extracted.</li>
<li>As codes are added to the dictionary, the code word size grows, so
finding the offset to a particular code word is involved.</li>
<li>The <code>compress(1)</code> encoder reserves a code word that
clears the coding tables. When this is encountered, the computation of
offsets and bit sizes reset.</li>
<li>The <code>compress(1)</code> decoder is designed to always read a
block of eight code words at the same time, so that it need only read
<code>N</code> bytes to get eight <code>N-bit</code> code words. When
the “clear” code is encountered, the entire eight-word block is flushed
(since the decoder didn’t know the word size would change). The program
needs to account for this extra flushing.</li>
<li>The end of the stream is not explicitly marked; the encoder just
pads out the output to the next byte. The decoder must notice this to
know when to stop.</li>
<li>Codes are at bit offsets within the stream, and must be extracted.</li>
<li>As codes are added to the dictionary, the code word size grows, so finding
the offset to a particular code word is involved.</li>
<li>The <code>compress(1)</code> encoder reserves a code word that clears the coding tables.
When this is encountered, the computation of offsets and bit sizes reset.</li>
<li>The <code>compress(1)</code> decoder is designed to always read a block of eight code
words at the same time, so that it need only read <code>N</code> bytes to get eight
<code>N-bit</code> code words. When the “clear” code is encountered, the entire eight-word
block is flushed (since the decoder didn’t know the word size would change).
The program needs to account for this extra flushing.</li>
<li>The end of the stream is not explicitly marked; the encoder just pads out
the output to the next byte. The decoder must notice this to know when
to stop.</li>
<li>The output stream contains a header that must be skipped.</li>
</ul>
<p>Managing all the details involved added a lovely additional layer of
obfuscation to the otherwise elegant recursive decoder. Still, the code
manages it in a remarkably small amount of code.</p>
<h3 id="limitations">Limitations</h3>
<p>The decoder doesn’t look at the header. If you supply something that
is not compressed data, it’s likely to crash in an interesting
manner.</p>
<p>In particular, it doesn’t look at the third byte of the header, which
encodes the maximum code word size and whether “block mode” was used
when the encoder was run. If you use <code>compress(1)</code> in its
default mode, the maximum word size will be 16 bits and “block mode”
will be enabled. You are unlikely to find any files that don’t use
“block mode”, since all versions of <code>compress(1)</code> after 2.0
(circa 1984) use it by default and have no documented way to disable it.
Reducing the bit depth is still possibly by using the <code>-b</code>
flag. Modern systems have no problem with the 200 KB or so needed for
16-bit decoder tables, so the need for reducing the table size has
passed, hence this program always assumes 16-bits… However, should you
find a file that needs a smaller table, feel free to change the
hard-coded 16 in the source into the appropriate number and
recompile.</p>
<p>In the event that you don’t supply an argument, or that argument
doesn’t name a readable file, the program will just silently exit. This
is a feature.</p>
<p>The program depends on having a little-endian system. On a big-endian
system you will get a weird big-endian version of
<code>compress(1)</code>, which might have come to pass in an alternate
universe where the <a href="https://en.wikipedia.org/wiki/VAX">VAX</a>
on which <code>compress(1)</code> was authored had been big-endian.
Luckily for us, it wasn’t, and neither are most of the systems you might
want to compile this for.</p>
<h2 id="copyright-and-cc-by-sa-4.0-license">Copyright and CC BY-SA 4.0
License:</h2>
<p>This file is Copyright (c) 2023 by Landon Curt Noll. All Rights
Reserved. You are free to share and adapt this file under the terms of
this license:</p>
<p>The decoder doesn’t look at the header. If you supply something that is not
compressed data, it’s likely to crash in an interesting manner.</p>
<p>In particular, it doesn’t look at the third byte of the header, which encodes
the maximum code word size and whether “block mode” was used when the encoder
was run. If you use <code>compress(1)</code> in its default mode, the maximum word size
will be 16 bits and “block mode” will be enabled. You are unlikely to find
any files that don’t use “block mode”, since all versions of <code>compress(1)</code> after
2.0 (circa 1984) use it by default and have no documented way to disable it.
Reducing the bit depth is still possibly by using the <code>-b</code> flag. Modern
systems have no problem with the 200 KB or so needed for 16-bit decoder
tables, so the need for reducing the table size has passed, hence this program
always assumes 16-bits… However, should you find a file that needs a
smaller table, feel free to change the hard-coded 16 in the source into the
appropriate number and recompile.</p>
<p>In the event that you don’t supply an argument, or that argument doesn’t name
a readable file, the program will just silently exit. This is a feature.</p>
<p>The program depends on having a little-endian system. On a big-endian system
you will get a weird big-endian version of <code>compress(1)</code>, which might have come
to pass in an alternate universe where the
<a href="https://en.wikipedia.org/wiki/VAX">VAX</a> on which <code>compress(1)</code> was authored had
been big-endian. Luckily for us, it wasn’t, and neither are most of the systems
you might want to compile this for.</p>
<h2 id="copyright-and-cc-by-sa-4.0-license">Copyright and CC BY-SA 4.0 License:</h2>
<p>This file is Copyright (c) 2023 by Landon Curt Noll. All Rights Reserved.
You are free to share and adapt this file under the terms of this license:</p>
<pre><code>Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)</code></pre>
<p>For more information, see:
https://creativecommons.org/licenses/by-sa/4.0/</p>
<p>For more information, see: https://creativecommons.org/licenses/by-sa/4.0/</p>
<!-- END: this line ends content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<!-- START: this line starts content for HTML phase 22 by: bin/output-index-inventory.sh via bin/md2html.sh -->
<!-- START: this line starts content generated by: bin/output-index-inventory.sh -->
<h1 id="inventory-for-2015mills2"><a name="inventory"></a>Inventory for
2015/mills2</h1>
<h1 id="inventory-for-2015mills2"><a name="inventory"></a>Inventory for 2015/mills2</h1>
<p><a href="#top">Jump to top</a></p>
<h2 id="primary-files">Primary files</h2>
<ul>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/prog.c">prog.c</a>
- entry source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/Makefile">Makefile</a>
- entry Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/prog.orig.c">prog.orig.c</a>
- original source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/try.sh">try.sh</a>
- how to run</li>
<li><a href="ioccc_guidelines.txt.Z">ioccc_guidelines.txt.Z</a> -
compressed IOCCC 2015 guidelines</li>
<li><a href="ioccc_rules.txt.Z">ioccc_rules.txt.Z</a> - compressed IOCCC
2015 rules</li>
<li><a href="2015_mills2.tar.bz2">2015_mills2.tar.bz2</a> - download
entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/prog.c">prog.c</a> - entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/Makefile">Makefile</a> - entry Makefile</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/prog.orig.c">prog.orig.c</a> - original source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/try.sh">try.sh</a> - how to run</li>
<li><a href="ioccc_guidelines.txt.Z">ioccc_guidelines.txt.Z</a> - compressed IOCCC 2015 guidelines</li>
<li><a href="ioccc_rules.txt.Z">ioccc_rules.txt.Z</a> - compressed IOCCC 2015 rules</li>
<li><a href="2015_mills2.tar.bz2">2015_mills2.tar.bz2</a> - download entry source</li>
</ul>
<h2 id="secondary-files">Secondary files</h2>
<ul>
<li><a href="index.html">index.html</a> - entry home page</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/.entry.json">.entry.json</a>
- description of entry in JSON</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/.gitignore">.gitignore</a>
- list of files that should not be committed under git</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/.entry.json">.entry.json</a> - description of entry in JSON</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/.gitignore">.gitignore</a> - list of files that should not be committed under git</li>
<li><a href=".path">.path</a> - directory path from top directory</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/README.md">README.md</a>
- markdown source for index.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2015/mills2/README.md">README.md</a> - markdown source for index.html</li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->