1pub fn find(haystack: &[u8], needle: &[u8]) -> Option<usize> {
9 if needle.is_empty() {
10 return None;
11 }
12 memchr::memmem::find(haystack, needle)
13}
14
15pub fn find_from(haystack: &[u8], needle: &[u8], from: usize) -> Option<usize> {
17 let tail = haystack.get(from..)?;
18 find(tail, needle).map(|relative| from + relative)
19}
20
21pub fn find_in(haystack: &[u8], needle: &[u8], start: usize, end: usize) -> Option<usize> {
23 let window = haystack.get(start..end)?;
24 find(window, needle).map(|relative| start + relative)
25}
26
27pub fn contains(haystack: &[u8], needle: &[u8]) -> bool {
29 find(haystack, needle).is_some()
30}
31
32pub fn find_iter<'a>(haystack: &'a [u8], needle: &'a [u8]) -> impl Iterator<Item = usize> + 'a {
36 let search = if needle.is_empty() {
37 None
38 } else {
39 Some(memchr::memmem::find_iter(haystack, needle))
40 };
41 search.into_iter().flatten()
42}
43
44#[cfg(test)]
45mod tests {
46 use super::{contains, find, find_from, find_in, find_iter};
47
48 #[test]
49 fn empty_needle_is_never_a_match() {
50 assert_eq!(find(b"abc", b""), None);
51 assert_eq!(find_from(b"abc", b"", 1), None);
52 assert_eq!(find_in(b"abc", b"", 0, 3), None);
53 assert!(!contains(b"abc", b""));
54 assert_eq!(
55 find_iter(b"abc", b"").collect::<Vec<_>>(),
56 Vec::<usize>::new()
57 );
58 }
59
60 #[test]
61 fn finds_absolute_and_ranged_offsets() {
62 let haystack = b"xxabcxxabc";
63 assert_eq!(find(haystack, b"abc"), Some(2));
64 assert_eq!(find_from(haystack, b"abc", 3), Some(7));
65 assert_eq!(find_in(haystack, b"abc", 3, 10), Some(7));
66 assert_eq!(find_in(haystack, b"abc", 3, 6), None);
67 assert!(contains(haystack, b"abc"));
68 assert_eq!(find_iter(haystack, b"abc").collect::<Vec<_>>(), [2, 7]);
69 }
70}