Struct FinderRev

struct FinderRev(_)

A reverse substring searcher that uses the Two-Way algorithm.

Implementations

impl FinderRev

fn new(needle: &[u8]) -> FinderRev

Create a searcher that finds occurrences of the given needle.

An empty needle results in a match at every position in a haystack, including at haystack.len().

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

Returns the last occurrence of needle in the given haystack, or None if no such occurrence could be found.

The needle given must be the same as the needle provided to FinderRev::new.

An empty needle results in a match at every position in a haystack, including at haystack.len().

impl Clone for FinderRev

fn clone(self: &Self) -> FinderRev

impl Copy for FinderRev

impl Debug for FinderRev

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

impl Freeze for FinderRev

impl RefUnwindSafe for FinderRev

impl Send for FinderRev

impl Sync for FinderRev

impl Unpin for FinderRev

impl UnwindSafe for FinderRev

impl<T> Any for FinderRev

fn type_id(self: &Self) -> TypeId

impl<T> Borrow for FinderRev

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

impl<T> BorrowMut for FinderRev

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

impl<T> CloneToUninit for FinderRev

unsafe fn clone_to_uninit(self: &Self, dest: *mut u8)

impl<T> From for FinderRev

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> ToOwned for FinderRev

fn to_owned(self: &Self) -> T
fn clone_into(self: &Self, target: &mut T)

impl<T, U> Into for FinderRev

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 FinderRev

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

impl<T, U> TryInto for FinderRev

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