| /external/chromium_org/third_party/re2/re2/testing/ |
| H A D | 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();
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))
94 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
|
| /external/regex-re2/re2/testing/ |
| H A D | 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();
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))
94 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
|
| /external/chromium_org/third_party/re2/re2/ |
| H A D | 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();
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))
293 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
|
| H A D | 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 &&
400 Search(const StringPiece& text, const StringPiece& const_context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
|
| H A D | 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
1591 // The first factor is whether the search is anchored or not.
1593 // two different entry points: one for anchored searches and one for
1595 // and then jumps to the anchored one.)
1610 // Examines text, context, and anchored to determine the right start
1656 if (params->anchored || prog
1749 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool want_earliest_match, bool run_forward, bool* failed, const char** epp, vector<int>* matches) argument
[all...] |
| /external/regex-re2/re2/ |
| H A D | 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();
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))
293 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
|
| H A D | 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 &&
400 Search(const StringPiece& text, const StringPiece& const_context, bool anchored, bool longest, StringPiece* submatch, int nsubmatch) argument
|
| H A D | 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
1589 // The first factor is whether the search is anchored or not.
1591 // two different entry points: one for anchored searches and one for
1593 // and then jumps to the anchored one.)
1608 // Examines text, context, and anchored to determine the right start
1654 if (params->anchored || prog
1747 Search(const StringPiece& text, const StringPiece& context, bool anchored, bool want_earliest_match, bool run_forward, bool* failed, const char** epp, vector<int>* matches) argument
[all...] |
| /external/mksh/src/ |
| H A D | 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) argument
524 if ((anchored && strncmp(*hp, str, len) == 0) ||
525 (!anchored && strstr(*hp, str)))
|
| H A D | edit.c | 1965 /* anchored search up from current line */
1972 /* anchored search down from current line */
1979 /* anchored search in the indicated direction */
5023 bool anchored; local
5031 anchored = *pat == '^' ? (++pat, true) : false;
5032 if ((hist = findhist(start, fwd, pat, anchored)) < 0) {
|
| /external/pcre/dist/ |
| H A D | pcre_dfa_exec.c | 330 external one, possibly multiple times if the pattern is not anchored. The
3154 is not anchored.
3194 BOOL utf, anchored, startline, firstline; local
3270 anchored = (options & (PCRE_ANCHORED|PCRE_DFA_RESTART)) != 0 ||
3381 never set for an anchored regular expression, but the anchoring may be forced
3386 if (!anchored)
3409 /* For anchored or unanchored matches, there may be a "last known required
3426 /* Call the main matching function, looping for a non-anchored regex after a
3627 on only if not anchored. */
3629 if (rc != PCRE_ERROR_NOMATCH || anchored)
[all...] |
| H A D | pcre_exec.c | 6353 BOOL anchored; local
6533 anchored = ((re->options | options) & PCRE_ANCHORED) != 0;
6680 never set for an anchored regular expression, but the anchoring may be forced
6685 if (!anchored)
6706 /* For anchored or unanchored matches, there may be a "last known required
6726 /* Loop for handling unanchored repeated matching attempts; for anchored regexs
6997 /* Break the loop if the pattern is anchored or if we have passed the end of
7000 if (anchored || start_match > end_subject) break;
7027 (1) The pattern is anchored or the match was failed by (*COMMIT);
|