memchr 2.7.3

Provides extremely fast (uses SIMD on x86_64, aarch64 and wasm32) routines for 1, 2 or 3 byte search and single substring search.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

/*!
This module defines "naive" implementations of substring search.

These are sometimes useful to compare with "real" substring implementations.
The idea is that they are so simple that they are unlikely to be incorrect.
*/

/// Naively search forwards for the given needle in the given haystack.
pub(crate) fn find(haystack: &[u8], needle: &[u8]) -> Option<usize> {
    let end = haystack.len().checked_sub(needle.len()).map_or(0, |i| i + 1);
    for i in 0..end {
        if needle == &haystack[i..i + needle.len()] {
            return Some(i);
        }
    }
    None
}

/// Naively search in reverse for the given needle in the given haystack.
pub(crate) fn rfind(haystack: &[u8], needle: &[u8]) -> Option<usize> {
    let end = haystack.len().checked_sub(needle.len()).map_or(0, |i| i + 1);
    for i in (0..end).rev() {
        if needle == &haystack[i..i + needle.len()] {
            return Some(i);
        }
    }
    None
}

#[cfg(test)]
mod tests {
    use crate::tests::substring;

    use super::*;

    #[test]
    fn forward() {
        substring::Runner::new().fwd(|h, n| Some(find(h, n))).run()
    }

    #[test]
    fn reverse() {
        substring::Runner::new().rev(|h, n| Some(rfind(h, n))).run()
    }
}