| /third_party/rust/crates/memchr/src/memchr/ |
| D | mod.rs | 17 pub fn memchr_iter(needle: u8, haystack: &[u8]) -> Memchr<'_> { in memchr_iter()
18 Memchr::new(needle, haystack) in memchr_iter()
23 pub fn memchr2_iter(needle1: u8, needle2: u8, haystack: &[u8]) -> Memchr2<'_> { in memchr2_iter()
24 Memchr2::new(needle1, needle2, haystack) in memchr2_iter()
33 haystack: &[u8], in memchr3_iter()
35 Memchr3::new(needle1, needle2, needle3, haystack) in memchr3_iter()
40 pub fn memrchr_iter(needle: u8, haystack: &[u8]) -> Rev<Memchr<'_>> { in memrchr_iter()
41 Memchr::new(needle, haystack).rev() in memrchr_iter()
49 haystack: &[u8], in memrchr2_iter()
51 Memchr2::new(needle1, needle2, haystack).rev() in memrchr2_iter()
[all …]
|
| D | iter.rs | 15 $self_.haystack = $self_.haystack.split_at(index + 1).1;
27 $self_.haystack = $self_.haystack.split_at(index).0;
37 haystack: &'a [u8], field
45 pub fn new(needle: u8, haystack: &[u8]) -> Memchr<'_> { in new()
46 Memchr { needle: needle, haystack: haystack, position: 0 } in new()
55 iter_next!(self, memchr(self.needle, self.haystack)) in next()
60 (0, Some(self.haystack.len())) in size_hint()
67 iter_next_back!(self, memrchr(self.needle, self.haystack)) in next_back()
76 haystack: &'a [u8], field
84 pub fn new(needle1: u8, needle2: u8, haystack: &[u8]) -> Memchr2<'_> { in new()
[all …]
|
| D | naive.rs | 3 pub fn memchr(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
4 haystack.iter().position(|&b| b == n1) in memchr()
7 pub fn memchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
8 haystack.iter().position(|&b| b == n1 || b == n2) in memchr2()
11 pub fn memchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memchr3()
12 haystack.iter().position(|&b| b == n1 || b == n2 || b == n3) in memchr3()
15 pub fn memrchr(n1: u8, haystack: &[u8]) -> Option<usize> { in memrchr()
16 haystack.iter().rposition(|&b| b == n1) in memrchr()
19 pub fn memrchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memrchr2()
20 haystack.iter().rposition(|&b| b == n1 || b == n2) in memrchr2()
[all …]
|
| D | fallback.rs | 46 pub fn memchr(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
49 let loop_size = cmp::min(LOOP_SIZE, haystack.len()); in memchr()
51 let start_ptr = haystack.as_ptr(); in memchr()
55 let end_ptr = start_ptr.add(haystack.len()); in memchr()
56 if haystack.len() < USIZE_BYTES { in memchr()
85 pub fn memchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
90 let start_ptr = haystack.as_ptr(); in memchr2()
94 let end_ptr = start_ptr.add(haystack.len()); in memchr2()
95 if haystack.len() < USIZE_BYTES { in memchr2()
125 pub fn memchr3(n1: u8, n2: u8, n3: u8, haystack: &[u8]) -> Option<usize> { in memchr3()
[all …]
|
| D | c.rs | 8 pub fn memchr(needle: u8, haystack: &[u8]) -> Option<usize> { in memchr()
12 haystack.as_ptr() as *const c_void, in memchr()
14 haystack.len() as size_t, in memchr()
20 Some(p as usize - (haystack.as_ptr() as usize)) in memchr()
26 pub fn memrchr(needle: u8, haystack: &[u8]) -> Option<usize> { in memrchr()
28 if haystack.is_empty() { in memrchr()
34 haystack.as_ptr() as *const c_void, in memrchr()
36 haystack.len() as size_t, in memrchr()
42 Some(p as usize - (haystack.as_ptr() as usize)) in memrchr()
|
| /third_party/rust/crates/aho-corasick/src/packed/teddy/ |
| D | runtime.rs | 106 haystack: &[u8], in find_at()
127 assert!(haystack[at..].len() >= self.minimum_len()); in find_at()
138 e.find_at(pats, self, haystack, at) in find_at()
141 e.find_at(pats, self, haystack, at) in find_at()
144 e.find_at(pats, self, haystack, at) in find_at()
147 e.find_at(pats, self, haystack, at) in find_at()
150 e.find_at(pats, self, haystack, at) in find_at()
153 e.find_at(pats, self, haystack, at) in find_at()
156 e.find_at(pats, self, haystack, at) in find_at()
159 e.find_at(pats, self, haystack, at) in find_at()
[all …]
|
| /third_party/rust/crates/memchr/src/memmem/ |
| D | rabinkarp.rs | 35 pub(crate) fn is_fast(haystack: &[u8], _needle: &[u8]) -> bool { in is_fast()
36 haystack.len() < 16 in is_fast()
40 pub(crate) fn find(haystack: &[u8], needle: &[u8]) -> Option<usize> { in find()
41 find_with(&NeedleHash::forward(needle), haystack, needle) in find()
48 mut haystack: &[u8], in find_with()
51 if haystack.len() < needle.len() { in find_with()
54 let start = haystack.as_ptr() as usize; in find_with()
55 let mut hash = Hash::from_bytes_fwd(&haystack[..needle.len()]); in find_with()
59 if nhash.eq(hash) && is_prefix(haystack, needle) { in find_with()
60 return Some(haystack.as_ptr() as usize - start); in find_with()
[all …]
|
| D | mod.rs | 102 haystack: Vec<u8>,
105 proptests::matches_naive(false, &haystack, &needle, $fwd)
117 haystack: Vec<u8>,
120 proptests::matches_naive(true, &haystack, &needle, $rev)
191 haystack: &'h [u8], in find_iter()
194 FindIter::new(haystack, Finder::new(needle)) in find_iter()
225 haystack: &'h [u8], in rfind_iter()
228 FindRevIter::new(haystack, FinderRev::new(needle)) in rfind_iter()
259 pub fn find(haystack: &[u8], needle: &[u8]) -> Option<usize> { in find()
260 if haystack.len() < 64 { in find()
[all …]
|
| D | twoway.rs | 110 haystack: &[u8], in find()
114 debug_assert!(needle.len() <= haystack.len(), "haystack too short"); in find()
118 self.find_small_imp(pre, haystack, needle, period) in find()
121 self.find_large_imp(pre, haystack, needle, shift) in find()
133 haystack: &[u8], in find_general()
138 } else if haystack.len() < needle.len() { in find_general()
141 self.find(pre, haystack, needle) in find_general()
155 haystack: &[u8], in find_small_imp()
162 while pos + needle.len() <= haystack.len() { in find_small_imp()
166 pos += pre.call(&haystack[pos..], needle)?; in find_small_imp()
[all …]
|
| /third_party/rust/crates/memchr/bench/src/memchr/ |
| D | imp.rs | 5 pub fn memchr1_count(b1: u8, haystack: &[u8]) -> usize { in memchr1_count()
6 Memchr::new(b1, haystack).count() in memchr1_count()
9 pub fn memchr1_libc_count(b1: u8, haystack: &[u8]) -> usize { in memchr1_libc_count()
12 while let Some(i) = c::memchr(b1, &haystack[start..]) { in memchr1_libc_count()
19 pub fn fallback1_count(b1: u8, haystack: &[u8]) -> usize { in fallback1_count()
22 while let Some(i) = fallback::memchr(b1, &haystack[start..]) { in fallback1_count()
29 pub fn naive1_count(b1: u8, haystack: &[u8]) -> usize { in naive1_count()
32 while let Some(i) = naive::memchr(b1, &haystack[start..]) { in naive1_count()
39 pub fn memchr2_count(b1: u8, b2: u8, haystack: &[u8]) -> usize { in memchr2_count()
40 Memchr2::new(b1, b2, haystack).count() in memchr2_count()
[all …]
|
| /third_party/rust/crates/memchr/bench/src/memmem/ |
| D | imp.rs | 29 pub(crate) fn oneshot(haystack: &str, needle: &str) -> bool { in oneshot()
30 memmem::find(haystack.as_bytes(), needle.as_bytes()).is_some() in oneshot()
41 haystack: &'a str, in oneshotiter()
44 memmem::find_iter(haystack.as_bytes(), needle.as_bytes()) in oneshotiter()
57 haystack: &'a str, in iter()
59 self.0.find_iter(haystack.as_bytes()) in iter()
67 pub(crate) fn oneshot(haystack: &str, needle: &str) -> bool { in oneshot()
68 memmem::rfind(haystack.as_bytes(), needle.as_bytes()).is_some() in oneshot()
79 haystack: &'a str, in oneshotiter()
82 memmem::rfind_iter(haystack.as_bytes(), needle.as_bytes()) in oneshotiter()
[all …]
|
| D | sliceslice.rs | 54 for haystack in &needles[i..] { in search_short_haystack()
56 searcher.find(haystack.as_bytes()).is_some(), in search_short_haystack()
80 for haystack in &needles[i..] { in search_short_haystack()
82 searcher.find(haystack.as_bytes()).is_some(), in search_short_haystack()
98 for haystack in &needles[i..] { in search_short_haystack()
99 black_box(haystack.contains(needle)); in search_short_haystack()
125 for haystack in &needles[i..] { in search_short_haystack()
127 searcher.search_in(haystack.as_bytes()) in search_short_haystack()
139 let haystack = SLICESLICE_HAYSTACK; in search_long_haystack() localVariable
152 black_box(searcher.find(haystack.as_bytes()).is_some()); in search_long_haystack()
[all …]
|
| /third_party/ffmpeg/libavutil/tests/ |
| D | avstring.c | 57 const char *haystack = "Education consists mainly in what we have unlearned."; in main() local
86 #define TEST_STRNSTR(haystack, needle, hay_length, expected) \ in main() argument
87 ptr = av_strnstr(haystack, needle, hay_length); \ in main()
91 TEST_STRNSTR(haystack, needle [0], strlen(haystack), haystack+44); in main()
92 TEST_STRNSTR(haystack, needle [1], strlen(haystack), haystack+42); in main()
93 TEST_STRNSTR(haystack, needle [2], strlen(haystack), NULL ); in main()
94 TEST_STRNSTR(haystack, strings[1], strlen(haystack), haystack ); in main()
97 #define TEST_STRIREPLACE(haystack, needle, expected) \ in main() argument
98 ptr = av_strireplace(haystack, needle, "instead"); \ in main()
107 TEST_STRIREPLACE(haystack, needle [0], "Education consists mainly in what we have uninstead"); in main()
[all …]
|
| /third_party/rust/crates/regex/bench/src/ |
| D | main.rs | 47 let haystack = unsafe { str::from_utf8_unchecked(&mmap) }; in main() localVariable
49 println!("{}", args.count(&haystack)); in main()
53 fn count(&self, haystack: &str) -> usize { in count()
56 count_onig(pat, haystack) in count()
58 count_pcre1(pat, haystack) in count()
60 count_pcre2(pat, haystack) in count()
62 count_re2(pat, haystack) in count()
64 count_rust(pat, haystack) in count()
66 count_rust_bytes(pat, haystack) in count()
68 count_tcl(pat, haystack) in count()
[all …]
|
| /third_party/rust/crates/aho-corasick/src/ |
| D | automaton.rs | 188 haystack: &[u8], in standard_find_at()
196 haystack, in standard_find_at()
201 self.standard_find_at_imp(prestate, None, haystack, at, state_id) in standard_find_at()
213 haystack: &[u8], in standard_find_at_imp()
217 while at < haystack.len() { in standard_find_at_imp()
221 let c = prefilter::next(prestate, pre, haystack, at) in standard_find_at_imp()
236 *state_id = self.next_state_no_fail(*state_id, haystack[at]); in standard_find_at_imp()
273 haystack: &[u8], in leftmost_find_at()
281 haystack, in leftmost_find_at()
286 self.leftmost_find_at_imp(prestate, None, haystack, at, state_id) in leftmost_find_at()
[all …]
|
| D | ahocorasick.rs | 183 pub fn is_match<B: AsRef<[u8]>>(&self, haystack: B) -> bool { in is_match()
184 self.earliest_find(haystack).is_some() in is_match()
211 pub fn earliest_find<B: AsRef<[u8]>>(&self, haystack: B) -> Option<Match> { in earliest_find()
216 haystack.as_ref(), in earliest_find()
283 pub fn find<B: AsRef<[u8]>>(&self, haystack: B) -> Option<Match> { in find()
285 self.imp.find_at_no_state(&mut prestate, haystack.as_ref(), 0) in find()
352 haystack: &'b B, in find_iter()
354 FindIter::new(self, haystack.as_ref()) in find_iter()
395 haystack: &'b B, in find_overlapping_iter()
397 FindOverlappingIter::new(self, haystack.as_ref()) in find_overlapping_iter()
[all …]
|
| /third_party/rust/crates/memchr/src/memchr/x86/ |
| D | mod.rs | 36 ($fnty:ty, $name:ident, $haystack:ident, $($needle:ident),+) => {{
43 fn detect($($needle: u8),+, haystack: &[u8]) -> Option<usize> {
58 mem::transmute::<FnRaw, $fnty>(fun)($($needle),+, haystack)
68 mem::transmute::<FnRaw, $fnty>(fun)($($needle),+, $haystack)
85 ($fnty:ty, $name:ident, $haystack:ident, $($needle:ident),+) => {{
87 unsafe { sse2::$name($($needle),+, $haystack) }
89 fallback::$name($($needle),+, $haystack)
95 pub fn memchr(n1: u8, haystack: &[u8]) -> Option<usize> { in memchr()
96 unsafe_ifunc!(fn(u8, &[u8]) -> Option<usize>, memchr, haystack, n1) in memchr()
100 pub fn memchr2(n1: u8, n2: u8, haystack: &[u8]) -> Option<usize> { in memchr2()
[all …]
|
| /third_party/rust/crates/aho-corasick/bench/src/ |
| D | random.rs | 92 |ac, haystack| ac.find_iter(haystack).count(), in many_patterns()
103 |ac, haystack| ac.find_iter(haystack).count(), in many_patterns()
114 |ac, haystack| ac.find_iter(haystack).count(), in many_patterns()
126 |ac, haystack| ac.find_overlapping_iter(haystack).count(), in many_patterns()
140 |ac, haystack| ac.find_iter(haystack).count(), in many_patterns()
151 |ac, haystack| ac.find_iter(haystack).count(), in many_patterns()
162 |ac, haystack| ac.find_iter(haystack).count(), in many_patterns()
174 |ac, haystack| ac.find_overlapping_iter(haystack).count(), in many_patterns()
|
| D | bench.rs | 34 let haystack = corpus.to_vec(); in define_aho_corasick() localVariable
42 b.iter(|| assert_eq!(count, aut.find_iter(&haystack).count())); in define_aho_corasick()
45 let haystack = corpus.to_vec(); in define_aho_corasick() localVariable
53 b.iter(|| assert_eq!(count, aut.find_iter(&haystack).count())); in define_aho_corasick()
57 let haystack = corpus.to_vec(); in define_aho_corasick() localVariable
63 assert_eq!(count, searcher.find_iter(&haystack).count()) in define_aho_corasick()
69 let haystack = corpus.to_vec(); in define_aho_corasick() localVariable
75 assert_eq!(count, searcher.find_iter(&haystack).count()) in define_aho_corasick()
100 let haystack = corpus.to_vec(); in define_aho_corasick_dfa() localVariable
109 b.iter(|| assert_eq!(count, counter(&aut, &haystack))) in define_aho_corasick_dfa()
[all …]
|
| /third_party/rust/crates/aho-corasick/src/packed/ |
| D | api.rs | 449 pub fn find<B: AsRef<[u8]>>(&self, haystack: B) -> Option<Match> { in find()
450 self.find_at(haystack, 0) in find()
484 haystack: B, in find_at()
487 let haystack = haystack.as_ref(); in find_at() localVariable
490 if haystack[at..].len() < teddy.minimum_len() { in find_at()
491 return self.slow_at(haystack, at); in find_at()
493 teddy.find_at(&self.patterns, haystack, at) in find_at()
496 self.rabinkarp.find_at(&self.patterns, haystack, at) in find_at()
527 haystack: &'b B, in find_iter()
529 FindIter { searcher: self, haystack: haystack.as_ref(), at: 0 } in find_iter()
[all …]
|
| /third_party/rust/crates/regex/regex-capi/src/ |
| D | rure.rs | 161 haystack: *const u8,
166 let haystack = unsafe { slice::from_raw_parts(haystack, len) }; localVariable
167 re.is_match_at(haystack, start)
174 haystack: *const u8,
180 let haystack = unsafe { slice::from_raw_parts(haystack, len) }; localVariable
181 re.find_at(haystack, start).map(|m| unsafe {
193 haystack: *const u8,
199 let haystack = unsafe { slice::from_raw_parts(haystack, len) }; localVariable
201 re.read_captures_at(slots, haystack, start).is_some()
208 haystack: *const u8,
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | controlFlowPropertyDeclarations.js | 51 function endsWith(haystack, needle) { argument
52 return haystack.slice(-needle.length) === needle;
63 function trimEnd(haystack, needle) { argument
64 return endsWith(haystack, needle)
65 ? haystack.slice(0, -needle.length)
66 : haystack;
199 function endsWith(haystack, needle) {
200 return haystack.slice(-needle.length) === needle;
210 function trimEnd(haystack, needle) {
211 return endsWith(haystack, needle)
[all …]
|
| /third_party/rust/crates/memchr/src/memmem/x86/ |
| D | avx.rs | 41 haystack: &[u8], in find()
47 unsafe { self.find_impl(haystack, needle) } in find()
60 haystack: &[u8], in find_impl()
63 if haystack.len() < self.0.min_haystack_len::<__m256i>() { in find_impl()
64 genericsimd::fwd_find::<__m128i>(&self.0, haystack, needle) in find_impl()
66 genericsimd::fwd_find::<__m256i>(&self.0, haystack, needle) in find_impl()
95 haystack: &[u8], in find()
110 haystack: &[u8], in find()
113 super::Forward::new(ninfo, needle).unwrap().find(haystack, needle) in find()
135 t.haystack.len() >= fwd.min_haystack_len() in prefilter_permutations()
|
| /third_party/rust/crates/regex/src/ |
| D | pattern.rs | 7 haystack: &'t str, field
16 fn into_searcher(self, haystack: &'t str) -> RegexSearcher<'r, 't> { in into_searcher()
18 haystack, in into_searcher()
19 it: self.find_iter(haystack), in into_searcher()
28 fn haystack(&self) -> &'t str { in haystack() method
29 self.haystack in haystack()
41 if self.last_step_end < self.haystack().len() { in next()
43 self.last_step_end = self.haystack().len(); in next()
44 SearchStep::Reject(last, self.haystack().len()) in next()
|
| /third_party/rust/crates/regex/regex-capi/ctest/ |
| D | test.c | 15 const char *haystack = "snowman: \xE2\x98\x83"; in test_is_match() local
18 bool matched = rure_is_match(re, (const uint8_t *)haystack, in test_is_match()
19 strlen(haystack), 0); in test_is_match()
33 const char *haystack = "aaaaa"; in test_shortest_match() local
37 bool matched = rure_shortest_match(re, (const uint8_t *)haystack, in test_shortest_match()
38 strlen(haystack), 0, &end); in test_shortest_match()
62 const char *haystack = "snowman: \xE2\x98\x83"; in test_find() local
66 bool matched = rure_find(re, (const uint8_t *)haystack, strlen(haystack), in test_find()
91 const char *haystack = "snowman: \xE2\x98\x83"; in test_captures() local
96 bool matched = rure_find_captures(re, (const uint8_t *)haystack, in test_captures()
[all …]
|