Lines Matching refs:long

32 To avoid a worst-case situation, very long hash chains are arbitrarily
35 possible match but generally finds a match which is long enough.
46 the current match is long enough, deflate() reduces the search for a longer
49 the first match is already long enough.
54 when the match is not too long. This degrades the compression ratio
65 short codes fast, and let the long codes take longer to decode.
97 symbol could be as short as one bit or as long as 15 bits.  If a particular
101 symbol is nine bits long, it appears in the table once.
107 compression in the first place.)  For the less frequent long symbols, there
108 will be two lookups.  If you had a compression method with really long
122 would take too long if you're only decoding several thousand symbols.  At the
133 The code being decoded, with 10 symbols, from 1 to 6 bits long:
146 Let's make the first table three bits long (eight entries):
161 Table X is two bits long since the longest code starting with 110 is five bits
162 long:
169 Table Y is three bits long since the longest code starting with 111 is six
170 bits long: