Searched refs:submatch (Results 1 - 5 of 5) sorted by relevance

/external/regex-re2/re2/testing/
H A Dtester.cc83 bool have_submatch; // computed all submatch info
84 bool have_submatch0; // computed just submatch[0]
85 StringPiece submatch[kMaxSubmatch]; member in struct:re2::TestInstance::Result
307 result->submatch, nsubmatch);
318 result->submatch, nsubmatch);
337 prog_->SearchDFA(text, context, anchor, kind_, result->submatch,
342 if (!rprog_->SearchDFA(result->submatch[0], context,
344 result->submatch,
363 result->submatch, nsubmatch);
373 result->submatch, nsubmatc
[all...]
H A Dbacktrack.cc55 StringPiece* submatch, int nsubmatch);
96 StringPiece* submatch, int nsubmatch) {
108 submatch_ = submatch;
94 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
/external/regex-re2/re2/
H A Dbitstate.cc7 // Prog::SearchBitState is a regular expression search with submatch
40 StringPiece* submatch, int nsubmatch);
295 StringPiece* submatch, int nsubmatch) {
308 submatch_ = submatch;
293 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
H A Dre2.cc225 // cares about submatch information, but the one-pass
330 // Returns the maximum submatch needed for the rewrite to be done by Replace().
529 StringPiece* submatch,
675 // If only a small amount of text and need submatch
721 submatch[0] = match;
731 // to find submatch locations.
742 if (!prog_->SearchOnePass(subtext1, text, anchor, kind, submatch, ncap)) {
753 kind, submatch, ncap)) {
763 if (!prog_->SearchNFA(subtext1, text, anchor, kind, submatch, ncap)) {
773 submatch[
525 Match(const StringPiece& text, int startpos, int endpos, Anchor re_anchor, StringPiece* submatch, int nsubmatch) const argument
[all...]
H A Dnfa.cc16 // over the DFA implementation is that it tracks submatch boundaries.
18 // When the choice of submatch boundaries is ambiguous, this particular
46 // Records submatch boundaries in submatch[1..nsubmatch-1].
48 // which text matches each subexpression, the submatch boundaries
52 StringPiece* submatch, int nsubmatch);
402 StringPiece* submatch, int nsubmatch) {
610 submatch[i].set(match_[2*i], match_[2*i+1] - match_[2*i]);
400 Search(const StringPiece& text, const StringPiece& const_context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument

Completed in 264 milliseconds