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

  /external/chromium_org/third_party/re2/re2/
walker-inl.h 60 // WalkExponential, but must be implemented by all clients,
77 T WalkExponential(Regexp* re, T top_arg, int max_visits);
236 template<typename T> T Regexp::Walker<T>::WalkExponential(Regexp* re, T top_arg,
tostring.cc 51 w.WalkExponential(this, PrecToplevel, 100000);
compile.cc 669 // We're using WalkExponential; there should be no copying.
675 // Visits a node quickly; called once WalkExponential has
968 // The call to WalkExponential uses 2*max_inst_ below,
1010 Frag f = c.WalkExponential(sre, NullFrag(), 2*c.max_inst_);
1101 Frag all = c.WalkExponential(re, NullFrag(), 2*c.max_inst_);
    [all...]
prefilter.cc 513 Prefilter::Info* info = w.WalkExponential(re, NULL, 100000);
  /external/regex-re2/re2/
walker-inl.h 60 // WalkExponential, but must be implemented by all clients,
77 T WalkExponential(Regexp* re, T top_arg, int max_visits);
236 template<typename T> T Regexp::Walker<T>::WalkExponential(Regexp* re, T top_arg,
tostring.cc 51 w.WalkExponential(this, PrecToplevel, 100000);
compile.cc 668 // We're using WalkExponential; there should be no copying.
674 // Visits a node quickly; called once WalkExponential has
967 // The call to WalkExponential uses 2*max_inst_ below,
1009 Frag f = c.WalkExponential(sre, kNullFrag, 2*c.max_inst_);
1100 Frag all = c.WalkExponential(re, kNullFrag, 2*c.max_inst_);
    [all...]
prefilter.cc 513 Prefilter::Info* info = w.WalkExponential(re, NULL, 100000);

Completed in 4268 milliseconds