aboutsummaryrefslogtreecommitdiff
path: root/titlecompression.txt
diff options
context:
space:
mode:
authorB. Watson <yalhcru@gmail.com>2016-01-06 04:21:16 -0500
committerB. Watson <yalhcru@gmail.com>2016-01-06 04:21:16 -0500
commite1987b6ba5097a3d95bae1aa61eba7ef66933302 (patch)
tree30e092bb0e448f54bca1b6d124a6d07639d7e972 /titlecompression.txt
parentd90c75703d7a9ca53fded2a40fa35344279ed843 (diff)
downloadtaipan-e1987b6ba5097a3d95bae1aa61eba7ef66933302.tar.gz
glorious ASCII art!
Diffstat (limited to 'titlecompression.txt')
-rw-r--r--titlecompression.txt8
1 files changed, 7 insertions, 1 deletions
diff --git a/titlecompression.txt b/titlecompression.txt
index 9cda223..ecbf9df 100644
--- a/titlecompression.txt
+++ b/titlecompression.txt
@@ -19,7 +19,13 @@ In other words, if the input looks like:
...there are 2 lengths of zero-run: 2 and 3. The fact that there are
two runs of length 2 doesn't affect the algorithm (in fact it helps
-the compression ratio).
+the compression ratio). Here are the runs, illustrated in glorious
+ASCII art:
+
+01 00 00 02 00 00 03 00 00 00 04
+ \___/ \___/ \______/
+ run of run of run of
+ 2 zeroes 2 zeroes 3 zeroes
For each length of zero-run found in the file, an otherwise-unused byte
is assigned as a marker for that length. The above input might be encoded