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

+100 -134
View File
@@ -129,9 +129,9 @@
<h2 id="author"><a name="author"></a>Author:</h2>
<ul>
<li>Name: <a href="../../authors.html#Brian_Westley">Brian
Westley</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#Brian_Westley">Brian Westley</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 -->
@@ -141,18 +141,16 @@ Westley</a><br> Location: <a href="../../location.html#US">US</a> -
<h2 id="to-build">To build:</h2>
<div class="sourceCode" id="cb1"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb1-1"><a href="#cb1-1" aria-hidden="true" tabindex="-1"></a><span class="fu">make</span></span></code></pre></div>
<p>There are two additional programs based on the author’s remarks and
the original version, provided as alternate code as it might be less
portable. See <a href="#sorted-code">sorted code</a>, <a
href="#punch-card-code">punch card code</a> and <a
href="#alternate-code">alternate code</a> below.</p>
<p>There are two additional programs based on the author’s remarks and the original
version, provided as alternate code as it might be less portable. See <a href="#sorted-code">sorted
code</a>, <a href="#punch-card-code">punch card code</a> and <a href="#alternate-code">alternate
code</a> below.</p>
<h3 id="bugs-and-misfeatures">Bugs and (Mis)features:</h3>
<p>The current status of this entry is:</p>
<pre><code>STATUS: uses gets() - change to fgets() if possible
STATUS: missing files - please provide them
STATUS: main() has only one arg - try and make it have 2 or 3</code></pre>
<p>For more detailed information see <a
href="../../bugs.html#2001_westley">2001 westley bugs</a>.</p>
<p>For more detailed information see <a href="../../bugs.html#2001_westley">2001 westley 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">./westley</span> <span class="dv">2</span><span class="op">&gt;</span>/dev/null</span>
<span id="cb3-2"><a href="#cb3-2" aria-hidden="true" tabindex="-1"></a><span class="co"># enter some input, terminate with EOF</span></span>
@@ -163,71 +161,62 @@ href="../../bugs.html#2001_westley">2001 westley bugs</a>.</p>
<h2 id="try">Try:</h2>
<div class="sourceCode" id="cb4"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb4-1"><a href="#cb4-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./try.sh</span></span></code></pre></div>
<h2 id="sorted-code">Sorted code:</h2>
<p>The author stated that one can sort (ignoring leading blanks
i.e. <code>sort -b</code>) the code by line and it will always sort the
order of the input.</p>
<p>This is compiled by default; use <code>westley.sort</code> as you
would <code>westley</code> above.</p>
<p>The author stated that one can sort (ignoring leading blanks i.e. <code>sort -b</code>) the
code by line and it will always sort the order of the input.</p>
<p>This is compiled by default; use <code>westley.sort</code> as you would <code>westley</code> above.</p>
<h2 id="punch-card-code">Punch card code:</h2>
<p>The author also stated that if you just sort the code you’ll get the
with <code>sort</code>) version that just prints out the punch card. The
<a href="westley.punch.c">westley.punch.c</a> code is specifically so
that Westley can punch everyone in the face! :-) This is also compiled
by default.</p>
<p>The author also stated that if you just sort the code you’ll get the with
<code>sort</code>) version that just prints out the punch card. The
<a href="westley.punch.c">westley.punch.c</a> code is specifically so that Westley can punch
everyone in the face! :-) This is also compiled by default.</p>
<h3 id="punch-card-try">Punch card try:</h3>
<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="bu">echo</span> <span class="st">&#39;Brian Westley does it again!&#39;</span> <span class="kw">|</span> <span class="ex">./westley.punch</span> <span class="dv">2</span><span class="op">&gt;</span>/dev/null</span></code></pre></div>
<h2 id="alternate-code">Alternate code:</h2>
<p>An alternate version of this entry, <a
href="westley.alt.c">westley.alt.c</a>, is provided. This alternate code
might be less portable.</p>
<p>An alternate version of this entry, <a href="westley.alt.c">westley.alt.c</a>, is provided.
This alternate code might be less portable.</p>
<h3 id="alternate-build">Alternate build:</h3>
<div class="sourceCode" id="cb6"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb6-1"><a href="#cb6-1" aria-hidden="true" tabindex="-1"></a><span class="fu">make</span> alt</span></code></pre></div>
<h3 id="alternate-use">Alternate use:</h3>
<p>Use <code>westley.alt</code> as you would <code>westley</code>
above.</p>
<p>Use <code>westley.alt</code> as you would <code>westley</code> above.</p>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>Try copying the source to a new file and changing around the order of
the lines. Does it produce the exact same output?</p>
<p>Try copying the source to a new file and changing around the
order of the lines. Does it produce the exact same output?</p>
<p>By changing the order of the source, figure out in how many different
ways this program can transform input to output.</p>
<p>This assortment of obfuscated lines takes <a
href="https://en.wikipedia.org/wiki/Position-independent_code">position-independent
<p>This assortment of obfuscated lines takes <a href="https://en.wikipedia.org/wiki/Position-independent_code">position-independent
code</a> to a new level! :-)</p>
<p>We find it amazing that with just 28 lines of code (not counting
comments and blank lines) there are <code>28!</code> or
<code>304,888,344,611,713,860,501,504,000,000</code> versions of the
program, all valid C!</p>
<p>We find it amazing that with just 28 lines of code (not counting comments and
blank lines) there are <code>28!</code> or <code>304,888,344,611,713,860,501,504,000,000</code>
versions of the program, all valid C!</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<p><a href="https://en.wikipedia.org/wiki/Punched_card">Punch cards</a>,
or Hollerith cards, were becoming obsolete just as C was becoming more
popular*; this is rather unfortunate, because C has an advantage over
many other languages when it comes to punch cards - C programs can be
written to be “drop proof”.</p>
<p><a href="https://en.wikipedia.org/wiki/Punched_card">Punch cards</a>, or Hollerith cards,
were becoming obsolete just as C was becoming more popular*; this is rather
unfortunate, because C has an advantage over many other languages when it comes
to punch cards - C programs can be written to be “drop proof”.</p>
<p>Consider the following C program:</p>
<div class="sourceCode" id="cb7"><pre class="sourceCode c"><code class="sourceCode c"><span id="cb7-1"><a href="#cb7-1" aria-hidden="true" tabindex="-1"></a>main<span class="op">(){</span>a<span class="op">();</span>b<span class="op">();</span>c<span class="op">();}</span></span>
<span id="cb7-2"><a href="#cb7-2" aria-hidden="true" tabindex="-1"></a>a<span class="op">(){</span>printf<span class="op">(</span><span class="st">&quot;A&quot;</span><span class="op">);}</span></span>
<span id="cb7-3"><a href="#cb7-3" aria-hidden="true" tabindex="-1"></a>b<span class="op">(){</span>printf<span class="op">(</span><span class="st">&quot;B&quot;</span><span class="op">);}</span></span>
<span id="cb7-4"><a href="#cb7-4" aria-hidden="true" tabindex="-1"></a>c<span class="op">(){</span>printf<span class="op">(</span><span class="st">&quot;C&quot;</span><span class="op">);}</span></span></code></pre></div>
<p>This program will compile and run no matter what order the lines are
in. If you punch it on cards (one line of code per card, naturally) and
drop them, you don’t need to put them in any particular order**; it will
always produce <code>ABC</code> as output.</p>
<p>This program will compile and run no matter what order the
lines are in. If you punch it on cards (one line of code per
card, naturally) and drop them, you don’t need to put them in
any particular order**; it will always produce <code>ABC</code> as output.</p>
<p>You can also use global variables:</p>
<div class="sourceCode" id="cb8"><pre class="sourceCode c"><code class="sourceCode c"><span id="cb8-1"><a href="#cb8-1" aria-hidden="true" tabindex="-1"></a><span class="dt">char</span> <span class="op">*</span>greet <span class="op">=</span> <span class="st">&quot;Hello, world!&quot;</span><span class="op">;</span></span>
<span id="cb8-2"><a href="#cb8-2" aria-hidden="true" tabindex="-1"></a><span class="dt">char</span> <span class="op">*</span>greet<span class="op">;</span> main<span class="op">(){</span>puts<span class="op">(</span>greet<span class="op">);}</span></span></code></pre></div>
<p>It would be trivial to write an entire C program that is “drop proof”
using the above techniques; surprisingly, it’s possible to write a
program that will always compile but behave differently depending on the
line order:</p>
<p>It would be trivial to write an entire C program that is
“drop proof” using the above techniques; surprisingly, it’s
possible to write a program that will always compile but
behave differently depending on the line order:</p>
<div class="sourceCode" id="cb9"><pre class="sourceCode c"><code class="sourceCode c"><span id="cb9-1"><a href="#cb9-1" aria-hidden="true" tabindex="-1"></a>test<span class="op">(</span>a<span class="op">,</span>b<span class="op">){</span><span class="cf">return</span> a<span class="op">;}</span></span>
<span id="cb9-2"><a href="#cb9-2" aria-hidden="true" tabindex="-1"></a><span class="pp">#define test</span><span class="op">(</span><span class="pp">a</span><span class="op">,</span><span class="pp">b</span><span class="op">)</span><span class="pp"> test</span><span class="op">(</span><span class="pp">b</span><span class="op">,</span><span class="pp">a</span><span class="op">)</span></span>
<span id="cb9-3"><a href="#cb9-3" aria-hidden="true" tabindex="-1"></a>main<span class="op">(){</span><span class="cf">if</span> <span class="op">(</span>test<span class="op">(</span><span class="dv">0</span><span class="op">,</span><span class="dv">1</span><span class="op">))</span> printf<span class="op">(</span><span class="st">&quot;T&quot;</span><span class="op">);</span> <span class="cf">else</span> printf<span class="op">(</span><span class="st">&quot;F&quot;</span><span class="op">);}</span></span></code></pre></div>
<p>This program will print out <code>T</code> if the
<code>#define</code> statement falls between the declaration of
<code>test()</code> and its use in <code>main()</code>, otherwise it
will print out <code>F</code>. Furthermore, you can use the same call to
<code>test()</code> repeatedly in different lines to return different
values:</p>
<p>This program will print out <code>T</code> if the <code>#define</code> statement
falls between the declaration of <code>test()</code> and its use in
<code>main()</code>, otherwise it will print out <code>F</code>. Furthermore,
you can use the same call to <code>test()</code> repeatedly in
different lines to return different values:</p>
<div class="sourceCode" id="cb10"><pre class="sourceCode c"><code class="sourceCode c"><span id="cb10-1"><a href="#cb10-1" aria-hidden="true" tabindex="-1"></a><span class="pp">#define test</span><span class="op">(</span><span class="pp">x</span><span class="op">,</span><span class="pp">y</span><span class="op">)</span><span class="pp"> test</span><span class="op">(</span><span class="pp">y</span><span class="op">,</span><span class="pp">x</span><span class="op">)</span></span>
<span id="cb10-2"><a href="#cb10-2" aria-hidden="true" tabindex="-1"></a>main<span class="op">(){</span><span class="dt">int</span> i<span class="op">=</span><span class="dv">0</span><span class="op">;</span>a<span class="op">(&amp;</span>i<span class="op">);</span>b<span class="op">(&amp;</span>i<span class="op">);</span>c<span class="op">(&amp;</span>i<span class="op">);</span>d<span class="op">(&amp;</span>i<span class="op">);</span>printf<span class="op">(</span><span class="st">&quot;</span><span class="sc">%d\n</span><span class="st">&quot;</span><span class="op">,</span>i<span class="op">);}</span></span>
<span id="cb10-3"><a href="#cb10-3" aria-hidden="true" tabindex="-1"></a>a<span class="op">(</span>i<span class="op">)</span><span class="dt">int</span><span class="op">*</span>i<span class="op">;{</span><span class="cf">if</span> <span class="op">(</span>test<span class="op">(</span><span class="dv">0</span><span class="op">,</span><span class="dv">1</span><span class="op">))</span> <span class="op">*</span>i <span class="op">+=</span> <span class="dv">1</span><span class="op">;}</span></span>
@@ -235,14 +224,15 @@ values:</p>
<span id="cb10-5"><a href="#cb10-5" aria-hidden="true" tabindex="-1"></a>c<span class="op">(</span>i<span class="op">)</span><span class="dt">int</span><span class="op">*</span>i<span class="op">;{</span><span class="cf">if</span> <span class="op">(</span>test<span class="op">(</span><span class="dv">0</span><span class="op">,</span><span class="dv">1</span><span class="op">))</span> <span class="op">*</span>i <span class="op">+=</span> <span class="dv">4</span><span class="op">;}</span></span>
<span id="cb10-6"><a href="#cb10-6" aria-hidden="true" tabindex="-1"></a>d<span class="op">(</span>i<span class="op">)</span><span class="dt">int</span><span class="op">*</span>i<span class="op">;{</span><span class="cf">if</span> <span class="op">(</span>test<span class="op">(</span><span class="dv">0</span><span class="op">,</span><span class="dv">1</span><span class="op">))</span> <span class="op">*</span>i <span class="op">+=</span> <span class="dv">8</span><span class="op">;}</span></span>
<span id="cb10-7"><a href="#cb10-7" aria-hidden="true" tabindex="-1"></a>test<span class="op">(</span>x<span class="op">,</span>y<span class="op">){</span><span class="cf">return</span> x<span class="op">;}</span></span></code></pre></div>
<p>If you enter the above program on punch cards, throw them up in the
air, gather them up, and run it, you will get a number from 0 to 15
printed out. Now <em>that’s</em> a random number generator…</p>
<p>Of course, there are drawbacks to C programming on punch cards; an
80-character line limit can be restricting, and (to be maximally
portable) you need to use trigraphs for the characters
<code>^[]{}\</code> (these aren’t found on every keypunch, and have
various encodings).</p>
<p>If you enter the above program on punch cards, throw them
up in the air, gather them up, and run it, you will get
a number from 0 to 15 printed out. Now <em>that’s</em> a random
number generator…</p>
<p>Of course, there are drawbacks to C programming on punch
cards; an 80-character line limit can be restricting, and
(to be maximally portable) you need to use trigraphs for
the characters <code>^[]{}\</code> (these aren’t found on every
keypunch, and have various encodings).</p>
<p>My C program entry does the following:</p>
<ol type="1">
<li><p>Reads in lines.</p></li>
@@ -251,103 +241,79 @@ various encodings).</p>
<li>if it rearranges the lines, they are sorted or scrambled.</li>
</ul></li>
<li><p>Reverses the order of the lines, or not.</p></li>
<li><p>Prints out the lines as either text or <a
href="https://en.wikipedia.org/wiki/EBCDIC">EBCDIC</a> punch
cards.</p></li>
<li><p>Prints out the lines as either text or
<a href="https://en.wikipedia.org/wiki/EBCDIC">EBCDIC</a> punch cards.</p></li>
</ol>
<p>The code, as written, scrambles the input and prints it out as normal
text, so you can simulate ‘dropping’ the cards. You can repeatedly
scramble the code to get all 12 variants (but the scrambling isn’t very
random; it’s just a bubble sort with a random number, so some variants
are more common than others). You can also just swap the arguments in
the calls to <code>t()</code> in all combinations to get all the
variations.</p>
<p>If you sort the lines, you will get the version that just prints out
the input as punch cards (you will need to display at least 82 columns
of text, or clip the last few chars by piping it through
<code>sed s/...$//</code>). If you use this on the original code, you
will see that it spells out <code>HOLLERITH</code> when punched on cards
(you can see the tall, thin letters spelling out <code>HOLLERITH</code>
if you turn the C code sideways). You will also see why
<code>/KC 0000 K</code> is a <code>Hollerith emoticon</code>.
Unrecognized characters are punched as a lace column. (You can see an
ASCII simulation of the code as punch cards by looking at
<code>card.gif</code>.)</p>
<p>The code, as written, scrambles the input and prints it out
as normal text, so you can simulate ‘dropping’ the cards.
You can repeatedly scramble the code to get all 12 variants
(but the scrambling isn’t very random; it’s just a bubble
sort with a random number, so some variants are more common
than others). You can also just swap the arguments in the
calls to <code>t()</code> in all combinations to get all the variations.</p>
<p>If you sort the lines, you will get the version that just
prints out the input as punch cards (you will need to display
at least 82 columns of text, or clip the last few chars by
piping it through <code>sed s/...$//</code>). If you use this on the
original code, you will see that it spells out <code>HOLLERITH</code>
when punched on cards (you can see the tall, thin letters
spelling out <code>HOLLERITH</code> if you turn the C code sideways).
You will also see why <code>/KC 0000 K</code> is a <code>Hollerith emoticon</code>.
Unrecognized characters are punched as a lace column.
(You can see an ASCII simulation of the code as punch cards
by looking at <code>card.gif</code>.)</p>
<p>For a nice test pattern, try</p>
<pre><code>&amp;-0123456789ABCDEFGHIJKLMNOPQR/STUVWXYZ:#@&#39;=&quot;.&lt;(+|!$*);,%_&gt;?abcmnoxyz^[]{}\</code></pre>
<p>If you want to analyze the program, sorting the lines while ignoring
leading blanks works best (<code>sort -b</code>). This will produce the
version that just reverses the line order, and the routines in the code
are in a sensible order.</p>
<p>This program should work on EBCDIC computers. It assumes that the
<code>time_t</code> ptr param to <code>time(3)</code> will work with an
<code>int</code> ptr, and that “passing through” a <code>char[][]</code>
array as a simple <code>char *</code> is OK. Your compiler MUST
understand trigraphs, or it will miss the trigraph backslash before the
double quote in the <code>K</code> string and complain about a malformed
string; for GNU C, use <code>-ansi</code> or <code>-trigraphs</code>.
Entering a line of more than 80 characters, or more than 81 lines, will
jam the card reader.</p>
<p>I’ve used the <code>a[b]</code> ==&gt; <code>*(a+b)</code> trick,
because this is actually shorter than the trigraph version of
<code>a??(b??)</code>.</p>
<p>With 28 lines of code (not counting the blank lines or the comment),
there are technically <code>28!</code> different programs, or
<p>If you want to analyze the program, sorting the lines while
ignoring leading blanks works best (<code>sort -b</code>). This will
produce the version that just reverses the line order, and
the routines in the code are in a sensible order.</p>
<p>This program should work on EBCDIC computers. It assumes
that the <code>time_t</code> ptr param to <code>time(3)</code> will work with an <code>int</code>
ptr, and that “passing through” a <code>char[][]</code> array as a simple
<code>char *</code> is OK. Your compiler MUST understand trigraphs, or it
will miss the trigraph backslash before the double quote in
the <code>K</code> string and complain about a malformed string; for GNU
C, use <code>-ansi</code> or <code>-trigraphs</code>. Entering a line of more than 80
characters, or more than 81 lines, will jam the card reader.</p>
<p>I’ve used the <code>a[b]</code> ==&gt; <code>*(a+b)</code> trick, because this is
actually shorter than the trigraph version of <code>a??(b??)</code>.</p>
<p>With 28 lines of code (not counting the blank lines or the
comment), there are technically <code>28!</code> different programs, or
<code>304,888,344,611,713,860,501,504,000,000</code> different versions,
all legal C.</p>
<pre><code>* except in Florida voting machines
** all cards must be face down, nine-edge first, of course.</code></pre>
<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-2001westley"><a name="inventory"></a>Inventory for
2001/westley</h1>
<h1 id="inventory-for-2001westley"><a name="inventory"></a>Inventory for 2001/westley</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/westley/westley.c">westley.c</a>
- entry source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/westley/Makefile">Makefile</a>
- entry Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/westley/westley.alt.c">westley.alt.c</a>
- alternative source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/westley/westley.orig.c">westley.orig.c</a>
- original source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/westley/try.sh">try.sh</a>
- how to run</li>
<li><a href="2001_westley.tar.bz2">2001_westley.tar.bz2</a> - download
entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/westley/westley.c">westley.c</a> - entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/westley/Makefile">Makefile</a> - entry Makefile</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/westley/westley.alt.c">westley.alt.c</a> - alternative source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/westley/westley.orig.c">westley.orig.c</a> - original source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2001/westley/try.sh">try.sh</a> - how to run</li>
<li><a href="2001_westley.tar.bz2">2001_westley.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/westley/.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/westley/.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/westley/.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/westley/.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/westley/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/westley/README.md">README.md</a> - markdown source for index.html</li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->