Virtualization
/
brotli
mirror of https://github.com/google/brotli
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Fix the introduction part of the specification. 

- window bits can be 10 to 24
- meta block can have 0 length
This commit is contained in:
Zoltan Szabadka 2015-10-06 15:22:18 +02:00
parent c85bb508cb
commit 4d7de651a2
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
docs/draft-alakuijala-brotli-06.nroff
View File

@ -226,7 +226,7 @@ relative LSB position).
2. Compressed representation overview 2. Compressed representation overview
A compressed data set consists of a header and a series of meta- A compressed data set consists of a header and a series of meta-
blocks. Each meta-block decompresses to a sequence of 1 blocks. Each meta-block decompresses to a sequence of 0
to 16,777,216 (16 MiB) uncompressed bytes. The final uncompressed data is to 16,777,216 (16 MiB) uncompressed bytes. The final uncompressed data is
the concatenation of the uncompressed sequences from each meta-block. the concatenation of the uncompressed sequences from each meta-block.
@ -234,8 +234,8 @@ The header contains the size of the sliding window that was used during compress
The decompressor must retain at least that amount of uncompressed data prior to the The decompressor must retain at least that amount of uncompressed data prior to the
current position in the stream, in order to be able to decompress current position in the stream, in order to be able to decompress
what follows. The sliding window size is a power of two, minus 16, where what follows. The sliding window size is a power of two, minus 16, where
the power is in the range of 16 to 24. The possible sliding window the power is in the range of 10 to 24. The possible sliding window
sizes range from 64 KiB - 16 B to 16 MiB - 16 B. sizes range from 1 KiB - 16 B to 16 MiB - 16 B.
Each meta-block is compressed using a combination of the LZ77 Each meta-block is compressed using a combination of the LZ77
algorithm (Lempel-Ziv 1977, [LZ77]) and Huffman coding. The algorithm (Lempel-Ziv 1977, [LZ77]) and Huffman coding. The

6
docs/draft-alakuijala-brotli-06.txt
View File

@ -255,7 +255,7 @@ Internet-Draft Brotli October 2015
2. Compressed representation overview 2. Compressed representation overview
A compressed data set consists of a header and a series of meta- A compressed data set consists of a header and a series of meta-
blocks. Each meta-block decompresses to a sequence of 1 to 16,777,216 blocks. Each meta-block decompresses to a sequence of 0 to 16,777,216
(16 MiB) uncompressed bytes. The final uncompressed data is the (16 MiB) uncompressed bytes. The final uncompressed data is the
concatenation of the uncompressed sequences from each meta-block. concatenation of the uncompressed sequences from each meta-block.
@ -264,8 +264,8 @@ Internet-Draft Brotli October 2015
amount of uncompressed data prior to the current position in the amount of uncompressed data prior to the current position in the
stream, in order to be able to decompress what follows. The sliding stream, in order to be able to decompress what follows. The sliding
window size is a power of two, minus 16, where the power is in the window size is a power of two, minus 16, where the power is in the
range of 16 to 24. The possible sliding window sizes range from 64 range of 10 to 24. The possible sliding window sizes range from 1 KiB
KiB - 16 B to 16 MiB - 16 B. - 16 B to 16 MiB - 16 B.
Each meta-block is compressed using a combination of the LZ77 Each meta-block is compressed using a combination of the LZ77
algorithm (Lempel-Ziv 1977, [LZ77]) and Huffman coding. The result of algorithm (Lempel-Ziv 1977, [LZ77]) and Huffman coding. The result of