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
1 parent
9eb7a54e9f
commit
b0b212acb1
402 files changed
+37061
-55132
No files matched your search
+53
-80
@@ -129,9 +129,9 @@
|
||||
|
||||
<h2 id="author"><a name="author"></a>Author:</h2>
|
||||
<ul>
|
||||
<li>Name: <a href="../../authors.html#Adrian_Mariano">Adrian
|
||||
Mariano</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#Adrian_Mariano">Adrian Mariano</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 -->
|
||||
@@ -144,8 +144,7 @@ Mariano</a><br> Location: <a href="../../location.html#US">US</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#1990_theorem">1990 theorem bugs</a>.</p>
|
||||
<p>For more detailed information see <a href="../../bugs.html#1990_theorem">1990 theorem 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">./theorem</span> expression x1 x2 h y1</span></code></pre></div>
|
||||
<p>where:</p>
|
||||
@@ -157,109 +156,83 @@ y1 - initial value (y(x1) == y1)</code></pre>
|
||||
<h2 id="try">Try:</h2>
|
||||
<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">./try.sh</span></span></code></pre></div>
|
||||
<h2 id="judges-remarks">Judges’ remarks:</h2>
|
||||
<p>The program’s source implements four functions, all from the same
|
||||
source file!</p>
|
||||
<p>When you compile <a href="theorem.c">theorem.c</a> as is and run with
|
||||
5 args, it numerically solves the equation <code>y'=f(x,y)</code>, with
|
||||
a step size of <code>h</code> (see above usage), over the interval
|
||||
<code>x=[x1,x2]</code>, with the initial condition of
|
||||
<code>y(x1)=y1</code>.</p>
|
||||
<p>The ‘expression’ <code>f(x,y)</code> is any function of
|
||||
<code>x</code> and <code>y</code> with the operators:</p>
|
||||
<p>The program’s source implements four functions, all from the
|
||||
same source file!</p>
|
||||
<p>When you compile <a href="theorem.c">theorem.c</a> as is and run with 5 args, it
|
||||
numerically solves the equation <code>y'=f(x,y)</code>, with a step size of <code>h</code> (see above
|
||||
usage), over the interval <code>x=[x1,x2]</code>, with the initial condition of <code>y(x1)=y1</code>.</p>
|
||||
<p>The ‘expression’ <code>f(x,y)</code> is any function of <code>x</code> and <code>y</code> with the
|
||||
operators:</p>
|
||||
<pre><code>+ - * / ^</code></pre>
|
||||
<p>The symbol <code>^</code> is the power operator. Note that it only
|
||||
supports integer powers. Also note that all expressions are evaluated
|
||||
strictly left to right. (i.e., parenthesis aren’t supported).</p>
|
||||
<p>The symbol <code>^</code> is the power operator. Note that it only supports
|
||||
integer powers. Also note that all expressions are evaluated strictly
|
||||
left to right. (i.e., parenthesis aren’t supported).</p>
|
||||
<p>Try running the program with the following args:</p>
|
||||
<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">./theorem</span> y 0 1 0.1 1</span>
|
||||
<span id="cb7-2"><a href="#cb7-2" aria-hidden="true" tabindex="-1"></a><span class="ex">./theorem</span> 1/x 1 2 0.1 0</span>
|
||||
<span id="cb7-3"><a href="#cb7-3" aria-hidden="true" tabindex="-1"></a><span class="ex">./theorem</span> <span class="st">'x^2/y+x'</span> 0 1 0.1 6</span></code></pre></div>
|
||||
<p>But wait, there is more! You also get, free of charge, a reversing
|
||||
filter! Try:</p>
|
||||
<p>But wait, there is more! You also get, free of charge, a
|
||||
reversing filter! Try:</p>
|
||||
<div class="sourceCode" id="cb8"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb8-1"><a href="#cb8-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./theorem</span> <span class="at">-r</span> 0 0 0 0 <span class="op"><</span> theorem.c <span class="op">></span> sorter.c</span></code></pre></div>
|
||||
<p>Still not impressed? The author throws in for free, a sort program!
|
||||
Try:</p>
|
||||
<p>Still not impressed? The author throws in for free, a
|
||||
sort program! Try:</p>
|
||||
<div class="sourceCode" id="cb9"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb9-1"><a href="#cb9-1" aria-hidden="true" tabindex="-1"></a><span class="fu">make</span> sorter</span>
|
||||
<span id="cb9-2"><a href="#cb9-2" aria-hidden="true" tabindex="-1"></a><span class="fu">ls</span> <span class="kw">|</span> <span class="ex">./sorter</span></span></code></pre></div>
|
||||
<p>This program is safe for home use as well. The author has included a
|
||||
safety feature in case you misplace the original program source:</p>
|
||||
<div class="sourceCode" id="cb10"><pre
|
||||
class="sourceCode sh"><code class="sourceCode bash"><span id="cb10-1"><a href="#cb10-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./sorter</span> <span class="at">-r</span> 0 0 0 0 <span class="op"><</span> sorter.c <span class="op">></span> theorem_bkp.c</span></code></pre></div>
|
||||
<p>And finally, as a special offer to users of this entry, the author
|
||||
provides a Fibonacci sequence generator! Try:</p>
|
||||
<div class="sourceCode" id="cb11"><pre
|
||||
class="sourceCode sh"><code class="sourceCode bash"><span id="cb11-1"><a href="#cb11-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./sorter</span> 0 0 0 0 <span class="op"><</span> theorem.c <span class="op">></span> fibonacci.c</span>
|
||||
<p>This program is safe for home use as well. The author has
|
||||
included a safety feature in case you misplace the original
|
||||
program source:</p>
|
||||
<div class="sourceCode" id="cb10"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb10-1"><a href="#cb10-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./sorter</span> <span class="at">-r</span> 0 0 0 0 <span class="op"><</span> sorter.c <span class="op">></span> theorem_bkp.c</span></code></pre></div>
|
||||
<p>And finally, as a special offer to users of this entry,
|
||||
the author provides a Fibonacci sequence generator! Try:</p>
|
||||
<div class="sourceCode" id="cb11"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb11-1"><a href="#cb11-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./sorter</span> 0 0 0 0 <span class="op"><</span> theorem.c <span class="op">></span> fibonacci.c</span>
|
||||
<span id="cb11-2"><a href="#cb11-2" aria-hidden="true" tabindex="-1"></a><span class="fu">make</span> fibonacci</span>
|
||||
<span id="cb11-3"><a href="#cb11-3" aria-hidden="true" tabindex="-1"></a><span class="ex">./fibonacci</span> 1 1</span>
|
||||
<span id="cb11-4"><a href="#cb11-4" aria-hidden="true" tabindex="-1"></a><span class="ex">./fibonacci</span> 2 1</span></code></pre></div>
|
||||
<p>NOTE: if the two args passed to <code>fibonacci</code> and
|
||||
<code>theorem_bkp</code> add to 0 it will print 0 over and over again in
|
||||
an infinite loop. In this case it should not be fixed (another condition
|
||||
where this occurred was fixed in 2023 as it affected usability of the
|
||||
program).</p>
|
||||
<p>Program available on 9 track and cartridge cassette. Neither <a
|
||||
href="https://ginsu.com">Ginsu knife</a> nor <a
|
||||
href="https://en.wikipedia.org/wiki/Swiss_Army_knife">Swiss army
|
||||
<p>NOTE: if the two args passed to <code>fibonacci</code> and <code>theorem_bkp</code> add to 0 it will
|
||||
print 0 over and over again in an infinite loop. In this case it should not be
|
||||
fixed (another condition where this occurred was fixed in 2023 as it affected
|
||||
usability of the program).</p>
|
||||
<p>Program available on 9 track and cartridge cassette. Neither <a href="https://ginsu.com">Ginsu
|
||||
knife</a> nor <a href="https://en.wikipedia.org/wiki/Swiss_Army_knife">Swiss army
|
||||
knife</a> included! :-)</p>
|
||||
<p>When this program was first shown at the 1990 Summer USENIX
|
||||
conference, it received a standing ovation; a first for a contest
|
||||
entry.</p>
|
||||
<p>When this program was first shown at the 1990 Summer USENIX conference, it
|
||||
received a standing ovation; a first for a contest entry.</p>
|
||||
<h2 id="authors-remarks">Author’s remarks:</h2>
|
||||
<p>Differential equations are solved via the Runge-Kutta method, which
|
||||
guarantees local error proportional to <code>h^5</code>, and total error
|
||||
across a finite interval is at most a constant times
|
||||
<code>h^4</code>.</p>
|
||||
<p>Sorting is accomplished with a standard <a
|
||||
href="https://en.wikipedia.org/wiki/Shellsort">shell sort</a>.</p>
|
||||
<p>Note that the sorting and reversing is limited to files with fewer
|
||||
than 500 lines, each less than 99 characters long.</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>Differential equations are solved via the Runge-Kutta method, which guarantees
|
||||
local error proportional to <code>h^5</code>, and total error across a finite interval is at
|
||||
most a constant times <code>h^4</code>.</p>
|
||||
<p>Sorting is accomplished with a standard <a href="https://en.wikipedia.org/wiki/Shellsort">shell
|
||||
sort</a>.</p>
|
||||
<p>Note that the sorting and reversing is limited to files with fewer than 500
|
||||
lines, each less than 99 characters long.</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-1990theorem"><a name="inventory"></a>Inventory for
|
||||
1990/theorem</h1>
|
||||
<h1 id="inventory-for-1990theorem"><a name="inventory"></a>Inventory for 1990/theorem</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/1990/theorem/theorem.c">theorem.c</a>
|
||||
- entry source</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/theorem/Makefile">Makefile</a>
|
||||
- entry Makefile</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/theorem/theorem.orig.c">theorem.orig.c</a>
|
||||
- original source</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/theorem/try.sh">try.sh</a>
|
||||
- how to run</li>
|
||||
<li><a href="1990_theorem.tar.bz2">1990_theorem.tar.bz2</a> - download
|
||||
entry source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/theorem/theorem.c">theorem.c</a> - entry source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/theorem/Makefile">Makefile</a> - entry Makefile</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/theorem/theorem.orig.c">theorem.orig.c</a> - original source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/theorem/try.sh">try.sh</a> - how to run</li>
|
||||
<li><a href="1990_theorem.tar.bz2">1990_theorem.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/1990/theorem/.entry.json">.entry.json</a>
|
||||
- description of entry in JSON</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/theorem/.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/1990/theorem/.entry.json">.entry.json</a> - description of entry in JSON</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/theorem/.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/1990/theorem/README.md">README.md</a>
|
||||
- markdown source for index.html</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/theorem/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