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
sourceimpl<'a, N: PartialEq + Ord + Clone, D: PartialEq> PartialEq<EntryMut<'a, N, D>> for EntryMut<'a, N, D>
impl<'a, N: PartialEq + Ord + Clone, D: PartialEq> PartialEq<EntryMut<'a, N, D>> for EntryMut<'a, N, D>
impl<'a, N: Eq + Ord + Clone, D: Eq> Eq for EntryMut<'a, N, D>
impl<'a, N: Ord + Clone, D> StructuralEq for EntryMut<'a, N, D>
impl<'a, N: Ord + Clone, D> StructuralPartialEq for EntryMut<'a, N, D>
Auto Trait Implementations
impl<'a, N, D> RefUnwindSafe for EntryMut<'a, N, D> where
D: RefUnwindSafe,
N: RefUnwindSafe,
impl<'a, N, D> Send for EntryMut<'a, N, D> where
D: Send,
N: Sync,
impl<'a, N, D> Sync for EntryMut<'a, N, D> where
D: Sync,
N: Sync,
impl<'a, N, D> Unpin for EntryMut<'a, N, D>
impl<'a, N, D> !UnwindSafe for EntryMut<'a, N, D>
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
sourceimpl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
sourcepub fn equivalent(&self, key: &K) -> bool
pub fn equivalent(&self, key: &K) -> bool
Compare self to key
and return true
if they are equal.
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.