Lines Matching defs:Search
7 // Prog::BadSearchBacktrack is a backtracking regular expression search,
17 // - It implements unanchored search by repeated anchored search.
32 // Backtracker holds the state for a backtracking search.
34 // Excluding the search parameters, the main search state
47 // and it has the nice benefit of making the search run in linear time.
53 bool Search(const StringPiece& text, const StringPiece& context,
62 // Search parameters
66 bool anchored_; // whether search is anchored at text.begin()
67 bool longest_; // whether search wants leftmost-longest match
68 bool endmatch_; // whether search must end at text.end()
72 // Search state
93 // Runs a backtracking search.
94 bool Backtracker::Search(const StringPiece& text, const StringPiece& context,
123 // to text, so have to reallocate on each call to Search.
129 // Anchored search must start at text.begin().
135 // Unanchored search, starting from each possible text position.
224 // Runs a backtracking search.
243 // Run the search.
247 if (!b.Search(text, context, anchored, longest, match, nmatch))
