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

fix problematic HTML caused by certain trailing backslashes

Browse Source 
In cases that are **outside of a markdown code block**,
a markdown line with ending in a tailing "\" can generate
problematic HTML.

We certain trailing backslashes outside of a markdown code block
with "<br>" HTML elements, or in some cases eliminated the
need for a trailing backslash.

In a few cases some unnecessary trailing backslashes inside
of a markdown code block were removed.

The following markdown files were changed in this commit:

```
1990/dds/README.md
1990/jaw/README.md
1991/ant/README.md
1991/rince/README.md
1991/westley/README.md
1992/vern/README.md
1992/westley/README.md
1998/schweikh1/README.md
2004/anonymous/README.md
2005/sykes/README.md
2006/toledo2/README.md
2011/toledo/README.md
2012/endoh2/README.md
2012/tromp/README.md
2013/robison/README.md
2015/hou/README.md
2015/howe/README.md
2015/schweikhardt/README.md
2018/burton1/README.md
2018/burton2/README.md
2018/ferguson/README.md
2018/vokes/README.md
2020/ferguson1/README.md
```

Performed `make www` to test these changes.
This commit is contained in:
Landon Curt Noll committed 2024-04-17 00:25:09 -07:00
1 parent 1785da1728
commit 4c3649a3c1
47 files changed
+481 -502
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2015/hou/README.md
+1 -1
View File
@@ -116,7 +116,7 @@ Tested platforms:
* Linux 3.18.7, Rasperberry Pi 2, clang 3.0-6.2, (works)
* Linux 3.18.7, Rasperberry Pi 2, gcc 4.6.3, (works)
* Mac OS X 10, x64, Apple LLVM version 6.1.0 (clang-602.0.53), (works)
* Windows 8.1, x86, MSVC 2012 (works)\
* Windows 8.1, x86, MSVC 2012 (works)
* Windows 8.1, x64, MSVC 2012 (works)
* Windows 8.1, x86, MinGW gcc 4.6.2 (fails, prints error message)
* Windows 8.1, x86, MinGW gcc 4.6.2 with -msse2 -mfpmath=sse (works)
2015/hou/index.html
+1 -2
View File
@@ -216,8 +216,7 @@ result. Error messages become garbled, though.</p></li>
<li>Linux 3.18.7, Rasperberry Pi 2, clang 3.0-6.2, (works)</li>
<li>Linux 3.18.7, Rasperberry Pi 2, gcc 4.6.3, (works)</li>
<li>Mac OS X 10, x64, Apple LLVM version 6.1.0 (clang-602.0.53), (works)</li>
<li>Windows 8.1, x86, MSVC 2012 (works)<br />
</li>
<li>Windows 8.1, x86, MSVC 2012 (works)</li>
<li>Windows 8.1, x64, MSVC 2012 (works)</li>
<li>Windows 8.1, x86, MinGW gcc 4.6.2 (fails, prints error message)</li>
<li>Windows 8.1, x86, MinGW gcc 4.6.2 with -msse2 -mfpmath=sse (works)</li>
2015/howe/README.md
+13 -13
View File
@@ -117,33 +117,33 @@ a region of edits are highly unlikely.
### References
Wu, Manber, Myers, and Miller; August 1989;\
"An O(NP) Sequence Comparison Algorithm";\
Wu, Manber, Myers, and Miller; August 1989;<br>
"An O(NP) Sequence Comparison Algorithm";<br>
<http://myerslab.mpi-cbg.de/wp-content/uploads/2014/06/np_diff.pdf>
Fowler, Noll, Vo; 1994\
Fowler, Noll, Vo; 1994<br>
<http://www.isthe.com/chongo/tech/comp/fnv/index.html>
Fowler, Noll, Vo on Wikipedia\
Fowler, Noll, Vo on Wikipedia<br>
<https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function>
"diff", The Open Group Base Specifications Issue 7\
IEEE Std 1003.1, 2013 Edition\
"diff", The Open Group Base Specifications Issue 7<br>
IEEE Std 1003.1, 2013 Edition<br>
<http://pubs.opengroup.org/onlinepubs/9699919799/utilities/diff.html>
Eugene W. Myers; "An O(ND) Difference Algorithm and Its Variations";\
Algorithmica, 1986, pages. 251-266\
Eugene W. Myers; "An O(ND) Difference Algorithm and Its Variations";<br>
Algorithmica, 1986, pages. 251-266<br>
<http://www.xmailserver.org/diff2.pdf>
Webb Miller and Eugene W. Myers; "A File Comparison Program";\
Software-Practice And Experience, Vol. 15(11). 1025-1040 (November 1985)\
Webb Miller and Eugene W. Myers; "A File Comparison Program";<br>
Software-Practice And Experience, Vol. 15(11). 1025-1040 (November 1985)<br>
<http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.189.70&rep=rep1&type=pdf>
D.S. Hirschberg, "A linear space algorithm for computing maximal common subsequence problem";\
Comm. of ACM, Vol. 18, June 1975, pages 341-343\
D.S. Hirschberg, "A linear space algorithm for computing maximal common subsequence problem";<br>
Comm. of ACM, Vol. 18, June 1975, pages 341-343<br>
<http://www.mathcs.emory.edu/~cheung/Courses/323/Syllabus/DynProg/Docs/Hirschberg-LCS-1975.pdf>
Which hashing algorithm is best for uniqueness and speed?\
Which hashing algorithm is best for uniqueness and speed?<br>
<http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed>
[Wu+89]: http://myerslab.mpi-cbg.de/wp-content/uploads/2014/06/np_diff.pdf
2015/howe/index.html
+13 -13
View File
@@ -218,26 +218,26 @@ Basic test program verifies known test edit distances and <code>patch(1)</code>
Random edits (holes) made to a file in-place.</p></li>
</ul>
<h3 id="references">References</h3>
<p>Wu, Manber, Myers, and Miller; August 1989;<br />
“An O(NP) Sequence Comparison Algorithm”;<br />
<p>Wu, Manber, Myers, and Miller; August 1989;<br>
“An O(NP) Sequence Comparison Algorithm”;<br>
<a href="http://myerslab.mpi-cbg.de/wp-content/uploads/2014/06/np_diff.pdf" class="uri">http://myerslab.mpi-cbg.de/wp-content/uploads/2014/06/np_diff.pdf</a></p>
<p>Fowler, Noll, Vo; 1994<br />
<p>Fowler, Noll, Vo; 1994<br>
<a href="http://www.isthe.com/chongo/tech/comp/fnv/index.html" class="uri">http://www.isthe.com/chongo/tech/comp/fnv/index.html</a></p>
<p>Fowler, Noll, Vo on Wikipedia<br />
<p>Fowler, Noll, Vo on Wikipedia<br>
<a href="https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function" class="uri">https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function</a></p>
<p>“diff”, The Open Group Base Specifications Issue 7<br />
IEEE Std 1003.1, 2013 Edition<br />
<p>“diff”, The Open Group Base Specifications Issue 7<br>
IEEE Std 1003.1, 2013 Edition<br>
<a href="http://pubs.opengroup.org/onlinepubs/9699919799/utilities/diff.html" class="uri">http://pubs.opengroup.org/onlinepubs/9699919799/utilities/diff.html</a></p>
<p>Eugene W. Myers; “An O(ND) Difference Algorithm and Its Variations”;<br />
Algorithmica, 1986, pages. 251-266<br />
<p>Eugene W. Myers; “An O(ND) Difference Algorithm and Its Variations”;<br>
Algorithmica, 1986, pages. 251-266<br>
<a href="http://www.xmailserver.org/diff2.pdf" class="uri">http://www.xmailserver.org/diff2.pdf</a></p>
<p>Webb Miller and Eugene W. Myers; “A File Comparison Program”;<br />
Software-Practice And Experience, Vol. 15(11). 1025-1040 (November 1985)<br />
<p>Webb Miller and Eugene W. Myers; “A File Comparison Program”;<br>
Software-Practice And Experience, Vol. 15(11). 1025-1040 (November 1985)<br>
<a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.189.70&amp;rep=rep1&amp;type=pdf" class="uri">http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.189.70&amp;rep=rep1&amp;type=pdf</a></p>
<p>D.S. Hirschberg, “A linear space algorithm for computing maximal common subsequence problem”;<br />
Comm. of ACM, Vol. 18, June 1975, pages 341-343<br />
<p>D.S. Hirschberg, “A linear space algorithm for computing maximal common subsequence problem”;<br>
Comm. of ACM, Vol. 18, June 1975, pages 341-343<br>
<a href="http://www.mathcs.emory.edu/~cheung/Courses/323/Syllabus/DynProg/Docs/Hirschberg-LCS-1975.pdf" class="uri">http://www.mathcs.emory.edu/~cheung/Courses/323/Syllabus/DynProg/Docs/Hirschberg-LCS-1975.pdf</a></p>
<p>Which hashing algorithm is best for uniqueness and speed?<br />
<p>Which hashing algorithm is best for uniqueness and speed?<br>
<a href="http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed" class="uri">http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed</a></p>
<!--
2015/schweikhardt/README.md
+2 -4
View File
@@ -189,10 +189,8 @@ to the rescue:
``` <!---sh-->
$ printf 'obase=16;10^100\n' | bc
1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F1000000000\
0000000000000000
$ ./prog 1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000 \
| less
1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000
$ ./prog 1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000 | less
[...]
```
2015/schweikhardt/index.html
+2 -4
View File
@@ -270,10 +270,8 @@ Fear not,
<a href="http://pubs.opengroup.org/onlinepubs/9699919799/utilities/bc.html">bc(1)</a>
to the rescue:</p>
<pre><code> $ printf &#39;obase=16;10^100\n&#39; | bc
1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F1000000000\
0000000000000000
$ ./prog 1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000 \
| less
1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000
$ ./prog 1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000 | less
[...]</code></pre>
<p>Observe how the first 100 iterations melt the zeros to the right. Can you explain
why?</p>