Searched refs:prefilter (Results 1 - 21 of 21) sorted by relevance

/external/chromium_org/third_party/re2/re2/
H A Dprefilter_tree.cc7 #include "re2/prefilter.h"
36 static bool KeepPart(Prefilter* prefilter, int level) { argument
37 if (prefilter == NULL)
40 switch (prefilter->op()) {
43 << prefilter->op();
50 return prefilter->atom().size() >=
55 vector<Prefilter*>* subs = prefilter->subs();
67 for (int i = 0; i < prefilter->subs()->size(); i++)
68 if (!KeepPart((*prefilter->subs())[i], level + 1))
105 // Note that getting rid of a prefilter nod
220 Prefilter* prefilter = v[i]; local
233 Prefilter* prefilter = v[i]; local
[all...]
H A Dprefilter_tree.h6 // that would trigger each regexp. The 'prefilter' of each regexp is
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
102 // Recursively constructs a readable prefilter string.
125 // Has the prefilter tree been compiled.
H A Dfiltered_re2.cc8 #include "re2/prefilter.h"
50 Prefilter* prefilter = Prefilter::FromRE2(re2_vec_[i]); local
51 prefilter_tree_->Add(prefilter);
/external/regex-re2/re2/
H A Dprefilter_tree.cc7 #include "re2/prefilter.h"
31 static bool KeepPart(Prefilter* prefilter, int level) { argument
32 if (prefilter == NULL)
35 switch (prefilter->op()) {
38 << prefilter->op();
45 return prefilter->atom().size() >=
50 vector<Prefilter*>* subs = prefilter->subs();
62 for (int i = 0; i < prefilter->subs()->size(); i++)
63 if (!KeepPart((*prefilter->subs())[i], level + 1))
100 // Note that getting rid of a prefilter nod
213 Prefilter* prefilter = v[i]; local
226 Prefilter* prefilter = v[i]; local
[all...]
H A Dprefilter_tree.h6 // that would trigger each regexp. The 'prefilter' of each regexp is
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
99 // Recursively constructs a readable prefilter string.
122 // Has the prefilter tree been compiled.
H A Dfiltered_re2.cc8 #include "re2/prefilter.h"
50 Prefilter* prefilter = Prefilter::FromRE2(re2_vec_[i]); local
51 prefilter_tree_->Add(prefilter);
/external/regex-re2/
H A DAndroid.mk27 re2/prefilter.cc \
H A DMakefile69 re2/prefilter.h\
102 obj/re2/prefilter.o\
/external/chromium_org/third_party/re2/
H A DMakefile69 re2/prefilter.h\
102 obj/re2/prefilter.o\
H A Dre2.target.darwin-arm64.mk35 third_party/re2/re2/prefilter.cc \
H A Dre2.target.darwin-mips.mk35 third_party/re2/re2/prefilter.cc \
H A Dre2.target.darwin-mips64.mk35 third_party/re2/re2/prefilter.cc \
H A Dre2.target.darwin-x86.mk35 third_party/re2/re2/prefilter.cc \
H A Dre2.target.darwin-x86_64.mk35 third_party/re2/re2/prefilter.cc \
H A Dre2.target.linux-arm64.mk35 third_party/re2/re2/prefilter.cc \
H A Dre2.target.linux-mips.mk35 third_party/re2/re2/prefilter.cc \
H A Dre2.target.linux-mips64.mk35 third_party/re2/re2/prefilter.cc \
H A Dre2.target.linux-x86.mk35 third_party/re2/re2/prefilter.cc \
H A Dre2.target.linux-x86_64.mk35 third_party/re2/re2/prefilter.cc \
H A Dre2.target.darwin-arm.mk35 third_party/re2/re2/prefilter.cc \
H A Dre2.target.linux-arm.mk35 third_party/re2/re2/prefilter.cc \

Completed in 215 milliseconds