Searched refs:FindBestMatch (Results 1 - 4 of 4) sorted by relevance
/external/chromium/sdch/open-vcdiff/src/ |
H A D | vcdiffengine.cc | 77 // directly to BlockHash::FindBestMatch; please see that function 87 // When FindBestMatch() comes up with a match for a candidate block, 93 hashed_dictionary_->FindBestMatch(hash_value, 101 target_hash->FindBestMatch(hash_value,
|
H A D | blockhash.h | 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() o [all...] |
H A D | blockhash_test.cc | 759 TEST_F(BlockHashTest, FindBestMatch) { 760 dh_->FindBestMatch(hashed_f, 776 th2.FindBestMatch(hashed_f, 795 dh_->FindBestMatch(hash_value, 809 dh_->FindBestMatch(hash_value, 830 many_matches_hash.FindBestMatch(hash_value, 859 dh_->FindBestMatch(hashed_f, 870 // If the footprint passed to FindBestMatch does not actually match 873 dh_->FindBestMatch(hashed_e, // Using hashed value of "e" instead of "f"! 884 // and target data that also contains 1M Qs. If FindBestMatch [all...] |
H A D | blockhash.cc | 336 // number of iterations in FindBestMatch. For example, if the entire 387 // The vast majority of calls to FindBestMatch enter the loop *zero* times, 391 void BlockHash::FindBestMatch(uint32_t hash_value, function in class:open_vcdiff::BlockHash
|
Completed in 68 milliseconds