| /external/regex-re2/util/ |
| logging.h | 1 // Copyright 2009 The RE2 Authors. All Rights Reserved.
|
| sparse_set.h | 1 // Copyright 2006 The RE2 Authors. All Rights Reserved.
52 namespace re2 { namespace
177 } // namespace re2
|
| 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
|
| 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...] |
| arena.cc | 1 // Copyright 2000 The RE2 Authors. All Rights Reserved.
7 namespace re2 { namespace
168 } // namespace re2
|
| /external/regex-re2/re2/ |
| 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...] |
| compile.cc | 1 // Copyright 2007 The RE2 Authors. All Rights Reserved.
11 #include "re2/prog.h"
12 #include "re2/re2.h"
13 #include "re2/regexp.h"
14 #include "re2/walker-inl.h"
16 namespace re2 { namespace
135 static Prog* CompileSet(const RE2::Options& options, RE2::Anchor anchor,
211 void Setup(Regexp::ParseFlags, int64, RE2::Anchor)
[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
|
| prog.cc | 1 // Copyright 2007 The RE2 Authors. All Rights Reserved.
10 #include "re2/prog.h"
11 #include "re2/stringpiece.h"
13 namespace re2 { namespace
340 } // namespace re2
|
| regexp.h | 1 // Copyright 2006 The RE2 Authors. All Rights Reserved.
7 // you should use re2/re2.h, which provides a class RE2 that
9 // This header describes the low-level interface used to implement RE2
11 // In contrast, RE2's interface will not.
23 // around manipulation of the regexps. RE2 does this.
90 #include "re2/stringpiece.h"
92 namespace re2 { namespace
153 // with match ID match_id_ (used by RE2::Set)
[all...] |
| prefilter_tree.cc | 1 // Copyright 2009 The RE2 Authors. All Rights Reserved.
7 #include "re2/prefilter.h"
8 #include "re2/prefilter_tree.h"
9 #include "re2/re2.h"
15 namespace re2 { namespace
398 } // namespace re2
|
| prefilter_tree.h | 1 // Copyright 2009 The RE2 Authors. All Rights Reserved.
22 namespace re2 { namespace
|
| unicode_casefold.cc | 5 #include "re2/unicode_casefold.h"
7 namespace re2 { namespace
467 } // namespace re2
|
| /external/regex-re2/re2/testing/ |
| backtrack.cc | 1 // Copyright 2008 The RE2 Authors. All Rights Reserved.
27 #include "re2/prog.h"
28 #include "re2/regexp.h"
30 namespace re2 { namespace
254 } // namespace re2
|
| unicode_test.py | 3 # Copyright 2008 The RE2 Authors. All Rights Reserved.
7 """Unittest for the util/regexp/re2/unicode.py module."""
13 from google3.util.regexp.re2 import unicode
|
| /prebuilts/go/darwin-x86/src/regexp/ |
| exec_test.go | 23 // considered during RE2's exhaustive tests, which run all possible
26 // up to a given size. Rather than try to link with RE2, we read a
28 // The log file, re2-exhaustive.txt, is generated by running 'make log'
29 // in the open source RE2 distribution https://github.com/google/re2/.
60 // a capital letter are test names printed during RE2's test suite
63 // At time of writing, re2-exhaustive.txt is 59 MB but compresses to 385 kB,
64 // so we store re2-exhaustive.txt.bz2 in the repository and decompress it on the fly.
67 testRE2(t, "testdata/re2-search.txt")
157 // RE2's \B considers every byte position
[all...] |
| /prebuilts/go/linux-x86/src/regexp/ |
| exec_test.go | 23 // considered during RE2's exhaustive tests, which run all possible
26 // up to a given size. Rather than try to link with RE2, we read a
28 // The log file, re2-exhaustive.txt, is generated by running 'make log'
29 // in the open source RE2 distribution https://github.com/google/re2/.
60 // a capital letter are test names printed during RE2's test suite
63 // At time of writing, re2-exhaustive.txt is 59 MB but compresses to 385 kB,
64 // so we store re2-exhaustive.txt.bz2 in the repository and decompress it on the fly.
67 testRE2(t, "testdata/re2-search.txt")
157 // RE2's \B considers every byte position
[all...] |
| /external/libyuv/files/tools/ubsan/ |
| blacklist.txt | 67 fun:*re2*RegexpD*
|
| /prebuilts/go/darwin-x86/src/regexp/syntax/ |
| parse.go | 159 re2 := p.stack[n-2]
160 if re1.Op != OpLiteral || re2.Op != OpLiteral || re1.Flags&FoldCase != re2.Flags&FoldCase {
164 // Push re1 into re2.
165 re2.Rune = append(re2.Rune, re1.Rune...)
1194 re2 := p.stack[n-2]
1195 if re2.Op == opVerticalBar {
1202 p.stack[n-1] = re2
1223 re2 := p.stack[n-2
[all...] |
| make_perl_groups.pl | 6 # Modified version of RE2's make_perl_groups.pl.
|
| /prebuilts/go/linux-x86/src/regexp/syntax/ |
| parse.go | 159 re2 := p.stack[n-2]
160 if re1.Op != OpLiteral || re2.Op != OpLiteral || re1.Flags&FoldCase != re2.Flags&FoldCase {
164 // Push re1 into re2.
165 re2.Rune = append(re2.Rune, re1.Rune...)
1194 re2 := p.stack[n-2]
1195 if re2.Op == opVerticalBar {
1202 p.stack[n-1] = re2
1223 re2 := p.stack[n-2
[all...] |
| make_perl_groups.pl | 6 # Modified version of RE2's make_perl_groups.pl.
|
| /external/llvm/lib/ExecutionEngine/RuntimeDyld/Targets/ |
| RuntimeDyldMachOARM.h | 244 MachO::any_relocation_info RE2 =
260 uint32_t AddrB = MachO.getScatteredRelocationValue(RE2);
273 uint32_t OtherHalf = MachO.getAnyRelocationAddress(RE2) & 0xffff;
|
| /prebuilts/go/darwin-x86/src/regexp/testdata/ |
| basic.dat | 128 E (a*)* - (0,0)(?,?) RE2/Go
131 E (a*|b)* - (0,0)(?,?) RE2/Go
137 E (^)* - (0,0)(?,?) RE2/Go
144 E ((a*|b))* - (0,0)(?,?)(?,?) RE2/Go
|
