| /external/regex-re2/re2/testing/ |
| string_generator_test.cc | 1 // Copyright 2008 The RE2 Authors. All Rights Reserved.
11 #include "re2/testing/string_generator.h"
12 #include "re2/testing/regexp_generator.h"
14 namespace re2 { namespace
109 } // namespace re2
|
| tester.h | 1 // Copyright 2008 The RE2 Authors. All Rights Reserved.
11 #include "re2/stringpiece.h"
12 #include "re2/prog.h"
13 #include "re2/regexp.h"
14 #include "re2/re2.h"
17 namespace re2 { namespace
29 kEngineRE2, // RE2, all submatches
30 kEngineRE2a, // RE2, only ask for match[0]
31 kEngineRE2b, // RE2, only ask whether it matche
[all...] |
| dump.cc | 1 // Copyright 2006 The RE2 Authors. All Rights Reserved.
22 #include "re2/stringpiece.h"
23 #include "re2/regexp.h"
28 namespace re2 { namespace
164 } // namespace re2
|
| exhaustive_tester.cc | 1 // Copyright 2008 The RE2 Authors. All Rights Reserved.
22 #include "re2/testing/exhaustive_tester.h"
23 #include "re2/testing/tester.h"
35 namespace re2 { namespace
59 static void PrintResult(const RE2& re, const StringPiece& input, RE2::Anchor anchor, StringPiece *m, int n) {
102 RE2 re(regexp);
103 RE2::Options longest;
105 RE2 relongest(regexp, longest);
112 PrintResult(re, input, RE2::ANCHOR_BOTH, group, ngroup)
[all...] |
| possible_match_test.cc | 1 // Copyright 2006-2008 The RE2 Authors. All Rights Reserved.
7 #include "re2/prog.h"
8 #include "re2/re2.h"
9 #include "re2/regexp.h"
10 #include "re2/testing/regexp_generator.h"
11 #include "re2/testing/string_generator.h"
13 namespace re2 { namespace
119 CHECK(RE2(t.regexp).PossibleMatchRange(&min, &max, t.maxlen));
132 EXPECT_FALSE(RE2("abc").PossibleMatchRange(&min, &max, 0))
[all...] |
| set_test.cc | 1 // Copyright 2010 The RE2 Authors. All Rights Reserved.
10 #include "re2/re2.h"
11 #include "re2/set.h"
13 namespace re2 { namespace
16 RE2::Set s(RE2::DefaultOptions, RE2::UNANCHORED);
42 RE2::Set s(RE2::DefaultOptions, RE2::UNANCHORED)
[all...] |
| /external/regex-re2/util/ |
| sparse_set.h | 1 // Copyright 2006 The RE2 Authors. All Rights Reserved.
52 namespace re2 { namespace
177 } // namespace re2
|
| arena.cc | 1 // Copyright 2000 The RE2 Authors. All Rights Reserved.
7 namespace re2 { namespace
168 } // namespace re2
|
| hash.cc | 1 // Modified by Russ Cox to add "namespace re2".
135 namespace re2 { namespace
231 } // namespace re2
|
| stringpiece.cc | 1 // Copyright 2004 The RE2 Authors. All Rights Reserved.
5 #include "re2/stringpiece.h"
8 using re2::StringPiece;
|
| util.h | 1 // Copyright 2009 The RE2 Authors. All Rights Reserved.
65 namespace re2 { namespace
133 } // namespace re2
|
| pcre.h | 7 // compilation as PCRE in namespace re2.
162 #include "re2/stringpiece.h"
166 namespace re2 { namespace
168 } // namespace re2
170 namespace re2 {
186 } // namespace re2
189 namespace re2 { namespace
244 // you should be using PCRE2 (re2/re2.h)
679 } // namespace re2
[all...] |
| benchmark.cc | 1 // Copyright 2009 The RE2 Authors. All Rights Reserved.
8 #include "re2/re2.h"
13 using namespace re2;
139 if(RE2::PartialMatch(name, argv[i]))
|
| mutex.h | 1 // Copyright 2007 The RE2 Authors. All Rights Reserved.
13 namespace re2 { namespace
209 } // namespace re2
|
| rune.cc | 18 namespace re2 { namespace
258 } // namespace re2
|
| sparse_array_test.cc | 1 // Copyright 2006 The RE2 Authors. All Rights Reserved.
10 namespace re2 { namespace
150 } // namespace re2
|
| /external/v8/test/mjsunit/regress/ |
| regress-603.js | 43 var re2 = /d../; variable
45 Function.prototype.call.call(re2, null, 'abcdefghijklm') + 'z';
|
| /external/regex-re2/re2/ |
| filtered_re2.cc | 1 // Copyright 2009 The RE2 Authors. All Rights Reserved.
7 #include "re2/filtered_re2.h"
8 #include "re2/prefilter.h"
9 #include "re2/prefilter_tree.h"
11 namespace re2 { namespace
24 RE2::ErrorCode FilteredRE2::Add(const StringPiece& pattern,
25 const RE2::Options& options, int* id) {
26 RE2* re = new RE2(pattern, options);
27 RE2::ErrorCode code = re->error_code()
[all...] |
| make_unicode_casefold.py | 4 # Copyright 2008 The RE2 Authors. All Rights Reserved.
18 #include "re2/unicode_casefold.h"
20 namespace re2 {
26 } // namespace re2
|
| parse.cc | 1 // Copyright 2006 The RE2 Authors. All Rights Reserved.
20 #include "re2/regexp.h"
21 #include "re2/stringpiece.h"
22 #include "re2/unicode_casefold.h"
23 #include "re2/unicode_groups.h"
25 namespace re2 { namespace
962 LOG(DFATAL) << "RE2: unexpected op: " << re->op() << " "
1073 Regexp* re2; local
[all...] |
| prefilter.cc | 1 // Copyright 2009 The RE2 Authors. All Rights Reserved.
6 #include "re2/prefilter.h"
7 #include "re2/re2.h"
8 #include "re2/unicode_casefold.h"
9 #include "re2/walker-inl.h"
11 namespace re2 { namespace
703 Prefilter* Prefilter::FromRE2(const RE2* re2) {
704 if (re2 == NULL
[all...] |
| bitstate.cc | 1 // Copyright 2008 The RE2 Authors. All Rights Reserved.
20 #include "re2/prog.h"
21 #include "re2/regexp.h"
23 namespace re2 { namespace
378 } // namespace re2
|
| /external/v8/test/webkit/fast/regex/ |
| toString.js | 31 re2 = eval(re1.toString());
33 return re1.test(string) && re2.test(string);
|
| /external/v8/test/webkit/ |
| regexp-zero-length-alternatives.js | 45 var re2 = new RegExp(/(?:a||z)*/);
46 shouldBe('emptyStr.match(re2)', '[""]');
47 shouldBe('s1.match(re2)', '[""]');
48 shouldBe('s2.match(re2)', '["aaaa"]');
49 shouldBe('s3.match(re2)', '["aa"]');
|
| /external/pcre/dist/ |
| pcrecpp_unittest.cc | 462 RE re2("(\\w+)*b", options_ml);
463 CHECK(re2.PartialMatch(text_good) == false); // because of match_limit
464 CHECK(re2.PartialMatch(text_bad) == false);
465 CHECK(re2.FullMatch(text_good) == false);
466 CHECK(re2.FullMatch(text_bad) == false);
[all...] |
