pub struct KMP<'a> { /* private fields */ }
Expand description
KMP algorithm.
Implementations
sourceimpl<'a> KMP<'a>
impl<'a> KMP<'a>
sourcepub fn find_all<C, T>(&self, text: T) -> Matches<'_, C, T::IntoIter>ⓘNotable traits for Matches<'a, C, T>impl<'a, C, T> Iterator for Matches<'a, C, T> where
C: Borrow<u8>,
T: Iterator<Item = C>, type Item = usize;
where
C: Borrow<u8>,
T: IntoIterator<Item = C>,
pub fn find_all<C, T>(&self, text: T) -> Matches<'_, C, T::IntoIter>ⓘNotable traits for Matches<'a, C, T>impl<'a, C, T> Iterator for Matches<'a, C, T> where
C: Borrow<u8>,
T: Iterator<Item = C>, type Item = usize;
where
C: Borrow<u8>,
T: IntoIterator<Item = C>,
C: Borrow<u8>,
T: Iterator<Item = C>, type Item = usize;
Find all matches of pattern in a given text. Matches are returned as iterator over start positions.
Auto Trait Implementations
impl<'a> RefUnwindSafe for KMP<'a>
impl<'a> Send for KMP<'a>
impl<'a> Sync for KMP<'a>
impl<'a> Unpin for KMP<'a>
impl<'a> UnwindSafe for KMP<'a>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
pub fn to_subset(&self) -> Option<SS>
pub fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.