Struct FinderRev

pub struct FinderRev(/* private fields */);

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

Implementations

impl FinderRev

pub 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().

pub fn rfind(&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().

Trait Implementations

impl Clone for FinderRev

fn clone(&self) -> FinderRev

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for FinderRev

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

Formats the value using the given formatter.

impl Copy for FinderRev