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

2001/ollinger/index.html
+38 -63
View File
@@ -129,9 +129,9 @@
<h2 id="author"><a name="author"></a>Author:</h2>
<ul>
<li>Name: <a href="../../authors.html#Nicolas_Ollinger">Nicolas
Ollinger</a><br> Location: <a href="../../location.html#FR">FR</a> -
<em>French Republic</em> (<em>France</em>) <br><br></li>
<li>Name: <a href="../../authors.html#Nicolas_Ollinger">Nicolas Ollinger</a><br>
Location: <a href="../../location.html#FR">FR</a> - <em>French Republic</em> (<em>France</em>)
<br><br></li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-author.sh -->
@@ -151,22 +151,20 @@ high (200x100) with a tiny font.</p>
<p>Do get lost in the program’s line of thought! :-)</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<h3 id="whats-this">What’s this?</h3>
<p>What do you see? On the left, you will see an enumeration of all
successive <a
href="https://en.wikipedia.org/wiki/Prime_number">primes</a> from 2 to
the parameter you gave to the program. On the right part, you can see
the sieve used to find these primes. The big diagonals from right to
left are used to erase composed numbers. When no diagonal crosses a
number, then the left cell take value 1 and the number is prime.</p>
<p>The parallel version of this algorithm works in real time
<code>n</code>. This C sequential version is slower as it works in
<code>O(n*log n)</code>. But you have some nice picture instead… the
cost is a constant number of operation for each character printed on the
screen.</p>
<p>What do you see? On the left, you will see an enumeration of all successive
<a href="https://en.wikipedia.org/wiki/Prime_number">primes</a> from 2 to the parameter you
gave to the program. On the right part, you can see the sieve used to find these
primes. The big diagonals from right to left are used to erase composed numbers.
When no diagonal crosses a number, then the left cell take value 1 and the
number is prime.</p>
<p>The parallel version of this algorithm works in real time <code>n</code>. This C
sequential version is slower as it works in <code>O(n*log n)</code>. But you have some
nice picture instead… the cost is a constant number of operation for each
character printed on the screen.</p>
<h3 id="why-did-i-write-this">Why did I write this ?</h3>
<p>Let’s just quote the <a href="../../faq.html">FAQ</a>:</p>
<p>Q: Are there types of entries that are submitted so frequently that
the judges get tired of them?</p>
<p>Q: Are there types of entries that are submitted so frequently that the
judges get tired of them?</p>
<p>A: Yes, there are types of entries that show up over and over again.
The guidelines say:</p>
<pre><code>We tend to dislike programs that:
@@ -197,72 +195,49 @@ entries that use some complex state machine/table to print something
1988/phillipps
Unbeaten for 12 years and counting...</code></pre>
<p>I think this is enough motivation for trying to submit a program
which uses some complex state machine/table to generate small primes and
print them.</p>
<p>I think this is enough motivation for trying to submit a program which uses
some complex state machine/table to generate small primes and print them.</p>
<h3 id="the-way-it-works">The way it works</h3>
<p>This program simply prints the space-time diagram of some particular
cellular automaton. The automaton is a 9-state automaton by <a
href="https://sk-m-wikipedia-org.translate.goog/wiki/Ivan_Korec?_x_tr_sl=auto&amp;_x_tr_tl=en&amp;_x_tr_hl=en-US&amp;_x_tr_pto=wapp">Ivan
Korec</a> in 1998. It is an optimization of an old automaton for
recognizing primes designed by <a
href="http://richardallenfischer.com">Fischer</a> in 1965.</p>
<p>The table of the automaton is encoded into the string <code>e</code>
and consists of 345 transitions of the kind
<code>ff(left,middle,right)</code>. This encoding into <code>e</code> is
obfuscated to reduce its size, restrict it to characters 32 to 127 and
cellular automaton. The automaton is a 9-state automaton by <a href="https://sk-m-wikipedia-org.translate.goog/wiki/Ivan_Korec?_x_tr_sl=auto&amp;_x_tr_tl=en&amp;_x_tr_hl=en-US&amp;_x_tr_pto=wapp">Ivan
Korec</a> in 1998.
It is an optimization of an old automaton for recognizing primes designed
by <a href="http://richardallenfischer.com">Fischer</a> in 1965.</p>
<p>The table of the automaton is encoded into the string <code>e</code> and consists of
345 transitions of the kind <code>ff(left,middle,right)</code>. This encoding into <code>e</code>
is obfuscated to reduce its size, restrict it to characters 32 to 127 and
guarantee a constant time.</p>
<p>The main loop simply iterates this transition function on each
cell.</p>
<p>The main loop simply iterates this transition function on each cell.</p>
<p>“The rest is silence” (Hamlet, V.2)</p>
<p>Enjoy!</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-2001ollinger"><a name="inventory"></a>Inventory
for 2001/ollinger</h1>
<h1 id="inventory-for-2001ollinger"><a name="inventory"></a>Inventory for 2001/ollinger</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/2001/ollinger/ollinger.c">ollinger.c</a>
- entry source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/ollinger/Makefile">Makefile</a>
- entry Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/ollinger/ollinger.orig.c">ollinger.orig.c</a>
- original source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/ollinger/try.sh">try.sh</a>
- how to run</li>
<li><a href="2001_ollinger.tar.bz2">2001_ollinger.tar.bz2</a> - download
entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/ollinger/ollinger.c">ollinger.c</a> - entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/ollinger/Makefile">Makefile</a> - entry Makefile</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/ollinger/ollinger.orig.c">ollinger.orig.c</a> - original source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/ollinger/try.sh">try.sh</a> - how to run</li>
<li><a href="2001_ollinger.tar.bz2">2001_ollinger.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/2001/ollinger/.entry.json">.entry.json</a>
- description of entry in JSON</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/ollinger/.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/2001/ollinger/.entry.json">.entry.json</a> - description of entry in JSON</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/ollinger/.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/2001/ollinger/README.md">README.md</a>
- markdown source for index.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/ollinger/README.md">README.md</a> - markdown source for index.html</li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->