| /external/chromium_org/third_party/re2/re2/testing/ |
| dfa_test.cc | 208 bool matched, failed = false; local
209 matched = prog->SearchDFA(match, NULL,
213 CHECK(matched);
214 matched = prog->SearchDFA(no_match, NULL,
218 CHECK(!matched);
243 bool matched, failed = false; local
244 matched = prog_->SearchDFA(match_, NULL,
248 CHECK(matched);
249 matched = prog_->SearchDFA(no_match_, NULL,
253 CHECK(!matched);
333 bool matched = prog->SearchDFA(t.text, NULL, Prog::kUnanchored, Prog::kFirstMatch, NULL, &failed, NULL); local
[all...] |
| /external/chromium_org/v8/tools/testrunner/server/ |
| signatures.py | 59 matched = (code == 0)
60 if not matched:
63 return matched
|
| /external/proguard/src/proguard/classfile/visitor/ |
| ClassNameFilter.java | 44 * will be matched.
59 * will be matched.
74 * class names will be matched.
|
| /external/regex-re2/re2/testing/ |
| dfa_test.cc | 208 bool matched, failed = false; local
209 matched = prog->SearchDFA(match, NULL,
213 CHECK(matched);
214 matched = prog->SearchDFA(no_match, NULL,
218 CHECK(!matched);
243 bool matched, failed = false; local
244 matched = prog_->SearchDFA(match_, NULL,
248 CHECK(matched);
249 matched = prog_->SearchDFA(no_match_, NULL,
253 CHECK(!matched);
333 bool matched = prog->SearchDFA(t.text, NULL, Prog::kUnanchored, Prog::kFirstMatch, NULL, &failed, NULL); local
[all...] |
| /external/skia/gm/viewer/ |
| module.js | 55 var matched = imageNameRegex.exec(imageName);
57 test: matched[1], config: matched[2],
|
| /external/chromium_org/tools/deep_memory_profiler/lib/ |
| dump.py | 70 matched = self._PATH_PATTERN.match(path)
71 self._pid = int(matched.group(2))
72 self._count = int(matched.group(3))
314 matched = self._HOOK_PATTERN.match(self._lines[ln])
315 if not matched:
321 if matched.group(7) == 'hooked':
322 submatched = self._HOOKED_PATTERN.match(matched.group(8))
324 submatched = self._OLD_HOOKED_PATTERN.match(matched.group(8))
325 elif matched.group(7) == 'unhooked':
326 submatched = self._UNHOOKED_PATTERN.match(matched.group(8)
[all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| RewriteRuleNodeStream.as | 4 /** Queues up nodes matched on left side of -> in a tree parser. This is
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| RewriteRuleNodeStream.js | 1 /** Queues up nodes matched on left side of -> in a tree parser. This is
|
| /external/chromium_org/chrome/app/ |
| signature_validator_win.h | 22 // |expected_hashes|. The cert must be current. If matched, returns true
|
| /external/chromium_org/chrome/browser/resources/app_list/ |
| plugin_manager.js | 83 var matched = recognitionPattern.exec(messageEvent.data);
84 if (matched && matched[1] == 'hotword_ok_google')
85 this.onRecognized_(Number(matched[2]));
|
| /external/chromium_org/chrome/browser/ui/app_list/search/ |
| tokenized_string_match.cc | 14 // the current char of the text to be matched. Different factors are chosen
16 // matched portion is a prefix of both the query and the text, which implies
17 // that the matched chars are at the same position in query and text. This is
25 // Suppose the text to be matched is 'Google Chrome'.
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| quant.h | 50 * @param text the text to be matched
52 * matching. On output, the limit of the matched text. The
53 * number of matched characters is the output value of offset
57 * @param limit the limit index of text to be matched. Greater
|
| /external/oprofile/libregex/ |
| op_regex.h | 64 * expression is matched
79 * been matched by saving the input string and comparing it to the new
86 // when this regexp is matched
88 // replace the matched part with this string
|
| op_regex.cpp | 229 regmatch_t const & matched = get_match(match, local
231 if (matched.rm_so == -1 &&
232 matched.rm_eo == -1) {
234 } else if (matched.rm_so == -1 ||
235 matched.rm_eo == -1) {
239 inserted += str.substr(matched.rm_so,
240 matched.rm_eo - matched.rm_so);
|
| /external/oprofile/libutil++/tests/ |
| glob_filter_tests.cpp | 21 cerr << "\"" << str << "\" matched with " #filter \
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.alg/re.alg.search/ |
| grep.pass.cpp | 32 assert(!m.prefix().matched);
35 assert(!m.suffix().matched);
48 assert(!m.prefix().matched);
51 assert(m.suffix().matched);
|
| /bionic/libc/include/ |
| fnmatch.h | 39 #define FNM_PATHNAME 0x02 /* Slash must be matched by slash. */
40 #define FNM_PERIOD 0x04 /* Period must be matched by period. */
|
| /development/ndk/platforms/android-3/include/ |
| fnmatch.h | 39 #define FNM_PATHNAME 0x02 /* Slash must be matched by slash. */
40 #define FNM_PERIOD 0x04 /* Period must be matched by period. */
|
| /external/chromium_org/chrome/browser/extensions/api/serial/ |
| serial_port_enumerator_unittest.cc | 34 " should have matched at least one pattern";
66 kInvalidNames[i] << " should not have matched " << *j;
|
| /external/sqlite/android/ |
| OldPhoneNumberUtils.cpp | 198 int matched; local
216 matched = 0;
242 ia--; ib--; matched++;
246 if (matched < MIN_MATCH) {
250 // if the number of dialable chars in a and b match, but the matched chars < MIN_MATCH,
252 if (effectiveALen == effectiveBLen && effectiveALen == matched) {
259 // At least one string has matched completely;
260 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) {
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.submatch/re.submatch.members/ |
| compare_value_type_ptr.pass.cpp | 30 sm.matched = true;
43 sm.matched = true;
|
| length.pass.cpp | 29 sm.matched = true;
40 sm.matched = true;
|
| operator_string.pass.cpp | 30 sm.matched = true;
43 sm.matched = true;
|
| str.pass.cpp | 30 sm.matched = true;
43 sm.matched = true;
|
| /packages/apps/Camera/jni/feature_stab/db_vlvm/ |
| db_feature_matching.h | 126 * feature at (x_l[m],y_l[m]) matched to (x_r[n],y_r[n]).
135 * \param id_l indices of left features that matched
136 * \param id_r indices of right features that matched
137 * \param nr_matches number of features actually matched
216 * feature at (x_l[m],y_l[m]) matched to (x_r[n],y_r[n]).
225 * \param id_l indices of left features that matched
226 * \param id_r indices of right features that matched
227 * \param nr_matches number of features actually matched
|
