/external/chromium/chrome/browser/autocomplete/ |
history_quick_provider.cc | 84 // HistoryQuickProvider matches are currently not deletable. 95 ScoredHistoryMatches matches = GetIndex()->HistoryItemsForTerms(terms); local 96 if (matches.empty()) 104 size_t match_num = matches.size() - 1; 105 for (ScoredHistoryMatches::const_iterator match_iter = matches.begin(); 106 match_iter != matches.end(); ++match_iter, --match_num) { 130 // of the URL, or b) there are more than one substring matches in the URL, or 217 const history::TermMatches& matches, 220 if (matches.empty()) { 225 if (matches[0].offset [all...] |
autocomplete_result_unittest.cc | 32 // Adds |count| AutocompleteMatches to |matches|. 35 ACMatches* matches); 37 // Asserts that |result| has |expected_count| matches matching |expected|. 67 ACMatches* matches) { 71 matches->push_back(match); 125 ACMatches matches; local 129 matches.push_back(match); 130 r1.AppendMatches(matches); 164 // Tests that matches are copied correctly from two distinct providers.
|
keyword_provider_unittest.cc | 67 ACMatches matches; local 73 matches = kw_provider_->matches(); 74 EXPECT_EQ(keyword_cases[i].num_results, matches.size()) << 76 if (matches.size() == keyword_cases[i].num_results) { 78 EXPECT_EQ(keyword_cases[i].output[j], matches[j].*member); 97 // Matches should be limited to three, and sorted in quality order, not 107 // Exact matches should prevent returning inexact matches. 185 // Whole keyword should be returned for both exact and inexact matches [all...] |
/external/chromium/webkit/glue/ |
password_form_dom_manager.cc | 35 const PasswordFormMap& matches, 66 for (iter = matches.begin(); iter != matches.end(); iter++) {
|
/external/proguard/src/proguard/classfile/util/ |
WarningPrinter.java | 61 * except if the names of any involved classes matches the given filter. 90 !classFilter.matches(className); 113 !(classFilter.matches(className1) || 114 classFilter.matches(className2));
|
/external/proguard/src/proguard/util/ |
VariableStringMatcher.java | 53 public boolean matches(String string) method in class:VariableStringMatcher 74 if (nextMatcher.matches(string.substring(index))) 86 return nextMatcher.matches(string.substring(maximumLength));
|
/external/iproute2/tc/ |
tc_qdisc.c | 116 } else if (matches(*argv, "estimator") == 0) { 119 } else if (matches(*argv, "stab") == 0) { 123 } else if (matches(*argv, "help") == 0) { 149 if (matches(*argv, "help") == 0) 301 } else if (matches(*argv, "help") == 0) { 338 if (matches(*argv, "add") == 0) 340 if (matches(*argv, "change") == 0) 342 if (matches(*argv, "replace") == 0) 344 if (matches(*argv, "link") == 0) 346 if (matches(*argv, "delete") == 0 [all...] |
m_pedit.c | 287 if (matches(*argv, "invert") == 0) { 289 } else if (matches(*argv, "set") == 0) { 293 } else if (matches(*argv, "preserve") == 0) { 296 if (matches(*argv, "clear") != 0) 302 if (argc && matches(*argv, "retain") == 0) { 360 if (matches(*argv, "u32") == 0) { 365 if (matches(*argv, "u16") == 0) { 370 if (matches(*argv, "u8") == 0) { 383 if (matches(*argv, "at") == 0) { 427 if (matches(*argv, "offset") == 0) [all...] |
q_hfsc.c | 77 if (matches(*argv, "default") == 0) { 87 } else if (matches(*argv, "help") == 0) { 155 if (matches(*argv, "rt") == 0) { 162 } else if (matches(*argv, "ls") == 0) { 169 } else if (matches(*argv, "sc") == 0) { 178 } else if (matches(*argv, "ul") == 0) { 185 } else if (matches(*argv, "help") == 0) { 295 if (matches(*argv, "m1") == 0) { 304 if (matches(*argv, "d") == 0) { 313 if (matches(*argv, "m2") == 0) [all...] |
tc_class.c | 96 } else if (matches(*argv, "estimator") == 0) { 99 } else if (matches(*argv, "help") == 0) { 125 if (matches(*argv, "help") == 0) 276 } else if (matches(*argv, "help") == 0) { 313 if (matches(*argv, "add") == 0) 315 if (matches(*argv, "change") == 0) 317 if (matches(*argv, "replace") == 0) 319 if (matches(*argv, "delete") == 0) 322 if (matches(*argv, "get") == 0) 325 if (matches(*argv, "list") == 0 || matches(*argv, "show") == [all...] |
f_route.c | 61 if (matches(*argv, "to") == 0) { 71 } else if (matches(*argv, "from") == 0) { 81 } else if (matches(*argv, "fromif") == 0) { 92 } else if (matches(*argv, "classid") == 0 || 101 } else if (matches(*argv, "police") == 0) { 108 } else if (matches(*argv, "order") == 0) {
|
tc_stab.c | 60 if (matches(*argv, "help") == 0) { 65 if (matches(*argv, "mtu") == 0) { 73 } else if (matches(*argv, "mpu") == 0) { 81 } else if (matches(*argv, "overhead") == 0) { 89 } else if (matches(*argv, "tsize") == 0) { 97 } else if (matches(*argv, "linklayer") == 0) {
|
/external/iproute2/ip/ |
iplink_vlan.c | 83 if (matches(*argv, "id") == 0) { 88 } else if (matches(*argv, "reorder_hdr") == 0) { 97 } else if (matches(*argv, "gvrp") == 0) { 106 } else if (matches(*argv, "loose_binding") == 0) { 115 } else if (matches(*argv, "ingress-qos-map") == 0) { 121 } else if (matches(*argv, "egress-qos-map") == 0) { 127 } else if (matches(*argv, "help") == 0) {
|
ipmonitor.c | 128 if (matches(*argv, "file") == 0) { 131 } else if (matches(*argv, "link") == 0) { 134 } else if (matches(*argv, "address") == 0) { 137 } else if (matches(*argv, "route") == 0) { 140 } else if (matches(*argv, "prefix") == 0) { 143 } else if (matches(*argv, "neigh") == 0) { 149 } else if (matches(*argv, "help") == 0) {
|
rtmon.c | 79 if (matches(argv[1], "-family") == 0) { 102 } else if (matches(argv[1], "-Version") == 0) { 105 } else if (matches(argv[1], "file") == 0) { 111 } else if (matches(argv[1], "link") == 0) { 114 } else if (matches(argv[1], "address") == 0) { 117 } else if (matches(argv[1], "route") == 0) { 122 } else if (matches(argv[1], "help") == 0) {
|
ipneigh.c | 57 if (matches(arg, "permanent") == 0) 59 else if (matches(arg, "reachable") == 0) 73 else if (matches(arg, "failed") == 0) 117 if (matches(*argv, "lladdr") == 0) { 129 } else if (matches(*argv, "proxy") == 0) { 131 if (matches(*argv, "help") == 0) 145 if (matches(*argv, "help") == 0) { 363 if (matches(*argv, "help") == 0) 439 if (matches(*argv, "add") == 0) 441 if (matches(*argv, "change") == 0 | [all...] |
iprule.c | 265 } else if (matches(*argv, "preference") == 0 || 266 matches(*argv, "order") == 0 || 267 matches(*argv, "priority") == 0) { 274 matches(*argv, "dsfield") == 0) { 294 } else if (matches(*argv, "realms") == 0) { 300 } else if (matches(*argv, "table") == 0 || 321 matches(*argv, "map-to") == 0) { 332 if (matches(*argv, "help") == 0) 334 else if (matches(*argv, "goto") == 0) { 341 } else if (matches(*argv, "nop") == 0 [all...] |
/packages/apps/Contacts/src/com/android/contacts/quickcontact/ |
ResolveCache.java | 131 final List<ResolveInfo> matches = mPackageManager.queryIntentActivities(intent, local 136 final int size = matches.size(); 138 bestResolve = matches.get(0); 140 bestResolve = getBestResolve(intent, matches); 164 protected ResolveInfo getBestResolve(Intent intent, List<ResolveInfo> matches) { 178 for (ResolveInfo info : matches) { 189 return firstSystem != null ? firstSystem : matches.get(0);
|
/external/chromium/chrome/browser/history/ |
query_parser.cc | 34 // Coalesces match positions in |matches| after index that intersect the match 37 Snippet::MatchPositions* matches) { 38 Snippet::MatchPosition& mp = (*matches)[index]; 39 for (Snippet::MatchPositions::iterator i = matches->begin() + index + 1; 40 i != matches->end(); ) { 43 i = matches->erase(i); 50 // Sorts the match positions in |matches| by their first index, then coalesces 52 void CoalseAndSortMatchPositions(Snippet::MatchPositions* matches) { 53 std::sort(matches->begin(), matches->end(), &CompareMatchPosition) [all...] |
url_database_unittest.cc | 142 std::vector<KeywordSearchTermVisit> matches; local 143 GetMostRecentKeywordSearchTerms(keyword_id, keyword, 10, &matches); 144 ASSERT_EQ(1U, matches.size()); 145 ASSERT_EQ(keyword, matches[0].term); 157 matches.clear(); 158 GetMostRecentKeywordSearchTerms(keyword_id, keyword, 10, &matches); 159 ASSERT_EQ(0U, matches.size()); 182 std::vector<KeywordSearchTermVisit> matches; local 183 GetMostRecentKeywordSearchTerms(1, UTF8ToUTF16("visit"), 10, &matches); 184 ASSERT_EQ(0U, matches.size()) [all...] |
/external/proguard/src/proguard/optimize/ |
Optimizer.java | 139 boolean classMarkingFinal = filter.matches(CLASS_MARKING_FINAL); 140 boolean classMergingVertical = filter.matches(CLASS_MERGING_VERTICAL); 141 boolean classMergingHorizontal = filter.matches(CLASS_MERGING_HORIZONTAL); 142 boolean fieldRemovalWriteonly = filter.matches(FIELD_REMOVAL_WRITEONLY); 143 boolean fieldMarkingPrivate = filter.matches(FIELD_MARKING_PRIVATE); 144 boolean fieldPropagationValue = filter.matches(FIELD_PROPAGATION_VALUE); 145 boolean methodMarkingPrivate = filter.matches(METHOD_MARKING_PRIVATE); 146 boolean methodMarkingStatic = filter.matches(METHOD_MARKING_STATIC); 147 boolean methodMarkingFinal = filter.matches(METHOD_MARKING_FINAL); 148 boolean methodRemovalParameter = filter.matches(METHOD_REMOVAL_PARAMETER) [all...] |
/device/samsung/crespo/ |
releasetools.py | 21 matches = [] 24 matches.append(name) 25 if len(matches) > 1: 27 if matches: 28 print "using %s as radio.img" % (matches[0],) 29 return zipfile.read(matches[0])
|
/external/chromium/base/i18n/ |
icu_encoding_detection.cc | 44 const UCharsetMatch** matches = ucsdet_detectAll(detector, local 62 const char* encoding_name = ucsdet_getName(matches[i], &get_name_status); 68 int32_t confidence = ucsdet_getConfidence(matches[i], &get_name_status);
|
/external/chromium/chrome/browser/bookmarks/ |
bookmark_index.h | 59 typedef std::vector<Match> Matches; 62 // Used to sort Matches in decreasing order of typed count. 66 // Extracts |matches.nodes| into NodeTypedCountPairs and sorts the pairs in 68 void SortMatches(const Matches& matches, 80 // count so that the best matches will always be added to the results. 86 // Add |node| to |results| if the node matches the query. 92 // Populates |matches| for the specified term. If |first_term| is true, this 97 Matches* matches); [all...] |
/external/icu4c/common/ |
triedict.h | 87 virtual int32_t matches( UText *text, 160 virtual int32_t matches( UText *text, 198 * <p>Search the dictionary for matches.</p> 291 virtual int32_t matches( UText *text,
|