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
@@ -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
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()`
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
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
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>
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
on to the next line of code.</p>
<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
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
straightforward; for `*` start out with `*foo` and `foo*` against `foo`.
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>
<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
<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
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