starred/brotli
1
0
Fork 0
mirror of https://github.com/google/brotli.git synced 2026-07-08 17:56:58 +00:00
Code Issues 1.2k Packages Projects Releases 20 Wiki Activity

Clarify Section 8.

Browse Source
This commit is contained in:
Joe Tsai
2015-10-28 20:09:11 -07:00
parent 4d375a2f4e
commit 238d459ebb
1 changed files with 5 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
docs/draft-alakuijala-brotli-07.nroff
View File

@@ -1328,14 +1328,13 @@ to a duplicated string in the uncompressed data produced so far has a maximum
backward distance value, which is the minimum of the window size and
the number of uncompressed bytes produced. However, decoding a distance
from the compressed stream, as described in Section 4., can produce
distances that are greater than this maximum allowed value. The
difference between these distances and the first invalid distance
value is treated as reference to a word in the static dictionary
given in Appendix A. The copy length for a static dictionary reference
distances that are greater than this maximum allowed value. In this case,
the distance is treated as a reference to a word in the static dictionary.
The copy length for a static dictionary reference
must be between 4 and 24. The static dictionary has three parts:
.nf
* DICT[0..DICTSIZE], an array of bytes
* DICT[0..DICTSIZE], an array of bytes, given in Appendix A.
* DOFFSET[0..24], an array of byte offset values for each length
* NDBITS[0..24], an array of bit-depth values for each length
.fi
@@ -1377,7 +1376,7 @@ follows:
The string copied to the uncompressed stream is computed by applying the
transformation to the base dictionary word. If transform_id is
greater than 120 or length is smaller than 4 or greater than 24, then
greater than 120, or the length is smaller than 4 or greater than 24, then
the compressed stream should be rejected as invalid.
Each word transformation has the following form: