Lines Matching +full:three +full:- +full:level

4 LZ77 (Lempel-Ziv 1977, see reference below). It finds duplicated strings in
19 somewhat similar to the behavior of LZW-based _compress_.)
32 To avoid a worst-case situation, very long hash chains are arbitrarily
33 truncated at a certain length, determined by a runtime option (level
52 modes (level parameter 1 to 3). For these fast modes, new strings
67 inflate() sets up a first level table that covers some number of bits of
71 the value, else it will point to the next level table for which inflate()
77 be a first level table to cover all the way to the longest code.  However,
100 symbol is four bits, then it's duplicated 32 times in a nine-bit table.  If a
121 kbytes.  You can imagine that filling in a 2^15 entry table for a 15-bit code
128 fill out the table vs. the time spent looking at the second level and above of
146 Let's make the first table three bits long (eight entries):
154 110: -> table X (gobble 3 bits)
155 111: -> table Y (gobble 3 bits)
169 Table Y is three bits long since the longest code starting with 111 is six
181 So what we have here are three tables with a total of 20 entries that had to
193 added to the base value.  Or it might be the special end-of-block code.  The
198 Jean-loup Gailly        Mark Adler
206 pp. 337-343.