force use of pandoc version >= 3.1.12.2

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

No files matched your search

+39 -63
View File
@@ -130,8 +130,8 @@
<h2 id="author"><a name="author"></a>Author:</h2>
<ul>
<li>Name: <a href="../../authors.html#Tom_Torfs">Tom Torfs</a><br>
Location: <a href="../../location.html#ZZ">ZZ</a> - <em>Unknown
location</em> <br><br></li>
Location: <a href="../../location.html#ZZ">ZZ</a> - <em>Unknown location</em>
<br><br></li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-author.sh -->
@@ -153,9 +153,9 @@ xor : value to xor the final CRC with (hexadecimal)</code></pre>
<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>If you don’t believe the program is correct, try and compare the
output of the program with the value of CRCs computed by PKZIP or any
other archiver that uses the CRC-32 algorithm.</p>
<p>If you don’t believe the program is correct, try and compare the output
of the program with the value of CRCs computed by PKZIP or any other
archiver that uses the CRC-32 algorithm.</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<pre><code>Usage:
./tomtorfs filename bitwidth polynom reflected init xor
@@ -176,22 +176,19 @@ xor : value to xor the final CRC with (hexadecimal)</code></pre>
<h4 id="arc">ARC:</h4>
<div class="sourceCode" id="cb9"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb9-1"><a href="#cb9-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./tomtorfs</span> filename 16 8005 1 0000 0000</span></code></pre></div>
<h3 id="portability-notes">Portability notes</h3>
<p>The program assumes <code>CHAR_BIT==8</code>. Results are undefined
if <code>bitwidth &gt; sizeof(unsigned long) * 8</code>. It is also
assumed that <code>EOF</code> is <code>-1</code> and <code>1</code> is a
valid exit value to indicate failure (replace them with <code>EOF</code>
resp. <code>EXIT_FAILURE</code> if the assumptions are false). Otherwise
ANSI/ISO C.</p>
<p>The program assumes <code>CHAR_BIT==8</code>. Results are undefined if <code>bitwidth &gt; sizeof(unsigned long) * 8</code>. It is also assumed that <code>EOF</code> is <code>-1</code> and <code>1</code> is a
valid exit value to indicate failure (replace them with <code>EOF</code> resp.
<code>EXIT_FAILURE</code> if the assumptions are false). Otherwise ANSI/ISO C.</p>
<p>No special build options required.</p>
<h3 id="special-notes">Special notes</h3>
<p>Count the number of non-whitespace characters in the source file to
find out what dark force drove me to write this ;-).</p>
<p>Count the number of non-whitespace characters in the source
file to find out what dark force drove me to write this ;-).</p>
<h3 id="spoiler">Spoiler</h3>
<p>First of all, if you run a C beautifier on the program (thereby of
course losing the nice code shape I worked so hard on ;-) ) the code
will become a bit more readable.</p>
<p>The variable names are not very descriptive. They have the following
meanings:</p>
<p>First of all, if you run a C beautifier on the program (thereby of course losing
the nice code shape I worked so hard on ;-) ) the code will become a bit more
readable.</p>
<p>The variable names are not very descriptive. They have the
following meanings:</p>
<pre><code>a = argc
A = argv
@@ -208,67 +205,46 @@ b = array of unsigned long variables
B = FILE * through which the file argv[1] is opened
C = typedef for unsigned long</code></pre>
<p>The first <code>for</code> loop simply reads the command-line
arguments in the <code>b[]</code> array. The third parameter to
<code>strtoul(3)</code> causes all arguments to be in base-16 (hex)
except the first one, which will be in base-10 (decimal).</p>
<p>The rest of the program “simply” calculates the CRC in
<code>b[5]</code> and then prints it to <code>stdout</code>. The bit
reflection loops may appear a bit tricky at first, but if you have a
good look at them they should become obvious also.</p>
<p>The first <code>for</code> loop simply reads the command-line arguments
in the <code>b[]</code> array. The third parameter to <code>strtoul(3)</code> causes
all arguments to be in base-16 (hex) except the first one,
which will be in base-10 (decimal).</p>
<p>The rest of the program “simply” calculates the CRC in <code>b[5]</code>
and then prints it to <code>stdout</code>. The bit reflection loops may
appear a bit tricky at first, but if you have a good look
at them they should become obvious also.</p>
<h3 id="acknowledgments">Acknowledgments:</h3>
<p>Ross N. Williams, whose CRC guide was very useful to me for writing
this. You can find it in <a href="crc.txt">crc.txt</a>.</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>Ross N. Williams, whose CRC guide was very useful to me
for writing this. You can find it in <a href="crc.txt">crc.txt</a>.</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-1998tomtorfs"><a name="inventory"></a>Inventory
for 1998/tomtorfs</h1>
<h1 id="inventory-for-1998tomtorfs"><a name="inventory"></a>Inventory for 1998/tomtorfs</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/1998/tomtorfs/tomtorfs.c">tomtorfs.c</a>
- entry source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1998/tomtorfs/Makefile">Makefile</a>
- entry Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1998/tomtorfs/tomtorfs.orig.c">tomtorfs.orig.c</a>
- original source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1998/tomtorfs/try.sh">try.sh</a>
- how to run</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1998/tomtorfs/crc.txt">crc.txt</a>
- painless guide to CRC algorithms</li>
<li><a href="1998_tomtorfs.tar.bz2">1998_tomtorfs.tar.bz2</a> - download
entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1998/tomtorfs/tomtorfs.c">tomtorfs.c</a> - entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1998/tomtorfs/Makefile">Makefile</a> - entry Makefile</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1998/tomtorfs/tomtorfs.orig.c">tomtorfs.orig.c</a> - original source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1998/tomtorfs/try.sh">try.sh</a> - how to run</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1998/tomtorfs/crc.txt">crc.txt</a> - painless guide to CRC algorithms</li>
<li><a href="1998_tomtorfs.tar.bz2">1998_tomtorfs.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/1998/tomtorfs/.entry.json">.entry.json</a>
- description of entry in JSON</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1998/tomtorfs/.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/1998/tomtorfs/.entry.json">.entry.json</a> - description of entry in JSON</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1998/tomtorfs/.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/1998/tomtorfs/README.md">README.md</a>
- markdown source for index.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1998/tomtorfs/README.md">README.md</a> - markdown source for index.html</li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->