Searched defs:nsubmatch (Results 1 - 4 of 4) sorted by relevance

/external/regex-re2/re2/testing/
H A Dbacktrack.cc55 StringPiece* submatch, int nsubmatch);
96 StringPiece* submatch, int nsubmatch) {
109 nsubmatch_ = nsubmatch;
116 if (nsubmatch < 1) {
94 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
H A Dtester.cc289 int nsubmatch = 1 + num_captures_; // NumCaptures doesn't count $0 local
290 if (nsubmatch > kMaxSubmatch)
291 nsubmatch = kMaxSubmatch;
307 result->submatch, nsubmatch);
318 result->submatch, nsubmatch);
358 nsubmatch > Prog::kMaxOnePassCapture) {
363 result->submatch, nsubmatch);
373 result->submatch, nsubmatch);
396 re_anchor, result->submatch, nsubmatch);
397 result->have_submatch = nsubmatch >
[all...]
/external/regex-re2/re2/
H A Dbitstate.cc40 StringPiece* submatch, int nsubmatch);
295 StringPiece* submatch, int nsubmatch) {
309 nsubmatch_ = nsubmatch;
319 ncap_ = 2*nsubmatch;
293 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
H A Dnfa.cc46 // Records submatch boundaries in submatch[1..nsubmatch-1].
52 StringPiece* submatch, int nsubmatch);
402 StringPiece* submatch, int nsubmatch) {
430 if (nsubmatch < 0) {
431 LOG(DFATAL) << "Bad args: nsubmatch=" << nsubmatch;
436 ncapture_ = 2*nsubmatch;
439 if (nsubmatch == 0) {
609 for (int i = 0; i < nsubmatch; i++)
400 Search(const StringPiece& text, const StringPiece& const_context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument

Completed in 131 milliseconds