Struct bio::data_structures::fmindex::BiInterval
source · pub struct BiInterval { /* private fields */ }
Expand description
A bi-interval on suffix array of the forward and reverse strand of a DNA text.
Implementations§
Trait Implementations§
source§impl Clone for BiInterval
impl Clone for BiInterval
source§fn clone(&self) -> BiInterval
fn clone(&self) -> BiInterval
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl Debug for BiInterval
impl Debug for BiInterval
source§impl Default for BiInterval
impl Default for BiInterval
source§fn default() -> BiInterval
fn default() -> BiInterval
Returns the “default value” for a type. Read more
source§impl<'de> Deserialize<'de> for BiInterval
impl<'de> Deserialize<'de> for BiInterval
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl Hash for BiInterval
impl Hash for BiInterval
source§impl Ord for BiInterval
impl Ord for BiInterval
source§fn cmp(&self, other: &BiInterval) -> Ordering
fn cmp(&self, other: &BiInterval) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl PartialEq<BiInterval> for BiInterval
impl PartialEq<BiInterval> for BiInterval
source§fn eq(&self, other: &BiInterval) -> bool
fn eq(&self, other: &BiInterval) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl PartialOrd<BiInterval> for BiInterval
impl PartialOrd<BiInterval> for BiInterval
source§fn partial_cmp(&self, other: &BiInterval) -> Option<Ordering>
fn partial_cmp(&self, other: &BiInterval) -> Option<Ordering>
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 moresource§impl Serialize for BiInterval
impl Serialize for BiInterval
impl Copy for BiInterval
impl Eq for BiInterval
impl StructuralEq for BiInterval
impl StructuralPartialEq for BiInterval
Auto Trait Implementations§
impl RefUnwindSafe for BiInterval
impl Send for BiInterval
impl Sync for BiInterval
impl Unpin for BiInterval
impl UnwindSafe for BiInterval
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.