Lines Matching refs:FindBestMatch
59 // match length that is guaranteed to be found in FindBestMatch(),
62 // Computational effort in FindBestMatch (which is the inner loop of
70 // memory/CPU and the effectiveness of FindBestMatch().
76 // This class is used to store the best match found by FindBestMatch()
105 // data at target_start, which is an argument of FindBestMatch().
147 // 1. The best_match->source_offset() returned from FindBestMatch()
150 // is equal to the dictionary size. FindBestMatch() will add
210 // FindBestMatch takes a position within the unencoded target data
237 // On calling FindBestMatch(), best_match must
240 // when calling FindBestMatch() on a different BlockHash object
247 // bh1.FindBestMatch(hash_value,
252 // bh2.FindBestMatch(hash_value,
263 // (rather than calculated within FindBestMatch) in order to take
281 // 4: best_match->source_offset() (after calling FindBestMatch)
282 // 5: best_match->target_offset() (after calling FindBestMatch)
284 // Under these conditions, FindBestMatch will find a matching
294 void FindBestMatch(uint32_t hash_value,
301 // FindBestMatch() will not process more than this number
310 // BlockHash::FindBestMatch over the number of matches (up to a maximum
319 // the number of true matches per call to FindBestMatch() did not exceed 78;
