mirror of
https://github.com/google/brotli.git
synced 2024-11-21 19:20:09 +00:00
Minor: added missing word _lengths_ to insert-and-copy lengths
This commit is contained in:
parent
df5bee181c
commit
9bb41938d3
@ -1742,7 +1742,7 @@ The decoding algorithm that produces the uncompressed data is as follows:
|
|||||||
else
|
else
|
||||||
fill CMAPD[] with zeros
|
fill CMAPD[] with zeros
|
||||||
read array of prefix codes for literals, HTREEL[]
|
read array of prefix codes for literals, HTREEL[]
|
||||||
read array of prefix codes for insert-and-copy, HTREEI[]
|
read array of prefix codes for insert-and-copy lengths, HTREEI[]
|
||||||
read array of prefix codes for distances, HTREED[]
|
read array of prefix codes for distances, HTREED[]
|
||||||
do
|
do
|
||||||
if BLEN_I is zero
|
if BLEN_I is zero
|
||||||
|
@ -1855,7 +1855,7 @@ 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 prefix codes for literals, HTREEL[]
|
||||||
read array of prefix codes for insert-and-copy, HTREEI[]
|
read array of prefix codes for insert-and-copy lengths, HTREEI[]
|
||||||
read array of prefix codes for distances, HTREED[]
|
read array of prefix codes for distances, HTREED[]
|
||||||
do
|
do
|
||||||
if BLEN_I is zero
|
if BLEN_I is zero
|
||||||
|
Loading…
Reference in New Issue
Block a user