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

2018/index.html
+59 -91
View File
@@ -123,56 +123,43 @@
<!-- 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="twenty-fifth-international-obfuscated-c-code-contest">Twenty
Fifth International Obfuscated C Code Contest</h1>
<h1 id="twenty-fifth-international-obfuscated-c-code-contest">Twenty Fifth 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 compile the entry 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. This year we included most of the information included by the
submitter.</p>
<p>The primary site can be found at <a
href="https://www.ioccc.org">www.ioccc.org</a>.</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>Look at the source and try to figure out what the programs do, and
run them with various inputs.</p>
<p>Read over the Makefile and index.html files for compile/build issues.
Your system may require certain changes (add or remove a library, add or
remove a <code>#define</code>).</p>
<p>View the <code>index.html</code> web page for the given winning entry for information on how
compile the entry 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. This year we included most of the
information included by the submitter.</p>
<p>The primary site can be found at <a href="https://www.ioccc.org">www.ioccc.org</a>.</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>Look at the source and try to figure out what the programs do, and run
them with various inputs.</p>
<p>Read over the Makefile and index.html files for compile/build issues. Your
system may require certain changes (add or remove a library, add or remove a
<code>#define</code>).</p>
<p>Some C compilers are not quite as good as they should be. If yours is
lacking, you may need to compile using clang or gcc instead of your
local compiler.</p>
<h2 id="remarks-on-some-of-the-winning-entries">Remarks on some of the
winning entries</h2>
<p>We believe you will again be impressed with this year’s winning
entries.</p>
<p>The <a href="mills/index.html">“Best of show” (mills)</a> is an
amazing tribute to entries from 1984 and 2015.</p>
<p>Take a close look at the “<a href="hou/index.html">Most likely to top
the charts” (hou)</a>. Observe that while it contains no variables and
no operators, it remains functional in what it does.</p>
<p>The <a href="burton1/index.html">“Best one-liner” (burton1)</a>, at
109 characters, is a short and sweet implementation of a classic utility
and a nod to a winning entry from 1986. Sometimes it takes 20 some years
to do things the true IOCCC way.</p>
<p>The color of the remarks text this year was inspired by one of the
stars of the <a href="poikola/index.html">“Most stellar”
(poikola)</a>.</p>
<p>The <a href="endoh2/index.html">“Best use of python” (endoh2)</a> is
a not what you might think it is. It is something completely
different.</p>
<p>The <a href="ciura/index.html">“Most likely to be awarded”
(ciura)</a> has an amazing vocabulary!</p>
<p>There are also nods to entries of the years <a
href="2000/bellard/index.htmk">2000/bellard</a>, <a
href="1989/yang/index.html">1989/yang</a>, …</p>
<p>…We’ll stop spouting spoilers now. Have fun exploring all the
entries!</p>
<h2 id="remarks-on-some-of-submissions-that-did-not-win">Remarks on some
of submissions that did not win</h2>
lacking, you may need to compile using clang or gcc instead of your local
compiler.</p>
<h2 id="remarks-on-some-of-the-winning-entries">Remarks on some of the winning entries</h2>
<p>We believe you will again be impressed with this year’s winning entries.</p>
<p>The <a href="mills/index.html">“Best of show” (mills)</a> is an amazing tribute to entries
from 1984 and 2015.</p>
<p>Take a close look at the “<a href="hou/index.html">Most likely to top the charts” (hou)</a>.
Observe that while it contains no variables and no operators, it
remains functional in what it does.</p>
<p>The <a href="burton1/index.html">“Best one-liner” (burton1)</a>, at 109 characters, is a
short and sweet implementation of a classic utility and a nod to a winning entry
from 1986. Sometimes it takes 20 some years to do things the true IOCCC way.</p>
<p>The color of the remarks text this year was inspired by one of the stars
of the <a href="poikola/index.html">“Most stellar” (poikola)</a>.</p>
<p>The <a href="endoh2/index.html">“Best use of python” (endoh2)</a> is a not what you might think it is.
It is something completely different.</p>
<p>The <a href="ciura/index.html">“Most likely to be awarded” (ciura)</a> has an amazing vocabulary!</p>
<p>There are also nods to entries of the years <a href="2000/bellard/index.htmk">2000/bellard</a>,
<a href="1989/yang/index.html">1989/yang</a>, …</p>
<p>…We’ll stop spouting spoilers now. Have fun exploring all the entries!</p>
<h2 id="remarks-on-some-of-submissions-that-did-not-win">Remarks on some of submissions that did not win</h2>
<p>The number of entries that would have made it into the final rounds
would have been much higher had some people paid attention to rules 2
and 22 (one third of 666).</p>
@@ -185,69 +172,50 @@ and 22 (one third of 666).</p>
| Identifying yourself, in an obvious way in your code, data, remarks
| or program output, unless you are Peter Honeyman or pretending
| to be Peter Honeyman, will be grounds for disqualification of your entry.</code></pre>
<p>A number of other entries were based on <a
href="iocccsize.c">iocccsize.c</a>, making derivative works rather than
original works.</p>
<p>Still other entries were too large, violating the first line of rule
2:</p>
<p>A number of other entries were based on <a href="iocccsize.c">iocccsize.c</a>, making
derivative works rather than original works.</p>
<p>Still other entries were too large, violating the first line of rule 2:</p>
<blockquote>
<ol start="2" type="1">
<li>The size of your program source must be &lt;= 4096 bytes in
length.</li>
<li>The size of your program source must be &lt;= 4096 bytes in length.</li>
</ol>
</blockquote>
<p>While these entries might have passed under the 2053 limit for
iocccsize, they were larger than &lt;= 4096 bytes, sometimes by an order
or magnitude.</p>
<p>While these entries might have passed under the 2053 limit for iocccsize,
they were larger than &lt;= 4096 bytes, sometimes by an order or magnitude.</p>
<p>We hope the authors of some of those entries will fix and re-submit
them for the next IOCCC.</p>
<p>Some entries seemed to have a good idea, but the implementation of
the idea was limited in scope.</p>
<h2 id="final-comments">Final Comments</h2>
<p><strong>IMPORTANT NOTE</strong>: 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>: 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) 2018,2023, Landon Curt Noll 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) 2018,2023, Landon Curt Noll 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-2018---the-25th-ioccc"><a name=inventory></a><a name=2018></a>Winning
Entries of 2018 - The 25th IOCCC</h1>
<p><strong>Download IOCCC</strong> <a
href="2018/ioccc.2018.tar.bz2">2018 entry source</a></p>
<h1 id="winning-entries-of-2018---the-25th-ioccc"><a name=inventory></a><a name=2018></a>Winning Entries of 2018 - The 25th IOCCC</h1>
<p><strong>Download IOCCC</strong> <a href="2018/ioccc.2018.tar.bz2">2018 entry source</a></p>
<ul>
<li><a href="algmyr/index.html">2018/algmyr</a> - Most cacophonic</li>
<li><a href="anderson/index.html">2018/anderson</a> - Most able to
divine code gaps</li>
<li><a href="bellard/index.html">2018/bellard</a> - Most
inflationary</li>
<li><a href="anderson/index.html">2018/anderson</a> - Most able to divine code gaps</li>
<li><a href="bellard/index.html">2018/bellard</a> - Most inflationary</li>
<li><a href="burton1/index.html">2018/burton1</a> - Best one-liner</li>
<li><a href="burton2/index.html">2018/burton2</a> - Best abuse of the
rules</li>
<li><a href="ciura/index.html">2018/ciura</a> - Most likely to be
awarded</li>
<li><a href="endoh1/index.html">2018/endoh1</a> - Best tool to reveal
holes</li>
<li><a href="endoh2/index.html">2018/endoh2</a> - Best use of
python</li>
<li><a href="ferguson/index.html">2018/ferguson</a> - Best use of weasel
words</li>
<li><a href="burton2/index.html">2018/burton2</a> - Best abuse of the rules</li>
<li><a href="ciura/index.html">2018/ciura</a> - Most likely to be awarded</li>
<li><a href="endoh1/index.html">2018/endoh1</a> - Best tool to reveal holes</li>
<li><a href="endoh2/index.html">2018/endoh2</a> - Best use of python</li>
<li><a href="ferguson/index.html">2018/ferguson</a> - Best use of weasel words</li>
<li><a href="giles/index.html">2018/giles</a> - Most unstable</li>
<li><a href="hou/index.html">2018/hou</a> - Most likely to top the
charts</li>
<li><a href="hou/index.html">2018/hou</a> - Most likely to top the charts</li>
<li><a href="mills/index.html">2018/mills</a> - Best of show</li>
<li><a href="poikola/index.html">2018/poikola</a> - Most stellar</li>
<li><a href="vokes/index.html">2018/vokes</a> - Most connected</li>