Lines Matching full:are
7 length). Distances are limited to 32K bytes, and lengths are limited
13 Literals or match lengths are compressed with one Huffman tree, and
14 match distances are compressed with another tree. The trees are stored
21 Duplicated strings are found using a hash table. All input strings of
22 length 3 are inserted in the hash table. A hash index is computed for
24 strings in the chain are compared with the current input string, and
27 The hash chains are searched starting with the most recent strings, to
29 The hash chains are singly linked. There are no deletions from the
30 hash chains, the algorithm simply discards matches that are too old.
32 To avoid a worst-case situation, very long hash chains are arbitrarily
53 are inserted in the hash table only when no match was found, or
55 but saves time since there are both fewer insertions and fewer searches.
64 codes are much more common than longer codes, so pay attention to decoding the
79 codes are replicated many times in such a table. What inflate() does is
95 looks like. You are correct that it's not a Huffman tree. It is simply a
104 to another similar table for the remaining bits. Again, there are duplicated
113 the above example are gobbled), or it contains the translation for the symbol
181 So what we have here are three tables with a total of 20 entries that had to
216 length). Distances are limited to 32K bytes, and lengths are limited
222 Literals or match lengths are compressed with one Huffman tree, and
223 match distances are compressed with another tree. The trees are stored
230 Duplicated strings are found using a hash table. All input strings of
231 length 3 are inserted in the hash table. A hash index is computed for
233 strings in the chain are compared with the current input string, and
236 The hash chains are searched starting with the most recent strings, to
238 The hash chains are singly linked. There are no deletions from the
239 hash chains, the algorithm simply discards matches that are too old.
241 To avoid a worst-case situation, very long hash chains are arbitrarily
262 are inserted in the hash table only when no match was found, or
264 but saves time since there are both fewer insertions and fewer searches.
273 codes are much more common than longer codes, so pay attention to decoding the
288 codes are replicated many times in such a table. What inflate() does is
304 looks like. You are correct that it's not a Huffman tree. It is simply a
313 to another similar table for the remaining bits. Again, there are duplicated
322 the above example are gobbled), or it contains the translation for the symbol
390 So what we have here are three tables with a total of 20 entries that had to
425 length). Distances are limited to 32K bytes, and lengths are limited
431 Literals or match lengths are compressed with one Huffman tree, and
432 match distances are compressed with another tree. The trees are stored
439 Duplicated strings are found using a hash table. All input strings of
440 length 3 are inserted in the hash table. A hash index is computed for
442 strings in the chain are compared with the current input string, and
445 The hash chains are searched starting with the most recent strings, to
447 The hash chains are singly linked. There are no deletions from the
448 hash chains, the algorithm simply discards matches that are too old.
450 To avoid a worst-case situation, very long hash chains are arbitrarily
471 are inserted in the hash table only when no match was found, or
473 but saves time since there are both fewer insertions and fewer searches.
482 codes are much more common than longer codes, so pay attention to decoding the
497 codes are replicated many times in such a table. What inflate() does is
513 looks like. You are correct that it's not a Huffman tree. It is simply a
522 to another similar table for the remaining bits. Again, there are duplicated
531 the above example are gobbled), or it contains the translation for the symbol
599 So what we have here are three tables with a total of 20 entries that had to