Struct bio::data_structures::interval_tree::EntryMut
source ·
[−]Expand description
A find_mut query on the interval tree does not directly return references to the nodes in the tree, but
wraps the fields interval and data in an EntryMut. Only the data part can be mutably accessed
using the data method
Implementations
Trait Implementations
Auto Trait Implementations
impl<'a, N, D> RefUnwindSafe for EntryMut<'a, N, D> where
D: RefUnwindSafe,
N: RefUnwindSafe,
impl<'a, N, D> !UnwindSafe for EntryMut<'a, N, D>
Blanket Implementations
Mutably borrows from an owned value. Read more
Compare self to key and return true if they are equal.
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.