| /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...] |
| parse.cc | 9 // of the ParseState class. The Regexp::Parse function is
17 // See regexp.h for rationale.
21 #include "re2/regexp.h"
30 // Regexp pointers called the stack. Left parenthesis and vertical
41 // form LeftParen regexp VerticalBar regexp VerticalBar ... regexp VerticalBar.
45 class Regexp::ParseState {
61 bool PushRegexp(Regexp* re);
66 // 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.
121 class Compiler : public Regexp::Walker<Frag> {
126 // Compiles Regexp to a new Prog.
130 static Prog *Compile(Regexp* re, bool reversed, int64 max_mem);
135 Regexp* re);
137 // Interface for Regexp::Walker, which helps traverse the Regexp.
141 // 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_;
|
| prefilter.cc | 144 // regexps, matching ab will already allow this regexp to be a
190 // Information about a regexp used during computation of Prefilter.
235 // match for this regexp is guaranteed to match.
460 class Prefilter::Info::Walker : public Regexp::Walker<Prefilter::Info*> {
465 Regexp* re, Info* parent_arg,
470 Regexp* re,
477 Prefilter::Info* Prefilter::BuildInfo(Regexp* re) {
493 Regexp* re, Prefilter::Info* parent_arg) {
500 Regexp* re, Prefilter::Info* parent_arg,
507 LOG(DFATAL) << "Bad regexp op " << re->op()
[all...] |
| re2.cc | 20 #include "re2/regexp.h"
50 // Converts from Regexp error code to RE2 error code.
52 // hides the existence of Regexp from RE2 users.
111 int flags = Regexp::ClassNL;
119 flags |= Regexp::Latin1;
124 flags |= Regexp::LikePerl;
127 flags |= Regexp::Literal;
130 flags |= Regexp::NeverNL;
133 flags |= Regexp::FoldCase;
136 flags |= Regexp::PerlClasses
[all...] |
| re2.h | 13 // REGEXP SYNTAX:
194 class Regexp;
220 ErrorTrailingBackslash, // trailing \ at end of regexp
225 ErrorBadUTF8, // invalid UTF-8 in regexp
237 static const Options Quiet; // do not log about regexp parse errors
267 // portion of the regexp.
270 // Returns the program size, a very approximate measure of a regexp's "cost".
274 // Returns the underlying Regexp; not for general use.
277 re2::Regexp* Regexp() const { return entire_regexp_;
[all...] |
| prog.h | 6 // See regexp.h for the Regexp class, which represents a regular
72 class Regexp;
77 // Compiled form of regexp program.
83 // Single instruction in regexp program.
247 // Execution engines. They all search for the regexp (run the prog)
253 // If a particular submatch is not matched during the regexp match,
316 // Computes range for any strings matching regexp. The min and max can in
321 // string s that is an anchored match for this regexp satisfies
325 // infinitely repeated element (i.e., any regexp element followed by a '*' o
[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...] |
| /external/webkit/Tools/Scripts/ |
| clean-header-guards | 30 IgnoreFileNamesPattern = Regexp.union(*IgnoredFilenamePatterns).freeze
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
| ant-apache-regexp.jar | |
| ant-apache-oro.jar | |
| ant-nodeps.jar | |
| /external/v8/test/mjsunit/ |
| regexp-string-methods.js | 28 // Regexp shouldn't use String.prototype.slice()
35 // Regexp shouldn't use String.prototype.charAt()
36 var f1 = new RegExp("f", "i");
41 var f2 = new RegExp("[g]", "i");
47 // We match other browsers in using the original value of RegExp.prototype.exec.
48 // I.e., RegExp.prototype.test shouldn't use the current value of
49 // RegExp.prototype.exec.
50 RegExp.prototype.exec = function(string) { return 'x'; };
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/test/ |
| core-extensions.rb | 14 chr = Regexp.escape( chr )
15 exp = Regexp.new( "^ *#{ chr }" )
|
| /external/libvpx/examples/includes/geshi/geshi/ |
| ruby.php | 98 'Range', 'RangeError', 'Rational', 'Regexp', 'RegexpError',
112 'URI::LDAP', 'URI::MailTo', 'URI::REGEXP',
113 'URI::REGEXP::PATTERN', 'UnboundMethod', 'Vector', 'YAML',
|
| rails.php | 91 'Range', 'RangeError', 'Rational', 'Regexp', 'RegexpError',
105 'URI::LDAP', 'URI::MailTo', 'URI::REGEXP',
106 'URI::REGEXP::PATTERN', 'UnboundMethod', 'Vector', 'YAML',
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| token.rb | 121 when Regexp then obj =~ text
|
