Lines Matching refs:Regexp
9 #include "re2/regexp.h"
36 // Create regexp with 2^FLAGS_size states in DFA.
45 Regexp* re = Regexp::Parse(s.c_str(), Regexp::LikePerl, NULL);
60 Regexp* re = Regexp::Parse(s.c_str(), Regexp::LikePerl, NULL);
89 // Create regexp with 2^30 states in DFA.
96 Regexp* re = Regexp::Parse(s.c_str(), Regexp::LikePerl, NULL);
169 // If we run this regexp to search in a string that contains
184 Regexp* re = Regexp::Parse(StringPrintf("0[01]{%d}$", n),
185 Regexp::LikePerl, NULL);
193 // The De Bruijn string is the worst case input for this regexp.
266 Regexp* re = Regexp::Parse(StringPrintf("0[01]{%d}$", n),
267 Regexp::LikePerl, NULL);
310 const char *regexp;
328 Regexp* re = Regexp::Parse(t.regexp, Regexp::LikePerl, NULL);
335 LOG(ERROR) << t.regexp << " on " << t.text << ": want " << t.match;
