Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:FindBestMatch (Results 1 - 12 of 12) sorted by null

/external/chromium/sdch/open-vcdiff/src/
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,
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() on a different BlockHash objec     [all...]
blockhash_test.cc	[all...]
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,
/external/chromium_org/sdch/open-vcdiff/src/
vcdiffengine.cc	74 // directly to BlockHash::FindBestMatch; please see that function 84 // When FindBestMatch() comes up with a match for a candidate block, 90 hashed_dictionary_->FindBestMatch(hash_value, 98 target_hash->FindBestMatch(hash_value,
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() on a different BlockHash objec     [all...]
blockhash_test.cc	[all...]
blockhash.cc	337 // number of iterations in FindBestMatch. For example, if the entire 388 // The vast majority of calls to FindBestMatch enter the loop *zero* times, 392 void BlockHash::FindBestMatch(uint32_t hash_value,
/external/open-vcdiff/src/
vcdiffengine.cc	74 // directly to BlockHash::FindBestMatch; please see that function 84 // When FindBestMatch() comes up with a match for a candidate block, 90 hashed_dictionary_->FindBestMatch(hash_value, 98 target_hash->FindBestMatch(hash_value,
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() on a different BlockHash objec     [all...]
blockhash_test.cc	[all...]
blockhash.cc	337 // number of iterations in FindBestMatch. For example, if the entire 388 // The vast majority of calls to FindBestMatch enter the loop *zero* times, 392 void BlockHash::FindBestMatch(uint32_t hash_value,

Completed in 61 milliseconds