Lines Matching full:match
53 bool longest_; // whether search wants leftmost-longest match
54 bool endmatch_; // whether match must end at text.end()
201 // One opcode is byte range; the other leads to match.
203 // out1 is the match
209 // out is the match - non-greedy
259 // VLOG(0) << "Found match.";
260 // We found a match. If the caller doesn't care
261 // where the match is, no point going further.
265 // Record best match so far.
276 // If going for first match, we're done.
280 // If we used the entire text, no longer match is possible.
284 // Otherwise, continue on in hope of a longer match.
342 if (TrySearch(prog_->start(), p)) // Match must be leftmost; done.
353 StringPiece* match,
355 // If full match, we ask for an anchored longest match
356 // and then check that match[0] == text.
357 // So make sure match[0] exists.
362 match = &sp0;
371 if (!b.Search(text, context, anchored, longest, match, nmatch))
373 if (kind == kFullMatch && match[0].end() != text.end())
