pub struct BOM { /* private fields */ }
Expand description
Backward oracle matching algorithm.
Implementations
sourceimpl BOM
impl BOM
sourcepub fn new<C, P>(pattern: P) -> Self where
C: Borrow<u8> + Ord,
P: IntoIterator<Item = C>,
P::IntoIter: DoubleEndedIterator + ExactSizeIterator + Clone,
pub fn new<C, P>(pattern: P) -> Self where
C: Borrow<u8> + Ord,
P: IntoIterator<Item = C>,
P::IntoIter: DoubleEndedIterator + ExactSizeIterator + Clone,
Create a new instance for a given pattern.
Auto Trait Implementations
impl RefUnwindSafe for BOM
impl Send for BOM
impl Sync for BOM
impl Unpin for BOM
impl UnwindSafe for BOM
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.