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:
1 parent
9eb7a54e9f
commit
b0b212acb1
402 files changed
+37061
-55132
No files matched your search
+31
-51
@@ -129,9 +129,9 @@
|
||||
|
||||
<h2 id="author"><a name="author"></a>Author:</h2>
|
||||
<ul>
|
||||
<li>Name: <a href="../../authors.html#Michael_Savastio">Michael
|
||||
Savastio</a><br> Location: <a href="../../location.html#ZZ">ZZ</a> -
|
||||
<em>Unknown location</em> <br><br></li>
|
||||
<li>Name: <a href="../../authors.html#Michael_Savastio">Michael Savastio</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 -->
|
||||
@@ -144,13 +144,12 @@ Savastio</a><br> Location: <a href="../../location.html#ZZ">ZZ</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#1995_savastio">1995 savastio bugs</a>.</p>
|
||||
<p>For more detailed information see <a href="../../bugs.html#1995_savastio">1995 savastio 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">./savastio</span></span>
|
||||
<span id="cb3-2"><a href="#cb3-2" aria-hidden="true" tabindex="-1"></a><span class="co"># enter a POSITIVE number such as 100</span></span></code></pre></div>
|
||||
<p>NOTE: if you specify a negative number it will get stuck, showing no
|
||||
output. But what happens if you give a non-number?</p>
|
||||
<p>NOTE: if you specify a negative number it will get stuck, showing no output. But
|
||||
what happens if you give a non-number?</p>
|
||||
<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>
|
||||
@@ -159,72 +158,53 @@ output. But what happens if you give a non-number?</p>
|
||||
<p>This program is an infinite-precision factorial calculator. It will
|
||||
compute the factorial of any number entered to an infinite degree of
|
||||
precision (or the limits of your machine’s memory, whichever comes
|
||||
first). I’d suggest you start with small numbers the first few times you
|
||||
run it and gradually work your way up in order to get a feel for the
|
||||
computation time your machine will require.</p>
|
||||
<p>Aside from having an artistic code layout and confusing variable
|
||||
names, the algorithm itself takes advantage of some cute C-isms. Try to
|
||||
first). I’d suggest you start with small numbers the first few times
|
||||
you run it and gradually work your way up in order to get a feel for
|
||||
the computation time your machine will require.</p>
|
||||
<p>Aside from having an artistic code layout and confusing variable names,
|
||||
the algorithm itself takes advantage of some cute C-isms. Try to
|
||||
figure out how it prints the prompt “Enter number:”.</p>
|
||||
<p>Numbers are represented internally by a <a
|
||||
href="https://en.wikipedia.org/wiki/Linked_list">linked list</a> of
|
||||
blocks each containing 1000 buckets of 4-digit integers. To further
|
||||
confuse matters, the buckets are arranged backwards in the block. For
|
||||
example, the number 8347108947139478934713847134 is represented as:</p>
|
||||
<p>Numbers are represented internally by a <a href="https://en.wikipedia.org/wiki/Linked_list">linked
|
||||
list</a> of blocks each
|
||||
containing 1000 buckets of 4-digit integers. To further confuse
|
||||
matters, the buckets are arranged backwards in the block. For example,
|
||||
the number 8347108947139478934713847134 is represented as:</p>
|
||||
<pre><code>7134 1384 9347 3947 9471 7108 834</code></pre>
|
||||
<h3 id="platform-limitations">Platform limitations</h3>
|
||||
<p>Long integers must be at least 4 bytes.</p>
|
||||
<h3 id="features">Features</h3>
|
||||
<p>In order to prevent the user from wasting too much time computing
|
||||
useless factorials, the maximum factorial that can be computed is
|
||||
429539! This limit was selected through extensive research in time
|
||||
management studies and the factorial arts.</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>
|
||||
429539! This limit was selected through extensive research in
|
||||
time management studies and the factorial arts.</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-1995savastio"><a name="inventory"></a>Inventory
|
||||
for 1995/savastio</h1>
|
||||
<h1 id="inventory-for-1995savastio"><a name="inventory"></a>Inventory for 1995/savastio</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/1995/savastio/savastio.c">savastio.c</a>
|
||||
- entry source</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1995/savastio/Makefile">Makefile</a>
|
||||
- entry Makefile</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1995/savastio/savastio.orig.c">savastio.orig.c</a>
|
||||
- original source</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1995/savastio/try.sh">try.sh</a>
|
||||
- how to run</li>
|
||||
<li><a href="1995_savastio.tar.bz2">1995_savastio.tar.bz2</a> - download
|
||||
entry source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1995/savastio/savastio.c">savastio.c</a> - entry source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1995/savastio/Makefile">Makefile</a> - entry Makefile</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1995/savastio/savastio.orig.c">savastio.orig.c</a> - original source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1995/savastio/try.sh">try.sh</a> - how to run</li>
|
||||
<li><a href="1995_savastio.tar.bz2">1995_savastio.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/1995/savastio/.entry.json">.entry.json</a>
|
||||
- description of entry in JSON</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1995/savastio/.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/1995/savastio/.entry.json">.entry.json</a> - description of entry in JSON</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1995/savastio/.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/1995/savastio/README.md">README.md</a>
|
||||
- markdown source for index.html</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1995/savastio/README.md">README.md</a> - markdown source for index.html</li>
|
||||
</ul>
|
||||
|
||||
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->
|
||||
|
||||
Reference in new issue
Block a user