Searched refs:kLongestMatch (Results 1 – 6 of 6) sorted by relevance
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/testing/ |
| D | tester.cc | 123 case Prog::kLongestMatch: in FormatKind()
241 if (kind_ == Prog::kLongestMatch) in TestInstance()
262 kind_ != Prog::kLongestMatch) { in TestInstance()
356 Prog::kAnchored, Prog::kLongestMatch, in RunSearch()
611 Prog::kLongestMatch,
|
| D | dfa_test.cc | 108 prog->BuildEntireDFA(Prog::kLongestMatch, nullptr); in TEST()
346 prog->BuildEntireDFA(Prog::kLongestMatch, [&](const int* next, bool match) { in TEST()
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/ |
| D | dfa.cc | 433 if (kind_ == Prog::kLongestMatch) in DFA()
630 (kind_ != Prog::kLongestMatch || !sawmark) && in WorkqToCachedState()
686 if (kind_ == Prog::kLongestMatch) { in WorkqToCachedState()
1812 prog->dfa_longest_ = new DFA(prog, kLongestMatch, prog->dfa_mem_ / 2); in GetDFA()
1814 prog->dfa_longest_ = new DFA(prog, kLongestMatch, prog->dfa_mem_); in GetDFA()
1861 kind = kLongestMatch; in SearchDFA()
1875 kind = kLongestMatch; in SearchDFA()
2127 return GetDFA(kLongestMatch)->PossibleMatchRange(min, max, maxlen); in PossibleMatchRange()
|
| D | re2.cc | 689 kind = Prog::kLongestMatch; in GlobalReplace()
723 Prog::kLongestMatch, matchp, &dfa_failed, NULL)) { in GlobalReplace()
769 Prog::kLongestMatch, &match, &dfa_failed, NULL)) { in GlobalReplace()
|
| D | prog.h | 194 kLongestMatch, // like egrep or POSIX enumerator
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/ |
| D | ucs2.diff | 391 if (kind_ == Prog::kLongestMatch)
|