Home
last modified time | relevance | path

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

12

/external/rust/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.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()
Drandom_test.cc46 t.regexps(), t.tests(), t.failures(), maxstrlen, (int)stralphabet.size()); in RandomTest()
Dexhaustive_tester.h58 int regexps() { return regexps_; } in regexps() function
Dexhaustive_tester.cc168 t.regexps(), t.tests(), t.failures(), maxstrlen, (int)stralphabet.size()); in ExhaustiveTest()
/external/rust/crates/grpcio-sys/grpc/third_party/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/llvm-project/lldb/test/API/lang/c/function_types/
DTestFunctionTypes.py60 regexps = ['lib.*\.dylib`printf']
62 regexps = ['printf']
65 patterns=regexps)
/external/llvm-project/llvm/test/tools/UpdateTestChecks/update_test_checks/
Dargument_name_reuse.test1 # Verify we reuse the argument regexps with --function-signature
4 # Verify we do not reuse the argument regexps, as there are none, without --function-signature
/external/dtc/tests/
Dcomments.dts1 /* regexps for lexing comments are.. tricky. Check if we've actually
/external/oss-fuzz/projects/libxslt/
Dbuild.sh41 --without-regexps \
/external/python/cpython2/Demo/scripts/
DREADME8 find-uname.py Search for Unicode characters using regexps
/external/libxml2/VxWorks/
Dbuild.sh22 ./configure --with-minimum --with-reader --with-writer --with-regexps --with-threads --with-thread-…
DREADME34 ./configure --with-minimum --with-reader --with-writer --with-regexps
/external/llvm-project/clang/test/Analysis/
Ddispatch-once.m34 // Use regexps to check that we're NOT suggesting to make this static.
/external/markdown/docs/
DCHANGE_LOG117 (a patch from Stelios Xanthakis). Chris Clark's new regexps that do
/external/testng/
DTODO.txt130 Group regexps for launching
/external/rust/crates/grpcio-sys/grpc/third_party/re2/doc/
Dsyntax.txt441 (*ACCEPT) make regexps more like Prolog NOT SUPPORTED
/external/libxml2/
Dconfigure.ac170 AC_ARG_WITH(regexps, optwith
171 [ --with-regexps add Regular Expressions support (on)])
DNEWS1282 tree skipping function fix (Ashwin), Schemas regexps escaping fix
1409 fix char 0x2d in regexps (William), regexp quantifier range with
1464 bug on misformed SSD regexps (Christopher Boumenot)
1550 transition bug in regexps, ctxt->standalone = -2 to indicate no
1719 Reed), error extraction API from regexps, new XMLSave option for format
1899 reported by Holger Rauch, nanohttp fd leak (William), regexps char
DChangeLog376 * xmlregexp.c: production [19] from XML Schemas regexps were a
832 regexps starting with the character '-'
1508 #362714 on regexps missing ']'
2904 regexps and automata. Not fully finished but should be way better.
10803 which the RNG can be compiled to regexps. Works on all regression
11593 python/types.c: fixing #104096 to compile without regexps
12846 python/types.c: added access to the XML Schemas regexps from
12902 made configuring with regexps/automata/unicode the default
12906 problem by switching to a compact form for determinist regexps
12943 the regexps for actual DTD validation
[all …]
/external/libtextclassifier/native/annotator/
Dmodel.fbs692 // List of regexps to run over each token. For each regexp, if there is a
/external/angle/tools/flex-bison/third_party/m4sugar/
Dm4sugar.m4954 # macro invocations inside strings with [] blocks (for instance regexps

12