Struct Finder
pub struct Finder { /* private fields */ }A forward substring searcher using the Shift-Or algorithm.
Implementations
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, haystack: &[u8]) -> Option<usize>Return the first occurrence of the needle given to
Finder::newin thehaystackgiven. If no such occurrence exists, thenNoneis 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 ishaystack.len() - 1.
Trait Implementations
impl Debug for Finder
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Auto Trait Implementations
impl Freeze for Finder
impl RefUnwindSafe for Finder
impl Send for Finder
impl Sync for Finder
impl Unpin for Finder
impl UnsafeUnpin for Finder
impl UnwindSafe for Finder
Blanket Implementations
impl<T> Any for Finder
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for Finder
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for Finder
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> From<T> for Finder
fn from(t: T) -> TReturns the argument unchanged.
impl<T, U> Into<U> for Finder
where
U: From<T>,
fn into(self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom<U> for Finder
where
U: Into<T>,
type Error = never;fn try_from(value: U) -> Result<T, never>
impl<T, U> TryInto<U> for Finder
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>