HomeSort by relevance Sort by last modified time
    Searched refs:PossibleMatchRange (Results 1 - 5 of 5) sorted by null

  /external/regex-re2/re2/testing/
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(&min, &max, 10)
    [all...]
  /external/regex-re2/re2/
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);
dfa.cc 85 bool PossibleMatchRange(string* min, string* max, int maxlen);
    [all...]
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;
    [all...]
re2.cc 463 bool RE2::PossibleMatchRange(string* min, string* max, int maxlen) const {
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,
    [all...]

Completed in 218 milliseconds