| /external/chromium_org/third_party/re2/re2/testing/ |
| backtrack.cc | 17 // - It implements unanchored search by repeated anchored search.
54 bool anchored, bool longest,
66 bool anchored_; // whether search is anchored at text.begin()
95 bool anchored, bool longest,
105 anchored_ = anchored | prog_->anchor_start();
129 // Anchored search must start at text.begin().
231 // If full match, we ask for an anchored longest match
245 bool anchored = anchor == kAnchored; local
247 if (!b.Search(text, context, anchored, longest, match, nmatch))
|
| /external/chromium_org/third_party/re2/re2/ |
| bitstate.cc | 39 bool anchored, bool longest,
52 bool anchored_; // whether search is anchored at text.begin()
294 bool anchored, bool longest,
305 anchored_ = anchored || prog_->anchor_start();
328 // Anchored search must start at text.begin().
355 // If full match, we ask for an anchored longest match
369 bool anchored = anchor == kAnchored; local
371 if (!b.Search(text, context, anchored, longest, match, nmatch))
|
| dfa.cc | 69 // If "anchored", the match must begin at the start of text.
78 bool anchored, bool want_earliest_match, bool run_forward,
190 // Add kStartAnchored for anchored searches.
257 anchored(false),
269 bool anchored; member in struct:re2::DFA::SearchParams
[all...] |
| /external/mksh/src/ |
| histrap.c | 445 bool anchored = *str == '?' ? (++str, false) : true; local
448 if ((n = findhist(histptr - history - 1, 0, str, anchored)) < 0)
512 findhist(int start, int fwd, const char *str, bool anchored)
524 if ((anchored && strncmp(*hp, str, len) == 0) ||
525 (!anchored && strstr(*hp, str)))
[all...] |
| edit.c | 5023 bool anchored; local
[all...] |
