Home
last modified time | relevance | path

Searched refs:regexps (Results 1 – 25 of 46) sorted by relevance

12

/external/chromium_org/third_party/re2/re2/testing/
Dregexp_generator.cc181 stack<string> regexps; in RunPostfix() local
187 regexps.push(post[i]); in RunPostfix()
190 string a = regexps.top(); in RunPostfix()
191 regexps.pop(); in RunPostfix()
192 regexps.push("(?:" + StringPrintf(post[i].c_str(), a.c_str()) + ")"); in RunPostfix()
196 string b = regexps.top(); in RunPostfix()
197 regexps.pop(); in RunPostfix()
198 string a = regexps.top(); in RunPostfix()
199 regexps.pop(); in RunPostfix()
200 regexps.push("(?:" + in RunPostfix()
[all …]
Dfiltered_re2_test.cc63 const char* regexps[20]; member
133 void AddRegexpsAndCompile(const char* regexps[], in AddRegexpsAndCompile() argument
138 v->f.Add(regexps[i], v->opts, &id); in AddRegexpsAndCompile()
179 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++) in TEST()
180 if (t->regexps[nregexp] == NULL) in TEST()
185 AddRegexpsAndCompile(t->regexps, nregexp, &v); in TEST()
218 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++) in TEST()
219 if (t->regexps[nregexp] == NULL) in TEST()
221 AddRegexpsAndCompile(t->regexps, nregexp, &v); in TEST()
237 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++) in TEST()
[all …]
Dpossible_match_test.cc177 int regexps() { return regexps_; } in regexps() function in re2::PossibleMatchTester
236 LOG(INFO) << t.regexps() << " regexps, " in TEST()
Drandom_test.cc39 t.regexps(), t.tests(), t.failures(), maxstrlen, (int)stralphabet.size()); in RandomTest()
Dexhaustive_tester.h41 int regexps() { return regexps_; } in regexps() function
Dexhaustive_tester.cc165 t.regexps(), t.tests(), t.failures(), maxstrlen, (int)stralphabet.size()); in ExhaustiveTest()
/external/regex-re2/re2/testing/
Dregexp_generator.cc181 stack<string> regexps; in RunPostfix() local
187 regexps.push(post[i]); in RunPostfix()
190 string a = regexps.top(); in RunPostfix()
191 regexps.pop(); in RunPostfix()
192 regexps.push("(?:" + StringPrintf(post[i].c_str(), a.c_str()) + ")"); in RunPostfix()
196 string b = regexps.top(); in RunPostfix()
197 regexps.pop(); in RunPostfix()
198 string a = regexps.top(); in RunPostfix()
199 regexps.pop(); in RunPostfix()
200 regexps.push("(?:" + in RunPostfix()
[all …]
Dfiltered_re2_test.cc63 const char* regexps[20]; member
133 void AddRegexpsAndCompile(const char* regexps[], in AddRegexpsAndCompile() argument
138 v->f.Add(regexps[i], v->opts, &id); in AddRegexpsAndCompile()
179 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++) in TEST()
180 if (t->regexps[nregexp] == NULL) in TEST()
185 AddRegexpsAndCompile(t->regexps, nregexp, &v); in TEST()
218 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++) in TEST()
219 if (t->regexps[nregexp] == NULL) in TEST()
221 AddRegexpsAndCompile(t->regexps, nregexp, &v); in TEST()
237 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++) in TEST()
[all …]
Dpossible_match_test.cc177 int regexps() { return regexps_; } in regexps() function in re2::PossibleMatchTester
236 LOG(INFO) << t.regexps() << " regexps, " in TEST()
Drandom_test.cc39 t.regexps(), t.tests(), t.failures(), maxstrlen, (int)stralphabet.size()); in RandomTest()
Dexhaustive_tester.h41 int regexps() { return regexps_; } in regexps() function
Dexhaustive_tester.cc165 t.regexps(), t.tests(), t.failures(), maxstrlen, (int)stralphabet.size()); in ExhaustiveTest()
/external/regex-re2/re2/
Dfiltered_re2.cc71 vector<int> regexps; in FirstMatch() local
72 prefilter_tree_->RegexpsGivenStrings(atoms, &regexps); in FirstMatch()
73 for (int i = 0; i < regexps.size(); i++) in FirstMatch()
74 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]])) in FirstMatch()
75 return regexps[i]; in FirstMatch()
84 vector<int> regexps; in AllMatches() local
85 prefilter_tree_->RegexpsGivenStrings(atoms, &regexps); in AllMatches()
86 for (int i = 0; i < regexps.size(); i++) in AllMatches()
87 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]])) in AllMatches()
88 matching_regexps->push_back(regexps[i]); in AllMatches()
Dprefilter_tree.cc278 entry->regexps.push_back(i); in AssignUniqueIds()
285 vector<int>* regexps) const { in RegexpsGivenStrings()
286 regexps->clear(); in RegexpsGivenStrings()
290 regexps->push_back(i); in RegexpsGivenStrings()
303 regexps->push_back(it->index()); in RegexpsGivenStrings()
305 regexps->insert(regexps->end(), unfiltered_.begin(), unfiltered_.end()); in RegexpsGivenStrings()
308 sort(regexps->begin(), regexps->end()); in RegexpsGivenStrings()
312 IntMap* regexps) const { in PropagateMatch()
321 for (int i = 0; i < entry.regexps.size(); i++) { in PropagateMatch()
322 VLOG(10) << "Regexp triggered: " << entry.regexps[i]; in PropagateMatch()
[all …]
Dprefilter_tree.h52 vector<int>* regexps) const;
78 vector<int> regexps; member
89 IntMap* regexps) const;
/external/chromium_org/third_party/re2/re2/
Dfiltered_re2.cc71 vector<int> regexps; in FirstMatch() local
72 prefilter_tree_->RegexpsGivenStrings(atoms, &regexps); in FirstMatch()
73 for (int i = 0; i < regexps.size(); i++) in FirstMatch()
74 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]])) in FirstMatch()
75 return regexps[i]; in FirstMatch()
84 vector<int> regexps; in AllMatches() local
85 prefilter_tree_->RegexpsGivenStrings(atoms, &regexps); in AllMatches()
86 for (int i = 0; i < regexps.size(); i++) in AllMatches()
87 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]])) in AllMatches()
88 matching_regexps->push_back(regexps[i]); in AllMatches()
Dprefilter_tree.cc285 entry->regexps.push_back(i); in AssignUniqueIds()
292 vector<int>* regexps) const { in RegexpsGivenStrings()
293 regexps->clear(); in RegexpsGivenStrings()
297 regexps->push_back(i); in RegexpsGivenStrings()
310 regexps->push_back(it->index()); in RegexpsGivenStrings()
312 regexps->insert(regexps->end(), unfiltered_.begin(), unfiltered_.end()); in RegexpsGivenStrings()
315 sort(regexps->begin(), regexps->end()); in RegexpsGivenStrings()
319 IntMap* regexps) const { in PropagateMatch()
328 for (int i = 0; i < entry.regexps.size(); i++) { in PropagateMatch()
329 VLOG(10) << "Regexp triggered: " << entry.regexps[i]; in PropagateMatch()
[all …]
Dprefilter_tree.h55 vector<int>* regexps) const;
81 vector<int> regexps; member
92 IntMap* regexps) const;
/external/chromium_org/v8/test/mjsunit/
Dregexp-global.js152 var regexps = new Array(); variable
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]));
/external/chromium_org/third_party/re2/patches/
Dre2-memory-optimization.patch5 // not miss out on any regexps triggering by getting rid of a
96 const vector<int>& regexps = entries_[i].regexps;
98 << " N: " << parents->size() << " R: " << regexps.size();
133 // regexps that are triggered.
/external/chromium_org/tools/android/memdump/
Dmemreport.py51 regexps = {}
53 regexps[region_filter] = re.compile(region_filter)
61 if regexps[region_filter].match(line.rstrip('\r\n')):
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/performance_tests/
Dperftest.py225 def _should_ignore_line(regexps, line): argument
228 for regexp in regexps:
/external/chromium_org/v8/test/webkit/
Dgmail-re-re-expected.txt24 Bug 7445, bug 7253: Handle Unicode escapes in regexps.
Dpretty-print-expected.txt24 This test checks that regexps, strings with special characters, object literals with non-identifier…
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/
DTODO12 - regexps

12