mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fix and improve links within the web site

Browse Source 
Entry source is now prog.c for IOCCC years 2014 thru 2020,
or is now dirname.c IOCCC years 1984 thru 2013.

To achieve this state, we renamed the following:

renamed:    2004/hibachi/src/hibachi.c -> 2004/hibachi/hibachi.c
renamed:    2012/omoikane/nyaruko.alt.c -> 2012/omoikane/omoikane.alt.c
renamed:    2012/omoikane/nyaruko.alt2.c -> 2012/omoikane/omoikane.alt2.c
renamed:    2012/omoikane/nyaruko.c -> 2012/omoikane/omoikane.c
renamed:    2012/omoikane/nyaruko.orig.c -> 2012/omoikane/omoikane.orig.c

Modified `bin/subst.entry-index.sh` to add to entry `index.html` file,
links to the `Makefile` and the _C code_ to the top navigation bar.
Changed `bin/subst.entry-index.sh` VERSION from "1.2.2 2024-02-25"
to "1.3 2024-03-02".

Moved printing the Inventory link in the top navigation bar
from `bin/subst.entry-navbar.awk` to `bin/subst.entry-index.sh`.
Changed `bin/subst.entry-navbar.awk` VERSION from "1.0.1 2024-02-23"
to "1.1 2024-03-02".

Moved printing the Inventory link in the top navigation bar
from `bin/subst.year-navbar.awk` to `bin/subst.year-index.sh`.
Changed `bin/subst.year-index.sh` VERSION from "1.0 2024-02-11"
to "1.1 2024-03-02".
Changed `bin/subst.year-navbar.awk` VERSION from "1.0 2024-02-11"
to "1.1 2024-03-02".

Added location names (both default and common) to `author.html`.
Changed `tmp/gen_author_json.sh` VERSION from "1.0 2023-06-06"
to "1.1 2024-03-04".

Added location names (both default and common) to `author.html`.
Changed `bin/gen-authors.sh` VERSION from "1.2 2024-03-09"
to "1.3 2024-03-04".

The manifest and the resulting `.entry.json` files have been changed
for `2004/hibachi` and `2012/omoikane`.

The Makefiles for  `2004/hibachi` and `2012/omoikane` copy the
source file into the "previously used location".  The `make clobber`
rule removes the copied source.  The `.gitignore` files have been
updated accordingly.

Improved how the concept of IOCCC terms _entry_, _author_ and _submission_ are
used in markdown files.

Links to markdown files (files ending in .md) within the repo were
changed to link to HTML files (files ending in .html).  Special cases
where `README.md` became `index.html` were modified accordingly.

Fixed URL for `bugs.html` in Makefile comments.

Fixed name of `bin/sgi.sh` referenced in comments in `.gitignore` files.

Links to locations within the repo are now relative.  For example a
link to `/contact.html` may become `../contact.html' or '../../contact.html`
depending on the directory level of the markdown file.

Nearly all links with absolute URLs under _https://www.ioccc.org_
or `https://ioccc-src.github.io/temp-test-ioccc_ have been changed to
relative paths within the repo.  Some exceptions to this (such as
referring to a GitHub repo) were preserved.

Fixed a number of inside `faq.md` and `bugs.md`.

Added HTML name tags (in the form of an _entry_id_) for each entry
referenced in `bugs.md`.  Fixed links from outside of `bugs.html`
into `bugs.html` accordingly.

Where FAQ entries are referenced, a named tag is used so that if a
FAQ is ever renumbered, links outside of `faq.html` will still work.

Changed the _inventory_order_ of a compressed tarball from _300_
to _100000_.  While this may have been done for the manifest,
this changed had not yet been propagated into the `.entry.json` files.

Links to web sites that were in the for <URL> are now [URL](URL).

Performed `name www` to process all of the above.

Improved format of `authors.html`.  Full names are now bold.
Location codes are now links back into `location.html` and
location names (both default and common) are now italics.
Added _author_handle_ each author.

Changed `bin/gen-authors.sh` VERSION from "1.1 2024-02-25"
to "1.2 2024-03-09".

Improved format of `location.html` as location codes are now bold,
author counts in a given location are now bold, and location names
(both default and common) are now italics.

Changed `bin/gen-location.sh` VERSION from "1.0.1 2024-02-23"
to "1.1 2024-03-04".

Added italic location name after location code in entry
`index.html` files.

Changed `bin/output-index-author.sh` VERSION from "1.4.1 2024-02-23"
to "1.5 2024-03-04".

Added _Location of authors_ to the sidebar as a link to `location.html`.

TODO: While nearly all of the above mentioned changes are likely correct,
      they likely introduced a few errors that need correcting.
This commit is contained in:
Landon Curt Noll committed 2024-03-04 23:45:28 -08:00
1 parent 91c55a20fd
commit 2b92c89be8
1811 files changed
+11313 -9962
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2020/ferguson2/.entry.json
+1 -1
View File
@@ -147,7 +147,7 @@
},
{
"file_path" : "2020_ferguson2.tar.bz2",
"inventory_order" : 300,
"inventory_order" : 100000,
"OK_to_edit" : false,
"display_as" : "tbz2",
"display_via_github" : false,
2020/ferguson2/.gitignore
+1 -1
View File
@@ -1,5 +1,5 @@
#
# sort with: ../../bin/sgi
# sort with: ../../bin/sgi.sh
*.dSYM
cake.sh
chocolate-cake.dat
2020/ferguson2/Makefile
+1 -1
View File
@@ -10,7 +10,7 @@
# Bug fixes, corrections and typo fixes are VERY WELCOME. If you see a problem,
# first check this URL for a list of known bugs and (mis)features of IOCCC entries:
#
# https://www.ioccc.org/bugs.md
# https://www.ioccc.org/bugs.html
#
# GitHub pull requests are welcome! Please see the above URL for details.
#
2020/ferguson2/README.md
+28 -28
View File
@@ -116,13 +116,13 @@ man ./enigma.1
```
* [recode.html][] (or [recode.md](recode.md) if reading on GitHub)
* [recode.html][] (or [recode.html](recode.html) if reading on GitHub)
- Some useful information about [recode.c](recode.c)
* [chocolate-cake.html][] (or [chocolate-cake.md](chocolate-cake.md) if reading on GitHub)
* [chocolate-cake.html][] (or [chocolate-cake.html](chocolate-cake.html) if reading on GitHub)
- Because most of us could use some *Double-layered Chocolate Fudge Cake*!
- NOTE: see [recode.html][] (or [recode.md](recode.md) for details about how to decrypt this!
- NOTE: see [recode.html][] (or [recode.html](recode.html) for details about how to decrypt this!
[recode.html]: recode.html
@@ -211,15 +211,15 @@ alphabet and then input it into their Enigma machine configured in the same way
and thus have the original message.
The [1998 ASCII / Morse code translator][] entry by [Franz van
Dorsselaer](/authors.html#Frans_van_Dorsselaer) prints the Morse code of text;
Dorsselaer](../../authors.html#Frans_van_Dorsselaer) prints the Morse code of text;
and the [2014 Morse audio transcoder][] by [Daniel
Vik](/authors.html#Daniel_Vik) can be used to allow for the actual sound of it.
Vik](../../authors.html#Daniel_Vik) can be used to allow for the actual sound of it.
With my entry we can complete the loop!
### <a name="nathan" href="#toc">The 1992 Nathan Sidwell entry</a>
The author [Nathan Sidwell](/authors.html#Nathan_Sidwell) of the [1992 Worst
The author [Nathan Sidwell](../../authors.html#Nathan_Sidwell) of the [1992 Worst
Abuse of the Rules][] had this to say about his program:
> This program is a hello world text encrypter/decrypter. It uses an
@@ -247,10 +247,10 @@ My entry should also work as a non-military grade Enigma; they had no
[plugboard](https://www.cryptomuseum.com/crypto/enigma/i/sb.htm) and by
default mine is empty. I explain how to set up the simulator later.
[Yusuke Endoh](/authors.html#Yusuke_Endoh) asked the judges and me if the real
[Yusuke Endoh](../../authors.html#Yusuke_Endoh) asked the judges and me if the real
1992 entry source was available. Simon Cooper didn't have access to it because
it was before his time in the IOCCC; but before the other judges could answer
[Ilya Kurdyukov](/authors.html#Ilya_Kurdyukov) sent a link to the original 1992
[Ilya Kurdyukov](../../authors.html#Ilya_Kurdyukov) sent a link to the original 1992
code. As of 4 March 2023 the original before unseen code was published but I
leave this in for historical purposes.
@@ -288,8 +288,8 @@ After that you can input the string and it'll go from there.
BTW: There's a much more entertaining (and delicious) challenge or exercise in
[recode.html][] (if you're reading this on GitHub check the
[recode.md](recode.md) file instead); this involves [chocolate-cake.html][] (if
on GitHub see [here](chocolate-cake.md)) though one might need a different kind
[recode.html](recode.html) file instead); this involves [chocolate-cake.html][] (if
on GitHub see [here](chocolate-cake.html)) though one might need a different kind
of exercise after taking up the challenge! :-) These however show the general
program as well as how to use the two winning entries of the [Morse
code](https://en.wikipedia.org/wiki/Morse_code) that I referred to earlier:
@@ -406,7 +406,7 @@ Phew! The program redeemed itself after the test failure! :)
is with some of the things I pasted in the other file and maybe others here
too. Notice also how it showed the same output that my program gave it - `UUMMX`.)
What about the other [Morse code entry](/1998/dorssel/dorssel.c)?
What about the other [Morse code entry](../../1998/dorssel/dorssel.c)?
```sh
$ echo IOCCC | ./prog | ./dorssel
@@ -443,7 +443,7 @@ as the ciphering goes but I thought this would make it much more interesting:
make it more flexible by a wrapper program.
For examples using it (and a delicious challenge) see [recode.html][] (or
[recode.md](recode.md) if reading on GitHub). See also the [recode.1][] and
[recode.html](recode.html) if reading on GitHub). See also the [recode.1][] and
[enigma.1][] man pages.
@@ -494,7 +494,7 @@ by itself. However for the reflector I did `1A` but it only expects 1 char! So
will that mean that the plugboard pairs are off? Yes it does seem to be so. This
is buffering at play I believe but it's useful for allowing the `recode` program
to easily configure the Enigma machine. In the [recode.html](recode.html) file
(or [recode.md](recode.md) if reading on GitHub) file I give a hint as to how
(or [recode.html](recode.html) if reading on GitHub) file I give a hint as to how
this could be fixed but the caveat is it would necessitate a need for rewriting
[recode.c](recode.c).
@@ -508,7 +508,7 @@ same applies: in C 0-1 but in human it's 1-2 (technically these were reflectors
the Enigma machine which I display by name in [recode.c](recode.c) just like
with the rotors).
For more information see [recode.html][] (or [recode.md](recode.md) if viewing on
For more information see [recode.html][] (or [recode.html](recode.html) if viewing on
GitHub).
BTW: If you need a reminder to go to the gym just do your Enigma ABCs and it
@@ -577,12 +577,12 @@ To encipher:
The file [obfuscation.key][] is the key to decipher/encipher
[obfuscation.txt][].
For the lazy [obfuscation.md][] has the deciphered version. I am afraid I'm not
For the lazy [obfuscation.html](obfuscation.html) has the deciphered version. I am afraid I'm not
so inclined to do that for the cake recipe: the idea there is to make it a fun
exercise that when solved unlocks a wonderful double-layered chocolate fudge
cake recipe. But given that my ['Don't tread on me'](../ferguson1) award entry
also has the [recipe](../ferguson1/chocolate-cake.html)
([ferguson1/chocolate-cake.md](../ferguson1/chocolate-cake.md) if reading on
([ferguson1/chocolate-cake.html](../ferguson1/chocolate-cake.html) if reading on
GitHub), not enciphered, one might just go there instead. Still it's a fun way
to explore this entry.
@@ -607,7 +607,7 @@ choose from a set of rotors and there were no duplicates. This shouldn't be a
problem here however except that it wouldn't be a possible configuration of the
real Enigma machine. The `recode` program *however does validate this* (except
when reading in settings via the `-R` option which I explain in the
[recode.html][] file ([recode.md](recode.md) on GitHub).
[recode.html][] file ([recode.html](recode.html) on GitHub).
* The way the [plugboard](https://www.cryptomuseum.com/crypto/enigma/i/sb.htm)
\- for the machines that had them - is, if you connect A to B then no other
@@ -838,9 +838,9 @@ don't think there need be any addition to the recode program - at least not
that.
[1992 Worst Abuse of the Rules]: https://www.ioccc.org/1992/nathan/README.md
[1998 ASCII / Morse code translator]: https://www.ioccc.org/1998/dorssel/README.md
[2014 Morse audio transcoder]: https://www.ioccc.org/2014/vik/README.md
[1992 Worst Abuse of the Rules]: ../../1992/nathan/index.html
[1998 ASCII / Morse code translator]: ../../1998/dorssel/index.html
[2014 Morse audio transcoder]: ../../2014/vik/index.html
[Enigma Message Procedures]: https://web.archive.org/web/20200710094321/http://users.telenet.be/d.rijmenants/en/enigmaproc.htm
[Interactive Enigma Machine]: http://enigmaco.de/enigma/enigma.html
[enigma.1]: enigma.1
@@ -848,7 +848,7 @@ that.
[recode.html]: recode.html
[chocolate-cake.html]: chocolate-cake.html
[recode.c]: recode.c
[obfuscation.md]: obfuscation.md
[obfuscation.html]: obfuscation.html
[obfuscation.txt]: obfuscation.txt
[obfuscation.key]: obfuscation.key
[Tony Sale's pages on The Enigma cipher machine]: https://web.archive.org/web/20200621180323/http://www.codesandciphers.co.uk/enigma/index.htm
@@ -861,21 +861,21 @@ that.
### <a name="winning" href="#toc">Winning thoughts, dedications and thanks</a>
Once again I'm honoured to win along with some of the other veterans who I have
a huge amount of respect for; there's [Don Yang](/authors.html#Don_Yang), [Dave
Burton](/authors.html#Dave_Burton), [Yusuke Endoh](/authors.html#Yusuke_Endoh)
and [Edward Giles](/authors.html#Edward_Giles) all of whom are amazing
a huge amount of respect for; there's [Don Yang](../../authors.html#Don_Yang), [Dave
Burton](../../authors.html#Dave_Burton), [Yusuke Endoh](../../authors.html#Yusuke_Endoh)
and [Edward Giles](../../authors.html#Edward_Giles) all of whom are amazing
programmers. I'm especially proud to win besides Dave Burton and Yusuke Endoh
but Don Yang and Edward Giles too.
But there are some others who I don't remember like [Ilya
Kurdyukov](/authors.html#https://en.wikipedia.org/wiki/Signals_intelligence#World_War_II)
Kurdyukov](../../authors.html#https://en.wikipedia.org/wiki/Signals_intelligence#World_War_II)
(who's offered a lot of interesting thoughts on [Snake](../ferguson1/prog.c) and
who plans to have his own version after the entries are published), [Nathan
Otterness](/authors.html#Nathan_Otterness), [Nicholas
Carlini](/authors.html#Nicholas_Carlini) (your entry is an absolutely brilliant
Otterness](../../authors.html#Nathan_Otterness), [Nicholas
Carlini](../../authors.html#Nicholas_Carlini) (your entry is an absolutely brilliant
abuse of `printf` - and I totally agree with the judges remarks that your entry
is so novel that it'll be worth special mention in the future Best of IOCCC
list!) and [tsoj](/authors.html#_tsoj) too.
list!) and [tsoj](../../authors.html#_tsoj) too.
Well done and congratulations to all of you again! Thank you for submitting the
wonderful entries and I'm honoured to have my two entries beside yours!
2020/ferguson2/chocolate-cake.html
+1
View File
@@ -66,6 +66,7 @@
<a href="../../index.html">IOCCC Home</a>
<a href="../../years.html">Winning Entries</a>
<a href="../../authors.html">People who have won</a>
<a href="../../location.html">Location of authors</a>
</div>
<hr>
<div class="sidenav">
2020/ferguson2/index.html
+51 -48
View File
@@ -45,6 +45,8 @@
<a class="Left" href="../ferguson1/index.html">&larr; ferguson1</a>
<a class="Left" href="../index.html">&uarr; 2020 &uarr;</a>
<a class="Left" href="../giles/index.html">giles &rarr;</a>
<a class="Right" href="https://github.com/ioccc-src/temp-test-ioccc/2020/ferguson2/prog.c">C code</a>
<a class="Right" href="https://github.com/ioccc-src/temp-test-ioccc/2020/ferguson2/Makefile">Makefile</a>
<a class="Right" href="#inventory">Inventory</a>
</div>
@@ -69,6 +71,7 @@
<a href="../../index.html">IOCCC Home</a>
<a href="../../years.html">Winning Entries</a>
<a href="../../authors.html">People who have won</a>
<a href="../../location.html">Location of authors</a>
</div>
<hr>
<div class="sidenav">
@@ -117,8 +120,8 @@
<h2 id="author"><a name="author"></a>Author:</h2>
<ul>
<li>Name: <a href="../../authors.html#Cody_Boone_Ferguson">Cody Boone
Ferguson</a><br> Location: <a href="../../location.html#US">US</a>
<br><br></li>
Ferguson</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 -->
@@ -201,17 +204,17 @@ To render, try:</li>
<div class="sourceCode" id="cb8"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb8-1"><a href="#cb8-1" aria-hidden="true" tabindex="-1"></a><span class="fu">man</span> ./enigma.1</span></code></pre></div>
<ul>
<li><a href="recode.html">recode.html</a> (or <a
href="recode.md">recode.md</a> if reading on GitHub)
href="recode.html">recode.html</a> if reading on GitHub)
<ul>
<li>Some useful information about <a href="recode.c">recode.c</a></li>
</ul></li>
<li><a href="chocolate-cake.html">chocolate-cake.html</a> (or <a
href="chocolate-cake.md">chocolate-cake.md</a> if reading on GitHub)
href="chocolate-cake.html">chocolate-cake.html</a> if reading on GitHub)
<ul>
<li>Because most of us could use some <em>Double-layered Chocolate Fudge
Cake</em>!</li>
<li>NOTE: see <a href="recode.html">recode.html</a> (or <a
href="recode.md">recode.md</a> for details about how to decrypt
href="recode.html">recode.html</a> for details about how to decrypt
this!</li>
</ul></li>
</ul>
@@ -292,18 +295,17 @@ encoded message. Then those picking up on the message would note the
Morse code, translate it to the alphabet and then input it into their
Enigma machine configured in the same way and thus have the original
message.</p>
<p>The <a href="https://www.ioccc.org/1998/dorssel/README.md">1998 ASCII
/ Morse code translator</a> entry by <a
href="/authors.html#Frans_van_Dorsselaer">Franz van Dorsselaer</a>
<p>The <a href="../../1998/dorssel/index.html">1998 ASCII / Morse code
translator</a> entry by <a
href="../../authors.html#Frans_van_Dorsselaer">Franz van Dorsselaer</a>
prints the Morse code of text; and the <a
href="https://www.ioccc.org/2014/vik/README.md">2014 Morse audio
transcoder</a> by <a href="/authors.html#Daniel_Vik">Daniel Vik</a> can
be used to allow for the actual sound of it. With my entry we can
complete the loop!</p>
href="../../2014/vik/index.html">2014 Morse audio transcoder</a> by <a
href="../../authors.html#Daniel_Vik">Daniel Vik</a> can be used to allow
for the actual sound of it. With my entry we can complete the loop!</p>
<h3 id="the-1992-nathan-sidwell-entry"><a name="nathan" href="#toc">The
1992 Nathan Sidwell entry</a></h3>
<p>The author <a href="/authors.html#Nathan_Sidwell">Nathan Sidwell</a>
of the <a href="https://www.ioccc.org/1992/nathan/README.md">1992 Worst
<p>The author <a href="../../authors.html#Nathan_Sidwell">Nathan
Sidwell</a> of the <a href="../../1992/nathan/index.html">1992 Worst
Abuse of the Rules</a> had this to say about his program:</p>
<blockquote>
<p>This program is a hello world text encrypter/decrypter. It uses an <a
@@ -337,12 +339,12 @@ that.</p>
href="https://www.cryptomuseum.com/crypto/enigma/i/sb.htm">plugboard</a>
and by default mine is empty. I explain how to set up the simulator
later.</p>
<p><a href="/authors.html#Yusuke_Endoh">Yusuke Endoh</a> asked the
<p><a href="../../authors.html#Yusuke_Endoh">Yusuke Endoh</a> asked the
judges and me if the real 1992 entry source was available. Simon Cooper
didn’t have access to it because it was before his time in the IOCCC;
but before the other judges could answer <a
href="/authors.html#Ilya_Kurdyukov">Ilya Kurdyukov</a> sent a link to
the original 1992 code. As of 4 March 2023 the original before unseen
href="../../authors.html#Ilya_Kurdyukov">Ilya Kurdyukov</a> sent a link
to the original 1992 code. As of 4 March 2023 the original before unseen
code was published but I leave this in for historical purposes.</p>
<h3 id="usage"><a name="usage" href="#toc">Usage</a></h3>
<p>If you run the program by itself it’ll use the default settings and
@@ -369,10 +371,10 @@ pairs</a>.</p>
<h4 id="example-run"><a name="example" href="#toc">Example run</a></h4>
<p>BTW: There’s a much more entertaining (and delicious) challenge or
exercise in <a href="recode.html">recode.html</a> (if you’re reading
this on GitHub check the <a href="recode.md">recode.md</a> file
this on GitHub check the <a href="recode.html">recode.html</a> file
instead); this involves <a
href="chocolate-cake.html">chocolate-cake.html</a> (if on GitHub see <a
href="chocolate-cake.md">here</a>) though one might need a different
href="chocolate-cake.html">here</a>) though one might need a different
kind of exercise after taking up the challenge! :-) These however show
the general program as well as how to use the two winning entries of the
<a href="https://en.wikipedia.org/wiki/Morse_code">Morse code</a> that I
@@ -466,8 +468,8 @@ class="sourceCode sh"><code class="sourceCode bash"><span id="cb18-1"><a href="#
this is how it is with some of the things I pasted in the other file and
maybe others here too. Notice also how it showed the same output that my
program gave it - <code>UUMMX</code>.)</p>
<p>What about the other <a href="/1998/dorssel/dorssel.c">Morse code
entry</a>?</p>
<p>What about the other <a href="../../1998/dorssel/dorssel.c">Morse
code entry</a>?</p>
<div class="sourceCode" id="cb19"><pre
class="sourceCode sh"><code class="sourceCode bash"><span id="cb19-1"><a href="#cb19-1" aria-hidden="true" tabindex="-1"></a><span class="ex">$</span> echo IOCCC <span class="kw">|</span> <span class="ex">./prog</span> <span class="kw">|</span> <span class="ex">./dorssel</span></span>
<span id="cb19-2"><a href="#cb19-2" aria-hidden="true" tabindex="-1"></a><span class="ex">..-</span> ..- <span class="at">--</span> <span class="at">--</span> <span class="at">-..-</span></span></code></pre></div>
@@ -500,9 +502,10 @@ simulator only as far as the ciphering goes but I thought this would
make it much more interesting: make it more flexible by a wrapper
program.</p>
<p>For examples using it (and a delicious challenge) see <a
href="recode.html">recode.html</a> (or <a href="recode.md">recode.md</a>
if reading on GitHub). See also the <a href="recode.1">recode.1</a> and
<a href="enigma.1">enigma.1</a> man pages.</p>
href="recode.html">recode.html</a> (or <a
href="recode.html">recode.html</a> if reading on GitHub). See also the
<a href="recode.1">recode.1</a> and <a href="enigma.1">enigma.1</a> man
pages.</p>
<h3
id="a-parser-subtlety-that-could-cause-confusion"><a name="parsersubtlety" href="#toc">A
parser subtlety that could cause confusion</a></h3>
@@ -552,9 +555,9 @@ plugboard pairs are off? Yes it does seem to be so. This is buffering at
play I believe but it’s useful for allowing the <code>recode</code>
program to easily configure the Enigma machine. In the <a
href="recode.html">recode.html</a> file (or <a
href="recode.md">recode.md</a> if reading on GitHub) file I give a hint
as to how this could be fixed but the caveat is it would necessitate a
need for rewriting <a href="recode.c">recode.c</a>.</p>
href="recode.html">recode.html</a> if reading on GitHub) file I give a
hint as to how this could be fixed but the caveat is it would
necessitate a need for rewriting <a href="recode.c">recode.c</a>.</p>
<p>There’s another thing to be aware of and that’s the way the ranges
are enforced. There are five rotors which obviously are in C 0-4 but in
‘natural language’ 1-5 (they were labelled I, II, III, IV and V
@@ -565,7 +568,7 @@ and the same applies: in C 0-1 but in human it’s 1-2 (technically these
were reflectors B and C in the Enigma machine which I display by name in
<a href="recode.c">recode.c</a> just like with the rotors).</p>
<p>For more information see <a href="recode.html">recode.html</a> (or <a
href="recode.md">recode.md</a> if viewing on GitHub).</p>
href="recode.html">recode.html</a> if viewing on GitHub).</p>
<p>BTW: If you need a reminder to go to the gym just do your Enigma ABCs
and it should help you remember (though not at this time in our world it
might help you later on?). This might become even more useful after the
@@ -615,15 +618,15 @@ class="sourceCode sh"><code class="sourceCode bash"><span id="cb23-1"><a href="#
class="sourceCode sh"><code class="sourceCode bash"><span id="cb24-1"><a href="#cb24-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./recode</span> <span class="at">-Robfuscation.key</span> <span class="at">-fobfuscation.md</span> <span class="kw">|</span> <span class="ex">./prog</span> <span class="at">-</span> <span class="dv">2</span><span class="op">&gt;</span>/dev/null <span class="op">&gt;</span> obfuscation.txt</span></code></pre></div>
<p>The file <a href="obfuscation.key">obfuscation.key</a> is the key to
decipher/encipher <a href="obfuscation.txt">obfuscation.txt</a>.</p>
<p>For the lazy <a href="obfuscation.md">obfuscation.md</a> has the
<p>For the lazy <a href="obfuscation.html">obfuscation.html</a> has the
deciphered version. I am afraid I’m not so inclined to do that for the
cake recipe: the idea there is to make it a fun exercise that when
solved unlocks a wonderful double-layered chocolate fudge cake recipe.
But given that my <a href="../ferguson1">‘Don’t tread on me’</a> award
entry also has the <a href="../ferguson1/chocolate-cake.html">recipe</a>
(<a
href="../ferguson1/chocolate-cake.md">ferguson1/chocolate-cake.md</a> if
reading on GitHub), not enciphered, one might just go there instead.
href="../ferguson1/chocolate-cake.html">ferguson1/chocolate-cake.html</a>
if reading on GitHub), not enciphered, one might just go there instead.
Still it’s a fun way to explore this entry.</p>
<p>As for the <a href="obfuscation.key">obfuscation.key</a> file if you
observe the contents you’ll find the word <code>OBFUSCATION</code>:</p>
@@ -646,7 +649,7 @@ possible configuration of the real Enigma machine. The
<code>recode</code> program <em>however does validate this</em> (except
when reading in settings via the <code>-R</code> option which I explain
in the <a href="recode.html">recode.html</a> file (<a
href="recode.md">recode.md</a> on GitHub).</p></li>
href="recode.html">recode.html</a> on GitHub).</p></li>
<li><p>The way the <a
href="https://www.cryptomuseum.com/crypto/enigma/i/sb.htm">plugboard</a>
- for the machines that had them - is, if you connect A to B then no
@@ -664,11 +667,11 @@ easily).</p></li>
<li><p>It does not obviously have the clicking sound associated with the
moving parts of the real machine. I think it would be annoying to have
this as it processes each letter - but with the <a
href="https://www.ioccc.org/2014/vik/README.md">2014 Morse audio
transcoder</a> entry you can at least have the output played in Morse
code as the Germans did; I think that’s really cool (I think it’s really
cool even if there’s a bug in it). That it pays homage to that (and
another) entry is a bonus here.</p></li>
href="../../2014/vik/index.html">2014 Morse audio transcoder</a> entry
you can at least have the output played in Morse code as the Germans
did; I think that’s really cool (I think it’s really cool even if
there’s a bug in it). That it pays homage to that (and another) entry is
a bonus here.</p></li>
<li><p>The <a href="prog.c">simulator</a> doesn’t report errors but
tries to gracefully deal with them: if one chooses a value out of range
it moves it into the range (if &gt; the max then the max, if &lt; min
@@ -885,23 +888,23 @@ id="winning-thoughts-dedications-and-thanks"><a name="winning" href="#toc">Winni
thoughts, dedications and thanks</a></h3>
<p>Once again I’m honoured to win along with some of the other veterans
who I have a huge amount of respect for; there’s <a
href="/authors.html#Don_Yang">Don Yang</a>, <a
href="/authors.html#Dave_Burton">Dave Burton</a>, <a
href="/authors.html#Yusuke_Endoh">Yusuke Endoh</a> and <a
href="/authors.html#Edward_Giles">Edward Giles</a> all of whom are
href="../../authors.html#Don_Yang">Don Yang</a>, <a
href="../../authors.html#Dave_Burton">Dave Burton</a>, <a
href="../../authors.html#Yusuke_Endoh">Yusuke Endoh</a> and <a
href="../../authors.html#Edward_Giles">Edward Giles</a> all of whom are
amazing programmers. I’m especially proud to win besides Dave Burton and
Yusuke Endoh but Don Yang and Edward Giles too.</p>
<p>But there are some others who I don’t remember like <a
href="/authors.html#https://en.wikipedia.org/wiki/Signals_intelligence#World_War_II">Ilya
href="../../authors.html#https://en.wikipedia.org/wiki/Signals_intelligence#World_War_II">Ilya
Kurdyukov</a> (who’s offered a lot of interesting thoughts on <a
href="../ferguson1/prog.c">Snake</a> and who plans to have his own
version after the entries are published), <a
href="/authors.html#Nathan_Otterness">Nathan Otterness</a>, <a
href="/authors.html#Nicholas_Carlini">Nicholas Carlini</a> (your entry
is an absolutely brilliant abuse of <code>printf</code> - and I totally
agree with the judges remarks that your entry is so novel that it’ll be
worth special mention in the future Best of IOCCC list!) and <a
href="/authors.html#_tsoj">tsoj</a> too.</p>
href="../../authors.html#Nathan_Otterness">Nathan Otterness</a>, <a
href="../../authors.html#Nicholas_Carlini">Nicholas Carlini</a> (your
entry is an absolutely brilliant abuse of <code>printf</code> - and I
totally agree with the judges remarks that your entry is so novel that
it’ll be worth special mention in the future Best of IOCCC list!) and <a
href="../../authors.html#_tsoj">tsoj</a> too.</p>
<p>Well done and congratulations to all of you again! Thank you for
submitting the wonderful entries and I’m honoured to have my two entries
beside yours!</p>
2020/ferguson2/obfuscation.html
+1
View File
@@ -66,6 +66,7 @@
<a href="../../index.html">IOCCC Home</a>
<a href="../../years.html">Winning Entries</a>
<a href="../../authors.html">People who have won</a>
<a href="../../location.html">Location of authors</a>
</div>
<hr>
<div class="sidenav">
2020/ferguson2/recode.html
+1
View File
@@ -66,6 +66,7 @@
<a href="../../index.html">IOCCC Home</a>
<a href="../../years.html">Winning Entries</a>
<a href="../../authors.html">People who have won</a>
<a href="../../location.html">Location of authors</a>
</div>
<hr>
<div class="sidenav">