| /third_party/rust/crates/regex/tests/ |
| H A D | searcher.rs | 1 macro_rules! searcher { macros
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...] |
| H A D | test_nfa_utf8bytes.rs | 46 mod searcher; modules
|
| H A D | test_nfa.rs | 42 mod searcher; modules
|
| H A D | test_backtrack_utf8bytes.rs | 50 mod searcher; modules
|
| H A D | test_backtrack.rs | 48 mod searcher; modules
|
| H A D | test_default.rs | 53 mod searcher; modules
|
| /third_party/rust/crates/memchr/bench/src/memmem/ |
| H A 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 in search_long_haystack()
[all...] |
| /third_party/rust/crates/aho-corasick/bench/src/ |
| H A 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/memchr/src/memmem/ |
| H A D | mod.rs | 53 It may be possible for the overhead of constructing a substring searcher to be
324 let prestate = finder.searcher.prefilter_state();
356 .searcher in next()
435 /// A single substring searcher fixed to a particular needle.
438 /// searcher that can be used to search haystacks without the overhead of
439 /// constructing the searcher in the first place. This is a somewhat niche
443 /// observe searcher construction time in a profile.
450 searcher: Searcher<'n>,
485 self.searcher.find(&mut self.searcher in find()
[all...] |
| /third_party/rust/crates/aho-corasick/src/packed/ |
| H A D | api.rs | 14 /// searcher.
56 /// The configuration for a packed multiple pattern searcher.
59 /// match semantics (leftmost-first or leftmost-longest) of a searcher. In the
75 /// let searcher = Config::new()
81 /// let matches: Vec<usize> = searcher
103 /// When an algorithm is forced, if a searcher could not be constructed for it,
104 /// then no searcher will be returned even if an alternative algorithm would
198 /// A builder for constructing a packed searcher from a collection of patterns.
202 /// This example shows how to use a builder to construct a searcher. By
209 /// let searcher
[all...] |
| /third_party/rust/crates/regex/src/ |
| H A D | re_set.rs | 180 self.0.searcher().is_match_at($as_bytes(text), start) in is_match_at()
247 self.0.searcher().many_matches_at(matches, $as_bytes(text), start) in read_matches_at()
|
| H A D | exec.rs | 1261 /// Get a searcher that isn't Sync.
1263 pub fn searcher(&self) -> ExecNoSync<'_> { in searcher() functions
1270 /// Get a searcher that isn't Sync and can match on &str.
1273 ExecNoSyncStr(self.searcher()) in searcher_str()
|
| /third_party/python/Lib/idlelib/idle_test/ |
| H A D | test_editor.py | 200 searcher = (self.text)
|
| /third_party/rust/crates/memchr/bench/data/code/ |
| H A D | rust-library.rs | 5248 let mut searcher = pat.into_searcher(haystack); in cmp_search_to_vec() variables
5251 match if !rev { searcher.next() } else { searcher.next_back() } { in cmp_search_to_vec()
17404 let mut searcher = pat.into_searcher(self); in remove_matches() variables
17407 while let Some(m) = searcher.next_match() { in remove_matches()
[all...] |