Lines Matching +full:parameter +full:- +full:less

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
34 parameter of deflateInit). So deflate() does not always find the longest
45 The lazy match evaluation is also subject to a runtime parameter. If
52 modes (level parameter 1 to 3). For these fast modes, new strings
68 input less than the length of longest code.  It gets that many bits from the
70 code is that many bits or less and how many, and if it is, it will tell
88 little more than eight bits for 286 symbols and a little less than five bits
100 symbol is four bits, then it's duplicated 32 times in a nine-bit table.  If a
107 compression in the first place.)  For the less frequent long symbols, there
121 kbytes.  You can imagine that filling in a 2^15 entry table for a 15-bit code
154 110: -> table X (gobble 3 bits)
155 111: -> table Y (gobble 3 bits)
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.