Struct bio::data_structures::interval_tree::ArrayBackedIntervalTree [−][src]
Implementations
Trait Implementations
Auto Trait Implementations
impl<N, D> RefUnwindSafe for ArrayBackedIntervalTree<N, D> where
D: RefUnwindSafe,
N: RefUnwindSafe,
impl<N, D> Send for ArrayBackedIntervalTree<N, D> where
D: Send,
N: Send,
impl<N, D> Sync for ArrayBackedIntervalTree<N, D> where
D: Sync,
N: Sync,
impl<N, D> Unpin for ArrayBackedIntervalTree<N, D> where
D: Unpin,
N: Unpin,
impl<N, D> UnwindSafe for ArrayBackedIntervalTree<N, D> where
D: UnwindSafe,
N: UnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
type Output = T
type Output = T
Should always be Self
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.