Lines Matching defs:matches
259 * bytes. With this organization, matches are limited to a distance of
390 uInt matches; /* number of string matches in current block */
454 * most input files: try all possible matches and select the longest.
458 * string matches are performed only when the previous match ends. So it
459 * is preferable to spend more time in matches to allow very fast string
473 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
529 /* 1 */ {4, 4, 8, 4}, /* maximum speed, no lazy matches */
533 /* 4 */ {4, 4, 16, 16}, /* lazy matches */
973 * we prevent matches with the string of window index 0.
1244 * This function does not perform lazy evaluationof matches and inserts
1246 * matches. It is used only for the fast compression options.
1281 /* To simplify the code, we prevent matches with the string
1341 * evaluation for matches: a match is finally adopted only if there is
1379 /* To simplify the code, we prevent matches with the string
1803 s->last_lit = s->matches = 0;
2436 s->matches++;
2461 if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1;