Expand description
Ukkonens algorithm.
Implementations
sourceimpl<F> Ukkonen<F> where
F: Fn(u8, u8) -> u32,
impl<F> Ukkonen<F> where
F: Fn(u8, u8) -> u32,
sourcepub fn with_capacity(m: usize, cost: F) -> Self
pub fn with_capacity(m: usize, cost: F) -> Self
Initialize algorithm with given capacity and cost function.
sourcepub fn find_all_end<'a, C, T>(
&'a mut self,
pattern: TextSlice<'a>,
text: T,
k: usize
) -> Matches<'_, F, C, T::IntoIter>ⓘNotable traits for Matches<'a, F, C, T>impl<'a, F, C, T> Iterator for Matches<'a, F, C, T> where
F: 'a + Fn(u8, u8) -> u32,
C: Borrow<u8>,
T: Iterator<Item = C>, type Item = (usize, usize);
where
C: Borrow<u8>,
T: IntoIterator<Item = C>,
pub fn find_all_end<'a, C, T>(
&'a mut self,
pattern: TextSlice<'a>,
text: T,
k: usize
) -> Matches<'_, F, C, T::IntoIter>ⓘNotable traits for Matches<'a, F, C, T>impl<'a, F, C, T> Iterator for Matches<'a, F, C, T> where
F: 'a + Fn(u8, u8) -> u32,
C: Borrow<u8>,
T: Iterator<Item = C>, type Item = (usize, usize);
where
C: Borrow<u8>,
T: IntoIterator<Item = C>,
F: 'a + Fn(u8, u8) -> u32,
C: Borrow<u8>,
T: Iterator<Item = C>, type Item = (usize, usize);
Find all matches between pattern and text with up to k errors. Matches are returned as an iterator over pairs of end position and distance.
Auto Trait Implementations
impl<F> RefUnwindSafe for Ukkonen<F> where
F: RefUnwindSafe,
impl<F> Send for Ukkonen<F> where
F: Send,
impl<F> Sync for Ukkonen<F> where
F: Sync,
impl<F> Unpin for Ukkonen<F> where
F: Unpin,
impl<F> UnwindSafe for Ukkonen<F> where
F: UnwindSafe,
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.