Make tables valid markdown

This commit is contained in:
James Gregory 2013-12-31 07:30:12 +11:00
commit 2091516544
13 changed files with 156 additions and 1002 deletions

128
14-03.md
View file

@ -24,130 +24,22 @@ somewhat faster. Regardless, the far superior performance of **REPNZ
SCASB** clearly indicates that assembly language is in order at this
point.
* * * * *
| | "g;" | "Yogi" | "igoY" | "Adrian" | "Conclusion" | "You don't know what you know" |
|--------------------------------------------------------------------|-------|--------|--------|----------|--------------|--------------------------------|
| Searching approach | (16K) | (16K) | (16K) | (\<1K) | (16K) | (16K) |
| REPNZ SCASB on first char a (Listing 9.1) | 8.2 | 7.5 | 9.7 | 0.4 | 7.4 | 8.1 |
| REPNZ SCASB on least common char (Listing 9.2) | 7.6 | 7.5 | 7.5 | 0.5 | 7.5 | 7.5 |
| Boyer-Moore in C (Listing 14.1) | 71.0 | 38.4 | 37.7 | 1.8 | 18.2 | 9.2 |
| Standard Boyer-Moore in ASM (code not shown) | 38.5 | 21.0 | 20.5 | 0.8 | 9.4 | 4.8 |
| Quick handling of first mismatch Boyer-Moore in ASM (Listing 14.3) | 14.1 | 8.9 | 7.7 | 0.4 | 4.0 | 2.0 |
| \<=255 pattern length + sentinelBoyer-Moore in ASM (Listing 14.4) | 8.1 | 5.2 | 4.6 | 0.3 | 2.6 | 1.2 |
"g;"
"Yogi"
"igoY"
"Adrian"
"Conclusion"
"You don't know what you know"
* * * * *
Searching approach
(16K)
(16K)
(16K)
(\<1K)
(16K)
(16K)
REPNZ SCASB on first char a(Listing 9.1)
8.2
7.5
9.7
0.4
7.4
8.1
REPNZ SCASB on least common char (Listing 9.2)
7.6
7.5
7.5
0.5
7.5
7.5
Boyer-Moore in C (Listing 14.1)
71.0
38.4
37.7
1.8
18.2
9.2
Standard Boyer-Moore in ASM(code not shown)
38.5
21.0
20.5
0.8
9.4
4.8
Quick handling of first mismatch Boyer-Moore in ASM(Listing 14.3)
14.1
8.9
7.7
0.4
4.0
2.0
\<=255 pattern length + sentinelBoyer-Moore in ASM(Listing 14.4)
8.1
5.2
4.6
0.3
2.6
1.2
Table: Table 14.1 Comparison of searching techniques.
Search pattern (approximate distance searched before match is shown in
parentheses).\
Times are in milliseconds; shorter is better.
* * * * *
Table 14.1 Comparison of searching techniques.
* * * * *
The entry "Standard Boyer-Moore in ASM" in Table 14.1 refers to
straight-forward hand optimization of Listing 14.1, code that is not
included in this chapter for the perfectly good reason that it is slower