change HTML strike to del

This commit is contained in:
Landon Curt Noll committed 2024-04-19 01:40:01 -07:00
1 parent a9ca93ec47
commit 1c813a86ac
22 files changed
+47 -51

No files matched your search

+1 -1
View File
@@ -192,7 +192,7 @@ right either.</p>
<p>If the optimiser is enabled, however, we will see that it works fine before the <p>If the optimiser is enabled, however, we will see that it works fine before the
change to <code>_exit()</code>.</p> change to <code>_exit()</code>.</p>
<h2 id="summary">Summary</h2> <h2 id="summary">Summary</h2>
<p>And that is the tale of a little <strike>engine</strike> train that <p>And that is the tale of a little <del>engine</del> train that
could…eventually! Or perhaps it’s the compilers, optimisers and OSes that could…eventually! Or perhaps it’s the compilers, optimisers and OSes that
eventually could?</p> eventually could?</p>
<p>Whichever you wish it to be, it now works with both clang and gcc! Choo choo!</p> <p>Whichever you wish it to be, it now works with both clang and gcc! Choo choo!</p>
+1 -1
View File
@@ -86,7 +86,7 @@ change to `_exit()`.
## Summary ## Summary
And that is the tale of a little <strike>engine</strike> train that And that is the tale of a little <del>engine</del> train that
could...eventually! Or perhaps it's the compilers, optimisers and OSes that could...eventually! Or perhaps it's the compilers, optimisers and OSes that
eventually could? eventually could?
+1 -1
View File
@@ -51,7 +51,7 @@ existing spreadsheet files unusable.
## Judges' remarks: ## Judges' remarks:
This entry is one of those that makes you wonder why some commercial software This entry is one of those that makes you wonder why some commercial software
needs tens to hundreds of <strike>megabytes</strike>gigabytes to install! This needs tens to hundreds of <del>megabytes</del>gigabytes to install! This
entry does not simply do the basics, it includes graphing features. All this entry does not simply do the basics, it includes graphing features. All this
program needs now is a [1998/banks](../../1998/banks/index.html) flight simulator! program needs now is a [1998/banks](../../1998/banks/index.html) flight simulator!
+1 -1
View File
@@ -177,7 +177,7 @@ Location: <a href="../../location.html#FI">FI</a> - <em>Republic of Finland </em
existing spreadsheet files unusable.</p> existing spreadsheet files unusable.</p>
<h2 id="judges-remarks">Judges’ remarks:</h2> <h2 id="judges-remarks">Judges’ remarks:</h2>
<p>This entry is one of those that makes you wonder why some commercial software <p>This entry is one of those that makes you wonder why some commercial software
needs tens to hundreds of <strike>megabytes</strike>gigabytes to install! This needs tens to hundreds of <del>megabytes</del>gigabytes to install! This
entry does not simply do the basics, it includes graphing features. All this entry does not simply do the basics, it includes graphing features. All this
program needs now is a <a href="../../1998/banks/index.html">1998/banks</a> flight simulator!</p> program needs now is a <a href="../../1998/banks/index.html">1998/banks</a> flight simulator!</p>
<h2 id="authors-remarks">Author’s remarks:</h2> <h2 id="authors-remarks">Author’s remarks:</h2>
+1 -1
View File
@@ -199,7 +199,7 @@ global state, and the other doesn't.
There is also quite a nice trick where I wave a magic wand, and a chunk of code There is also quite a nice trick where I wave a magic wand, and a chunk of code
which should only be run when the program is run for the first time (setting the which should only be run when the program is run for the first time (setting the
[PC / IP](https://en.wikipedia.org/wiki/Program_counter) to point at `main()` [PC / IP](https://en.wikipedia.org/wiki/Program_counter) to point at `main()`
etc.) gets turned into a <strike>frog</strike>string. The C compiler sees a string by etc.) gets turned into a <del>frog</del>string. The C compiler sees a string by
itself in the code, thinks "yup, that's a valid C expression", and quietly moves itself in the code, thinks "yup, that's a valid C expression", and quietly moves
on to the next line of code. on to the next line of code.
+1 -1
View File
@@ -281,7 +281,7 @@ global state, and the other doesn’t.</p>
<p>There is also quite a nice trick where I wave a magic wand, and a chunk of code <p>There is also quite a nice trick where I wave a magic wand, and a chunk of code
which should only be run when the program is run for the first time (setting the which should only be run when the program is run for the first time (setting the
<a href="https://en.wikipedia.org/wiki/Program_counter">PC / IP</a> to point at <code>main()</code> <a href="https://en.wikipedia.org/wiki/Program_counter">PC / IP</a> to point at <code>main()</code>
etc.) gets turned into a <strike>frog</strike>string. The C compiler sees a string by etc.) gets turned into a <del>frog</del>string. The C compiler sees a string by
itself in the code, thinks “yup, that’s a valid C expression”, and quietly moves itself in the code, thinks “yup, that’s a valid C expression”, and quietly moves
on to the next line of code.</p> on to the next line of code.</p>
<h3 id="limitations">Limitations</h3> <h3 id="limitations">Limitations</h3>
+1 -1
View File
@@ -95,7 +95,7 @@ character glob pattern evaluator, returning nonzero for a match:
The recursion wonderfully and magically takes care of iteration and The recursion wonderfully and magically takes care of iteration and
backtracking. I could tell you how it works but then I would have to backtracking. I could tell you how it works but then I would have to
<strike>kill</strike> request a NDA from you :-) Run it under a debugger with several <del>kill</del> request a NDA from you :-) Run it under a debugger with several
inputs, it will be quite helpful and instructive. Handling of `?` is inputs, it will be quite helpful and instructive. Handling of `?` is
straightforward; for `*` start out with `*foo` and `foo*` against `foo`. straightforward; for `*` start out with `*foo` and `foo*` against `foo`.
How does it deal with sequences of adjacent `*`? How could this be How does it deal with sequences of adjacent `*`? How could this be
+1 -1
View File
@@ -208,7 +208,7 @@ program in less than a screenful.</li>
</ul> </ul>
<p>The recursion wonderfully and magically takes care of iteration and <p>The recursion wonderfully and magically takes care of iteration and
backtracking. I could tell you how it works but then I would have to backtracking. I could tell you how it works but then I would have to
<strike>kill</strike> request a NDA from you :-) Run it under a debugger with several <del>kill</del> request a NDA from you :-) Run it under a debugger with several
inputs, it will be quite helpful and instructive. Handling of <code>?</code> is inputs, it will be quite helpful and instructive. Handling of <code>?</code> is
straightforward; for <code>*</code> start out with <code>*foo</code> and <code>foo*</code> against <code>foo</code>. straightforward; for <code>*</code> start out with <code>*foo</code> and <code>foo*</code> against <code>foo</code>.
How does it deal with sequences of adjacent <code>*</code>? How could this be How does it deal with sequences of adjacent <code>*</code>? How could this be
+1 -1
View File
@@ -178,7 +178,7 @@ warning about a name conflict between my `BC()` and a `BC()` from
curses in the main system library. curses in the main system library.
### <strike>BUGS</strike> FEATURES: ### <del>BUGS</del> FEATURES:
Arguments matching `/[^2]22$/` cause the program to segfault Arguments matching `/[^2]22$/` cause the program to segfault
after rapidly exhausting the available stack space. I could after rapidly exhausting the available stack space. I could
+1 -1
View File
@@ -264,7 +264,7 @@ macro <code>#defines</code> would work. The compile step gives the usual
messages with <code>-Wall -pedantic</code>. The link step generates a messages with <code>-Wall -pedantic</code>. The link step generates a
warning about a name conflict between my <code>BC()</code> and a <code>BC()</code> from warning about a name conflict between my <code>BC()</code> and a <code>BC()</code> from
curses in the main system library.</p> curses in the main system library.</p>
<h3 id="bugs-features"><strike>BUGS</strike> FEATURES:</h3> <h3 id="bugs-features"><del>BUGS</del> FEATURES:</h3>
<p>Arguments matching <code>/[^2]22$/</code> cause the program to segfault <p>Arguments matching <code>/[^2]22$/</code> cause the program to segfault
after rapidly exhausting the available stack space. I could after rapidly exhausting the available stack space. I could
probably fix this by adding some special cases to the code, probably fix this by adding some special cases to the code,
+1 -1
View File
@@ -118,7 +118,7 @@ Believe it or not, it has strategy!
When only one tank remains on the field, the level will advance. When only one tank remains on the field, the level will advance.
Don't forget to destroy the aqua tank. Don't forget to destroy the aqua tank.
The <strike>battle</strike>playground is surrounded by mountains and each level is The <del>battle</del>playground is surrounded by mountains and each level is
filled with random obstacles (pyramids and cubes). filled with random obstacles (pyramids and cubes).
The bars show players energy and score; each bar shows energy The bars show players energy and score; each bar shows energy
+1 -1
View File
@@ -221,7 +221,7 @@ extra points.</p>
<p>Believe it or not, it has strategy!</p> <p>Believe it or not, it has strategy!</p>
<p>When only one tank remains on the field, the level will advance. <p>When only one tank remains on the field, the level will advance.
Don’t forget to destroy the aqua tank.</p> Don’t forget to destroy the aqua tank.</p>
<p>The <strike>battle</strike>playground is surrounded by mountains and each level is <p>The <del>battle</del>playground is surrounded by mountains and each level is
filled with random obstacles (pyramids and cubes).</p> filled with random obstacles (pyramids and cubes).</p>
<p>The bars show players energy and score; each bar shows energy <p>The bars show players energy and score; each bar shows energy
and indicates the current player view (wider on the left). The right and indicates the current player view (wider on the left). The right
+1 -1
View File
@@ -308,7 +308,7 @@ colors.
I would like to thank my wife @hirekoke for her teaching me the SPH method. I would like to thank my wife @hirekoke for her teaching me the SPH method.
The judges <strike>ordered</strike> suggested creating a color version The judges <del>ordered</del> suggested creating a color version
after the contest. after the contest.
The judges and HAMANO Tsukasa (The silver medalist at this IOCCC) kindly The judges and HAMANO Tsukasa (The silver medalist at this IOCCC) kindly
+1 -1
View File
@@ -333,7 +333,7 @@ fields</a>” in Japanese.)</p>
colors.</p> colors.</p>
<h3 id="acknowledgments">Acknowledgments</h3> <h3 id="acknowledgments">Acknowledgments</h3>
<p>I would like to thank my wife <span class="citation" data-cites="hirekoke">@hirekoke</span> for her teaching me the SPH method.</p> <p>I would like to thank my wife <span class="citation" data-cites="hirekoke">@hirekoke</span> for her teaching me the SPH method.</p>
<p>The judges <strike>ordered</strike> suggested creating a color version <p>The judges <del>ordered</del> suggested creating a color version
after the contest.</p> after the contest.</p>
<p>The judges and HAMANO Tsukasa (The silver medalist at this IOCCC) kindly <p>The judges and HAMANO Tsukasa (The silver medalist at this IOCCC) kindly
provided many configuration files.</p> provided many configuration files.</p>
+1 -1
View File
@@ -87,7 +87,7 @@ machines(!!), so they are truly configuration parameters, not logic.
### Notes: ### Notes:
One <strike>ping</strike> argument only. It will segfault on zero arguments, and One <del>ping</del> argument only. It will segfault on zero arguments, and
display strange results with more than one argument. display strange results with more than one argument.
Small, non-negative integers only. Useful range is `0 .. 511`, sorta, for LE; `0 Small, non-negative integers only. Useful range is `0 .. 511`, sorta, for LE; `0
+1 -1
View File
@@ -191,7 +191,7 @@ transformation occurs.</p>
code to be compiled for either LE (little-endian) or BE (big-endian) code to be compiled for either LE (little-endian) or BE (big-endian)
machines(!!), so they are truly configuration parameters, not logic.</p> machines(!!), so they are truly configuration parameters, not logic.</p>
<h3 id="notes">Notes:</h3> <h3 id="notes">Notes:</h3>
<p>One <strike>ping</strike> argument only. It will segfault on zero arguments, and <p>One <del>ping</del> argument only. It will segfault on zero arguments, and
display strange results with more than one argument.</p> display strange results with more than one argument.</p>
<p>Small, non-negative integers only. Useful range is <code>0 .. 511</code>, sorta, for LE; <code>0 .. 255</code> for BE. Bonus points if you can explain why the limits work this way.</p> <p>Small, non-negative integers only. Useful range is <code>0 .. 511</code>, sorta, for LE; <code>0 .. 255</code> for BE. Bonus points if you can explain why the limits work this way.</p>
<p>ASCII character set, 64-bit <code>long long</code>s are required.</p> <p>ASCII character set, 64-bit <code>long long</code>s are required.</p>
+2 -2
View File
@@ -47,7 +47,7 @@ ASCII art of the program source.
## Author's remarks: ## Author's remarks:
HOW ABOUT A NICE GAME OF <strike>CHESS</strike>TIC-TAC-TOE? HOW ABOUT A NICE GAME OF <del>CHESS</del>TIC-TAC-TOE?
### USAGE ### USAGE
@@ -114,7 +114,7 @@ to be Turing complete. (See "Control-Flow Bending: On the Effectiveness of Contr
Integrity" where we introduced this in an actual, published, academic paper. The Integrity" where we introduced this in an actual, published, academic paper. The
things you can get away with sometimes.) things you can get away with sometimes.)
We <strike>ab</strike>use this fact to implement the logic of tic-tac-toe entirely within We <del>ab</del>use this fact to implement the logic of tic-tac-toe entirely within
this one `printf(3)` call (and a call to `scanf(3)` to read user input). this one `printf(3)` call (and a call to `scanf(3)` to read user input).
Here's (briefly) how it works. Here's (briefly) how it works.
+2 -2
View File
@@ -171,7 +171,7 @@ loop. You would not think that this would amount to much, but you would be very,
very wrong. A clue to what is happening and how this works is encoded in the very wrong. A clue to what is happening and how this works is encoded in the
ASCII art of the program source.</p> ASCII art of the program source.</p>
<h2 id="authors-remarks">Author’s remarks:</h2> <h2 id="authors-remarks">Author’s remarks:</h2>
<p>HOW ABOUT A NICE GAME OF <strike>CHESS</strike>TIC-TAC-TOE?</p> <p>HOW ABOUT A NICE GAME OF <del>CHESS</del>TIC-TAC-TOE?</p>
<h3 id="usage">USAGE</h3> <h3 id="usage">USAGE</h3>
<pre><code> cc -o prog prog.c <pre><code> cc -o prog prog.c
./prog</code></pre> ./prog</code></pre>
@@ -211,7 +211,7 @@ compilers unhappy, and others slow. (For example, passing GCC the flags <code>-W
to be Turing complete. (See “Control-Flow Bending: On the Effectiveness of Control-Flow to be Turing complete. (See “Control-Flow Bending: On the Effectiveness of Control-Flow
Integrity” where we introduced this in an actual, published, academic paper. The Integrity” where we introduced this in an actual, published, academic paper. The
things you can get away with sometimes.)</p> things you can get away with sometimes.)</p>
<p>We <strike>ab</strike>use this fact to implement the logic of tic-tac-toe entirely within <p>We <del>ab</del>use this fact to implement the logic of tic-tac-toe entirely within
this one <code>printf(3)</code> call (and a call to <code>scanf(3)</code> to read user input).</p> this one <code>printf(3)</code> call (and a call to <code>scanf(3)</code> to read user input).</p>
<p>Here’s (briefly) how it works.</p> <p>Here’s (briefly) how it works.</p>
<h4 id="preliminaries">Preliminaries</h4> <h4 id="preliminaries">Preliminaries</h4>
+2 -2
View File
@@ -132,7 +132,7 @@
<!-- END: this line ends content from: inc/before-content.default.html --> <!-- 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 --> <!-- START: this line starts content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<!-- BEFORE: 1st line of markdown file: .gen-authors.sh.34894.entry.md --> <!-- BEFORE: 1st line of markdown file: .gen-authors.sh.41543.entry.md -->
<p style="text-align:center;"> <p style="text-align:center;">
Jump to authors starting with: [ Jump to authors starting with: [
<a href="#A">A</a>   <a href="#A">A</a>  
@@ -2800,7 +2800,7 @@ Location: <a href="location.html#US">US</a> - <em>United States of America</em>
<ul> <ul>
<li><a href="2011/zucker/index.html">2011/zucker</a> - Most shiny</li> <li><a href="2011/zucker/index.html">2011/zucker</a> - Most shiny</li>
</ul> </ul>
<!-- AFTER: last line of markdown file: .gen-authors.sh.34894.entry.md --> <!-- AFTER: last line of markdown file: .gen-authors.sh.41543.entry.md -->
<!-- END: this line ends content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh --> <!-- END: this line ends content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<!-- START: this line starts content from: inc/after-content.default.html --> <!-- START: this line starts content from: inc/after-content.default.html -->
+2 -2
View File
@@ -132,7 +132,7 @@
<!-- END: this line ends content from: inc/before-content.default.html --> <!-- 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 --> <!-- START: this line starts content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<!-- BEFORE: 1st line of markdown file: .gen-location.sh.41510.location.md --> <!-- BEFORE: 1st line of markdown file: .gen-location.sh.48159.location.md -->
<ul> <ul>
<li><div id="AU"> <li><div id="AU">
<strong>AU</strong> - <em>Commonwealth of Australia</em> (<em>Australia</em>) <strong>AU</strong> - <em>Commonwealth of Australia</em> (<em>Australia</em>)
@@ -540,7 +540,7 @@
</p></li> </p></li>
</ul></li> </ul></li>
</ul> </ul>
<!-- AFTER: last line of markdown file: .gen-location.sh.41510.location.md --> <!-- AFTER: last line of markdown file: .gen-location.sh.48159.location.md -->
<!-- END: this line ends content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh --> <!-- END: this line ends content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<!-- START: this line starts content from: inc/after-content.default.html --> <!-- START: this line starts content from: inc/after-content.default.html -->
+21 -25
View File
@@ -658,11 +658,11 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/1986/marshall/compilers.html</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/1986/marshall/compilers.html</loc>
<lastmod>2024-04-19T08:14:04+00:00</lastmod> <lastmod>2024-04-19T08:36:17+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/1986/marshall/compilers.md</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/1986/marshall/compilers.md</loc>
<lastmod>2024-04-12T18:22:04+00:00</lastmod> <lastmod>2024-04-19T08:33:42+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/1986/marshall/.entry.json</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/1986/marshall/.entry.json</loc>
@@ -6790,7 +6790,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2000/jarijyrki/index.html</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2000/jarijyrki/index.html</loc>
<lastmod>2024-04-19T08:15:29+00:00</lastmod> <lastmod>2024-04-19T08:37:40+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2000/jarijyrki/jarijyrki.c</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2000/jarijyrki/jarijyrki.c</loc>
@@ -6810,7 +6810,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2000/jarijyrki/README.md</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2000/jarijyrki/README.md</loc>
<lastmod>2024-04-19T00:43:51+00:00</lastmod> <lastmod>2024-04-19T08:33:00+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2000/Makefile</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2000/Makefile</loc>
@@ -7170,7 +7170,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/anonymous/index.html</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2001/anonymous/index.html</loc>
<lastmod>2024-04-19T08:15:33+00:00</lastmod> <lastmod>2024-04-19T08:37:44+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/anonymous/Makefile</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2001/anonymous/Makefile</loc>
@@ -7182,7 +7182,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/anonymous/README.md</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2001/anonymous/README.md</loc>
<lastmod>2024-04-12T18:22:04+00:00</lastmod> <lastmod>2024-04-19T08:33:50+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/anonymous/try.sh</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2001/anonymous/try.sh</loc>
@@ -7698,7 +7698,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/schweikh/index.html</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2001/schweikh/index.html</loc>
<lastmod>2024-04-19T08:15:39+00:00</lastmod> <lastmod>2024-04-19T08:37:50+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/schweikh/Makefile</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2001/schweikh/Makefile</loc>
@@ -7710,7 +7710,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/schweikh/README.md</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2001/schweikh/README.md</loc>
<lastmod>2024-04-12T18:22:04+00:00</lastmod> <lastmod>2024-04-19T08:29:53+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/schweikh/schweikh.c</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2001/schweikh/schweikh.c</loc>
@@ -8306,7 +8306,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2004/jdalbec/index.html</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2004/jdalbec/index.html</loc>
<lastmod>2024-04-19T08:15:45+00:00</lastmod> <lastmod>2024-04-19T08:37:55+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2004/jdalbec/jdalbec.alt.c</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2004/jdalbec/jdalbec.alt.c</loc>
@@ -8330,7 +8330,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2004/jdalbec/README.md</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2004/jdalbec/README.md</loc>
<lastmod>2024-04-12T18:22:04+00:00</lastmod> <lastmod>2024-04-19T08:34:24+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2004/jdalbec/try.alt.sh</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2004/jdalbec/try.alt.sh</loc>
@@ -11126,7 +11126,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/index.html</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/index.html</loc>
<lastmod>2024-04-19T08:16:09+00:00</lastmod> <lastmod>2024-04-19T08:38:20+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/keysym.h</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/keysym.h</loc>
@@ -11146,7 +11146,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/README.md</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/README.md</loc>
<lastmod>2024-04-17T07:09:29+00:00</lastmod> <lastmod>2024-04-19T08:34:15+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/toledo.alt2.c</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/toledo.alt2.c</loc>
@@ -11510,7 +11510,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/endoh1/index.html</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2012/endoh1/index.html</loc>
<lastmod>2024-04-19T08:16:12+00:00</lastmod> <lastmod>2024-04-19T08:38:23+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/endoh1/leidenfrost.txt</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2012/endoh1/leidenfrost.txt</loc>
@@ -11534,7 +11534,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/endoh1/README.md</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2012/endoh1/README.md</loc>
<lastmod>2024-04-12T18:22:04+00:00</lastmod> <lastmod>2024-04-19T08:33:33+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/endoh1/tanada.txt</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2012/endoh1/tanada.txt</loc>
@@ -17178,7 +17178,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/burton/index.html</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2020/burton/index.html</loc>
<lastmod>2024-04-19T08:16:54+00:00</lastmod> <lastmod>2024-04-19T08:39:04+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/burton/Makefile</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2020/burton/Makefile</loc>
@@ -17198,7 +17198,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/burton/README.md</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2020/burton/README.md</loc>
<lastmod>2024-04-12T18:22:04+00:00</lastmod> <lastmod>2024-04-19T08:33:55+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/burton/try.sh</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2020/burton/try.sh</loc>
@@ -17218,7 +17218,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/carlini/index.html</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2020/carlini/index.html</loc>
<lastmod>2024-04-19T08:16:54+00:00</lastmod> <lastmod>2024-04-19T08:39:05+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/carlini/Makefile</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2020/carlini/Makefile</loc>
@@ -17238,7 +17238,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/carlini/README.md</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2020/carlini/README.md</loc>
<lastmod>2024-04-12T18:22:04+00:00</lastmod> <lastmod>2024-04-19T08:34:09+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/carlini/try.sh</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/2020/carlini/try.sh</loc>
@@ -18942,7 +18942,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/authors.html</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/authors.html</loc>
<lastmod>2024-04-19T08:13:49+00:00</lastmod> <lastmod>2024-04-19T08:36:03+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/author/Sjoerd_Mullender.json</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/author/Sjoerd_Mullender.json</loc>
@@ -19116,10 +19116,6 @@
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/md2html.sh</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/bin/md2html.sh</loc>
<lastmod>2024-04-19T08:03:32+00:00</lastmod> <lastmod>2024-04-19T08:03:32+00:00</lastmod>
</url> </url>
<url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/.md2html.sh.swp</loc>
<lastmod>2024-04-19T08:03:32+00:00</lastmod>
</url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/output-index-author.sh</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/bin/output-index-author.sh</loc>
<lastmod>2024-04-16T19:14:55+00:00</lastmod> <lastmod>2024-04-16T19:14:55+00:00</lastmod>
@@ -19414,7 +19410,7 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/location.html</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/location.html</loc>
<lastmod>2024-04-19T08:13:51+00:00</lastmod> <lastmod>2024-04-19T08:36:05+00:00</lastmod>
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/Makefile</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/Makefile</loc>
@@ -19466,6 +19462,6 @@
</url> </url>
<url> <url>
<loc>https://ioccc-src.github.io/temp-test-ioccc/years.html</loc> <loc>https://ioccc-src.github.io/temp-test-ioccc/years.html</loc>
<lastmod>2024-04-19T08:13:52+00:00</lastmod> <lastmod>2024-04-19T08:36:06+00:00</lastmod>
</url> </url>
</urlset> </urlset>
+2 -2
View File
@@ -132,7 +132,7 @@
<!-- END: this line ends content from: inc/before-content.default.html --> <!-- 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 --> <!-- START: this line starts content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<!-- BEFORE: 1st line of markdown file: .gen-years.sh.43687.years.md --> <!-- BEFORE: 1st line of markdown file: .gen-years.sh.50335.years.md -->
<h1 id="ioccc-winning-entries-by-year">IOCCC Winning Entries by Year</h1> <h1 id="ioccc-winning-entries-by-year">IOCCC Winning Entries by Year</h1>
<h3 id="jump-to">Jump to:</h3> <h3 id="jump-to">Jump to:</h3>
<p><a href="#2020">2020</a> | <a href="#2019">2019</a> | <a href="#2018">2018</a> | <a href="#2015">2015</a> | <a href="#2014">2014</a> | <a href="#2013">2013</a> | <a href="#2012">2012</a> | <a href="#2011">2011</a><br><br> <p><a href="#2020">2020</a> | <a href="#2019">2019</a> | <a href="#2018">2018</a> | <a href="#2015">2015</a> | <a href="#2014">2014</a> | <a href="#2013">2013</a> | <a href="#2012">2012</a> | <a href="#2011">2011</a><br><br>
@@ -712,7 +712,7 @@
<li>Download all <a href="1984/1984.tar.bz2">1984 IOCCC entry source</a><br></li> <li>Download all <a href="1984/1984.tar.bz2">1984 IOCCC entry source</a><br></li>
</ul> </ul>
<p> <strong>Jump to:</strong> <a href="#">top</a></p> <p> <strong>Jump to:</strong> <a href="#">top</a></p>
<!-- AFTER: last line of markdown file: .gen-years.sh.43687.years.md --> <!-- AFTER: last line of markdown file: .gen-years.sh.50335.years.md -->
<!-- END: this line ends content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh --> <!-- END: this line ends content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<!-- START: this line starts content from: inc/after-content.default.html --> <!-- START: this line starts content from: inc/after-content.default.html -->