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

+56 -88
View File
@@ -129,9 +129,9 @@
<h2 id="author"><a name="author"></a>Author:</h2>
<ul>
<li>Name: <a href="../../authors.html#E_Jay_Berkenbilt">E. Jay
Berkenbilt</a><br> Location: <a href="../../location.html#ZZ">ZZ</a> -
<em>Unknown location</em> <br><br></li>
<li>Name: <a href="../../authors.html#E_Jay_Berkenbilt">E. Jay Berkenbilt</a><br>
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 -->
@@ -148,116 +148,84 @@ Berkenbilt</a><br> Location: <a href="../../location.html#ZZ">ZZ</a> -
<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>A negative argument plays the patience puzzle. An argument greater
than 0 plays the Tower of Hanoi puzzle. In either case the absolute
value of the argument specifies the size of the respective puzzle. Refer
to the web pages <a href="hanoi.html">hanoi.html</a> and <a
href="patience.html">patience.html</a> for more information on these
puzzles.</p>
<p>Of course, you need a different kind of “patience” if you give the
argument 127 to this program and want to see it finish!</p>
<p>A negative argument plays the patience puzzle. An argument
greater than 0 plays the Tower of Hanoi puzzle. In either case
the absolute value of the argument specifies the size of the
respective puzzle. Refer to the web pages <a href="hanoi.html">hanoi.html</a> and
<a href="patience.html">patience.html</a> for more information on these puzzles.</p>
<p>Of course, you need a different kind of “patience” if you give
the argument 127 to this program and want to see it finish!</p>
<p>We note that this also works under macOS just fine.</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<h3 id="what-this-program-does">What this program does</h3>
<h4 id="output-solution-to-towers-of-hanoi-for-five-rings">Output
solution to Towers of Hanoi for five rings:</h4>
<h4 id="output-solution-to-towers-of-hanoi-for-five-rings">Output solution to Towers of Hanoi for five rings:</h4>
<div class="sourceCode" id="cb5"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb5-1"><a href="#cb5-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./ejb</span> 5</span></code></pre></div>
<p>The format of the output for the Towers of Hanoi case is simply a
text description of how to solve the puzzle.</p>
<h4 id="output-solution-to-the-patience-puzzle-for-six-rings">Output
solution to the Patience puzzle for six rings:</h4>
<h4 id="output-solution-to-the-patience-puzzle-for-six-rings">Output solution to the Patience puzzle for six rings:</h4>
<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">./ejb</span> <span class="at">-6</span></span></code></pre></div>
<p>For the patience puzzle, the output is a sequence binary codes
representing successive states of the puzzle. The rightmost digit
represents the first ring. A <code>1</code> means the ring is on the
<code>U</code>; a <code>0</code> means it is off the <code>U</code>. The
program prints the word <code>"Invalid"</code> in response to illegal
command line parameters.</p>
<p>For the patience puzzle, the output is a sequence binary codes representing
successive states of the puzzle. The rightmost digit represents the first ring.
A <code>1</code> means the ring is on the <code>U</code>; a <code>0</code> means it is off the <code>U</code>. The program
prints the word <code>"Invalid"</code> in response to illegal command line parameters.</p>
<h3 id="motivation">Motivation</h3>
<p>Most people who have written software for other people have been
asked to count lines of code. Naturally, this brings up the
controversial question of exactly what defines a line of code. This
program serves to show that counting semicolons will not always provide
a meaningful measure of code size. This is especially true in this
program where the number of semicolons itself is ambiguous. Does it have
two or three? In addition, the only C keyword this program uses besides
type names and qualifiers is <code>return</code>, and the only function
defined in the code is <code>main()</code>. The level of complexity of
the program without multiple semicolons, statements, and functions is
achieved by abusing C operators, especially the comma operator.
Considerable use of <code>||</code>, <code>&amp;&amp;</code>, and
<code>?:</code> helps too. In addition, <code>main()</code> is called
recursively. The NULL pointer that terminates <code>argv</code> is used
to pass additional information into <code>main()</code>. Even though the
algorithms used by this code are simple, this program is still hard to
follow even when indented properly. (It is pretty hard to indent this
code reasonably, however.)</p>
<p>Although this program has only been tested on UNIX systems it will
probably run on just about any machine with an ANSI C compiler. It does
not use the C preprocessor at all. The only functions it uses are
<code>atoi()</code>, <code>malloc()</code>, <code>memset()</code>,
<code>printf()</code>, and <code>puts()</code>. It does, however,
require that the architecture it runs on have bytes that are at least
eight bits long and pointers that are at least four bytes long. In
addition, it requires an ANSI compiler since it uses
<code>signed char</code> and ANSI-style function declarations.</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>
controversial question of exactly what defines a line of code.
This program serves to show that counting semicolons will not
always provide a meaningful measure of code size. This is
especially true in this program where the number of semicolons
itself is ambiguous. Does it have two or three? In addition, the
only C keyword this program uses besides type names and
qualifiers is <code>return</code>, and the only function defined in the code
is <code>main()</code>. The level of complexity of the program without multiple
semicolons, statements, and functions is achieved by abusing C
operators, especially the comma operator. Considerable use of <code>||</code>,
<code>&amp;&amp;</code>, and <code>?:</code> helps too. In addition, <code>main()</code> is called recursively.
The NULL pointer that terminates <code>argv</code> is used to pass additional
information into <code>main()</code>. Even though the algorithms used by this
code are simple, this program is still hard to follow even when
indented properly. (It is pretty hard to indent this code
reasonably, however.)</p>
<p>Although this program has only been tested on UNIX systems it will probably run
on just about any machine with an ANSI C compiler. It does not use the C
preprocessor at all. The only functions it uses are <code>atoi()</code>, <code>malloc()</code>,
<code>memset()</code>, <code>printf()</code>, and <code>puts()</code>. It does, however, require that the
architecture it runs on have bytes that are at least eight bits long and
pointers that are at least four bytes long. In addition, it requires an ANSI
compiler since it uses <code>signed char</code> and ANSI-style function declarations.</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-1993ejb"><a name="inventory"></a>Inventory for
1993/ejb</h1>
<h1 id="inventory-for-1993ejb"><a name="inventory"></a>Inventory for 1993/ejb</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/1993/ejb/ejb.c">ejb.c</a>
- entry source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/Makefile">Makefile</a>
- entry Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/ejb.orig.c">ejb.orig.c</a>
- original source</li>
<li><a href="hanoi.html">hanoi.html</a> - about the Towers of Hanoi
puzzle</li>
<li><a href="patience.html">patience.html</a> - about the Patience
puzzle</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/try.sh">try.sh</a>
- how to run</li>
<li><a href="1993_ejb.tar.bz2">1993_ejb.tar.bz2</a> - download entry
source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/ejb.c">ejb.c</a> - entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/Makefile">Makefile</a> - entry Makefile</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/ejb.orig.c">ejb.orig.c</a> - original source</li>
<li><a href="hanoi.html">hanoi.html</a> - about the Towers of Hanoi puzzle</li>
<li><a href="patience.html">patience.html</a> - about the Patience puzzle</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/try.sh">try.sh</a> - how to run</li>
<li><a href="1993_ejb.tar.bz2">1993_ejb.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/1993/ejb/.entry.json">.entry.json</a>
- description of entry in JSON</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/.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/1993/ejb/.entry.json">.entry.json</a> - description of entry in JSON</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/.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/1993/ejb/README.md">README.md</a>
- markdown source for index.html</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/hanoi.md">hanoi.md</a>
- markdown source for hanoi.html</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/patience.md">patience.md</a>
- markdown source for patience.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/README.md">README.md</a> - markdown source for index.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/hanoi.md">hanoi.md</a> - markdown source for hanoi.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ejb/patience.md">patience.md</a> - markdown source for patience.html</li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->