Lines Matching refs:matches
362 * bytes. With this organization, matches are limited to a distance of
493 uInt matches; /* number of string matches in current block */
554 * most input files: try all possible matches and select the longest.
558 * string matches are performed only when the previous match ends. So it
559 * is preferable to spend more time in matches to allow very fast string
573 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
668 /* 1 */ {4, 4, 8, 4, deflate_fast}, /* maximum speed, no lazy matches */
672 /* 4 */ {4, 4, 16, 16, deflate_slow}, /* lazy matches */
1282 * we prevent matches with the string of window index 0.
1309 /* Do not look for matches beyond the end of the input. This is necessary
1620 * This function does not perform lazy evaluation of matches and inserts
1622 * matches. It is used only for the fast compression options.
1656 /* To simplify the code, we prevent matches with the string
1714 * evaluation for matches: a match is finally adopted only if there is
1753 /* To simplify the code, we prevent matches with the string
2179 s->last_lit = s->matches = 0;
2806 s->matches++;
2831 if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1;