| /external/regex-re2/re2/testing/ |
| dfa_test.cc | 86 // BuildEntireDFA will, like SearchDFA, stop building out
176 TEST(SingleThreaded, SearchDFA) {
209 matched = prog->SearchDFA(match, NULL,
214 matched = prog->SearchDFA(no_match, NULL,
244 matched = prog_->SearchDFA(match_, NULL,
249 matched = prog_->SearchDFA(no_match_, NULL,
263 TEST(Multithreaded, SearchDFA) {
333 bool matched = prog->SearchDFA(t.text, NULL, Prog::kUnanchored, Prog::kFirstMatch, NULL, &failed, NULL);
|
| tester.cc | 327 result->matched = prog_->SearchDFA(text, context, anchor, kind_, NULL,
337 prog_->SearchDFA(text, context, anchor, kind_, result->submatch,
342 if (!rprog_->SearchDFA(result->submatch[0], context,
|
| regexp_benchmark.cc | 108 SearchImpl SearchDFA, SearchNFA, SearchOnePass, SearchBitState,
296 void Search_Success_DFA(int i, int n) { SearchSuccess(i, n, ".*$", SearchDFA); }
322 void Search_Success1_DFA(int i, int n) { SearchSuccess(i, n, ".*.$", SearchDFA); }
355 void Search_Digits_DFA(int i) { SearchDigits(i, SearchDFA); }
801 void SearchDFA(int iters, const char* regexp, const StringPiece& text,
809 CHECK_EQ(prog->SearchDFA(text, NULL, anchor, Prog::kFirstMatch,
[all...] |
| /external/regex-re2/re2/ |
| set.cc | 101 bool ret = prog_->SearchDFA(text, text, Prog::kAnchored,
|
| prog.h | 195 kManyMatch // for SearchDFA, records set of matches
271 // SearchDFA fills matches with the match IDs of the final matching state.
272 bool SearchDFA(const StringPiece& text, const StringPiece& context,
|
| re2.cc | 550 // SearchDFA can do extra optimizations in that case.
614 if (!prog_->SearchDFA(subtext, text, anchor, kind,
637 // SearchDFA set match[0].end() but didn't know where the
643 if (!prog->SearchDFA(match, text, Prog::kAnchored,
699 if (!prog_->SearchDFA(subtext, text, anchor, kind,
[all...] |
| compile.cc | 1124 prog->SearchDFA(sp, sp, Prog::kAnchored, Prog::kManyMatch,
[all...] |
| dfa.cc | [all...] |
