| /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...] |
| nfa.cc | 40 // * If anchored is true, only considers matches starting at offset.
51 bool anchored, bool longest,
401 bool anchored, bool longest,
423 anchored |= prog_->anchor_start();
454 fprintf(stderr, "NFA::Search %s (context: %s) anchored=%d longest=%d\n",
455 text.as_string().c_str(), context.as_string().c_str(), anchored,
565 if (!matched_ && (!anchored || p == text.begin())) {
569 if (!anchored && first_byte_ >= 0 && runq->size() == 0 &&
|
| /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/regex-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 | 67 // If "anchored", the match must begin at the start of text.
76 bool anchored, bool want_earliest_match, bool run_forward,
188 // Add kStartAnchored for anchored searches.
255 anchored(false),
267 bool anchored; member in struct:re2::DFA::SearchParams
[all...] |
| nfa.cc | 40 // * If anchored is true, only considers matches starting at offset.
51 bool anchored, bool longest,
401 bool anchored, bool longest,
423 anchored |= prog_->anchor_start();
454 fprintf(stderr, "NFA::Search %s (context: %s) anchored=%d longest=%d\n",
455 text.as_string().c_str(), context.as_string().c_str(), anchored,
565 if (!matched_ && (!anchored || p == text.begin())) {
569 if (!anchored && first_byte_ >= 0 && runq->size() == 0 &&
|
| /external/regex-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/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...] |
| /external/chromium_org/ui/webui/resources/js/cr/ui/ |
| position_util.js | 210 * @param {!HTMLElement} anchorElement The element that the popup is anchored
|
| /external/chromium_org/v8/test/mjsunit/ |
| regexp.js | 633 // Check that end-anchored regexps are optimized correctly.
656 // Anchored at both ends.
680 // Only partially anchored.
|
| /external/pcre/dist/ |
| pcre_dfa_exec.c | 330 external one, possibly multiple times if the pattern is not anchored. The
3194 BOOL utf, anchored, startline, firstline; local
[all...] |
| pcre_exec.c | 6353 BOOL anchored; local
[all...] |
| /external/chromium_org/third_party/polymer/components-chromium/core-component-page/ |
| core-component-page-extracted.js | [all...] |
| /build/tools/droiddoc/templates-sac/assets/js/ |
| android_3p-bundle.js | 541 // ^^ really does mean an anchored match though.
[all...] |
| /build/tools/droiddoc/templates-sdk/assets/js/ |
| android_3p-bundle.js | 541 // ^^ really does mean an anchored match though.
[all...] |
| /build/tools/droiddoc/templates-sdk-dyn/assets/js/ |
| android_3p-bundle.js | 541 // ^^ really does mean an anchored match though.
[all...] |
