| /external/libxml2/result/schemas/ |
| regexp-char-ref_0_0 | 1 ./test/schemas/regexp-char-ref_0.xml validates
|
| regexp-char-ref_1_0 | 1 ./test/schemas/regexp-char-ref_0.xml validates
|
| /external/regex-re2/re2/testing/ |
| 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...] |
| 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...] |
| 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...] |
| 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_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...] |
| 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...] |
| possible_match_test.cc | 9 #include "re2/regexp.h"
24 const char* regexp; member in struct:re2::PrefixTest
109 LOG(INFO) << "Checking regexp=" << CEscape(t.regexp);
110 Regexp* re = Regexp::Parse(t.regexp, Regexp::LikePerl, NULL);
115 << " " << t.regexp;
119 CHECK(RE2(t.regexp).PossibleMatchRange(&min, &max, t.maxlen))
[all...] |
| /external/libxml2/result/regexp/ |
| ranges | 0 Regexp: a{2,3}
6 Regexp: ba{2,3}c
11 Regexp: a(b|c){2,3}d
|
| ncname | 0 Regexp: [\i-[:]][\c-[:]]*
|
| bug420596 | 0 Regexp: (\+|-)(0[0-9]|1[0-1])
6 Regexp: [+-](0[0-9]|1[0-1])
|
| content | 0 Regexp: ((a|b|c)def)
6 Regexp: ((a|b|c|d|e|f)?(g|h|i)+(k|l)*)
|
| hard | 0 Regexp: ((a|b|\p{Nd}){1,2}|aaa|bbbb){1,2}
8 Regexp: (\d{1,3}\.){3}\d{1,3}
|
| ranges2 | 0 Regexp: (a|b{0,3}){0,1}
10 Regexp: ([0-9]{0,3}|([0-9]{0}|[0-9]{0,3})){0,3}
|
| /external/v8/src/builtins/ |
| builtins-regexp.h | 27 Node* FastLoadLastIndex(Node* regexp);
28 Node* SlowLoadLastIndex(Node* context, Node* regexp);
29 Node* LoadLastIndex(Node* context, Node* regexp, bool is_fastpath);
31 void FastStoreLastIndex(Node* regexp, Node* value);
32 void SlowStoreLastIndex(Node* context, Node* regexp, Node* value);
33 void StoreLastIndex(Node* context, Node* regexp, Node* value,
36 Node* ConstructNewResultFromMatchInfo(Node* const context, Node* const regexp,
41 Node* const regexp,
45 Node* RegExpPrototypeExecBody(Node* const context, Node* const regexp,
60 Node* FlagsGetter(Node* const context, Node* const regexp, bool is_fastpath)
[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.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...] |
| 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...] |
| 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...] |
| 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/snakeyaml/src/main/java/org/yaml/snakeyaml/resolver/ |
| ResolverTuple.java | 24 private final Pattern regexp; field in class:ResolverTuple
26 public ResolverTuple(Tag tag, Pattern regexp) {
28 this.regexp = regexp;
36 return regexp;
41 return "Tuple tag=" + tag + " regexp=" + regexp;
|
| /external/snakeyaml/ |
| .hgignore | 1 syntax: regexp
|
| /external/v8/src/regexp/ |
| regexp-utils.h | 15 // Helper methods for C++ regexp builtins.
23 // Last index (RegExp.lastIndex) accessors.
25 Isolate* isolate, Handle<JSReceiver> regexp, int value);
31 Isolate* isolate, Handle<JSReceiver> regexp, Handle<String> string,
47 Isolate* isolate, Handle<JSReceiver> regexp, Handle<String> string,
|
