Finder - memchr

`impl Finder`

fn new(needle: &[u8]) -> Option<Finder>

Create a new Shift-Or forward searcher for the given needle.

The needle may be empty. The empty needle matches at every byte offset.

fn find(self: &Self, haystack: &[u8]) -> Option<usize>

Return the first occurrence of the needle given to Finder::new in the haystack given. If no such occurrence exists, then None is returned.

Unlike most other substring search implementations in this crate, this finder does not require passing the needle at search time. A match can be determined without the needle at all since the required information is already encoded into this finder at construction time.

The maximum value this can return is haystack.len(), which can only occur when the needle and haystack both have length zero. Otherwise, for non-empty haystacks, the maximum value is haystack.len() - 1.

`impl Debug for Finder`

fn fmt(self: &Self, f: &mut $crate::fmt::Formatter<'_>) -> $crate::fmt::Result

`impl Freeze for Finder`

`impl RefUnwindSafe for Finder`

`impl Send for Finder`

`impl Sync for Finder`

`impl Unpin for Finder`

`impl UnwindSafe for Finder`

`impl<T> Any for Finder`

fn type_id(self: &Self) -> TypeId

`impl<T> Borrow for Finder`

fn borrow(self: &Self) -> &T

`impl<T> BorrowMut for Finder`

fn borrow_mut(self: &mut Self) -> &mut T

`impl<T> From for Finder`

fn from(t: T) -> T: Returns the argument unchanged.

`impl<T, U> Into for Finder`

fn into(self: Self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

`impl<T, U> TryFrom for Finder`

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

`impl<T, U> TryInto for Finder`

fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>

Struct `Finder`

Implementations