HomeSort by relevance Sort by last modified time
    Searched full:best_match (Results 1 - 25 of 36) sorted by null

1 2

  /external/chromium_org/third_party/libphonenumber/src/phonenumbers/geocoding/
mapping_file_provider.cc 128 const string& script, const string& region, string* best_match) const {
135 best_match->swap(normalized_locale_str);
141 best_match->swap(full_locale);
147 *best_match = language;
155 best_match->swap(lang_with_script);
164 best_match->swap(lang_with_region);
168 *best_match = language;
171 best_match->clear();
mapping_file_provider.h 63 string* best_match) const;
  /external/chromium/sdch/open-vcdiff/src/
vcdiffengine.cc 88 // it will populate best_match with the size, source offset,
90 BlockHash::Match best_match; local
97 &best_match);
105 &best_match);
107 if (!ShouldGenerateCopyInstructionForMatchOfSize(best_match.size())) {
110 if (best_match.target_offset() > 0) {
114 coder->Add(unencoded_target_start, best_match.target_offset());
116 coder->Copy(best_match.source_offset(), best_match.size());
117 return best_match.target_offset() // ADD siz
    [all...]
blockhash.h 147 // 1. The best_match->source_offset() returned from FindBestMatch()
151 // starting_offset_ to any best_match->source_offset() value it returns,
225 // of best_match, this function populates *best_match with the
227 // best_match->source_offset() will contain the index of the start of the
230 // best_match->target_offset() will contain the offset of the match
232 // 0 <= best_match->target_offset()
234 // and best_match->size() will contain the size of the match.
235 // If no such match is found, this function leaves *best_match unmodified.
237 // On calling FindBestMatch(), best_match mus
    [all...]
blockhash.cc 395 Match* best_match) const {
433 // than any match already stored in *best_match.
434 best_match->ReplaceIfBetterMatch(match_size,
  /external/chromium_org/sdch/open-vcdiff/src/
vcdiffengine.cc 85 // it will populate best_match with the size, source offset,
87 BlockHash::Match best_match; local
94 &best_match);
102 &best_match);
104 if (!ShouldGenerateCopyInstructionForMatchOfSize(best_match.size())) {
107 if (best_match.target_offset() > 0) {
111 coder->Add(unencoded_target_start, best_match.target_offset());
113 coder->Copy(best_match.source_offset(), best_match.size());
114 return best_match.target_offset() // ADD siz
    [all...]
blockhash.h 147 // 1. The best_match->source_offset() returned from FindBestMatch()
151 // starting_offset_ to any best_match->source_offset() value it returns,
225 // of best_match, this function populates *best_match with the
227 // best_match->source_offset() will contain the index of the start of the
230 // best_match->target_offset() will contain the offset of the match
232 // 0 <= best_match->target_offset()
234 // and best_match->size() will contain the size of the match.
235 // If no such match is found, this function leaves *best_match unmodified.
237 // On calling FindBestMatch(), best_match mus
    [all...]
blockhash.cc 396 Match* best_match) const {
434 // than any match already stored in *best_match.
435 best_match->ReplaceIfBetterMatch(match_size,
  /external/open-vcdiff/src/
vcdiffengine.cc 85 // it will populate best_match with the size, source offset,
87 BlockHash::Match best_match; local
94 &best_match);
102 &best_match);
104 if (!ShouldGenerateCopyInstructionForMatchOfSize(best_match.size())) {
107 if (best_match.target_offset() > 0) {
111 coder->Add(unencoded_target_start, best_match.target_offset());
113 coder->Copy(best_match.source_offset(), best_match.size());
114 return best_match.target_offset() // ADD siz
    [all...]
blockhash.h 147 // 1. The best_match->source_offset() returned from FindBestMatch()
151 // starting_offset_ to any best_match->source_offset() value it returns,
225 // of best_match, this function populates *best_match with the
227 // best_match->source_offset() will contain the index of the start of the
230 // best_match->target_offset() will contain the offset of the match
232 // 0 <= best_match->target_offset()
234 // and best_match->size() will contain the size of the match.
235 // If no such match is found, this function leaves *best_match unmodified.
237 // On calling FindBestMatch(), best_match mus
    [all...]
blockhash.cc 396 Match* best_match) const {
434 // than any match already stored in *best_match.
435 best_match->ReplaceIfBetterMatch(match_size,
  /external/chromium_org/chrome/browser/autocomplete/
bookmark_provider.h 46 // |matches_|. If |best_match| then only suggest the single best match,
48 void DoAutocomplete(const AutocompleteInput& input, bool best_match);
autocomplete_classifier.cc 46 allow_exact_keyword_match, AutocompleteInput::BEST_MATCH));
bookmark_provider.cc 45 // we're looking for BEST_MATCH because none of the BookmarkProvider's
50 ((input.matches_requested() == AutocompleteInput::BEST_MATCH) &&
56 input.matches_requested() == AutocompleteInput::BEST_MATCH);
64 bool best_match) {
112 size_t max_matches = best_match ? 1 : AutocompleteProvider::kMaxMatches;
autocomplete_input.h 39 BEST_MATCH,
133 // If |matches_requested| is BEST_MATCH or SYNCHRONOUS_MATCHES the controller
extension_app_provider_unittest.cc 143 true, AutocompleteInput::BEST_MATCH);
  /external/chromium/chrome/browser/autocomplete/
autocomplete_classifier.cc 28 AutocompleteInput::BEST_MATCH);
builtin_provider.cc 32 (input.matches_requested() == AutocompleteInput::BEST_MATCH))
  /external/chromium/net/http/
http_auth_cache.cc 88 HttpAuthCache::Entry* best_match = NULL; local
103 (!best_match || len > best_match_length)) {
105 best_match = &(*it);
108 return best_match;
  /external/chromium_org/net/http/
http_auth_cache.cc 90 HttpAuthCache::Entry* best_match = NULL; local
105 (!best_match || len > best_match_length)) {
107 best_match = &(*it);
110 return best_match;
  /external/apache-http/src/org/apache/http/client/params/
CookiePolicy.java 60 public static final String BEST_MATCH = "best-match";
HttpClientParams.java 89 return CookiePolicy.BEST_MATCH;
  /external/chromium_org/components/autofill/core/browser/
autofill_field.cc 44 base::string16 best_match; local
49 best_match = field->option_values[i];
57 best_match = field->option_values[i];
61 if (best_match.empty())
64 field->value = best_match;
  /external/chromium_org/net/quic/crypto/
strike_register.cc 151 const uint8* best_match = external_node(best_match_index); local
152 if (memcmp(best_match, value, sizeof(value)) == 0) {
167 best_match = external_node(best_match_index);
170 // Now we need to find the first bit where we differ from |best_match|.
174 new_other_bits = value[differing_byte] ^ best_match[differing_byte];
  /external/chromium_org/printing/
printing_context_mac.mm 255 double best_match = std::numeric_limits<double>::max();
270 if (current_match < best_match) {
272 best_match = current_match;

Completed in 386 milliseconds

1 2