| /external/chromium_org/third_party/re2/re2/ |
| filtered_re2.cc | 71 vector<int> regexps; local
72 prefilter_tree_->RegexpsGivenStrings(atoms, ®exps);
73 for (int i = 0; i < regexps.size(); i++)
74 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]]))
75 return regexps[i];
84 vector<int> regexps; local
85 prefilter_tree_->RegexpsGivenStrings(atoms, ®exps);
86 for (int i = 0; i < regexps.size(); i++)
87 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]]))
88 matching_regexps->push_back(regexps[i])
[all...] |
| prefilter_tree.h | 10 // set of regexps that are to be triggered. The 'string matching
37 // Add called sequentially for all regexps. All Add calls
50 // of regexps that should be searched. The matched_atoms should
55 vector<int>* regexps) const;
80 // regexps that are triggered.
81 vector<int> regexps; member in struct:re2::PrefilterTree::Entry
90 // Given the matching atoms, find the regexps to be triggered.
92 IntMap* regexps) const;
115 // indices of regexps that always pass through the filter (since we
116 // found no required literals in these regexps)
[all...] |
| prefilter_tree.cc | 94 // PrefilterTree that call Compile before adding any regexps,
107 // not miss out on any regexps triggering by getting rid of a
285 entry->regexps.push_back(i);
292 vector<int>* regexps) const {
293 regexps->clear();
297 regexps->push_back(i);
310 regexps->push_back(it->index());
312 regexps->insert(regexps->end(), unfiltered_.begin(), unfiltered_.end());
315 sort(regexps->begin(), regexps->end())
370 const vector<int>& regexps = entries_[i].regexps; local
[all...] |
| /external/regex-re2/re2/ |
| filtered_re2.cc | 71 vector<int> regexps; local
72 prefilter_tree_->RegexpsGivenStrings(atoms, ®exps);
73 for (int i = 0; i < regexps.size(); i++)
74 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]]))
75 return regexps[i];
84 vector<int> regexps; local
85 prefilter_tree_->RegexpsGivenStrings(atoms, ®exps);
86 for (int i = 0; i < regexps.size(); i++)
87 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]]))
88 matching_regexps->push_back(regexps[i])
[all...] |
| prefilter_tree.h | 10 // set of regexps that are to be triggered. The 'string matching
34 // Add called sequentially for all regexps. All Add calls
47 // of regexps that should be searched. The matched_atoms should
52 vector<int>* regexps) const;
77 // regexps that are triggered.
78 vector<int> regexps; member in struct:re2::PrefilterTree::Entry
87 // Given the matching atoms, find the regexps to be triggered.
89 IntMap* regexps) const;
112 // indices of regexps that always pass through the filter (since we
113 // found no required literals in these regexps)
[all...] |
| prefilter_tree.cc | 89 // PrefilterTree that call Compile before adding any regexps,
102 // not miss out on any regexps triggering by getting rid of a
278 entry->regexps.push_back(i);
285 vector<int>* regexps) const {
286 regexps->clear();
290 regexps->push_back(i);
303 regexps->push_back(it->index());
305 regexps->insert(regexps->end(), unfiltered_.begin(), unfiltered_.end());
308 sort(regexps->begin(), regexps->end())
363 const vector<int>& regexps = entries_[i].regexps; local
[all...] |
| /external/chromium_org/third_party/re2/re2/testing/ |
| regexp_generator.cc | 181 stack<string> regexps; local
187 regexps.push(post[i]);
190 string a = regexps.top();
191 regexps.pop();
192 regexps.push("(?:" + StringPrintf(post[i].c_str(), a.c_str()) + ")");
196 string b = regexps.top();
197 regexps.pop();
198 string a = regexps.top();
199 regexps.pop();
200 regexps.push("(?:"
[all...] |
| filtered_re2_test.cc | 61 // If any test needs more than this many regexps or atoms, increase
63 const char* regexps[20]; member in struct:re2::AtomTest
133 void AddRegexpsAndCompile(const char* regexps[],
138 v->f.Add(regexps[i], v->opts, &id);
179 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++)
180 if (t->regexps[nregexp] == NULL)
185 AddRegexpsAndCompile(t->regexps, nregexp, &v);
213 // We are using the regexps used in one of the atom tests
218 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++)
219 if (t->regexps[nregexp] == NULL
[all...] |
| exhaustive_tester.h | 16 // Exhaustive regular expression test: generate all regexps within parameters,
41 int regexps() { return regexps_; } function in class:re2::ExhaustiveTester
|
| random_test.cc | 12 DEFINE_int32(regexpcount, 100, "How many random regexps to generate.");
38 printf("%d regexps, %d tests, %d failures [%d/%d str]\n",
39 t.regexps(), t.tests(), t.failures(), maxstrlen, (int)stralphabet.size());
43 // Tests random small regexps involving literals and egrep operators.
50 // Tests random bigger regexps involving literals and egrep operators.
57 // Tests random small regexps involving literals, capturing parens,
65 // Tests random bigger regexps involving literals, capturing parens,
|
| possible_match_test.cc | 161 // Exhaustive test: generate all regexps within parameters,
177 int regexps() { return regexps_; } function in class:re2::PossibleMatchTester
236 LOG(INFO) << t.regexps() << " regexps, "
|
| exhaustive_tester.cc | 25 DEFINE_bool(show_regexps, false, "show regexps during testing");
98 printf("regexps\n");
164 printf("%d regexps, %d tests, %d failures [%d/%d str]\n",
165 t.regexps(), t.tests(), t.failures(), maxstrlen, (int)stralphabet.size());
|
| /external/regex-re2/re2/testing/ |
| regexp_generator.cc | 181 stack<string> regexps; local
187 regexps.push(post[i]);
190 string a = regexps.top();
191 regexps.pop();
192 regexps.push("(?:" + StringPrintf(post[i].c_str(), a.c_str()) + ")");
196 string b = regexps.top();
197 regexps.pop();
198 string a = regexps.top();
199 regexps.pop();
200 regexps.push("(?:"
[all...] |
| filtered_re2_test.cc | 61 // If any test needs more than this many regexps or atoms, increase
63 const char* regexps[20]; member in struct:re2::AtomTest
133 void AddRegexpsAndCompile(const char* regexps[],
138 v->f.Add(regexps[i], v->opts, &id);
179 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++)
180 if (t->regexps[nregexp] == NULL)
185 AddRegexpsAndCompile(t->regexps, nregexp, &v);
213 // We are using the regexps used in one of the atom tests
218 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++)
219 if (t->regexps[nregexp] == NULL
[all...] |
| exhaustive_tester.h | 16 // Exhaustive regular expression test: generate all regexps within parameters,
41 int regexps() { return regexps_; } function in class:re2::ExhaustiveTester
|
| random_test.cc | 12 DEFINE_int32(regexpcount, 100, "How many random regexps to generate.");
38 printf("%d regexps, %d tests, %d failures [%d/%d str]\n",
39 t.regexps(), t.tests(), t.failures(), maxstrlen, (int)stralphabet.size());
43 // Tests random small regexps involving literals and egrep operators.
50 // Tests random bigger regexps involving literals and egrep operators.
57 // Tests random small regexps involving literals, capturing parens,
65 // Tests random bigger regexps involving literals, capturing parens,
|
| possible_match_test.cc | 161 // Exhaustive test: generate all regexps within parameters,
177 int regexps() { return regexps_; } function in class:re2::PossibleMatchTester
236 LOG(INFO) << t.regexps() << " regexps, "
|
| exhaustive_tester.cc | 25 DEFINE_bool(show_regexps, false, "show regexps during testing");
98 printf("regexps\n");
164 printf("%d regexps, %d tests, %d failures [%d/%d str]\n",
165 t.regexps(), t.tests(), t.failures(), maxstrlen, (int)stralphabet.size());
|
| /external/lldb/test/lang/c/function_types/ |
| TestFunctionTypes.py | 91 regexps = ['lib.*\.dylib`printf']
93 regexps = ['printf']
96 patterns = regexps)
|
| /frameworks/webview/chromium/tools/ |
| memreport.py | 67 regexps = {}
69 regexps[region_filter] = re.compile(region_filter)
77 if regexps[region_filter].match(line.rstrip('\r\n')):
|
| /external/chromium_org/v8/test/mjsunit/ |
| regexp-global.js | 152 var regexps = new Array();
157 regexps.push(/a1/g);
161 regexps.push(/\w1/g);
165 regexps.push(/(a)1/g);
169 regexps.push(new RegExp(re_string, "g"));
177 for (var i = 0; i < regexps.length; i++) {
181 assertEquals(result_expectation, subject.replace(regexps[i], replacement));
196 for (var i = 0; i < regexps.length; i++) {
201 assertNull(subject.match(regexps[i]));
203 assertArrayEquals(result_expectation, subject.match(regexps[i]))
[all...] |
| /external/chromium_org/v8/test/webkit/ |
| pretty-print.js | 25 "This test checks that regexps, strings with special characters, object literals with non-identifier names, and array literals are pretty-printed correctly"
|
| gmail-re-re.js | 25 "Bug 7445, bug 7253: Handle Unicode escapes in regexps."
|
| /external/chromium_org/third_party/readability/js/ |
| readability.js | 56 regexps: {
328 curTitle = curTitle.replace( readability.regexps.trim, "" );
560 unlikelyMatchString.search(readability.regexps.unlikelyCandidates) !== -1 &&
561 unlikelyMatchString.search(readability.regexps.okMaybeItsACandidate) === -1 &&
579 if (node.innerHTML.search(readability.regexps.divToPElements) === -1) {
[all...] |
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-45469.js | 28 // Test that global regexps capture and fail in the correct cyclic way.
|
