| /external/chromium_org/third_party/re2/re2/testing/ |
| H A D | possible_match_test.cc | 16 // PossibleMatchRange doesn't depend on this, but callers probably will.
103 TEST(PossibleMatchRange, HandWritten) {
114 CHECK(prog->PossibleMatchRange(&min, &max, t.maxlen))
119 CHECK(RE2(t.regexp).PossibleMatchRange(&min, &max, t.maxlen));
127 // Test cases where PossibleMatchRange should return false.
128 TEST(PossibleMatchRange, Failures) {
132 EXPECT_FALSE(RE2("abc").PossibleMatchRange(&min, &max, 0));
138 PossibleMatchRange(&min, &max, 10))
141 PossibleMatchRange(&min, &max, 10))
144 PossibleMatchRange(
[all...] |
| /external/regex-re2/re2/testing/ |
| H A D | possible_match_test.cc | 16 // PossibleMatchRange doesn't depend on this, but callers probably will.
103 TEST(PossibleMatchRange, HandWritten) {
114 CHECK(prog->PossibleMatchRange(&min, &max, t.maxlen))
119 CHECK(RE2(t.regexp).PossibleMatchRange(&min, &max, t.maxlen));
127 // Test cases where PossibleMatchRange should return false.
128 TEST(PossibleMatchRange, Failures) {
132 EXPECT_FALSE(RE2("abc").PossibleMatchRange(&min, &max, 0));
138 PossibleMatchRange(&min, &max, 10))
141 PossibleMatchRange(&min, &max, 10))
144 PossibleMatchRange(
[all...] |
| /external/chromium_org/third_party/re2/re2/ |
| H A D | prog.h | 320 // Assuming PossibleMatchRange(&min, &max, N) returns successfully, any
324 // Note that PossibleMatchRange() will only consider the first copy of an
330 bool PossibleMatchRange(string* min, string* max, int maxlen);
|
| H A D | dfa.cc | 87 bool PossibleMatchRange(string* min, string* max, int maxlen);
974 // It is convenient for routines like PossibleMatchRange
1977 bool DFA::PossibleMatchRange(string* min, string* max, int maxlen) { function in class:re2::DFA
1981 // NOTE: if future users of PossibleMatchRange want more precision when
1983 // parameter to PossibleMatchRange.
2118 // PossibleMatchRange for a Prog.
2119 bool Prog::PossibleMatchRange(string* min, string* max, int maxlen) { function in class:re2::Prog
2131 return dfa->PossibleMatchRange(min, max, maxlen);
|
| H A D | re2.h | 414 // Assuming PossibleMatchRange(&min, &max, N) returns successfully, any
418 // Note that PossibleMatchRange() will only consider the first copy of an
424 bool PossibleMatchRange(string* min, string* max, int maxlen) const;
|
| H A D | re2.cc | 481 bool RE2::PossibleMatchRange(string* min, string* max, int maxlen) const { function in class:re2::RE2
501 // Add to prefix min max using PossibleMatchRange on regexp.
504 if (maxlen > 0 && prog_->PossibleMatchRange(&dmin, &dmax, maxlen)) {
508 // prog_->PossibleMatchRange has failed us,
|
| /external/regex-re2/re2/ |
| H A D | prog.h | 320 // Assuming PossibleMatchRange(&min, &max, N) returns successfully, any
324 // Note that PossibleMatchRange() will only consider the first copy of an
330 bool PossibleMatchRange(string* min, string* max, int maxlen);
|
| H A D | dfa.cc | 85 bool PossibleMatchRange(string* min, string* max, int maxlen);
972 // It is convenient for routines like PossibleMatchRange
1975 bool DFA::PossibleMatchRange(string* min, string* max, int maxlen) { function in class:re2::DFA
1979 // NOTE: if future users of PossibleMatchRange want more precision when
1981 // parameter to PossibleMatchRange.
2116 // PossibleMatchRange for a Prog.
2117 bool Prog::PossibleMatchRange(string* min, string* max, int maxlen) { function in class:re2::Prog
2129 return dfa->PossibleMatchRange(min, max, maxlen);
|
| H A D | re2.h | 414 // Assuming PossibleMatchRange(&min, &max, N) returns successfully, any
418 // Note that PossibleMatchRange() will only consider the first copy of an
424 bool PossibleMatchRange(string* min, string* max, int maxlen) const;
|
| H A D | re2.cc | 463 bool RE2::PossibleMatchRange(string* min, string* max, int maxlen) const { function in class:re2::RE2
483 // Add to prefix min max using PossibleMatchRange on regexp.
486 if (maxlen > 0 && prog_->PossibleMatchRange(&dmin, &dmax, maxlen)) {
490 // prog_->PossibleMatchRange has failed us,
|