Lines Matching defs:matches
237 * bytes. With this organization, matches are limited to a distance of
368 uInt matches; /* number of string matches in current block */
432 * most input files: try all possible matches and select the longest.
436 * string matches are performed only when the previous match ends. So it
437 * is preferable to spend more time in matches to allow very fast string
451 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
507 /* 1 */ {4, 4, 8, 4}, /* maximum speed, no lazy matches */
511 /* 4 */ {4, 4, 16, 16}, /* lazy matches */
951 * we prevent matches with the string of window index 0.
1222 * This function does not perform lazy evaluationof matches and inserts
1224 * matches. It is used only for the fast compression options.
1259 /* To simplify the code, we prevent matches with the string
1319 * evaluation for matches: a match is finally adopted only if there is
1357 /* To simplify the code, we prevent matches with the string
1781 s->last_lit = s->matches = 0;
2414 s->matches++;
2439 if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1;