Struct bio::pattern_matching::shift_and::ShiftAnd
source · pub struct ShiftAnd { /* private fields */ }
Expand description
ShiftAnd
algorithm.
Implementations§
source§impl ShiftAnd
impl ShiftAnd
sourcepub fn new<C, P>(pattern: P) -> Selfwhere
P::IntoIter: ExactSizeIterator,
C: Borrow<u8>,
P: IntoIterator<Item = C>,
pub fn new<C, P>(pattern: P) -> Selfwhere P::IntoIter: ExactSizeIterator, C: Borrow<u8>, P: IntoIterator<Item = C>,
Create new ShiftAnd instance from a given pattern.
Trait Implementations§
source§impl Ord for ShiftAnd
impl Ord for ShiftAnd
source§impl PartialEq<ShiftAnd> for ShiftAnd
impl PartialEq<ShiftAnd> for ShiftAnd
source§impl PartialOrd<ShiftAnd> for ShiftAnd
impl PartialOrd<ShiftAnd> for ShiftAnd
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl Copy for ShiftAnd
impl Eq for ShiftAnd
impl StructuralEq for ShiftAnd
impl StructuralPartialEq for ShiftAnd
Auto Trait Implementations§
impl RefUnwindSafe for ShiftAnd
impl Send for ShiftAnd
impl Sync for ShiftAnd
impl Unpin for ShiftAnd
impl UnwindSafe for ShiftAnd
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.