| /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) {
|
| f_cgroup.c | 47 if (matches(*argv, "match") == 0) {
54 } else if (matches(*argv, "action") == 0) {
62 } else if (matches(*argv, "police") == 0) {
|
| q_qfq.c | 42 if (matches(*argv, "help") == 0) {
66 if (matches(*argv, "weight") == 0) {
72 } else if (matches(*argv, "maxpkt") == 0) {
|
| /external/iproute2/ip/ |
| 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...] |
| /external/chromium/chrome/browser/autocomplete/ |
| 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_org/chrome/browser/autocomplete/ |
| extension_app_provider_unittest.cc | 87 ACMatches matches; local
94 matches = app_provider_->matches();
95 EXPECT_EQ(keyword_cases[i].num_results, matches.size())
97 if (matches.size() == keyword_cases[i].num_results) {
99 EXPECT_EQ(keyword_cases[i].output[j], matches[j].destination_url);
|
| /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/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | 99 /// \brief If the provided matcher matches a node, binds the node to \c ID.
119 /// \brief Matches any node.
125 /// Example: \c DeclarationMatcher(anything()) matches all declarations, e.g.,
138 /// \brief Matches declarations.
140 /// Examples matches \c X, \c C, and the friend declaration inside \c C;
149 /// \brief Matches a declaration of anything that could have a name.
151 /// Example matches \c X, \c S, the anonymous union type, \c i, and \c U;
162 /// \brief Matches a declaration of a namespace.
170 /// matches "namespace {}" and "namespace test {}"
173 /// \brief Matches C++ class declarations
[all...] |
| ASTMatchersMacros.h | 30 // return InnerMatcher.matches(*Node.getMemberDecl(), Finder, Builder);
50 /// The code should return true if 'Node' matches.
56 virtual bool matches(const Type &Node, ASTMatchFinder *Finder, \
64 inline bool internal::matcher_##DefineMatcher##Matcher::matches( \
80 /// The code should return true if 'Node' matches.
93 virtual bool matches(const Type &Node, ASTMatchFinder *Finder, \
106 inline bool internal::matcher_##DefineMatcher##OverloadId##Matcher::matches( \
123 /// The code should return true if 'Node' matches.
138 virtual bool matches(const Type &Node, ASTMatchFinder *Finder, \
154 inline bool internal::matcher_##DefineMatcher##OverloadId##Matcher::matches( \
[all...] |
| /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/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/chrome/browser/bookmarks/ |
| bookmark_index.h | 57 typedef std::vector<Match> Matches;
60 // Used to sort Matches in decreasing order of typed count.
64 // Extracts |matches.nodes| into NodeTypedCountPairs, sorts the pairs in
65 // decreasing order of typed count, and then de-dupes the matches.
66 void SortMatches(const Matches& matches,
78 // count so that the best matches will always be added to the results.
84 // Add |node| to |results| if the node matches the query.
90 // Populates |matches| for the specified term. If |first_term| is true, this
95 Matches* matches)
[all...] |
| /external/chromium_org/components/autofill/core/common/ |
| password_form_fill_data.cc | 34 const content::PasswordFormMap& matches,
61 for (iter = matches.begin(); iter != matches.end(); iter++) {
|
| /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) {
|
| /external/icu4c/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/chrome/browser/resources/options/ |
| language_dictionary_overlay.css | 5 #language-dictionary-overlay-no-matches {
37 #language-dictionary-overlay-word-list.no-search-matches {
|
| /external/chromium_org/extensions/common/matcher/ |
| regex_set_matcher.cc | 39 std::set<StringPattern::ID>* matches) const {
40 size_t old_number_of_matches = matches->size();
59 matches->insert(id);
61 return old_number_of_matches != matches->size();
|
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| SelectorCheckerFastPath.h | 41 bool matches() const;
|
| /external/chromium_org/third_party/WebKit/Source/core/page/ |
| UserContentURLPattern.h | 48 bool matches(const KURL&) const;
|
| /external/chromium_org/tools/android/ |
| find_unused_resources.py | 29 matches = re.finditer(
32 return [m.group('type', 'name') for m in matches]
59 # matches are found.
61 matches = re.finditer(pattern, grep_out)
62 for match in matches:
|
