Lines Matching defs:Search
7 // Prog::SearchBitState is a regular expression search with submatch
12 // limits the search to run in time linear in the length of the text.
36 // The usual Search prototype.
37 // Can only call Search once per BitState.
38 bool Search(const StringPiece& text, const StringPiece& context,
48 // Search parameters
52 bool anchored_; // whether search is anchored at text.begin()
53 bool longest_; // whether search wants leftmost-longest match
58 // Search state
93 // Should the search visit the pair ip, p?
140 // Try a search from instruction id0 in state p0.
292 // Search text (within context) for prog_.
293 bool BitState::Search(const StringPiece& text, const StringPiece& context,
296 // Search parameters.
328 // Anchored search must start at text.begin().
334 // Unanchored search, starting from each possible text position.
348 // Bit-state search.
367 // Run the search.
371 if (!b.Search(text, context, anchored, longest, match, nmatch))
