| /external/chromium_org/third_party/re2/re2/testing/ |
| parse_test.cc | 10 #include "re2/regexp.h"
14 static const Regexp::ParseFlags TestZeroFlags = Regexp::ParseFlags(1<<30);
17 const char* regexp; member in struct:re2::Test
19 Regexp::ParseFlags flags;
22 static Regexp::ParseFlags kTestFlags = Regexp::MatchNL |
23 Regexp::PerlX |
24 Regexp::PerlClasses |
25 Regexp::UnicodeGroups
[all...] |
| null_walker.cc | 6 #include "re2/regexp.h"
13 class NullWalker : public Regexp::Walker<bool> {
16 bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
19 bool ShortVisit(Regexp* re, bool a) {
33 bool NullWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
39 void Regexp::NullWalk() {
|
| regexp_test.cc | 10 #include "re2/regexp.h"
15 TEST(Regexp, BigRef) {
16 Regexp* re;
17 re = Regexp::Parse("x", Regexp::NoParseFlags, NULL);
28 TEST(Regexp, BigConcat) {
29 Regexp* x;
30 x = Regexp::Parse("x", Regexp::NoParseFlags, NULL);
31 vector<Regexp*> v(90000, x); // ToString bails out at 10000
[all...] |
| mimics_pcre_test.cc | 7 #include "re2/regexp.h"
12 const char* regexp; member in struct:re2::PCRETest
63 Regexp::ParseFlags flags = Regexp::LikePerl;
65 flags = flags | Regexp::Latin1;
66 Regexp* re = Regexp::Parse(t.regexp, flags, NULL);
67 CHECK(re) << " " << t.regexp;
69 << " " << t.regexp << " "
[all...] |
| required_prefix_test.cc | 6 #include "re2/regexp.h"
11 const char* regexp; member in struct:re2::PrefixTest
19 // If the regexp is missing a ^, there's no required prefix.
24 // If the regexp immediately goes into
43 Regexp::ParseFlags flags = Regexp::LikePerl;
45 flags = flags | Regexp::Latin1;
46 Regexp* re = Regexp::Parse(t.regexp, flags, NULL)
[all...] |
| simplify_test.cc | 10 #include "re2/regexp.h"
15 const char* regexp; member in struct:re2::Test
144 VLOG(1) << "Testing " << tests[i].regexp;
145 Regexp* re = Regexp::Parse(tests[i].regexp,
146 Regexp::MatchNL | (Regexp::LikePerl &
147 ~Regexp::OneLine),
149 CHECK(re != NULL) << " " << tests[i].regexp << " " << status.Text()
[all...] |
| compile_test.cc | 10 #include "re2/regexp.h"
18 // the regexp compiles to the expected code.
24 const char* regexp; member in struct:re2::Test
108 Regexp* re = Regexp::Parse(t.regexp, Regexp::PerlX|Regexp::Latin1, NULL);
110 LOG(ERROR) << "Cannot parse: " << t.regexp;
116 LOG(ERROR) << "Cannot compile: " << t.regexp;
[all...] |
| /external/regex-re2/re2/testing/ |
| parse_test.cc | 10 #include "re2/regexp.h"
14 static const Regexp::ParseFlags TestZeroFlags = Regexp::ParseFlags(1<<30);
17 const char* regexp; member in struct:re2::Test
19 Regexp::ParseFlags flags;
22 static Regexp::ParseFlags kTestFlags = Regexp::MatchNL |
23 Regexp::PerlX |
24 Regexp::PerlClasses |
25 Regexp::UnicodeGroups
[all...] |
| null_walker.cc | 6 #include "re2/regexp.h"
13 class NullWalker : public Regexp::Walker<bool> {
16 bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
19 bool ShortVisit(Regexp* re, bool a) {
33 bool NullWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
39 void Regexp::NullWalk() {
|
| regexp_test.cc | 10 #include "re2/regexp.h"
15 TEST(Regexp, BigRef) {
16 Regexp* re;
17 re = Regexp::Parse("x", Regexp::NoParseFlags, NULL);
28 TEST(Regexp, BigConcat) {
29 Regexp* x;
30 x = Regexp::Parse("x", Regexp::NoParseFlags, NULL);
31 vector<Regexp*> v(90000, x); // ToString bails out at 10000
[all...] |
| mimics_pcre_test.cc | 7 #include "re2/regexp.h"
12 const char* regexp; member in struct:re2::PCRETest
63 Regexp::ParseFlags flags = Regexp::LikePerl;
65 flags = flags | Regexp::Latin1;
66 Regexp* re = Regexp::Parse(t.regexp, flags, NULL);
67 CHECK(re) << " " << t.regexp;
69 << " " << t.regexp << " "
[all...] |
| required_prefix_test.cc | 6 #include "re2/regexp.h"
11 const char* regexp; member in struct:re2::PrefixTest
19 // If the regexp is missing a ^, there's no required prefix.
24 // If the regexp immediately goes into
43 Regexp::ParseFlags flags = Regexp::LikePerl;
45 flags = flags | Regexp::Latin1;
46 Regexp* re = Regexp::Parse(t.regexp, flags, NULL)
[all...] |
| simplify_test.cc | 10 #include "re2/regexp.h"
15 const char* regexp; member in struct:re2::Test
144 VLOG(1) << "Testing " << tests[i].regexp;
145 Regexp* re = Regexp::Parse(tests[i].regexp,
146 Regexp::MatchNL | (Regexp::LikePerl &
147 ~Regexp::OneLine),
149 CHECK(re != NULL) << " " << tests[i].regexp << " " << status.Text()
[all...] |
| /external/chromium_org/third_party/re2/re2/ |
| simplify.cc | 10 #include "re2/regexp.h"
15 // Parses the regexp src and then simplifies it and sets *dst to the
18 bool Regexp::SimplifyRegexp(const StringPiece& src, ParseFlags flags,
21 Regexp* re = Parse(src, flags, status);
24 Regexp* sre = re->Simplify();
41 // is this Regexp* simple?
42 bool Regexp::ComputeSimple() {
43 Regexp** subs;
102 // The child_args are simplified Regexp*s.
103 class SimplifyWalker : public Regexp::Walker<Regexp*>
[all...] |
| regexp.h | 17 // Any operation that traverses the Regexp structures should be written
18 // using Regexp::Walker (see walker-inl.h), not recursively, because deeply nested
27 // Regexp::Parse parses regular expressions encoded in UTF-8.
39 // Regexp::Parse. In particular, many of the basic Perl additions
42 // If parsed with the flag Regexp::Latin1, both the regular expression
48 // Once Regexp has parsed a regular expression, it provides methods
53 // To call a sublibrary, Regexp does not simply prepare a
55 // sublibrary. Instead, Regexp prepares, from its own parsed form, the
61 // to be that used by Regexp's parser, not the syntax expected
62 // by the sublibrary. Regexp might accept a restricted o
[all...] |
| set.cc | 11 #include "re2/regexp.h"
34 Regexp::ParseFlags pf = static_cast<Regexp::ParseFlags>(
38 re2::Regexp* re = Regexp::Parse(pattern, pf, &status);
49 re2::Regexp* m = re2::Regexp::HaveMatch(n, pf);
52 re2::Regexp** sub = new re2::Regexp*[nsub + 1];
57 re = re2::Regexp::Concat(sub, nsub + 1, pf)
[all...] |
| mimics_pcre.cc | 6 // for a particular Regexp. (If so, the testing framework can
10 // * the regexp contains a repetition of an empty string,
23 // Regexp::MimicsPCRE checks for any of these conditions.
26 #include "re2/regexp.h"
32 static bool CanBeEmptyString(Regexp *re);
34 // Walker class to compute whether library handles a regexp
37 class PCREWalker : public Regexp::Walker<bool> {
40 bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg, bool* child_args,
43 bool ShortVisit(Regexp* re, bool a) {
53 bool PCREWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg
[all...] |
| regexp.cc | 9 #include "re2/regexp.h"
16 Regexp::Regexp(RegexpOp op, ParseFlags parse_flags)
32 Regexp::~Regexp() {
34 LOG(DFATAL) << "Regexp not destroyed.";
52 // If it's possible to destroy this regexp without recurring,
54 bool Regexp::QuickDestroy() {
62 static map<Regexp*, int> *ref_map;
65 int Regexp::Ref()
[all...] |
| walker-inl.h | 16 #include "re2/regexp.h"
22 template<typename T> class Regexp::Walker {
31 // At the top-most Regexp, parent_arg is arg passed to walk.
36 virtual T PreVisit(Regexp* re, T parent_arg, bool* stop);
47 virtual T PostVisit(Regexp* re, T parent_arg, T pre_arg,
62 virtual T ShortVisit(Regexp* re, T parent_arg) = 0;
67 T Walk(Regexp* re, T top_arg);
77 T WalkExponential(Regexp* re, T top_arg, int max_visits);
93 T WalkInternal(Regexp* re, T top_arg, bool use_copy);
98 template<typename T> T Regexp::Walker<T>::PreVisit(Regexp* re
[all...] |
| /external/regex-re2/re2/ |
| simplify.cc | 10 #include "re2/regexp.h"
15 // Parses the regexp src and then simplifies it and sets *dst to the
18 bool Regexp::SimplifyRegexp(const StringPiece& src, ParseFlags flags,
21 Regexp* re = Parse(src, flags, status);
24 Regexp* sre = re->Simplify();
41 // is this Regexp* simple?
42 bool Regexp::ComputeSimple() {
43 Regexp** subs;
102 // The child_args are simplified Regexp*s.
103 class SimplifyWalker : public Regexp::Walker<Regexp*>
[all...] |
| regexp.h | 17 // Any operation that traverses the Regexp structures should be written
18 // using Regexp::Walker (see walker-inl.h), not recursively, because deeply nested
27 // Regexp::Parse parses regular expressions encoded in UTF-8.
39 // Regexp::Parse. In particular, many of the basic Perl additions
42 // If parsed with the flag Regexp::Latin1, both the regular expression
48 // Once Regexp has parsed a regular expression, it provides methods
53 // To call a sublibrary, Regexp does not simply prepare a
55 // sublibrary. Instead, Regexp prepares, from its own parsed form, the
61 // to be that used by Regexp's parser, not the syntax expected
62 // by the sublibrary. Regexp might accept a restricted o
[all...] |
| set.cc | 11 #include "re2/regexp.h"
34 Regexp::ParseFlags pf = static_cast<Regexp::ParseFlags>(
38 re2::Regexp* re = Regexp::Parse(pattern, pf, &status);
49 re2::Regexp* m = re2::Regexp::HaveMatch(n, pf);
52 re2::Regexp** sub = new re2::Regexp*[nsub + 1];
57 re = re2::Regexp::Concat(sub, nsub + 1, pf)
[all...] |
| mimics_pcre.cc | 6 // for a particular Regexp. (If so, the testing framework can
10 // * the regexp contains a repetition of an empty string,
23 // Regexp::MimicsPCRE checks for any of these conditions.
26 #include "re2/regexp.h"
32 static bool CanBeEmptyString(Regexp *re);
34 // Walker class to compute whether library handles a regexp
37 class PCREWalker : public Regexp::Walker<bool> {
40 bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg, bool* child_args,
43 bool ShortVisit(Regexp* re, bool a) {
53 bool PCREWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg
[all...] |
| regexp.cc | 9 #include "re2/regexp.h"
16 Regexp::Regexp(RegexpOp op, ParseFlags parse_flags)
32 Regexp::~Regexp() {
34 LOG(DFATAL) << "Regexp not destroyed.";
52 // If it's possible to destroy this regexp without recurring,
54 bool Regexp::QuickDestroy() {
62 static map<Regexp*, int> *ref_map;
65 int Regexp::Ref()
[all...] |
| walker-inl.h | 16 #include "re2/regexp.h"
22 template<typename T> class Regexp::Walker {
31 // At the top-most Regexp, parent_arg is arg passed to walk.
36 virtual T PreVisit(Regexp* re, T parent_arg, bool* stop);
47 virtual T PostVisit(Regexp* re, T parent_arg, T pre_arg,
62 virtual T ShortVisit(Regexp* re, T parent_arg) = 0;
67 T Walk(Regexp* re, T top_arg);
77 T WalkExponential(Regexp* re, T top_arg, int max_visits);
93 T WalkInternal(Regexp* re, T top_arg, bool use_copy);
98 template<typename T> T Regexp::Walker<T>::PreVisit(Regexp* re
[all...] |
