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

1994/weisberg/index.html
+50 -75
View File
@@ -129,9 +129,9 @@
<h2 id="author"><a name="author"></a>Author:</h2>
<ul>
<li>Name: <a href="../../authors.html#Jeff_Weisberg">Jeff
Weisberg</a><br> Location: <a href="../../location.html#ZZ">ZZ</a> -
<em>Unknown location</em> <br><br></li>
<li>Name: <a href="../../authors.html#Jeff_Weisberg">Jeff Weisberg</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 -->
@@ -141,108 +141,83 @@ Weisberg</a><br> Location: <a href="../../location.html#ZZ">ZZ</a> -
<h2 id="to-build">To build:</h2>
<div class="sourceCode" id="cb1"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb1-1"><a href="#cb1-1" aria-hidden="true" tabindex="-1"></a><span class="fu">make</span> all</span></code></pre></div>
<p>There is an alternate version that uses more memory. See <a
href="#alternate-code">alternate code</a> below for more details.</p>
<p>There is an alternate version that uses more memory. See <a href="#alternate-code">alternate
code</a> below for more details.</p>
<h2 id="to-use">To use:</h2>
<div class="sourceCode" id="cb2"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb2-1"><a href="#cb2-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./weisberg</span></span></code></pre></div>
<h2 id="try">Try:</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">./try.sh</span></span></code></pre></div>
<p>If you have <code>primes(1)</code> installed you might also wish to
try:</p>
<p>If you have <code>primes(1)</code> installed you might also wish to try:</p>
<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">./primes.sh</span> number</span></code></pre></div>
<p>where <code>number</code> is a positive number, defaulting to 15. The
<a href="try.sh">try.sh</a> script will also do this.</p>
<p>where <code>number</code> is a positive number, defaulting to 15. The <a href="try.sh">try.sh</a>
script will also do this.</p>
<h2 id="alternate-code">Alternate code:</h2>
<p>If you liked what you saw from the above program, and happen to have
some 512 Megabytes of virtual memory lying around with to do something
with you might try this version.</p>
<p>If you liked what you saw from the above program, and happen to
have some 512 Megabytes of virtual memory lying around with to do
something with you might try this version.</p>
<h3 id="alternate-build">Alternate build:</h3>
<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="fu">make</span> alt</span></code></pre></div>
<h3 id="alternate-use">Alternate use:</h3>
<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">./weisberg.alt</span></span></code></pre></div>
<p>Lesser systems will find this alternative version a good way to
create a core file. :-)</p>
<p>Lesser systems will find this alternative version a good way to create
a core file. :-)</p>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>This entry confuses some C-preprocessors and some C-beautifiers. We
found one cpp that processed this source differently when it was read on
<code>stdin</code> instead of via <code>cc -E</code>.</p>
<p>This entry confuses some C-preprocessors and some C-beautifiers.
We found one cpp that processed this source differently when
it was read on <code>stdin</code> instead of via <code>cc -E</code>.</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<h3 id="description">Description</h3>
<p>The following short program implements the “Yet Another” algorithm
for generating prime numbers. It will generate all primes up to
33554432, displaying them to the standard output as it churns along. As
33554432 is rather large on most machines, this code may take quite some
time to run to completion, so as an added feature, it will cease
execution upon reception of a signal (any will do equally well), as well
as in the event of a system shutdown or reboot.</p>
<p>The following short program implements the “Yet Another” algorithm for
generating prime numbers. It will generate all primes up to 33554432,
displaying them to the standard output as it churns along. As 33554432
is rather large on most machines, this code may take quite some time to
run to completion, so as an added feature, it will cease execution upon
reception of a signal (any will do equally well), as well as in the
event of a system shutdown or reboot.</p>
<h3 id="bugs">Bugs</h3>
<p>The alternative version (<a href="weisberg.alt.c">weisberg.alt.c</a>)
has never actually run to completion. After running for close to a week
it had reached somewhere around 250e6, when it became necessary to test
the reboot feature (which worked remarkably well). As there are quite a
lot of primes to be found before reaching <code>INT_MAX</code>, the
output produced can be quite overwhelming so it’s recommended to pipe
the output through your favorite pager (<code>more</code> or
<code>less</code>), and not output to a paper output device (unless you
have <em>LOTS</em> of paper).</p>
<p>The alternative version (<a href="weisberg.alt.c">weisberg.alt.c</a>) has never actually run
to completion. After running for close to a week it had reached somewhere around
250e6, when it became necessary to test the reboot feature (which worked
remarkably well). As there are quite a lot of primes to be found before reaching
<code>INT_MAX</code>, the output produced can be quite overwhelming so it’s recommended to pipe
the output through your favorite pager (<code>more</code> or <code>less</code>), and not output to a
paper output device (unless you have <em>LOTS</em> of paper).</p>
<h3 id="technical">Technical</h3>
<p>The original “Yet Another Prime Program” algorithm used here was
developed as a Computer Architecture course micro-programming exercise,
and was designed to take full advantage of the UR300 micro-architecture
to achieve blindingly fast speed. It was ported to C specifically for
the IOCCC. In the conversion/obfuscation step some of (much of) the
blazing speed was lost, but as a bonus, the understandability of the
code was reduced to zero.</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 original “Yet Another Prime Program” algorithm used here was developed as a
Computer Architecture course micro-programming exercise, and was designed to
take full advantage of the UR300 micro-architecture to achieve blindingly fast
speed. It was ported to C specifically for the IOCCC. In the
conversion/obfuscation step some of (much of) the blazing speed was lost, but as
a bonus, the understandability of the code was reduced to zero.</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-1994weisberg"><a name="inventory"></a>Inventory
for 1994/weisberg</h1>
<h1 id="inventory-for-1994weisberg"><a name="inventory"></a>Inventory for 1994/weisberg</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/1994/weisberg/weisberg.c">weisberg.c</a>
- entry source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/Makefile">Makefile</a>
- entry Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/weisberg.orig.c">weisberg.orig.c</a>
- original source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/primes.sh">primes.sh</a>
- feed primes to the program</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/try.sh">try.sh</a>
- how to run</li>
<li><a href="1994_weisberg.tar.bz2">1994_weisberg.tar.bz2</a> - download
entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/weisberg.c">weisberg.c</a> - entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/Makefile">Makefile</a> - entry Makefile</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/weisberg.orig.c">weisberg.orig.c</a> - original source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/primes.sh">primes.sh</a> - feed primes to the program</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/try.sh">try.sh</a> - how to run</li>
<li><a href="1994_weisberg.tar.bz2">1994_weisberg.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/1994/weisberg/.entry.json">.entry.json</a>
- description of entry in JSON</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/.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/1994/weisberg/.entry.json">.entry.json</a> - description of entry in JSON</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/.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/1994/weisberg/README.md">README.md</a>
- markdown source for index.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/weisberg/README.md">README.md</a> - markdown source for index.html</li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->