Home
last modified time | relevance | path

Searched refs:regexps (Results 1 – 25 of 62) sorted by relevance

123

/external/regex-re2/re2/testing/
Dregexp_generator.cc193 std::stack<string> regexps; in RunPostfix() local
199 regexps.push(post[i]); in RunPostfix()
202 string a = regexps.top(); in RunPostfix()
203 regexps.pop(); in RunPostfix()
204 regexps.push("(?:" + StringPrintf(post[i].c_str(), a.c_str()) + ")"); in RunPostfix()
208 string b = regexps.top(); in RunPostfix()
209 regexps.pop(); in RunPostfix()
210 string a = regexps.top(); in RunPostfix()
211 regexps.pop(); in RunPostfix()
212 regexps.push("(?:" + in RunPostfix()
[all …]
Dfiltered_re2_test.cc76 const char* regexps[20]; member
146 void AddRegexpsAndCompile(const char* regexps[], in AddRegexpsAndCompile() argument
151 v->f.Add(regexps[i], v->opts, &id); in AddRegexpsAndCompile()
190 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++) in TEST()
191 if (t->regexps[nregexp] == NULL) in TEST()
196 AddRegexpsAndCompile(t->regexps, nregexp, &v); in TEST()
225 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++) in TEST()
226 if (t->regexps[nregexp] == NULL) in TEST()
228 AddRegexpsAndCompile(t->regexps, nregexp, &v); in TEST()
242 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++) in TEST()
[all …]
Dpossible_match_test.cc183 int regexps() { return regexps_; } in regexps() function in re2::PossibleMatchTester
243 LOG(INFO) << t.regexps() << " regexps, " in TEST()
/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/re2/re2/testing/
Dregexp_generator.cc193 std::stack<std::string> regexps; in RunPostfix() local
199 regexps.push(post[i]); in RunPostfix()
202 std::string a = regexps.top(); in RunPostfix()
203 regexps.pop(); in RunPostfix()
204 regexps.push("(?:" + StringPrintf(post[i].c_str(), a.c_str()) + ")"); in RunPostfix()
208 std::string b = regexps.top(); in RunPostfix()
209 regexps.pop(); in RunPostfix()
210 std::string a = regexps.top(); in RunPostfix()
211 regexps.pop(); in RunPostfix()
212 regexps.push("(?:" + in RunPostfix()
[all …]
Dfiltered_re2_test.cc77 const char* regexps[20]; member
147 void AddRegexpsAndCompile(const char* regexps[], in AddRegexpsAndCompile() argument
152 v->f.Add(regexps[i], v->opts, &id); in AddRegexpsAndCompile()
191 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++) in TEST()
192 if (t->regexps[nregexp] == NULL) in TEST()
197 AddRegexpsAndCompile(t->regexps, nregexp, &v); in TEST()
226 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++) in TEST()
227 if (t->regexps[nregexp] == NULL) in TEST()
229 AddRegexpsAndCompile(t->regexps, nregexp, &v); in TEST()
243 for (nregexp = 0; nregexp < arraysize(t->regexps); nregexp++) in TEST()
[all …]
Dpossible_match_test.cc183 int regexps() { return regexps_; } in regexps() function in re2::PossibleMatchTester
243 LOG(INFO) << t.regexps() << " regexps, " in TEST()
/external/cronet/stable/third_party/re2/src/re2/testing/
Dregexp_generator.cc199 std::stack<std::string> regexps; in RunPostfix() local
205 regexps.push(post[i]); in RunPostfix()
210 std::string a = regexps.top(); in RunPostfix()
211 regexps.pop(); in RunPostfix()
212 regexps.push("(?:" + absl::StrFormat(*fmt, a) + ")"); in RunPostfix()
218 std::string b = regexps.top(); in RunPostfix()
219 regexps.pop(); in RunPostfix()
220 std::string a = regexps.top(); in RunPostfix()
221 regexps.pop(); in RunPostfix()
222 regexps.push("(?:" + absl::StrFormat(*fmt, a, b) + ")"); in RunPostfix()
[all …]
Dfiltered_re2_test.cc79 const char* regexps[20]; member
150 void AddRegexpsAndCompile(const char* regexps[], in AddRegexpsAndCompile() argument
155 v->f.Add(regexps[i], v->opts, &id); in AddRegexpsAndCompile()
194 for (nregexp = 0; nregexp < ABSL_ARRAYSIZE(t->regexps); nregexp++) in TEST()
195 if (t->regexps[nregexp] == NULL) in TEST()
200 AddRegexpsAndCompile(t->regexps, nregexp, &v); in TEST()
229 for (nregexp = 0; nregexp < ABSL_ARRAYSIZE(t->regexps); nregexp++) in TEST()
230 if (t->regexps[nregexp] == NULL) in TEST()
232 AddRegexpsAndCompile(t->regexps, nregexp, &v); in TEST()
246 for (nregexp = 0; nregexp < ABSL_ARRAYSIZE(t->regexps); nregexp++) in TEST()
[all …]
Dpossible_match_test.cc186 int regexps() { return regexps_; } in regexps() function in re2::PossibleMatchTester
247 ABSL_LOG(INFO) << t.regexps() << " regexps, " in TEST()
/external/cronet/tot/third_party/re2/src/re2/testing/
Dregexp_generator.cc199 std::stack<std::string> regexps; in RunPostfix() local
205 regexps.push(post[i]); in RunPostfix()
210 std::string a = regexps.top(); in RunPostfix()
211 regexps.pop(); in RunPostfix()
212 regexps.push("(?:" + absl::StrFormat(*fmt, a) + ")"); in RunPostfix()
218 std::string b = regexps.top(); in RunPostfix()
219 regexps.pop(); in RunPostfix()
220 std::string a = regexps.top(); in RunPostfix()
221 regexps.pop(); in RunPostfix()
222 regexps.push("(?:" + absl::StrFormat(*fmt, a, b) + ")"); in RunPostfix()
[all …]
Dfiltered_re2_test.cc79 const char* regexps[20]; member
150 void AddRegexpsAndCompile(const char* regexps[], in AddRegexpsAndCompile() argument
155 v->f.Add(regexps[i], v->opts, &id); in AddRegexpsAndCompile()
194 for (nregexp = 0; nregexp < ABSL_ARRAYSIZE(t->regexps); nregexp++) in TEST()
195 if (t->regexps[nregexp] == NULL) in TEST()
200 AddRegexpsAndCompile(t->regexps, nregexp, &v); in TEST()
229 for (nregexp = 0; nregexp < ABSL_ARRAYSIZE(t->regexps); nregexp++) in TEST()
230 if (t->regexps[nregexp] == NULL) in TEST()
232 AddRegexpsAndCompile(t->regexps, nregexp, &v); in TEST()
246 for (nregexp = 0; nregexp < ABSL_ARRAYSIZE(t->regexps); nregexp++) in TEST()
[all …]
Dpossible_match_test.cc186 int regexps() { return regexps_; } in regexps() function in re2::PossibleMatchTester
247 ABSL_LOG(INFO) << t.regexps() << " regexps, " in TEST()
/external/regex-re2/re2/
Dfiltered_re2.cc85 std::vector<int> regexps; in FirstMatch() local
86 prefilter_tree_->RegexpsGivenStrings(atoms, &regexps); in FirstMatch()
87 for (size_t i = 0; i < regexps.size(); i++) in FirstMatch()
88 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]])) in FirstMatch()
89 return regexps[i]; in FirstMatch()
98 std::vector<int> regexps; in AllMatches() local
99 prefilter_tree_->RegexpsGivenStrings(atoms, &regexps); in AllMatches()
100 for (size_t i = 0; i < regexps.size(); i++) in AllMatches()
101 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]])) in AllMatches()
102 matching_regexps->push_back(regexps[i]); in AllMatches()
Dprefilter_tree.cc291 entry->regexps.push_back(static_cast<int>(i)); in AssignUniqueIds()
298 std::vector<int>* regexps) const { in RegexpsGivenStrings()
299 regexps->clear(); in RegexpsGivenStrings()
309 regexps->push_back(static_cast<int>(i)); in RegexpsGivenStrings()
319 regexps->push_back(it->index()); in RegexpsGivenStrings()
321 regexps->insert(regexps->end(), unfiltered_.begin(), unfiltered_.end()); in RegexpsGivenStrings()
323 std::sort(regexps->begin(), regexps->end()); in RegexpsGivenStrings()
327 IntMap* regexps) const { in PropagateMatch()
335 for (size_t i = 0; i < entry.regexps.size(); i++) in PropagateMatch()
336 regexps->set(entry.regexps[i], 1); in PropagateMatch()
[all …]
Dprefilter_tree.h54 std::vector<int>* regexps) const;
84 std::vector<int> regexps; member
97 IntMap* regexps) const;
/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/re2/re2/
Dfiltered_re2.cc101 std::vector<int> regexps; in FirstMatch() local
102 prefilter_tree_->RegexpsGivenStrings(atoms, &regexps); in FirstMatch()
103 for (size_t i = 0; i < regexps.size(); i++) in FirstMatch()
104 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]])) in FirstMatch()
105 return regexps[i]; in FirstMatch()
114 std::vector<int> regexps; in AllMatches() local
115 prefilter_tree_->RegexpsGivenStrings(atoms, &regexps); in AllMatches()
116 for (size_t i = 0; i < regexps.size(); i++) in AllMatches()
117 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]])) in AllMatches()
118 matching_regexps->push_back(regexps[i]); in AllMatches()
Dprefilter_tree.cc262 entry->regexps.push_back(static_cast<int>(i)); in AssignUniqueIds()
269 std::vector<int>* regexps) const { in RegexpsGivenStrings()
270 regexps->clear(); in RegexpsGivenStrings()
280 regexps->push_back(static_cast<int>(i)); in RegexpsGivenStrings()
290 regexps->push_back(it->index()); in RegexpsGivenStrings()
292 regexps->insert(regexps->end(), unfiltered_.begin(), unfiltered_.end()); in RegexpsGivenStrings()
294 std::sort(regexps->begin(), regexps->end()); in RegexpsGivenStrings()
298 IntMap* regexps) const { in PropagateMatch()
306 for (size_t i = 0; i < entry.regexps.size(); i++) in PropagateMatch()
307 regexps->set(entry.regexps[i], 1); in PropagateMatch()
[all …]
Dprefilter_tree.h54 std::vector<int>* regexps) const;
85 std::vector<int> regexps; member
98 IntMap* regexps) const;
/external/cronet/tot/third_party/re2/src/re2/
Dfiltered_re2.cc104 std::vector<int> regexps; in FirstMatch() local
105 prefilter_tree_->RegexpsGivenStrings(atoms, &regexps); in FirstMatch()
106 for (size_t i = 0; i < regexps.size(); i++) in FirstMatch()
107 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]])) in FirstMatch()
108 return regexps[i]; in FirstMatch()
116 std::vector<int> regexps; in AllMatches() local
117 prefilter_tree_->RegexpsGivenStrings(atoms, &regexps); in AllMatches()
118 for (size_t i = 0; i < regexps.size(); i++) in AllMatches()
119 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]])) in AllMatches()
120 matching_regexps->push_back(regexps[i]); in AllMatches()
Dprefilter_tree.cc217 entry->regexps.push_back(static_cast<int>(i)); in AssignUniqueIds()
270 std::vector<int>* regexps) const { in RegexpsGivenStrings()
271 regexps->clear(); in RegexpsGivenStrings()
282 regexps->push_back(static_cast<int>(i)); in RegexpsGivenStrings()
292 regexps->push_back(it->index()); in RegexpsGivenStrings()
294 regexps->insert(regexps->end(), unfiltered_.begin(), unfiltered_.end()); in RegexpsGivenStrings()
296 std::sort(regexps->begin(), regexps->end()); in RegexpsGivenStrings()
300 IntMap* regexps) const { in PropagateMatch()
308 for (size_t i = 0; i < entry.regexps.size(); i++) in PropagateMatch()
309 regexps->set(entry.regexps[i], 1); in PropagateMatch()
[all …]
Dprefilter_tree.h55 std::vector<int>* regexps) const;
101 std::vector<int> regexps; member
114 IntMap* regexps) const;
/external/cronet/stable/third_party/re2/src/re2/
Dfiltered_re2.cc104 std::vector<int> regexps; in FirstMatch() local
105 prefilter_tree_->RegexpsGivenStrings(atoms, &regexps); in FirstMatch()
106 for (size_t i = 0; i < regexps.size(); i++) in FirstMatch()
107 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]])) in FirstMatch()
108 return regexps[i]; in FirstMatch()
116 std::vector<int> regexps; in AllMatches() local
117 prefilter_tree_->RegexpsGivenStrings(atoms, &regexps); in AllMatches()
118 for (size_t i = 0; i < regexps.size(); i++) in AllMatches()
119 if (RE2::PartialMatch(text, *re2_vec_[regexps[i]])) in AllMatches()
120 matching_regexps->push_back(regexps[i]); in AllMatches()
Dprefilter_tree.cc217 entry->regexps.push_back(static_cast<int>(i)); in AssignUniqueIds()
270 std::vector<int>* regexps) const { in RegexpsGivenStrings()
271 regexps->clear(); in RegexpsGivenStrings()
282 regexps->push_back(static_cast<int>(i)); in RegexpsGivenStrings()
292 regexps->push_back(it->index()); in RegexpsGivenStrings()
294 regexps->insert(regexps->end(), unfiltered_.begin(), unfiltered_.end()); in RegexpsGivenStrings()
296 std::sort(regexps->begin(), regexps->end()); in RegexpsGivenStrings()
300 IntMap* regexps) const { in PropagateMatch()
308 for (size_t i = 0; i < entry.regexps.size(); i++) in PropagateMatch()
309 regexps->set(entry.regexps[i], 1); in PropagateMatch()
[all …]
Dprefilter_tree.h55 std::vector<int>* regexps) const;
101 std::vector<int> regexps; member
114 IntMap* regexps) const;
/external/libxml2/
Dmeson_options.txt21 # [X] regexps
130 option('regexps', feature

123