Lines Matching refs:match
52 kInstAltMatch, // Alt: out_ is [00-FF] and back, out1_ is match; or vice versa.
56 kInstMatch, // found a match!
58 kInstFail, // never match; occasionally unavoidable
113 // Does this inst (an kInstByteRange) match c?
154 // Match ID to identify this match (for re2::Set).
175 kUnanchored, // match anywhere
176 kAnchored, // match only starting at beginning of text
179 // Kind of match to look for (for anchor != kFullMatch)
182 // match but still makes its submatch choices the way
188 // kLongestMatch and then check the length of the match -- but
194 kFullMatch, // match only entire text; implies anchor==kAnchored
250 // Returns true if match found, false if not.
251 // If match found, fills match[0..nmatch-1] with submatch info.
252 // match[0] is overall match, match[1] is first set of parens, etc.
253 // If a particular submatch is not matched during the regexp match,
259 // match anything. Either way, match[i] == NULL.
264 StringPiece* match, int nmatch);
267 // end of match and can use a lot more memory.
268 // Returns whether a match was found.
270 // If matches != NULL and kind == kManyMatch and there is a match,
271 // SearchDFA fills matches with the match IDs of the final matching state.
277 // Build the entire DFA for the given match kind. FOR TESTING ONLY.
295 StringPiece* match, int nmatch);
301 StringPiece* match, int nmatch);
314 StringPiece* match, int nmatch);
321 // string s that is an anchored match for this regexp satisfies
333 // its own Match instruction recording the index in the vector.
