Searched defs:matches (Results 251 - 275 of 380) sorted by relevance

<<111213141516

/external/zlib/src/
H A Ddeflate.h119 * bytes. With this organization, matches are limited to a distance of
249 uInt matches; /* number of string matches in current block */ member in struct:internal_state
/external/chromium_org/chrome/browser/autocomplete/
H A Dhistory_url_provider.cc58 // Innermost matches (matches after any scheme or "www.") are better than
59 // non-innermost matches.
80 // Sorts and dedups the given list of matches.
81 void SortAndDedupMatches(history::HistoryMatches* matches) { argument
83 std::sort(matches->begin(), matches->end(), &CompareHistoryMatch);
85 // Remove duplicate matches (caused by the search string appearing in one of
104 for (size_t i = 0; i < matches->size(); ++i) {
105 for (history::HistoryMatches::iterator j(matches
200 CreateOrPromoteMatch(const history::URLRow& info, size_t input_location, bool match_in_scheme, history::HistoryMatches* matches, bool create_if_necessary, bool promote) argument
1071 CullRedirects(history::HistoryBackend* backend, history::HistoryMatches* matches, size_t max_results) const argument
1101 RemoveSubsequentMatchesOf( history::HistoryMatches* matches, size_t source_index, const std::vector<GURL>& remove) const argument
[all...]
H A Dsearch_provider_unittest.cc60 // Returns the first match in |matches| with |allowed_to_be_default_match|
62 ACMatches::const_iterator FindDefaultMatch(const ACMatches& matches) { argument
63 ACMatches::const_iterator it = matches.begin();
64 while ((it != matches.end()) && !it->allowed_to_be_default_match)
205 // fetchers, and waits until the responses have been returned and the matches
220 // with |json|, and expects that the resulting matches' contents equals
221 // that in |matches|. An empty entry in |matches| means no match should
226 const std::string matches[3],
229 // Verifies that |matches| an
338 ACMatches matches; local
507 const ACMatches& matches = provider_->matches(); local
522 CheckMatches(const std::string& description, const size_t num_expected_matches, const ExpectedMatch expected_matches[], const ACMatches& matches) argument
1228 const std::string matches[5]; member in struct:__anon2922
1264 const ACMatches& matches = provider_->matches(); local
1283 const ExpectedMatch matches[6]; member in struct:__anon2923
1527 const KeywordFetcherMatch matches[6]; member in struct:__anon2924
1956 const ACMatches& matches = provider_->matches(); local
2213 const std::string matches[6]; member in struct:__anon2926
2266 const ACMatches& matches = provider_->matches(); local
2384 const ACMatches& matches = provider_->matches(); local
2702 const Match matches[5]; member in struct:__anon2929
2738 const ACMatches& matches = provider_->matches(); local
2791 const Match matches[5]; member in struct:__anon2930
2869 const ACMatches& matches = provider_->matches(); local
2897 const ACMatches& matches = provider_->matches(); local
2920 const Match matches[4]; member in struct:__anon2931
2963 const ACMatches& matches = provider_->matches(); local
3009 const Match matches[5]; member in struct:__anon2932
3069 const ACMatches& matches = provider_->matches(); local
3396 ACMatches matches; local
3431 ACMatches matches; local
[all...]
/external/chromium_org/chrome/browser/password_manager/
H A Dpassword_store_mac.cc59 void FindMatchingItems(std::vector<SecKeychainItemRef>* matches);
407 // TODO(stuartmorgan): We should really be scoring path matches and picking
597 std::vector<PasswordForm*> matches; local
611 matches.push_back(form_with_password.release());
614 return matches;
648 std::vector<SecKeychainItemRef> matches = local
651 for (std::vector<SecKeychainItemRef>::iterator i = matches.begin();
652 i != matches.end(); ++i) {
656 return !matches.empty();
667 std::vector<SecKeychainItemRef> matches; local
775 std::vector<SecKeychainItemRef> matches = MatchingKeychainItems( local
794 std::vector<SecKeychainItemRef> matches; local
[all...]
/external/chromium_org/components/autofill/core/browser/
H A Dform_structure.cc1108 const InputFieldComparator& matches,
1115 if (matches.Run(types[j], *field(i))) {
1106 FillFields( const std::vector<ServerFieldType>& types, const InputFieldComparator& matches, const base::Callback<base::string16(const AutofillType&)>& get_info, const std::string& address_language_code, const std::string& app_locale) argument
/external/chromium_org/components/bookmarks/browser/
H A Dbookmark_model.cc695 std::vector<BookmarkMatch>* matches) {
699 index_->GetBookmarksMatching(text, max_count, matches);
692 GetBookmarksMatching( const base::string16& text, size_t max_count, std::vector<BookmarkMatch>* matches) argument
/external/chromium_org/components/omnibox/
H A Dsearch_provider.cc150 // This function is responsible for scoring verbatim query matches
152 // scores verbatim query matches for extension keywords, as well as
153 // for keyword matches (i.e., suggestions of a keyword itself, not a
156 // couldn't decide in the future to score verbatim matches
186 ACMatches::iterator SearchProvider::FindTopMatch(ACMatches* matches) { argument
187 ACMatches::iterator it = matches->begin();
188 while ((it != matches->end()) && !it->allowed_to_be_default_match)
392 // Ignore suggested scores for non-keyword matches in keyword mode; if the
553 // more matches than we'll ultimately clamp to so that if there are several
554 // recent multi-word matches wh
878 ACMatches matches; local
941 RemoveExtraAnswers(ACMatches* matches) argument
971 AddNavigationResultsToMatches( const SearchSuggestionParser::NavigationResults& navigation_results, ACMatches* matches) argument
1430 ACMatches matches; local
[all...]
/external/chromium_org/components/url_matcher/
H A Durl_matcher.cc589 // matches. Simply checking the presence of key is sufficient, which is done
825 std::set<StringPattern::ID> matches; local
830 condition_factory_.CanonicalizeURLForFullSearches(url), &matches);
835 url_component_matcher_.Match(url_for_component_searches, &matches);
839 condition_factory_.CanonicalizeURLForRegexSearches(url), &matches);
844 &matches);
850 for (std::set<StringPattern::ID>::const_iterator i = matches.begin();
851 i != matches.end(); ++i) {
859 continue; // Not all substring matches are triggers for a condition set.
868 matches, ur
[all...]
/external/chromium_org/google_apis/gaia/
H A Dgaia_auth_fetcher.cc871 UserInfoMap matches; local
875 matches[i->first] = i->second;
877 consumer_->OnGetUserInfoSuccess(matches);
/external/chromium_org/third_party/mesa/src/src/egl/drivers/dri2/
H A Degl_dri2.c335 struct dri2_extension_match *matches,
343 for (j = 0; matches[j].name; j++) {
344 if (strcmp(extensions[i]->name, matches[j].name) == 0 &&
345 extensions[i]->version >= matches[j].version) {
346 field = ((char *) dri2_dpy + matches[j].offset);
354 for (j = 0; matches[j].name; j++) {
355 field = ((char *) dri2_dpy + matches[j].offset);
358 matches[j].name, matches[j].version);
334 dri2_bind_extensions(struct dri2_egl_display *dri2_dpy, struct dri2_extension_match *matches, const __DRIextension **extensions) argument
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/
H A Dcode.c136 static int matches(Go *g1, State *s1, Go *g2, State *s2){ function
182 if(matches(b->go, b->on, g, x))
561 if(b && matches(b->go, b->on, g, to)){
/external/deqp/framework/common/
H A DtcuCommandLine.cpp520 bool matches (const string& caseName, bool allowPrefix=false) const;
568 // component may contain *-wildcards. A pattern component "**" matches zero or
602 bool CasePaths::matches (const string& caseName, bool allowPrefix) const function in class:tcu::CasePaths
863 return m_casePaths->matches(groupName, true);
873 return m_casePaths->matches(caseName, false);
/external/doclava/src/com/google/doclava/
H A DMethodInfo.java732 public boolean matches(MethodInfo other) { method in class:MethodInfo
/external/iptables/iptables/
H A Dip6tables.c193 exit_printhelp(const struct xtables_rule_match *matches) argument
269 print_extension_helps(xtables_targets, matches);
721 make_delete_mask(const struct xtables_rule_match *matches, argument
730 for (matchp = matches; matchp; matchp = matchp->next)
740 for (matchp = matches; matchp; matchp = matchp->next) {
765 struct xtables_rule_match *matches,
772 mask = make_delete_mask(matches, target);
795 struct xtables_rule_match *matches,
802 mask = make_delete_mask(matches, target);
1008 /* some matches do
755 delete_entry(const xt_chainlabel chain, struct ip6t_entry *fw, unsigned int nsaddrs, const struct in6_addr saddrs[], const struct in6_addr smasks[], unsigned int ndaddrs, const struct in6_addr daddrs[], const struct in6_addr dmasks[], int verbose, struct xtc_handle *handle, struct xtables_rule_match *matches, const struct xtables_target *target) argument
790 check_entry(const xt_chainlabel chain, struct ip6t_entry *fw, unsigned int nsaddrs, const struct in6_addr *saddrs, const struct in6_addr *smasks, unsigned int ndaddrs, const struct in6_addr *daddrs, const struct in6_addr *dmasks, bool verbose, struct xtc_handle *handle, struct xtables_rule_match *matches, const struct xtables_target *target) argument
1187 generate_entry(const struct ip6t_entry *fw, struct xtables_rule_match *matches, struct xt_entry_target *target) argument
[all...]
H A Diptables.c187 exit_printhelp(const struct xtables_rule_match *matches) argument
263 print_extension_helps(xtables_targets, matches);
706 make_delete_mask(const struct xtables_rule_match *matches, argument
715 for (matchp = matches; matchp; matchp = matchp->next)
725 for (matchp = matches; matchp; matchp = matchp->next) {
750 struct xtables_rule_match *matches,
757 mask = make_delete_mask(matches, target);
780 struct xtables_rule_match *matches,
787 mask = make_delete_mask(matches, target);
999 /* some matches do
740 delete_entry(const xt_chainlabel chain, struct ipt_entry *fw, unsigned int nsaddrs, const struct in_addr saddrs[], const struct in_addr smasks[], unsigned int ndaddrs, const struct in_addr daddrs[], const struct in_addr dmasks[], int verbose, struct xtc_handle *handle, struct xtables_rule_match *matches, const struct xtables_target *target) argument
775 check_entry(const xt_chainlabel chain, struct ipt_entry *fw, unsigned int nsaddrs, const struct in_addr *saddrs, const struct in_addr *smasks, unsigned int ndaddrs, const struct in_addr *daddrs, const struct in_addr *dmasks, bool verbose, struct xtc_handle *handle, struct xtables_rule_match *matches, const struct xtables_target *target) argument
1178 generate_entry(const struct ipt_entry *fw, struct xtables_rule_match *matches, struct xt_entry_target *target) argument
[all...]
/external/javassist/src/main/javassist/bytecode/
H A DCodeIterator.java1200 int[] matches = new int[npairs];
1203 matches[j] = ByteArray.read32bit(code, i0);
1208 jumps.add(new Lookup(i, defaultbyte, matches, offsets));
1549 int[] matches; field in class:CodeIterator.Lookup
1551 Lookup(int pos, int defaultByte, int[] matches, int[] offsets) { argument
1553 this.matches = matches;
1557 int n = matches.length;
1561 ByteArray.write32bit(matches[i], newcode, dest);
1569 int tableSize() { return 4 + 8 * matches
[all...]
/external/lldb/source/Core/
H A DPluginManager.cpp1368 PluginManager::AutoCompletePlatformName (const char *name, StringList &matches) argument
1381 matches.AppendString (plugin_name.data());
1384 return matches.GetSize();
/external/lldb/source/Expression/
H A DClangExpressionDeclMap.cpp689 const uint32_t matches = sc_list.GetSize(); local
690 for (uint32_t i=0; i<matches; ++i)
713 // named matches for these symbols.
/external/lldb/source/Host/common/
H A DFileSpec.cpp150 FileSpec::ResolvePartialUsername (const char *partial_name, StringList &matches) argument
153 size_t extant_entries = matches.GetSize();
173 matches.AppendString((*pos).c_str());
175 return matches.GetSize() - extant_entries;
/external/lldb/source/Interpreter/
H A DCommandObject.cpp344 // A NULL or empty string matches everything.
357 StringList &matches)
367 matches.AppendString((*matching_cmds).first.c_str());
382 StringList &matches
392 matches.Clear();
427 matches);
429 return matches.GetSize();
440 matches);
356 AddNamesMatchingPartialString(CommandObject::CommandMap &in_map, const char *cmd_str, StringList &matches) argument
/external/lldb/source/Plugins/Disassembler/llvm/
H A DDisassemblerLLVMC.cpp378 ::regmatch_t matches[3]; local
380 if (!::regexec(&s_regex, out_string, sizeof(matches) / sizeof(::regmatch_t), matches, 0))
382 if (matches[1].rm_so != -1)
383 m_opcode_name.assign(out_string + matches[1].rm_so, matches[1].rm_eo - matches[1].rm_so);
384 if (matches[2].rm_so != -1)
385 m_mnemonics.assign(out_string + matches[2].rm_so, matches[
[all...]
/external/mesa3d/src/egl/drivers/dri2/
H A Degl_dri2.c335 struct dri2_extension_match *matches,
343 for (j = 0; matches[j].name; j++) {
344 if (strcmp(extensions[i]->name, matches[j].name) == 0 &&
345 extensions[i]->version >= matches[j].version) {
346 field = ((char *) dri2_dpy + matches[j].offset);
354 for (j = 0; matches[j].name; j++) {
355 field = ((char *) dri2_dpy + matches[j].offset);
358 matches[j].name, matches[j].version);
334 dri2_bind_extensions(struct dri2_egl_display *dri2_dpy, struct dri2_extension_match *matches, const __DRIextension **extensions) argument
/external/sepolicy/tools/
H A Dcheck_seapp.c373 size_t matches = 0; local
410 matches++;
416 if (matches == rmA->length) {
/external/srec/seti/sltsEngine/src/
H A Drun_seq_lts.c88 int matches(LQUESTION *q1, LQUESTION *q2, int type, LDP *dp) ;
1279 int matches(LQUESTION *q1, LQUESTION *q2, int type, LDP *dp) function
1337 if (matches(q1, q2, comb_type, dp)) {
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.equinox.p2.director_2.0.3.R36x_v20101117-1018.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 561 milliseconds

<<111213141516