Lines Matching +full:fast +full:- +full:speed

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
48 important than speed, deflate() attempts a complete second search even if
52 modes (level parameter 1 to 3). For these fast modes, new strings
63 that you can decode fast.  The most important characteristic is that shorter
65 short codes fast, and let the long codes take longer to decode.
81 to set that variable for the maximum speed.
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
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.