| /packages/apps/Contacts/src/com/android/contacts/quickcontact/ |
| ResolveCache.java | 134 final List<ResolveInfo> matches = mPackageManager.queryIntentActivities(intent, local
139 final int size = matches.size();
141 bestResolve = matches.get(0);
143 bestResolve = getBestResolve(intent, matches);
167 protected ResolveInfo getBestResolve(Intent intent, List<ResolveInfo> matches) {
181 for (ResolveInfo info : matches) {
192 return firstSystem != null ? firstSystem : matches.get(0);
|
| /external/guava/guava-tests/test/com/google/common/base/ |
| ToStringHelperTest.java | 44 assertTrue(toTest, toTest.matches(".*\\{\\}"));
55 assertTrue(toTest, toTest.matches(".*\\{\\}"));
66 assertTrue(toTest, toTest.matches(".*\\{\\}"));
77 assertTrue(toTest, toTest.matches(".*\\{\\}"));
96 assertTrue(toTest, toTest.matches(".*\\{\\}"));
115 assertTrue(toTest, toTest.matches(".*\\{\\}"));
148 assertTrue(toTest, toTest.matches(".*\\{\\}"));
180 assertTrue(toTest, toTest.matches(".*\\{field1\\=Hello\\}"));
187 assertTrue(toTest, toTest.matches(".*\\{field1\\=42\\}"));
194 assertTrue(toTest, toTest.matches(".*\\{field1\\=null\\}"))
[all...] |
| /external/lldb/source/Symbol/ |
| Variable.cpp | 527 StringList &matches,
536 StringList &matches,
545 StringList &matches,
563 matches,
581 matches,
606 matches,
611 matches.AppendString (prefix_path + member_name);
623 StringList &matches,
649 matches.AppendString (prefix_path);
650 word_complete = matches.GetSize() == 1
[all...] |
| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_index.cc | 46 // count so that the best matches will always be added to the results.
144 Matches matches;
146 if (!GetBookmarksMatchingTerm(terms[i], i == 0, &matches))
151 SortMatches(matches, &sorted_nodes);
155 // matches and so this shouldn't be performance critical.
161 // so that the best matches will always be included in the results. The loop
164 // best matches.
171 void BookmarkIndex::SortMatches(const Matches& matches,
[all...] |
| /external/chromium_org/components/omnibox/ |
| autocomplete_result.cc | 27 // that allows matches of particular types to be demoted in AutocompleteResult.
64 // For equal-relevance matches, we sort alphabetically, so that providers
89 // Sort identical destination_urls together. Place the most relevant matches
101 // whether we're supposed to (and able to) demote all matches with inline
124 // Reserve space for the max number of matches we'll show.
143 // If we've got no matches we can copy everything from the last result.
150 // In hopes of providing a stable popup we try to keep the number of matches
152 // relevant matches) typically result in many successive 'What You Typed'
153 // results filling all the matches, which looks awful.
155 // Instead of starting with the current matches and then adding old matche
[all...] |
| keyword_provider.cc | 26 // Helper functor for Start(), for sorting keyword matches by quality.
34 // always put any exact matches first no matter what, since the code in
235 // Get the best matches for this keyword.
241 TemplateURLService::TemplateURLVector matches;
243 keyword, !remaining_input.empty(), &matches);
245 for (TemplateURLService::TemplateURLVector::iterator i(matches.begin());
246 i != matches.end(); ) {
255 i = matches.erase(i);
264 i = matches.erase(i);
270 if (matches.empty()
[all...] |
| autocomplete_result.h | 21 // All matches from all providers for a particular query. This also tracks
60 // Max number of matches we'll show from the various providers.
66 // Copies matches from |old_matches| to provide a consistant result set. See
72 // Adds a new set of matches to the result set. Does not re-sort.
73 void AppendMatches(const ACMatches& matches);
76 // the best kMaxMatches matches. Sets the default match to the best match
113 // suggested matches. This makes it more likely that users will see and
114 // select useful non-verbatim matches. (Note that hiding the verbatim match
117 // We avoid hiding when the top two matches are both verbatim in order to
132 // Clears the matches for this result set
[all...] |
| /external/iproute2/ip/ |
| 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) {
368 if (matches(*argv, "help") == 0)
446 if (matches(*argv, "add") == 0)
448 if (matches(*argv, "change") == 0 |
[all...] |
| iprule.c | 278 } else if (matches(*argv, "preference") == 0 ||
279 matches(*argv, "order") == 0 ||
280 matches(*argv, "priority") == 0) {
287 matches(*argv, "dsfield") == 0) {
307 } else if (matches(*argv, "realms") == 0) {
313 } else if (matches(*argv, "table") == 0 ||
334 matches(*argv, "map-to") == 0) {
352 if (matches(*argv, "help") == 0)
354 else if (matches(*argv, "goto") == 0) {
361 } else if (matches(*argv, "nop") == 0
[all...] |
| /external/chromium_org/components/url_matcher/ |
| substring_set_matcher.cc | 110 std::set<StringPattern::ID>* matches) const {
111 const size_t old_number_of_matches = matches->size();
114 matches->insert(tree_[0].matches().begin(), tree_[0].matches().end());
126 matches->insert(tree_[current_node].matches().begin(),
127 tree_[current_node].matches().end());
133 return old_number_of_matches != matches->size();
227 tree_[leads_to].AddMatches(tree_[follow_in_case_of_failure].matches());
[all...] |
| /external/iproute2/tc/ |
| q_hfsc.c | 81 if (matches(*argv, "default") == 0) {
91 } else if (matches(*argv, "help") == 0) {
159 if (matches(*argv, "rt") == 0) {
166 } else if (matches(*argv, "ls") == 0) {
173 } else if (matches(*argv, "sc") == 0) {
182 } else if (matches(*argv, "ul") == 0) {
189 } else if (matches(*argv, "help") == 0) {
299 if (matches(*argv, "m1") == 0) {
308 if (matches(*argv, "d") == 0) {
317 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/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
| platform_util.js | 30 *Checks whether the given filter matches the current platform. An undefined
31 * filter always matches the current platform.
33 * @return {boolean} Whether the filter matches the current platform.
|
| /external/chromium_org/third_party/closure_linter/closure_linter/ |
| scopeutil_test.py | 162 matches = set()
166 matches.add(match)
174 matches)
180 matches = set()
186 matches.add(match)
191 matches)
|
| /external/chromium_org/third_party/skia/tools/ |
| test_gpuveto.py | 106 matches = re.findall('[\d]+\.[\d]+', output)
107 if len(matches) != 1:
110 rasterTime = float(matches[0])
121 matches = re.findall('[\d]+\.[\d]+', output)
122 if len(matches) != 1:
125 gpuTime = float(matches[0])
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
| ant-apache-regexp.jar | |
| /external/ltrace/ |
| filter.c | 169 int matches = 0; local
174 if (matches)
178 if (!matches)
185 matches = !matches;
187 if (matches)
|
| /external/skia/tools/ |
| test_gpuveto.py | 106 matches = re.findall('[\d]+\.[\d]+', output)
107 if len(matches) != 1:
110 rasterTime = float(matches[0])
121 matches = re.findall('[\d]+\.[\d]+', output)
122 if len(matches) != 1:
125 gpuTime = float(matches[0])
|
| /external/chromium_org/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_org/components/autofill/core/common/ |
| password_form_fill_data.cc | 34 const PasswordFormMap& matches,
61 for (iter = matches.begin(); iter != matches.end(); iter++) {
|
| /external/chromium_org/third_party/icu/source/common/ |
| dictionarydata.h | 61 * Wrapper class around generic dictionaries, implementing matches().
70 // this should emulate CompactTrieDictionary::matches()
71 virtual int32_t matches(UText *text, int32_t maxLength, int32_t *lengths, int32_t &count,
84 virtual int32_t matches(UText *text, int32_t maxLength, int32_t *lengths, int32_t &count,
101 virtual int32_t matches(UText *text, int32_t maxLength, int32_t *lengths, int32_t &count,
|
| /external/chromium_org/tools/findit/ |
| match_set.py | 108 """Represents a set of matches.
111 matches: A map from CL to a match object.
113 matches_lock: A lock guarding matches dictionary.
118 self.matches = {}
124 for cl in self.matches:
126 del self.matches[cl]
|
| /external/chromium_org/v8/test/webkit/ |
| regexp-in-and-foreach-handling.js | 43 matches = re.exec(str);
45 for (var j = 0; j < matches.length; j++) {
46 if (j in matches) {
47 inArray.push(matches[j]);
58 matches = re.exec(str);
60 matches.forEach(function(m) {
|
