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

2005/giljade/index.html
+105 -147
View File
@@ -130,8 +130,8 @@
<h2 id="author"><a name="author"></a>Author:</h2>
<ul>
<li>Name: <a href="../../authors.html#Gil_Dogon">Gil Dogon</a><br>
Location: <a href="../../location.html#IL">IL</a> - <em>State of
Israel</em> (<em>Israel</em>) <br><br></li>
Location: <a href="../../location.html#IL">IL</a> - <em>State of Israel</em> (<em>Israel</em>)
<br><br></li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-author.sh -->
@@ -141,13 +141,12 @@ Israel</em> (<em>Israel</em>) <br><br></li>
<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>NOTE: We FORCE the use of -O0 even if someone overrides it because
this entry will not work with it enabled.</p>
<p>NOTE: We FORCE the use of -O0 even if someone overrides it because this entry
will not work with it enabled.</p>
<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#2005_giljade">2005 giljade bugs</a>.</p>
<p>For more detailed information see <a href="../../bugs.html#2005_giljade">2005 giljade 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">./giljade</span></span></code></pre></div>
<h2 id="try">Try:</h2>
@@ -155,180 +154,139 @@ href="../../bugs.html#2005_giljade">2005 giljade bugs</a>.</p>
<h3 id="self-test-feature-to-try">Self-test feature to 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="ex">./giljade</span> <span class="op">&gt;</span> out</span>
<span id="cb5-2"><a href="#cb5-2" aria-hidden="true" tabindex="-1"></a><span class="ex">./giljade</span> out</span></code></pre></div>
<p>NOTE: <a href="try.sh">try.sh</a> will ask you if you wish to do
this.</p>
<p>NOTE: <a href="try.sh">try.sh</a> will ask you if you wish to do this.</p>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>This entry takes editorial in how it deals with its output. After
using <code>vi(1)</code> (or <code>vim(1)</code>) to look at the source,
use <code>vi(1)</code> (or <code>vim(1)</code>) to look at its output.
We especially recommend it on a 78 column xterm while leaning on
<p>This entry takes editorial in how it deals with its output. After using <code>vi(1)</code>
(or <code>vim(1)</code>) to look at the source, use <code>vi(1)</code> (or <code>vim(1)</code>) to look at its
output. We especially recommend it on a 78 column xterm while leaning on
Control-F.</p>
<p>If you really understand expressions, then understand this:</p>
<div class="sourceCode" id="cb6"><pre class="sourceCode c"><code class="sourceCode c"><span id="cb6-1"><a href="#cb6-1" aria-hidden="true" tabindex="-1"></a>s<span class="op">=</span>s<span class="op">^(</span>b<span class="op">=</span>s<span class="op">&amp;</span>s<span class="op">-</span><span class="dv">1</span><span class="op">^</span>s<span class="op">)</span></span></code></pre></div>
<p>… and understand why it is found in the source code.</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<h3 id="so-what-do-we-have-here">So what do we have here ?</h3>
<p>Just run the executable with no command line args and look at the
output. In order to properly enjoy it you will need two good old
programs: <code>xterm(1)</code> and <code>vi(1)</code> (or
<code>vim(1)</code>). Do the following: open an <code>xterm(1)</code>
with precisely 78 lines, and use the tiny font size for best results.
Then <code>vi(1)</code> (<code>vim(1)</code> will also do) the output.
Type <code>^F</code> repeatedly or hold it down and enjoy the show …</p>
<p>The program solves (very very fast) a sliding block puzzle. There are
many variants of such puzzles which are usually made from wood or
plastic pieces. The start position can be recognized by looking at the
program itself. The goal is to move the big piece (2 by 2) to the center
top, which takes 179 steps in the shortest move sequence.</p>
<p>Notice that the step count used by the program is longer than the
traditional step count for such puzzles, as normally if the same piece
is moved twice in a row it is counted as only one step, but here it is
counted as two.</p>
<p>The printout of the solution however is in a rather unorthodox form,
as can be easily discerned. As you have probably suspected each of the
steps in the solution printout is a C program which compiles to result
in - surprise surprise! - the original (well almost).</p>
<p>Actually, This program is smarter than merely printing ITSELF in 180
different layouts. It is self-improving, in that the programs it prints
have three advantages over the original:</p>
<p>Just run the executable with no command line args and look at the output. In
order to properly enjoy it you will need two good old programs: <code>xterm(1)</code> and
<code>vi(1)</code> (or <code>vim(1)</code>).
Do the following: open an <code>xterm(1)</code> with precisely 78 lines, and use the tiny font
size for best results. Then <code>vi(1)</code> (<code>vim(1)</code> will also do) the output. Type <code>^F</code>
repeatedly or hold it down and enjoy the show …</p>
<p>The program solves (very very fast) a sliding block puzzle. There are many
variants of such puzzles which are usually made from wood or plastic pieces.
The start position can be recognized by looking at the program itself. The
goal is to move the big piece (2 by 2) to the center top, which takes 179
steps in the shortest move sequence.</p>
<p>Notice that the step count used by the program is longer than the traditional
step count for such puzzles, as normally if the same piece is moved twice in a
row it is counted as only one step, but here it is counted as two.</p>
<p>The printout of the solution however is in a rather unorthodox form, as can be
easily discerned. As you have probably suspected each of the steps in the
solution printout is a C program which compiles to result in - surprise
surprise! - the original (well almost).</p>
<p>Actually, This program is smarter than merely printing ITSELF in 180 different
layouts. It is self-improving, in that the programs it prints have three
advantages over the original:</p>
<ol type="1">
<li><p>Their layout is more precise (Notice the annoying <code>\</code>
at the 10’th line of the original program which is actually a ‘layout
bug’).</p></li>
<li><p>Their binary output does not rely on the source file being in the
same directory, and will not dump core if it doesn’t (like the original
does). :)</p></li>
<li><p>They have much more comments (Not very helpful ones
though).</p></li>
<li><p>Their layout is more precise (Notice the annoying <code>\</code> at the 10’th line of
the original program which is actually a ‘layout bug’).</p></li>
<li><p>Their binary output does not rely on the source file being in the same
directory, and will not dump core if it doesn’t (like the original does). :)</p></li>
<li><p>They have much more comments (Not very helpful ones though).</p></li>
</ol>
<p>In addition as we all know bugs can creep up on us in the most
unexpected of places, and checking that indeed the output is composed of
180 legal C programs by hand can be quite tedious, hence the program
also include a self- test mode. Just run it with the output file as
command line argument. It will then try to compile each of the programs
(printing the line number where the program starts). It will stop where
any compilation fails and the culprit program would be in the file
<code>c.c</code>. The exit code of the self-test will be non-zero in
that case. In case this entry wins, I do hope nobody by the name of ‘c’
also wins this year otherwise that part of the program would have to be
<p>In addition as we all know bugs can creep up on us in the most unexpected of
places, and checking that indeed the output is composed of 180 legal C
programs by hand can be quite tedious, hence the program also include a self-
test mode. Just run it with the output file as command line argument. It will
then try to compile each of the programs (printing the line number where the
program starts). It will stop where any compilation fails and the culprit
program would be in the file <code>c.c</code>. The exit code of the self-test will be
non-zero in that case. In case this entry wins, I do hope nobody by the name
of ‘c’ also wins this year otherwise that part of the program would have to be
changed!</p>
<p>Notice that the self-test does not try to run the result of the
compilations but this can easily be done. Try it and diff the output of
any of the 180 results with the original output. Of course all 180
programs also include the self-test mode.</p>
<h3 id="why-i-think-this-program-is-obfuscated">Why I think this program
is obfuscated</h3>
<p>Notice that the self-test does not try to run the result of the compilations
but this can easily be done. Try it and diff the output of any of the 180
results with the original output. Of course all 180 programs also include the
self-test mode.</p>
<h3 id="why-i-think-this-program-is-obfuscated">Why I think this program is obfuscated</h3>
<ul>
<li><p>Because it says so, and twice is better than once!</p></li>
<li><p>All the usual suspects i.e. <code>?:</code>,
<code>&amp;&amp;</code>, <code>||</code>, <code>,</code> used to
compress code length in the noble tradition of this contest, meaningless
one character variable names, etc…</p></li>
<li><p>The board representation is efficiently compressed hence
obfuscated, and the algorithm that is used to generate possible moves is
extremely efficient.</p>
<p>In fact it can compute several moves in parallel on one processor!
Moreover only the most efficient bitwise logical operations, shift,and
subtraction by one is used. No inefficient conditional tests and jumps
are needed in that part of the program.</p></li>
<li><p>The single expression I’m most proud of, and would have submitted
to the category of ‘best obfuscated short expression’ if there was one
is:</p>
<li><p>All the usual suspects i.e. <code>?:</code>, <code>&amp;&amp;</code>, <code>||</code>, <code>,</code> used to compress code
length in the noble tradition of this contest, meaningless one character
variable names, etc…</p></li>
<li><p>The board representation is efficiently compressed hence obfuscated, and
the algorithm that is used to generate possible moves is extremely efficient.</p>
<p>In fact it can compute several moves in parallel on one processor! Moreover
only the most efficient bitwise logical operations, shift,and subtraction by
one is used. No inefficient conditional tests and jumps are needed in that
part of the program.</p></li>
<li><p>The single expression I’m most proud of, and would have submitted to the
category of ‘best obfuscated short expression’ if there was one is:</p>
<pre><code> s=s^(b=s&amp;s-1^s)</code></pre>
<p>Can you figure out what it does (very efficiently) and how it fits in
the scheme of things?</p></li>
<li><p>IMHO the program is easier to understand before running cpp on
it. It is also shorter that way to be sure.</p></li>
<li><p>It even takes care to obfuscate the comments in the output
programs.</p></li>
<li><p>Having the output programs a bit different than the original is
more interesting.</p></li>
<li><p>I have written an earlier version of the program about half a
year ago and when returning to it now I had to sweat quite a lot to
understand the f***ing mess I’ve made.</p></li>
<p>Can you figure out what it does (very efficiently) and how it fits in the
scheme of things?</p></li>
<li><p>IMHO the program is easier to understand before running cpp on it. It is also
shorter that way to be sure.</p></li>
<li><p>It even takes care to obfuscate the comments in the output programs.</p></li>
<li><p>Having the output programs a bit different than the original is more
interesting.</p></li>
<li><p>I have written an earlier version of the program about half a year ago and
when returning to it now I had to sweat quite a lot to understand the f***ing
mess I’ve made.</p></li>
</ul>
<h3 id="known-bugsproblemswarningsportability-issues">Known
Bugs/problems/warnings/portability issues</h3>
<p>Some <code>cpp</code>s issue a warning about empty macro
parameters.</p>
<p><code>-pedantic</code> informs me that ‘ISO C’ does not allow extra ;
outside of a function, and to this I say to ISO what ???</p>
<p><code>-Wall</code> of course will suggest adding a lot of
parenthesis, function prototypes, and remove some unnecessary
expressions, and to this I say: if I listen to you where is my freedom
to obfuscate in style?</p>
<p>As mentioned earlier if you try to run the original program without
its source in the working directory it will dump core.</p>
<p>The program relies heavily on the ASCII coding system (have I seen
this comment before ?). It also implicitly assumes that
<code>sizeof(int) = sizeof(FILE *)</code>. On systems when that is not
the case expect a core dump…</p>
<h3 id="known-bugsproblemswarningsportability-issues">Known Bugs/problems/warnings/portability issues</h3>
<p>Some <code>cpp</code>s issue a warning about empty macro parameters.</p>
<p><code>-pedantic</code> informs me that ‘ISO C’ does not allow extra ; outside of a
function, and to this I say to ISO what ???</p>
<p><code>-Wall</code> of course will suggest adding a lot of parenthesis, function prototypes,
and remove some unnecessary expressions, and to this I say: if I listen to you
where is my freedom to obfuscate in style?</p>
<p>As mentioned earlier if you try to run the original program without its source
in the working directory it will dump core.</p>
<p>The program relies heavily on the ASCII coding system (have I seen this
comment before ?). It also implicitly assumes that <code>sizeof(int) = sizeof(FILE *)</code>. On systems when that is not the case expect a core dump…</p>
<h3 id="challenges">Challenges</h3>
<p>What use are the <code>;;</code> for ?</p>
<p>Why do I use <code>126&amp;</code> in the program? (except for the
rather obvious fact that it serves as comment obfuscater).</p>
<p>Why not write <code>s^=</code> instead of <code>s=s^</code> In the
expression I’m most proud of ?</p>
<p>Why do I use <code>126&amp;</code> in the program? (except for the rather obvious fact that it
serves as comment obfuscater).</p>
<p>Why not write <code>s^=</code> instead of <code>s=s^</code> In the expression I’m most proud of ?</p>
<p>What is <code>40-(h&amp;62)</code> doing ?</p>
<p>Use the program to solve for a different starting position. It is not
that difficult. Notice however that if there are more than two empty
spaces the outputs would not compile as the layout would not be
sufficient to contain the program.</p>
<p>Use the program to solve for board size different than
<code>4*5</code>. That’s a bit more tricky.</p>
<p>Use the program to solve for a different starting position. It is not that
difficult. Notice however that if there are more than two empty spaces the
outputs would not compile as the layout would not be sufficient to contain the
program.</p>
<p>Use the program to solve for board size different than <code>4*5</code>. That’s a bit more
tricky.</p>
<h3 id="hint-for-the-challenges">Hint for the challenges</h3>
<p>Just try to change the program, and use the self test to see what
happens …</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>Just try to change the program, and use the self test to see what happens …</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-2005giljade"><a name="inventory"></a>Inventory for
2005/giljade</h1>
<h1 id="inventory-for-2005giljade"><a name="inventory"></a>Inventory for 2005/giljade</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/2005/giljade/giljade.c">giljade.c</a>
- entry source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljade/Makefile">Makefile</a>
- entry Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljade/giljade.orig.c">giljade.orig.c</a>
- original source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljade/test.sh">test.sh</a>
- test tool</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljade/try.sh">try.sh</a>
- how to run</li>
<li><a href="2005_giljade.tar.bz2">2005_giljade.tar.bz2</a> - download
entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljade/giljade.c">giljade.c</a> - entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljade/Makefile">Makefile</a> - entry Makefile</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljade/giljade.orig.c">giljade.orig.c</a> - original source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljade/test.sh">test.sh</a> - test tool</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljade/try.sh">try.sh</a> - how to run</li>
<li><a href="2005_giljade.tar.bz2">2005_giljade.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/2005/giljade/.entry.json">.entry.json</a>
- description of entry in JSON</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljade/.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/2005/giljade/.entry.json">.entry.json</a> - description of entry in JSON</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljade/.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/2005/giljade/README.md">README.md</a>
- markdown source for index.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2005/giljade/README.md">README.md</a> - markdown source for index.html</li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->