| /external/chromium_org/third_party/re2/re2/testing/ |
| H A D | regexp_benchmark.cc | 108 SearchImpl SearchDFA, SearchNFA, SearchOnePass, SearchBitState, member in namespace:re2
325 void Search_Success1_BitState(int i, int n) { SearchSuccess(i, n, ".*.$", SearchBitState); }
360 void Search_Digits_BitState(int i) { SearchDigits(i, SearchBitState); }
847 void SearchBitState(int iters, const char* regexp, const StringPiece& text, function in namespace:re2
854 CHECK_EQ(prog->SearchBitState(text, text, anchor, Prog::kFirstMatch, NULL, 0),
941 CHECK_EQ(prog->SearchBitState(text, text, anchor, Prog::kFirstMatch, NULL, 0),
1009 CHECK(prog->SearchBitState(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4));
1079 CHECK(prog->SearchBitState(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4));
1152 CHECK(prog->SearchBitState(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 2));
1209 CHECK(prog->SearchBitState(tex
[all...] |
| H A D | tester.cc | 372 result->matched = prog_->SearchBitState(text, context, anchor, kind_,
|
| /external/regex-re2/re2/testing/ |
| H A D | regexp_benchmark.cc | 108 SearchImpl SearchDFA, SearchNFA, SearchOnePass, SearchBitState, member in namespace:re2
325 void Search_Success1_BitState(int i, int n) { SearchSuccess(i, n, ".*.$", SearchBitState); }
360 void Search_Digits_BitState(int i) { SearchDigits(i, SearchBitState); }
847 void SearchBitState(int iters, const char* regexp, const StringPiece& text, function in namespace:re2
854 CHECK_EQ(prog->SearchBitState(text, text, anchor, Prog::kFirstMatch, NULL, 0),
941 CHECK_EQ(prog->SearchBitState(text, text, anchor, Prog::kFirstMatch, NULL, 0),
1009 CHECK(prog->SearchBitState(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4));
1079 CHECK(prog->SearchBitState(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4));
1152 CHECK(prog->SearchBitState(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 2));
1209 CHECK(prog->SearchBitState(tex
[all...] |
| H A D | tester.cc | 372 result->matched = prog_->SearchBitState(text, context, anchor, kind_,
|
| /external/chromium_org/third_party/re2/re2/ |
| H A D | bitstate.cc | 7 // Prog::SearchBitState is a regular expression search with submatch
14 // Unlike testing/backtrack.cc, SearchBitState is not recursive
17 // SearchBitState is a fast replacement for the NFA code on small
349 bool Prog::SearchBitState(const StringPiece& text, function in class:re2::Prog
|
| H A D | prog.h | 299 bool SearchBitState(const StringPiece& text, const StringPiece& context,
|
| H A D | re2.cc | 618 // SearchBitState allocates a bit vector of size prog_->size() * text.size().
622 // Conditions for using SearchBitState:
770 if (!prog_->SearchBitState(subtext1, text, anchor,
773 LOG(ERROR) << "SearchBitState inconsistency";
|
| /external/regex-re2/re2/ |
| H A D | bitstate.cc | 7 // Prog::SearchBitState is a regular expression search with submatch
14 // Unlike testing/backtrack.cc, SearchBitState is not recursive
17 // SearchBitState is a fast replacement for the NFA code on small
349 bool Prog::SearchBitState(const StringPiece& text, function in class:re2::Prog
|
| H A D | prog.h | 299 bool SearchBitState(const StringPiece& text, const StringPiece& context,
|
| H A D | re2.cc | 600 // SearchBitState allocates a bit vector of size prog_->size() * text.size().
604 // Conditions for using SearchBitState:
752 if (!prog_->SearchBitState(subtext1, text, anchor,
755 LOG(ERROR) << "SearchBitState inconsistency";
|