| /external/chromium_org/third_party/re2/re2/ |
| prefilter.h | 5 // Prefilter is the class used to extract string guards from regexps.
6 // Rather than using Prefilter class directly, use FilteredRE2.
20 class Prefilter {
21 // Instead of using Prefilter directly, use FilteredRE2; see filtered_re2.h
31 explicit Prefilter(Op op);
32 ~Prefilter();
39 // The children of the Prefilter node.
40 vector<Prefilter*>* subs() {
45 // Set the children vector. Prefilter takes ownership of subs and
46 // subs_ will be deleted when Prefilter is deleted
[all...] |
| prefilter.cc | 6 #include "re2/prefilter.h"
19 // Initializes a Prefilter, allocating subs_ as necessary.
20 Prefilter::Prefilter(Op op) {
24 subs_ = new vector<Prefilter*>;
30 // Destroys a Prefilter.
31 Prefilter::~Prefilter() {
42 Prefilter* Prefilter::Simplify()
[all...] |
| prefilter_tree.cc | 7 #include "re2/prefilter.h"
36 static bool KeepPart(Prefilter* prefilter, int level) {
37 if (prefilter == NULL)
40 switch (prefilter->op()) {
43 << prefilter->op();
46 case Prefilter::ALL:
49 case Prefilter::ATOM:
50 return prefilter->atom().size() >=
53 case Prefilter::AND:
220 Prefilter* prefilter = v[i]; local
233 Prefilter* prefilter = v[i]; local
[all...] |
| prefilter_tree.h | 6 // that would trigger each regexp. The 'prefilter' of each regexp is
29 class Prefilter;
36 // Adds the prefilter for the next regexp. Note that we assume that
39 void Add(Prefilter* prefilter);
57 // Print debug prefilter. Also prints unique ids associated with
58 // nodes of the prefilter of the regexp.
86 // prefilter, by looking at if these nodes are already in the
94 // Returns the prefilter node that has the same NodeString as this
96 Prefilter* CanonicalNode(Prefilter* node)
[all...] |
| filtered_re2.cc | 8 #include "re2/prefilter.h"
50 Prefilter* prefilter = Prefilter::FromRE2(re2_vec_[i]); local
51 prefilter_tree_->Add(prefilter);
|
| filtered_re2.h | 6 // It provides a prefilter mechanism that helps in cutting down the
78 // Print prefilter.
|
| /external/regex-re2/re2/ |
| prefilter.h | 5 // Prefilter is the class used to extract string guards from regexps.
6 // Rather than using Prefilter class directly, use FilteredRE2.
20 class Prefilter {
21 // Instead of using Prefilter directly, use FilteredRE2; see filtered_re2.h
31 explicit Prefilter(Op op);
32 ~Prefilter();
39 // The children of the Prefilter node.
40 vector<Prefilter*>* subs() {
45 // Set the children vector. Prefilter takes ownership of subs and
46 // subs_ will be deleted when Prefilter is deleted
[all...] |
| prefilter.cc | 6 #include "re2/prefilter.h"
19 // Initializes a Prefilter, allocating subs_ as necessary.
20 Prefilter::Prefilter(Op op) {
24 subs_ = new vector<Prefilter*>;
30 // Destroys a Prefilter.
31 Prefilter::~Prefilter() {
42 Prefilter* Prefilter::Simplify()
[all...] |
| prefilter_tree.cc | 7 #include "re2/prefilter.h"
31 static bool KeepPart(Prefilter* prefilter, int level) {
32 if (prefilter == NULL)
35 switch (prefilter->op()) {
38 << prefilter->op();
41 case Prefilter::ALL:
44 case Prefilter::ATOM:
45 return prefilter->atom().size() >=
48 case Prefilter::AND:
213 Prefilter* prefilter = v[i]; local
226 Prefilter* prefilter = v[i]; local
[all...] |
| prefilter_tree.h | 6 // that would trigger each regexp. The 'prefilter' of each regexp is
26 class Prefilter;
33 // Adds the prefilter for the next regexp. Note that we assume that
36 void Add(Prefilter* prefilter);
54 // Print debug prefilter. Also prints unique ids associated with
55 // nodes of the prefilter of the regexp.
83 // prefilter, by looking at if these nodes are already in the
91 // Returns the prefilter node that has the same NodeString as this
93 Prefilter* CanonicalNode(Prefilter* node)
[all...] |
| filtered_re2.cc | 8 #include "re2/prefilter.h"
50 Prefilter* prefilter = Prefilter::FromRE2(re2_vec_[i]); local
51 prefilter_tree_->Add(prefilter);
|
| filtered_re2.h | 6 // It provides a prefilter mechanism that helps in cutting down the
78 // Print prefilter.
|
| /external/chromium_org/third_party/re2/patches/ |
| re2-memory-optimization.patch | 6 // prefilter node.
40 Prefilter* prefilter = v[i];
41 if (prefilter == NULL)
45 Entry* entry = &entries_[prefilter->unique_id()];
53 case Prefilter::OR:
54 case Prefilter::AND: {
57 for (int j = 0; j < prefilter->subs()->size() ; j++) {
58 Prefilter* child = (*prefilter->subs())[j]
[all...] |
| this-null.patch | 1 Index: re2/prefilter.cc
3 --- a/re2/prefilter.cc
4 +++ b/re2/prefilter.cc
8 string Prefilter::Info::ToString() {
32 string Prefilter::DebugString() const {
38 LOG(DFATAL) << "Bad op in Prefilter::DebugString: " << op_;
44 + Prefilter* sub = (*subs_)[i];
54 + Prefilter* sub = (*subs_)[i];
|
| /external/chromium_org/third_party/re2/ |
| BUILD.gn | 22 "re2/prefilter.cc",
23 "re2/prefilter.h",
|
| re2.gyp | 34 're2/prefilter.cc',
35 're2/prefilter.h',
|
| /external/chromium_org/third_party/opus/src/silk/fixed/ |
| structs_FIX.h | 51 /* Prefilter state */
70 silk_prefilter_state_FIX sPrefilt; /* Prefilter State */
|
| prefilter_FIX.c | 36 /* Prefilter for finding Quantizer input signal */
158 /* Prefilter for finding Quantizer input signal */
|
| /external/chromium_org/third_party/opus/src/silk/float/ |
| structs_FLP.h | 51 /* Prefilter state */
70 silk_prefilter_state_FLP sPrefilt; /* Prefilter State */
|
| prefilter_FLP.c | 36 * Prefilter for finding Quantizer input signal
92 * silk_prefilter. Main prefilter function
154 * Prefilter for finding Quantizer input signal
|
| /external/libopus/silk/fixed/ |
| structs_FIX.h | 51 /* Prefilter state */
70 silk_prefilter_state_FIX sPrefilt; /* Prefilter State */
|
| prefilter_FIX.c | 36 /* Prefilter for finding Quantizer input signal */
158 /* Prefilter for finding Quantizer input signal */
|
| /external/libopus/silk/float/ |
| structs_FLP.h | 51 /* Prefilter state */
70 silk_prefilter_state_FLP sPrefilt; /* Prefilter State */
|
| prefilter_FLP.c | 36 * Prefilter for finding Quantizer input signal
92 * silk_prefilter. Main prefilter function
154 * Prefilter for finding Quantizer input signal
|
| /external/regex-re2/ |
| Android.mk | 27 re2/prefilter.cc \
|
