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

  /external/libcxx/test/re/re.submatch/re.submatch.op/
Android.mk 17 test_makefile := external/libcxx/test/re/re.submatch/re.submatch.op/Android.mk
19 test_name := re/re.submatch/re.submatch.op/compare
23 test_name := re/re.submatch/re.submatch.op/stream
  /external/libcxx/test/re/re.submatch/re.submatch.members/
Android.mk 17 test_makefile := external/libcxx/test/re/re.submatch/re.submatch.members/Android.mk
19 test_name := re/re.submatch/re.submatch.members/default
23 test_name := re/re.submatch/re.submatch.members/compare_string_type
27 test_name := re/re.submatch/re.submatch.members/length
31 test_name := re/re.submatch/re.submatch.members/operator_strin
    [all...]
  /external/libcxx/test/re/re.submatch/
Android.mk 17 test_makefile := external/libcxx/test/re/re.submatch/Android.mk
19 test_name := re/re.submatch/types
  /external/chromium_org/third_party/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/chromium_org/third_party/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 243 // cares about submatch information, but the one-pass
348 // Returns the maximum submatch needed for the rewrite to be done by Replace().
547 StringPiece* submatch,
693 // If only a small amount of text and need submatch
739 submatch[0] = match;
749 // to find submatch locations.
760 if (!prog_->SearchOnePass(subtext1, text, anchor, kind, submatch, ncap)) {
771 kind, submatch, ncap)) {
781 if (!prog_->SearchNFA(subtext1, text, anchor, kind, submatch, ncap)) {
791 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]);

Completed in 353 milliseconds