| /external/regex-re2/re2/testing/ |
| 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...] |
| tester.h | 13 #include "re2/regexp.h"
19 class Regexp;
21 // All the supported regexp engines.
47 // A TestInstance caches per-regexp state for a given
54 TestInstance(const StringPiece& regexp, Prog::MatchKind kind,
55 Regexp::ParseFlags flags);
57 Regexp::ParseFlags flags() { return flags_; }
75 const StringPiece& regexp_str_; // regexp being tested
77 Regexp::ParseFlags flags_; // flags for parsing regexp_str_
80 Regexp* regexp_; // parsed regex
[all...] |
| dfa_test.cc | 9 #include "re2/regexp.h"
36 // Create regexp with 2^FLAGS_size states in DFA.
45 Regexp* re = Regexp::Parse(s.c_str(), Regexp::LikePerl, NULL);
60 Regexp* re = Regexp::Parse(s.c_str(), Regexp::LikePerl, NULL);
89 // Create regexp with 2^30 states in DFA.
96 Regexp* re = Regexp::Parse(s.c_str(), Regexp::LikePerl, NULL)
310 const char *regexp; member in struct:re2::ReverseTest
[all...] |
| regexp_benchmark.cc | 10 #include "re2/regexp.h"
24 Regexp* re = Regexp::Parse("(\\d+)-(\\d+)-(\\d+)", Regexp::LikePerl, NULL);
42 const char* regexp = "(\\d+)-(\\d+)-(\\d+)"; local
46 Regexp* re = Regexp::Parse(regexp, Regexp::LikePerl, NULL);
50 fprintf(stderr, "Regexp: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth())
243 string regexp = "^" + s + ".*$"; local
[all...] |
| dump.cc | 5 // Dump the regexp into a string showing structure.
8 // This function traverses the regexp recursively,
9 // meaning that on inputs like Regexp::Simplify of
23 #include "re2/regexp.h"
55 // Create string representation of regexp with explicit structure.
57 static void DumpRegexpAppending(Regexp* re, string* s) {
68 if (re->parse_flags() & Regexp::NonGreedy)
73 if (re->op() == kRegexpLiteral && (re->parse_flags() & Regexp::FoldCase)) {
78 if (re->op() == kRegexpLiteralString && (re->parse_flags() & Regexp::FoldCase)) {
93 if (!(re->parse_flags() & Regexp::WasDollar))
[all...] |
| search_test.cc | 9 #include "re2/regexp.h"
16 const char* regexp; member in struct:re2::RegexpTest
305 TEST(Regexp, SearchTests) {
309 if (!TestRegexpOnText(t.regexp, t.text))
316 atom.push_back(StringPiece(t.regexp).as_string());
|
| /external/chromium_org/third_party/re2/re2/ |
| parse.cc | 9 // of the ParseState class. The Regexp::Parse function is
17 // See regexp.h for rationale.
20 #include "re2/regexp.h"
29 // Regexp pointers called the stack. Left parenthesis and vertical
40 // form LeftParen regexp VerticalBar regexp VerticalBar ... regexp VerticalBar.
44 class Regexp::ParseState {
60 bool PushRegexp(Regexp* re);
65 // Pushes a regexp with the given op (and no args) onto the stack
[all...] |
| tostring.cc | 9 #include "re2/regexp.h"
31 class ToStringWalker : public Regexp::Walker<int> {
35 virtual int PreVisit(Regexp* re, int parent_arg, bool* stop);
36 virtual int PostVisit(Regexp* re, int parent_arg, int pre_arg,
38 virtual int ShortVisit(Regexp* re, int parent_arg) {
48 string Regexp::ToString() {
61 int ToStringWalker::PreVisit(Regexp* re, int parent_arg, bool* stop) {
139 int ToStringWalker::PostVisit(Regexp* re, int parent_arg, int pre_arg,
157 AppendLiteral(t_, re->rune(), re->parse_flags() & Regexp::FoldCase);
162 AppendLiteral(t_, re->runes()[i], re->parse_flags() & Regexp::FoldCase)
[all...] |
| prefilter.h | 18 class Regexp;
71 static Prefilter* FromRegexp(Regexp* a);
77 static Info* BuildInfo(Regexp* re);
|
| compile.cc | 8 // This file's external interface is just Regexp::CompileToProg.
13 #include "re2/regexp.h"
22 // See http://swtch.com/~rsc/regexp/regexp1.html for inspiration.
123 class Compiler : public Regexp::Walker<Frag> {
128 // Compiles Regexp to a new Prog.
132 static Prog *Compile(Regexp* re, bool reversed, int64 max_mem);
137 Regexp* re);
139 // Interface for Regexp::Walker, which helps traverse the Regexp.
143 // The Compiler traverses the Regexp parse tree, visitin
[all...] |
| set.h | 23 // Add adds regexp pattern to the set, interpreted using the RE2 options.
25 // Add returns the regexp index that will be used to identify
26 // it in the result of Match, or -1 if the regexp cannot be parsed.
45 vector<re2::Regexp*> re_;
|
| /external/regex-re2/re2/ |
| parse.cc | 9 // of the ParseState class. The Regexp::Parse function is
17 // See regexp.h for rationale.
20 #include "re2/regexp.h"
29 // Regexp pointers called the stack. Left parenthesis and vertical
40 // form LeftParen regexp VerticalBar regexp VerticalBar ... regexp VerticalBar.
44 class Regexp::ParseState {
60 bool PushRegexp(Regexp* re);
65 // Pushes a regexp with the given op (and no args) onto the stack
[all...] |
| tostring.cc | 9 #include "re2/regexp.h"
31 class ToStringWalker : public Regexp::Walker<int> {
35 virtual int PreVisit(Regexp* re, int parent_arg, bool* stop);
36 virtual int PostVisit(Regexp* re, int parent_arg, int pre_arg,
38 virtual int ShortVisit(Regexp* re, int parent_arg) {
48 string Regexp::ToString() {
61 int ToStringWalker::PreVisit(Regexp* re, int parent_arg, bool* stop) {
139 int ToStringWalker::PostVisit(Regexp* re, int parent_arg, int pre_arg,
157 AppendLiteral(t_, re->rune(), re->parse_flags() & Regexp::FoldCase);
162 AppendLiteral(t_, re->runes()[i], re->parse_flags() & Regexp::FoldCase)
[all...] |
| prefilter.h | 18 class Regexp;
71 static Prefilter* FromRegexp(Regexp* a);
77 static Info* BuildInfo(Regexp* re);
|
| compile.cc | 8 // This file's external interface is just Regexp::CompileToProg.
13 #include "re2/regexp.h"
22 // See http://swtch.com/~rsc/regexp/regexp1.html for inspiration.
122 class Compiler : public Regexp::Walker<Frag> {
127 // Compiles Regexp to a new Prog.
131 static Prog *Compile(Regexp* re, bool reversed, int64 max_mem);
136 Regexp* re);
138 // Interface for Regexp::Walker, which helps traverse the Regexp.
142 // The Compiler traverses the Regexp parse tree, visitin
[all...] |
| set.h | 23 // Add adds regexp pattern to the set, interpreted using the RE2 options.
25 // Add returns the regexp index that will be used to identify
26 // it in the result of Match, or -1 if the regexp cannot be parsed.
45 vector<re2::Regexp*> re_;
|
| /external/chromium_org/third_party/re2/re2/testing/ |
| tester.h | 13 #include "re2/regexp.h"
19 class Regexp;
21 // All the supported regexp engines.
47 // A TestInstance caches per-regexp state for a given
54 TestInstance(const StringPiece& regexp, Prog::MatchKind kind,
55 Regexp::ParseFlags flags);
57 Regexp::ParseFlags flags() { return flags_; }
75 const StringPiece& regexp_str_; // regexp being tested
77 Regexp::ParseFlags flags_; // flags for parsing regexp_str_
80 Regexp* regexp_; // parsed regex
[all...] |
| dfa_test.cc | 9 #include "re2/regexp.h"
36 // Create regexp with 2^FLAGS_size states in DFA.
45 Regexp* re = Regexp::Parse(s.c_str(), Regexp::LikePerl, NULL);
60 Regexp* re = Regexp::Parse(s.c_str(), Regexp::LikePerl, NULL);
89 // Create regexp with 2^30 states in DFA.
96 Regexp* re = Regexp::Parse(s.c_str(), Regexp::LikePerl, NULL)
310 const char *regexp; member in struct:re2::ReverseTest
[all...] |
| regexp_benchmark.cc | 10 #include "re2/regexp.h"
24 Regexp* re = Regexp::Parse("(\\d+)-(\\d+)-(\\d+)", Regexp::LikePerl, NULL);
42 const char* regexp = "(\\d+)-(\\d+)-(\\d+)"; local
46 Regexp* re = Regexp::Parse(regexp, Regexp::LikePerl, NULL);
50 fprintf(stderr, "Regexp: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth())
243 string regexp = "^" + s + ".*$"; local
[all...] |
| dump.cc | 5 // Dump the regexp into a string showing structure.
8 // This function traverses the regexp recursively,
9 // meaning that on inputs like Regexp::Simplify of
23 #include "re2/regexp.h"
55 // Create string representation of regexp with explicit structure.
57 static void DumpRegexpAppending(Regexp* re, string* s) {
68 if (re->parse_flags() & Regexp::NonGreedy)
73 if (re->op() == kRegexpLiteral && (re->parse_flags() & Regexp::FoldCase)) {
78 if (re->op() == kRegexpLiteralString && (re->parse_flags() & Regexp::FoldCase)) {
93 if (!(re->parse_flags() & Regexp::WasDollar))
[all...] |
| search_test.cc | 9 #include "re2/regexp.h"
16 const char* regexp; member in struct:re2::RegexpTest
305 TEST(Regexp, SearchTests) {
309 if (!TestRegexpOnText(t.regexp, t.text))
316 atom.push_back(StringPiece(t.regexp).as_string());
|
| tester.cc | 12 #include "re2/regexp.h"
14 DEFINE_bool(dump_prog, false, "dump regexp program");
16 DEFINE_bool(dump_rprog, false, "dump reversed regexp program");
19 "maximum number of regexp test failures (-1 = unlimited)");
21 DEFINE_string(regexp_engines, "", "pattern to select regexp engines to test");
135 Regexp::ParseFlags parse_flags;
139 static const Regexp::ParseFlags single_line =
140 Regexp::LikePerl;
141 static const Regexp::ParseFlags multi_line =
142 static_cast<Regexp::ParseFlags>(Regexp::LikePerl & ~Regexp::OneLine)
[all...] |
| /external/lldb/include/lldb/Core/ |
| AddressResolver.h | 50 Regexp,
|
| /external/llvm/lib/Support/ |
| SpecialCaseList.cpp | 92 // Get our prefix and unparsed regexp.
103 std::string Regexp = SplitRegexp.first;
118 // See if we can store Regexp in Strings.
119 if (Regex::isLiteralERE(Regexp)) {
120 Entries[Prefix][Category].Strings.insert(Regexp);
125 for (size_t pos = 0; (pos = Regexp.find("*", pos)) != std::string::npos;
127 Regexp.replace(pos, strlen("*"), ".*");
130 // Check that the regexp is valid.
131 Regex CheckRE(Regexp);
139 // Add this regexp into the proper group by its prefix
[all...] |
| /development/tools/findunused/ |
| find_unused_resources.rb | 15 @@stringIdPattern = Regexp.new("name=\"([@_a-zA-Z0-9 ]*)\"")
16 @@layoutIdPattern = Regexp.new("android:id=\".*id/([_a-zA-Z0-9]*)\"")
19 Regexp.new("@string/([_a-zA-Z0-9]*)"),
20 Regexp.new("@array/([_a-zA-Z0-9]*)"),
24 Regexp.new("R.id.([_a-zA-Z0-9]+)"),
25 Regexp.new("R.string.([_a-zA-Z0-9]+)"),
26 Regexp.new("R.array.([_a-zA-Z0-9]+)"),
27 Regexp.new("R.color.([_a-zA-Z0-9]+)"),
28 Regexp.new("R.configVarying.([_a-zA-Z0-9]+)"),
29 Regexp.new("R.dimen.([_a-zA-Z0-9]+)")
[all...] |
