HomeSort by relevance Sort by last modified time
    Searched refs:submatch (Results 1 - 19 of 19) sorted by null

  /external/regex-re2/re2/testing/
tester.cc 83 bool have_submatch; // computed all submatch info
84 bool have_submatch0; // computed just submatch[0]
85 StringPiece submatch[kMaxSubmatch]; member in struct:re2::TestInstance::Result
307 result->submatch, nsubmatch);
318 result->submatch, nsubmatch);
337 prog_->SearchDFA(text, context, anchor, kind_, result->submatch,
342 if (!rprog_->SearchDFA(result->submatch[0], context,
344 result->submatch,
363 result->submatch, nsubmatch);
373 result->submatch, nsubmatch)
    [all...]
backtrack.cc 55 StringPiece* submatch, int nsubmatch);
96 StringPiece* submatch, int nsubmatch) {
108 submatch_ = submatch;
  /external/regex-re2/re2/
bitstate.cc 7 // Prog::SearchBitState is a regular expression search with submatch
40 StringPiece* submatch, int nsubmatch);
295 StringPiece* submatch, int nsubmatch) {
308 submatch_ = submatch;
re2.cc 225 // cares about submatch information, but the one-pass
330 // Returns the maximum submatch needed for the rewrite to be done by Replace().
529 StringPiece* submatch,
675 // If only a small amount of text and need submatch
721 submatch[0] = match;
731 // to find submatch locations.
742 if (!prog_->SearchOnePass(subtext1, text, anchor, kind, submatch, ncap)) {
753 kind, submatch, ncap)) {
763 if (!prog_->SearchNFA(subtext1, text, anchor, kind, submatch, ncap)) {
773 submatch[0] = StringPiece(submatch[0].begin() - prefixlen
    [all...]
nfa.cc 16 // over the DFA implementation is that it tracks submatch boundaries.
18 // When the choice of submatch boundaries is ambiguous, this particular
46 // Records submatch boundaries in submatch[1..nsubmatch-1].
47 // Submatch[0] is the entire match. When there is a choice in
48 // which text matches each subexpression, the submatch boundaries
52 StringPiece* submatch, int nsubmatch);
402 StringPiece* submatch, int nsubmatch) {
610 submatch[i].set(match_[2*i], match_[2*i+1] - match_[2*i]);
  /prebuilts/go/darwin-x86/src/regexp/syntax/
doc.go 54 (re) numbered capturing group (submatch)
55 (?P<name>re) named & numbered capturing group (submatch)
  /prebuilts/go/linux-x86/src/regexp/syntax/
doc.go 54 (re) numbered capturing group (submatch)
55 (?P<name>re) named & numbered capturing group (submatch)
  /prebuilts/go/darwin-x86/src/regexp/
regexp.go 27 // Find(All)?(String)?(Submatch)?(Index)?
39 // If 'Submatch' is present, the return value is a slice identifying the
43 // parenthesis. Submatch 0 is the match of the entire expression, submatch 1
48 // the nth submatch. The pair for n==0 identifies the match of the entire
50 // text of the match/submatch. If an index is negative, it means that
133 // submatch choices, and here this package diverges from POSIX.
443 // in Expand, so for instance $1 represents the text of the first submatch.
537 // in Expand, so for instance $1 represents the text of the first submatch.
723 // subexpressions, as defined by the 'Submatch' descriptions in the packag
    [all...]
exec.go 120 // If so, m.matchcap holds the submatch information.
323 // If so, m.matchcap holds the submatch information.
find_test.go 14 // We can derive the textual results from the indexed results, the non-submatch
312 // Now come the Submatch cases.
393 t.Errorf("match %d: submatch error: expected %v got %v: %s", n, expect, result, test)
exec_test.go 51 // submatch indices. An unmatched subexpression formats
290 // Process a single pair. - means no submatch.
backtrack.go 5 // backtrack is a regular expression search with submatch
  /prebuilts/go/linux-x86/src/regexp/
regexp.go 27 // Find(All)?(String)?(Submatch)?(Index)?
39 // If 'Submatch' is present, the return value is a slice identifying the
43 // parenthesis. Submatch 0 is the match of the entire expression, submatch 1
48 // the nth submatch. The pair for n==0 identifies the match of the entire
50 // text of the match/submatch. If an index is negative, it means that
133 // submatch choices, and here this package diverges from POSIX.
443 // in Expand, so for instance $1 represents the text of the first submatch.
537 // in Expand, so for instance $1 represents the text of the first submatch.
723 // subexpressions, as defined by the 'Submatch' descriptions in the packag
    [all...]
exec.go 120 // If so, m.matchcap holds the submatch information.
323 // If so, m.matchcap holds the submatch information.
find_test.go 14 // We can derive the textual results from the indexed results, the non-submatch
312 // Now come the Submatch cases.
393 t.Errorf("match %d: submatch error: expected %v got %v: %s", n, expect, result, test)
exec_test.go 51 // submatch indices. An unmatched subexpression formats
290 // Process a single pair. - means no submatch.
backtrack.go 5 // backtrack is a regular expression search with submatch
  /ndk/tests/device/test-libc++-shared-full/jni/
Android.mk     [all...]
  /ndk/tests/device/test-libc++-static-full/jni/
Android.mk     [all...]

Completed in 219 milliseconds