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

+49 -75
View File
@@ -129,9 +129,9 @@
<h2 id="author"><a name="author"></a>Author:</h2>
<ul>
<li>Name: <a href="../../authors.html#Raphael_Meyer">Raphael
Meyer</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#Raphael_Meyer">Raphael Meyer</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 -->
@@ -147,74 +147,65 @@ Meyer</a><br> Location: <a href="../../location.html#US">US</a> -
<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">./meyer</span> <span class="pp">[</span><span class="ss">SEED</span><span class="pp">]</span></span></code></pre></div>
<p>For your first input try:</p>
<pre><code>a 0 1</code></pre>
<p>where <code>a</code> is the row (<code>a</code>-<code>i</code>),
<code>0</code> is the column (<code>0</code>-<code>8</code>) and
<code>1</code> is the number (<code>1</code>-<code>9</code>).</p>
<p>NOTE: if you do not input three different ‘words’ it will block. You
can input more text to fulfil the program’s requirements.</p>
<p>NOTE: if your move is invalid it will prompt you again but not show
the board.</p>
<p>where <code>a</code> is the row (<code>a</code>-<code>i</code>), <code>0</code> is the column (<code>0</code>-<code>8</code>) and <code>1</code> is the
number (<code>1</code>-<code>9</code>).</p>
<p>NOTE: if you do not input three different ‘words’ it will block. You can input
more text to fulfil the program’s requirements.</p>
<p>NOTE: if your move is invalid it will prompt you again but not show the board.</p>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>This entry turns a newspaper solitaire puzzle into a competition with
the computer to be the last one moving. The object of this <a
href="meyer.c">source code</a> is to determine the object of this <a
href="meyer.c">source code</a>! :-)</p>
<p>This entry turns a newspaper solitaire puzzle into a competition
with the computer to be the last one moving. The object of this
<a href="meyer.c">source code</a> is to determine the object of this <a href="meyer.c">source
code</a>! :-)</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<p>I wanted submit a fully object-oriented entry to show that
object-orientated code:</p>
<ol type="1">
<li>is ridiculously bloated.</li>
<li>is unreadable.</li>
<li>isn’t ‘<code>WYWIWID</code>’ (‘what you write is what it does’)
anymore.</li>
<li>isn’t ‘<code>WYWIWID</code>’ (‘what you write is what it does’) anymore.</li>
</ol>
<p>But I just totally failed. No, I didn’t fail in showing any of the
points above. Before I even had the chance to prove any of these claims,
(1) already brought me to my knees. The code got so bloated up, that I
missed the size limit by a few hundred bytes. Therefore, I broke the
only rule in this contest, I think you shouldn’t break in any case: Rule
Nr 2, The size of …</p>
<p>But I just totally failed. No, I didn’t fail in showing any of
the points above. Before I even had the chance to prove any of
these claims, (1) already brought me to my knees. The code got
so bloated up, that I missed the size limit by a few hundred
bytes. Therefore, I broke the only rule in this contest, I think
you shouldn’t break in any case: Rule Nr 2, The size of …</p>
<p>The degree of claim (2) actually depends on the compiler. As I
<em>manually</em> translated it from a generic object-oriented
programming language to C, it didn’t just end up unreadable, but awfully
<em>manually</em> translated it from a generic object-oriented programming
language to C, it didn’t just end up unreadable, but awfully
messed up, i.e. obfuscated.</p>
<p>As it is already (pre)translated to C, you could also call it an
object- disoriented program.</p>
<p>As it is already (pre)translated to C, you could also call it an object-
disoriented program.</p>
<p>Comparing this program to a potential object-oriented implementation,
it is obvious, that object-oriented code isn’t ‘<code>WYWIWID</code>’
(‘what you write is what it does’). It may be tempting to think that</p>
it is obvious, that object-oriented code isn’t ‘<code>WYWIWID</code>’ (‘what
you write is what it does’). It may be tempting to think that</p>
<pre><code>Object o;</code></pre>
<p>might do something similar as</p>
<div class="sourceCode" id="cb6"><pre class="sourceCode c"><code class="sourceCode c"><span id="cb6-1"><a href="#cb6-1" aria-hidden="true" tabindex="-1"></a><span class="kw">struct</span> not_an_object o<span class="op">;</span></span></code></pre></div>
<p>But this program reveals that it doesn’t. Even worse, this program
only reveals the tip of the iceberg, what kind of black magic is
involved in a simple declaration of an object.</p>
<p>But this program reveals that it doesn’t. Even worse, this program only
reveals the tip of the iceberg, what kind of black magic is involved in
a simple declaration of an object.</p>
<p>A few things you can explore about object-orientation in this program
include:</p>
<ul>
<li>constructors (invoked by the new operator).</li>
<li>new operators (every class gets its own new operator at compile
time).</li>
<li>virtual method tables (all the virtual method tables have been
combined to a single <a
href="https://en.wikipedia.org/wiki/Virtual_method_table">vtable</a>).</li>
<li>new operators (every class gets its own new operator at compile time).</li>
<li>virtual method tables (all the virtual method tables have been combined to a
single <a href="https://en.wikipedia.org/wiki/Virtual_method_table">vtable</a>).</li>
<li>runtime method binding.</li>
<li><a
href="https://en.wikipedia.org/wiki/Inheritance_(object-oriented_programming)">inheritance</a>
and <a
href="https://en.wikipedia.org/wiki/Polymorphism_(computer_science)">polymorphism</a>.</li>
<li><a href="https://en.wikipedia.org/wiki/Inheritance_(object-oriented_programming)">inheritance</a>
and <a href="https://en.wikipedia.org/wiki/Polymorphism_(computer_science)">polymorphism</a>.</li>
</ul>
<p>It is left as an exercise to the reader to find a corresponding
implementation in a popular object-oriented programming language.</p>
<h3 id="starting-the-game">Starting the game</h3>
<div class="sourceCode" id="cb7"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb7-1"><a href="#cb7-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./meyer</span> <span class="pp">[</span><span class="ss">SEED</span><span class="pp">]</span></span></code></pre></div>
<h3 id="gameplay">Gameplay</h3>
<p>It is a <a href="https://en.wikipedia.org/wiki/Sudoku">sudoku</a>
based game. The goal of the game is to be able to do the last valid
‘move’.</p>
<p>On your turn you have to set a free cell to a value between 1 to 9
without breaking the following rule. Any number must be unique in
its:</p>
<p>It is a <a href="https://en.wikipedia.org/wiki/Sudoku">sudoku</a> based game. The goal of
the game is to be able to do the last valid ‘move’.</p>
<p>On your turn you have to set a free cell to a value between 1 to 9 without
breaking the following rule. Any number must be unique in its:</p>
<ol type="1">
<li>row</li>
<li>column</li>
@@ -228,50 +219,33 @@ column: [0-8]
number: [1-9].</code></pre>
<p>The game can be aborted with <code>q</code>.</p>
<p>The one who can do the last move wins the game.</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>
<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-2006meyer"><a name="inventory"></a>Inventory for
2006/meyer</h1>
<h1 id="inventory-for-2006meyer"><a name="inventory"></a>Inventory for 2006/meyer</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/2006/meyer/meyer.c">meyer.c</a>
- entry source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/meyer/Makefile">Makefile</a>
- entry Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/meyer/meyer.orig.c">meyer.orig.c</a>
- original source</li>
<li><a href="2006_meyer.tar.bz2">2006_meyer.tar.bz2</a> - download entry
source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/meyer/meyer.c">meyer.c</a> - entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/meyer/Makefile">Makefile</a> - entry Makefile</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/meyer/meyer.orig.c">meyer.orig.c</a> - original source</li>
<li><a href="2006_meyer.tar.bz2">2006_meyer.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/2006/meyer/.entry.json">.entry.json</a>
- description of entry in JSON</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/meyer/.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/2006/meyer/.entry.json">.entry.json</a> - description of entry in JSON</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/meyer/.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/2006/meyer/README.md">README.md</a>
- markdown source for index.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/meyer/README.md">README.md</a> - markdown source for index.html</li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->