mirror of
https://github.com/google/brotli.git
synced 2024-11-22 03:30:07 +00:00
Rearranged wording to stay under 72 character limit
This commit is contained in:
parent
1b8b801078
commit
e33ff0a679
@ -1741,9 +1741,9 @@ The decoding algorithm that produces the uncompressed data is as follows:
|
|||||||
read distance context map, CMAPD[]
|
read distance context map, CMAPD[]
|
||||||
else
|
else
|
||||||
fill CMAPD[] with zeros
|
fill CMAPD[] with zeros
|
||||||
read array of prefix codes for literals, HTREEL[]
|
read array of literals prefix codes, HTREEL[]
|
||||||
read array of prefix codes for insert-and-copy lengths, HTREEI[]
|
read array of insert-and-copy lengths prefix codes, HTREEI[]
|
||||||
read array of prefix codes for distances, HTREED[]
|
read array of distances prefix codes, HTREED[]
|
||||||
do
|
do
|
||||||
if BLEN_I is zero
|
if BLEN_I is zero
|
||||||
read block type using HTREE_BTYPE_I and set BTYPE_I
|
read block type using HTREE_BTYPE_I and set BTYPE_I
|
||||||
|
@ -1854,9 +1854,9 @@ Internet-Draft Brotli October 2015
|
|||||||
|
|
||||||
else
|
else
|
||||||
fill CMAPD[] with zeros
|
fill CMAPD[] with zeros
|
||||||
read array of prefix codes for literals, HTREEL[]
|
read array of literals prefix codes, HTREEL[]
|
||||||
read array of prefix codes for insert-and-copy lengths, HTREEI[]
|
read array of insert-and-copy lengths prefix codes, HTREEI[]
|
||||||
read array of prefix codes for distances, HTREED[]
|
read array of distances prefix codes, HTREED[]
|
||||||
do
|
do
|
||||||
if BLEN_I is zero
|
if BLEN_I is zero
|
||||||
read block type using HTREE_BTYPE_I and set BTYPE_I
|
read block type using HTREE_BTYPE_I and set BTYPE_I
|
||||||
|
Loading…
Reference in New Issue
Block a user