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

+59 -85
View File
@@ -123,17 +123,14 @@
<!-- END: this line ends content from: inc/before-content.default.html -->
<!-- START: this line starts content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<h1 id="fifteenth-international-obfuscated-c-code-contest">Fifteenth
International Obfuscated C Code Contest</h1>
<h1 id="fifteenth-international-obfuscated-c-code-contest">Fifteenth International Obfuscated C Code Contest</h1>
<h2 id="standard-ioccc-stuff">Standard IOCCC stuff</h2>
<p>View the <code>index.html</code> web page for the given winning entry
for information on how on how to compile it and how to run the winning
program. Look at the winning source and try to figure how it does what
it does! You may then wish to look at the Author’s remarks for even more
details.</p>
<p>Use <code>make</code> to compile entries. It is possible that on
non-Unix / non-Linux systems the Makefile needs to be changed. See the
Makefile for details.</p>
<p>View the <code>index.html</code> web page for the given winning entry for information on how
on how to compile it and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.</p>
<p>Use <code>make</code> to compile entries. It is possible that on non-Unix / non-Linux
systems the Makefile needs to be changed. See the Makefile for details.</p>
<p>Read over the Makefile for compile/build issues. Your system may
require certain changes (add or remove a library, add or remove a
<code>#define</code>).</p>
@@ -141,107 +138,84 @@ require certain changes (add or remove a library, add or remove a
yours is lacking, you may need to compile using gcc instead of your
local compiler.</p>
<h2 id="new-judge">New Judge</h2>
<p>The judges were unable to contact Jeremy Horn for judging the 2000
contest.</p>
<p>As a result, <a href="http://www.sfik.com/">Simon Cooper</a> joined
our team. Simon is well known for being a co-author of the 2nd edition
of the Building Internet Firewalls book.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the
entries</h2>
<p>The judges were unable to contact Jeremy Horn for judging the 2000 contest.</p>
<p>As a result, <a href="http://www.sfik.com/">Simon Cooper</a> joined our team. Simon is
well known for being a co-author of the 2nd edition of the Building Internet
Firewalls book.</p>
<h2 id="remarks-on-some-of-the-entries">Remarks on some of the entries</h2>
<p>There were some outstanding entries that did not win. Unfortunately
some very good entries lost because they:</p>
<ul>
<li>depended too much on non-portable side effects in expressions;</li>
<li>depended too much on a particular byte order;</li>
<li>required the use of a special script, data file or pseudo-machine
language that was not supplied with the entry.</li>
<li>required the use of a special script, data file or pseudo-machine language
that was not supplied with the entry.</li>
</ul>
<p>We hope the authors of some of those entries will fix and re-submit
them for the next IOCCC.</p>
<p>We believe you will be impressed with this year’s winning entries.
The <a href="jarijyrki/index.html">Best of Show</a> is a fine example of
compact obfuscation. But don’t ignore the shorter entries. The <a
href="natori/index.html">Best Small Program</a>, <a
href="briddlebane/README.m">Best Abuse of User</a> and <a
href="tomx/index.html">Most Complete Program</a> are well worth studying
in detail.</p>
<p>The <a href="dlowe/index.html">Worst Abuse of the Rules</a> is
technically allowed by the rules. We gave it an award this year, but
don’t assume you can get away with using it next time … :-)</p>
<p>Speaking of time, be sure to check out the <a
href="rince/index.html">Astronomically Obfuscated</a> and the <a
href="schneiderwent/index.html">Most Timely Output</a> entries.</p>
<p>We believe you will be impressed with this year’s winning entries. The <a href="jarijyrki/index.html">Best of
Show</a> is a fine example of compact obfuscation. But don’t
ignore the shorter entries. The <a href="natori/index.html">Best Small Program</a>, <a href="briddlebane/README.m">Best
Abuse of User</a> and <a href="tomx/index.html">Most Complete Program</a>
are well worth studying in detail.</p>
<p>The <a href="dlowe/index.html">Worst Abuse of the Rules</a> is technically allowed by the
rules. We gave it an award this year, but don’t assume you can get away with
using it next time … :-)</p>
<p>Speaking of time, be sure to check out the <a href="rince/index.html">Astronomically
Obfuscated</a> and the <a href="schneiderwent/index.html">Most Timely
Output</a> entries.</p>
<h2 id="there-was-no-1999-contest">There was no 1999 contest</h2>
<p>So what happened to 1999? Landon Curt Noll was scheduled to take a
vacation from the IOCCC this year. The remaining judges were unable to
contact Jeremy Horn, so the IOCCC stalled.</p>
<p>But thanks to Landon’s returning early from his IOCCC vacation
(Landon will take a full IOCCC vacation during some other year), Simon
Cooper joining the IOCCC judging team as well as the hard work of Peter
Seebach and Leonid A. Broukhis the judging was completed in Dec
2000.</p>
vacation from the IOCCC this year. The remaining judges were
unable to contact Jeremy Horn, so the IOCCC stalled.</p>
<p>But thanks to Landon’s returning early from his IOCCC vacation (Landon
will take a full IOCCC vacation during some other year), Simon Cooper
joining the IOCCC judging team as well as the hard work of Peter Seebach
and Leonid A. Broukhis the judging was completed in Dec 2000.</p>
<p>It was decided that the 15th contest would be the year 2000 contest
(the year the judging completed) rather than year 1999 (the initial
scheduled start of the contest). That is why there is no 1999
contest.</p>
<p><strong>NOTE</strong>: The above has been mentioned in an Amici
Curiae for the DeCSS case. See <a
href="https://web.archive.org/web/20231021211330/http://cryptome.org/mpaa-v-2600-bac.htm">BRIEF
OF AMICI CURIAE N SUPPORT OF APPELLANTS AND REVERSAL ..</a>.</p>
scheduled start of the contest). That is why there is no 1999 contest.</p>
<p><strong>NOTE</strong>: The above has been mentioned in an Amici Curiae for the
DeCSS case. See <a href="https://web.archive.org/web/20231021211330/http://cryptome.org/mpaa-v-2600-bac.htm">BRIEF OF AMICI CURIAE N SUPPORT OF APPELLANTS AND
REVERSAL ..</a>.</p>
<h2 id="final-comments">Final Comments</h2>
<p>Please send us comments and suggestions what we have expressed above.
Also include anything else that you would like to see in future
contests. Send such email to:</p>
Also include anything else that you would like to see in future contests.
Send such email to:</p>
<pre><code>questions@ioccc.org</code></pre>
<p><strong>IMPORTANT NOTE</strong>: The email addresses found above are
for historical purposes only, and should not be used today. See <a
href="../contact.html">contact.html</a> for up to date contact details
as well as details on how to provide fixes to any of the entries. See
also <a href="../faq.html">the IOCCC FAQ</a> for addition information on
the IOCCC.</p>
<p><strong>IMPORTANT NOTE</strong>: The email addresses found above are for historical
purposes only, and should not be used today. See
<a href="../contact.html">contact.html</a> for up to date contact details
as well as details on how to provide fixes to any of the entries.
See also <a href="../faq.html">the IOCCC FAQ</a> for addition information on the IOCCC.</p>
<h1 id="copyright-and-license">Copyright and License</h1>
<p>Copyright (c) 2000,2023, Landon Curt Noll, Peter Seebach and Leonid
A. Broukhis. All Rights Reserved. This work is licensed under a <a
href="https://creativecommons.org/licenses/by-sa/4.0/">Creative Commons
CC BY-SA 4.0 DEED Attribution-ShareAlike 4.0 International</a> license.
If you do use this work in some form, the <a href="../judges.html">IOCCC
judges</a> would appreciate (but does not require) if you were to <a
href="../contact.html">send us a note about your use</a>.</p>
<p>Copyright (c) 2000,2023, Landon Curt Noll, Peter Seebach and Leonid A. Broukhis. All Rights Reserved.
This work is licensed under a <a href="https://creativecommons.org/licenses/by-sa/4.0/">Creative Commons CC BY-SA 4.0 DEED Attribution-ShareAlike
4.0 International</a> license.
If you do use this work in some form, the <a href="../judges.html">IOCCC judges</a> would appreciate
(but does not require) if you were to <a href="../contact.html">send us a note about your use</a>.</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-year-index.sh via bin/md2html.sh -->
<!-- START: this line starts content generated by: bin/output-year-index.sh -->
<h1
id="winning-entries-of-2000---the-15th-ioccc"><a name=inventory></a><a name=2000></a>Winning
Entries of 2000 - The 15th IOCCC</h1>
<p><strong>Download IOCCC</strong> <a
href="2000/ioccc.2000.tar.bz2">2000 entry source</a></p>
<h1 id="winning-entries-of-2000---the-15th-ioccc"><a name=inventory></a><a name=2000></a>Winning Entries of 2000 - The 15th IOCCC</h1>
<p><strong>Download IOCCC</strong> <a href="2000/ioccc.2000.tar.bz2">2000 entry source</a></p>
<ul>
<li><a href="anderson/index.html">2000/anderson</a> - Best Use of
Flags</li>
<li><a href="bellard/index.html">2000/bellard</a> - Most Specific
Output</li>
<li><a href="anderson/index.html">2000/anderson</a> - Best Use of Flags</li>
<li><a href="bellard/index.html">2000/bellard</a> - Most Specific Output</li>
<li><a href="bmeyer/index.html">2000/bmeyer</a> - Best Utility</li>
<li><a href="briddlebane/index.html">2000/briddlebane</a> - Best Abuse
of User</li>
<li><a href="briddlebane/index.html">2000/briddlebane</a> - Best Abuse of User</li>
<li><a href="dhyang/index.html">2000/dhyang</a> - Best Layout</li>
<li><a href="dlowe/index.html">2000/dlowe</a> - Worst Abuse of the
Rules</li>
<li><a href="jarijyrki/index.html">2000/jarijyrki</a> - Best of
Show</li>
<li><a href="natori/index.html">2000/natori</a> - Best Small
Program</li>
<li><a href="primenum/index.html">2000/primenum</a> - Best Abuse of
CPP</li>
<li><a href="rince/index.html">2000/rince</a> - Astronomically
Obfuscated</li>
<li><a href="dlowe/index.html">2000/dlowe</a> - Worst Abuse of the Rules</li>
<li><a href="jarijyrki/index.html">2000/jarijyrki</a> - Best of Show</li>
<li><a href="natori/index.html">2000/natori</a> - Best Small Program</li>
<li><a href="primenum/index.html">2000/primenum</a> - Best Abuse of CPP</li>
<li><a href="rince/index.html">2000/rince</a> - Astronomically Obfuscated</li>
<li><a href="robison/index.html">2000/robison</a> - Best game</li>
<li><a href="schneiderwent/index.html">2000/schneiderwent</a> - Most
Timely Output</li>
<li><a href="thadgavin/index.html">2000/thadgavin</a> - Most Portable
Output</li>
<li><a href="schneiderwent/index.html">2000/schneiderwent</a> - Most Timely Output</li>
<li><a href="thadgavin/index.html">2000/thadgavin</a> - Most Portable Output</li>
<li><a href="tomx/index.html">2000/tomx</a> - Most Complete Program</li>
</ul>
<p> <strong>Jump to:</strong> <a href="#">top</a></p>