| /third_party/rust/crates/regex/tests/ |
| D | searcher.rs | 1 macro_rules! searcher { macro
3 searcher!($name, $re, $haystack, vec vec![]);
6 searcher!($name, $re, $haystack, vec vec![$($steps),*]);
9 searcher!($name, $re, $haystack, vec vec![$($steps),*]);
33 searcher!(searcher_empty_regex_empty_haystack, r"", "", Match(0, 0));
34 searcher!(
44 searcher!(searcher_empty_haystack, r"\d", "");
45 searcher!(searcher_one_match, r"\d", "5", Match(0, 1));
46 searcher!(searcher_no_match, r"\d", "a", Reject(0, 1));
47 searcher!(
[all …]
|
| D | test_backtrack_utf8bytes.rs | 50 mod searcher; module
|
| D | test_nfa_utf8bytes.rs | 46 mod searcher; module
|
| D | test_backtrack.rs | 48 mod searcher; module
|
| D | test_nfa.rs | 42 mod searcher; module
|
| D | test_default.rs | 53 mod searcher; module
|
| /third_party/rust/crates/memchr/bench/src/memmem/ |
| D | sliceslice.rs | 53 for (i, searcher) in searchers.iter().enumerate() { in search_short_haystack()
56 searcher.find(haystack.as_bytes()).is_some(), in search_short_haystack()
79 for (i, searcher) in searchers.iter().enumerate() { in search_short_haystack()
82 searcher.find(haystack.as_bytes()).is_some(), in search_short_haystack()
124 for (i, searcher) in searchers.iter().enumerate() { in search_short_haystack()
127 searcher.search_in(haystack.as_bytes()) in search_short_haystack()
151 for searcher in searchers.iter() { in search_long_haystack()
152 black_box(searcher.find(haystack.as_bytes()).is_some()); in search_long_haystack()
173 for searcher in searchers.iter() { in search_long_haystack()
174 black_box(searcher.find(haystack.as_bytes()).is_some()); in search_long_haystack()
[all …]
|
| /third_party/rust/crates/memchr/src/memmem/ |
| D | mod.rs | 324 let prestate = finder.searcher.prefilter_state(); in new()
356 .searcher in next()
450 searcher: Searcher<'n>, field
485 self.searcher.find(&mut self.searcher.prefilter_state(), haystack) in find()
532 Finder { searcher: self.searcher.into_owned() } in into_owned()
547 Finder { searcher: self.searcher.as_ref() } in as_ref()
558 self.searcher.needle() in needle()
577 searcher: SearcherRev<'n>, field
615 self.searcher.rfind(haystack.as_ref()) in rfind()
663 FinderRev { searcher: self.searcher.into_owned() } in into_owned()
[all …]
|
| /third_party/rust/crates/memchr/bench/data/sliceslice/ |
| D | README.md | 5 these benchmarks include the time it takes to build a searcher. They only
10 substring searcher is created for each of these words in the same order. The
11 actual benchmark consists of executing each searcher once on every needle that
|
| /third_party/rust/crates/aho-corasick/bench/src/ |
| D | bench.rs | 60 if let Some(searcher) = builder.build() { in define_aho_corasick()
63 assert_eq!(count, searcher.find_iter(&haystack).count()) in define_aho_corasick()
72 if let Some(searcher) = builder.build() { in define_aho_corasick()
75 assert_eq!(count, searcher.find_iter(&haystack).count()) in define_aho_corasick()
|
| /third_party/rust/crates/regex/src/ |
| D | re_bytes.rs | 189 Matches(self.0.searcher().find_iter(text)) in find_iter()
294 CaptureMatches(self.0.searcher().captures_iter(text)) in captures_iter()
571 self.0.searcher().shortest_match_at(text, start) in shortest_match_at()
581 self.0.searcher().is_match_at(text, start) in is_match_at()
596 .searcher() in find_at()
632 .searcher() in captures_read_at()
673 CaptureLocations(self.0.searcher().locations()) in capture_locations()
682 CaptureLocations(self.0.searcher().locations()) in locations()
|
| D | re_set.rs | 180 self.0.searcher().is_match_at($as_bytes(text), start)
247 self.0.searcher().many_matches_at(matches, $as_bytes(text), start)
|
| D | exec.rs | 1263 pub fn searcher(&self) -> ExecNoSync<'_> { in searcher() method
1273 ExecNoSyncStr(self.searcher()) in searcher_str()
|
| /third_party/rust/crates/aho-corasick/src/packed/ |
| D | api.rs | 529 FindIter { searcher: self, haystack: haystack.as_ref(), at: 0 } in find_iter()
605 searcher: &'s Searcher, field
617 match self.searcher.find_at(&self.haystack, self.at) { in next()
|
| /third_party/typescript/lib/ |
| D | lib.es2015.symbol.wellknown.d.ts | 259 search(searcher: { [Symbol.search](string: string): number; }): number;
|
| /third_party/typescript/src/lib/ |
| D | es2015.symbol.wellknown.d.ts | 239 search(searcher: { [Symbol.search](string: string): number; }): number;
|
| /third_party/pulseaudio/src/utils/ |
| D | qpaeq | 339 def searcher(initial,evaluator): function
357 searcher(i,partial(evaluate,self.filter_state,t_w))
|
| /third_party/rust/crates/regex/ |
| D | CHANGELOG.md | 767 Fixes a bug in the new Boyer-Moore searcher that results in a match failure.
776 Fixes a bug in the new Boyer-Moore searcher that results in a panic.
996 Improves match verification performance in the Teddy SIMD searcher.
998 Replaces slow substring loop in the Teddy SIMD searcher with Aho-Corasick.
|
| /third_party/rust/crates/aho-corasick/ |
| D | DESIGN.md | 87 because they instruct the searcher (the thing traversing the automaton while
160 haystack was `abzabcd`, then the searcher would transition back to `S0` after
|
| /third_party/rust/crates/memchr/bench/runs/2021-05-06_sliceslice-0.3.0/ |
| D | README.md | 10 in this release was to make constructing the searcher generic over the needle,
|
| /third_party/rust/crates/memchr/bench/data/code/ |
| D | rust-library.rs | 5248 let mut searcher = pat.into_searcher(haystack); localVariable
5251 match if !rev { searcher.next() } else { searcher.next_back() } {
17404 let mut searcher = pat.into_searcher(self); localVariable
17407 while let Some(m) = searcher.next_match() {
|
| /third_party/icu/icu4j/perf-tests/data/collation/ |
| D | 2drvb10.txt | 756 shalt direct the just: the searcher of hearts and reins is God. Just
12455 searcher of majesty shall be overwhelmed by glory.
14585 a true searcher of his heart, and a hearer of his tongue.
|