Struct bio::data_structures::interval_tree::ArrayBackedIntervalTree
source · [−]Implementations
sourceimpl<N: Ord + Clone + Copy, D: Clone> ArrayBackedIntervalTree<N, D>
impl<N: Ord + Clone + Copy, D: Clone> ArrayBackedIntervalTree<N, D>
pub fn new() -> Self
pub fn insert<I: Into<Interval<N>>>(&mut self, interval: I, data: D)
pub fn index(&mut self)
sourcepub fn find<I: Into<Interval<N>>>(&self, interval: I) -> Vec<Entry<'_, N, D>>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
pub fn find<I: Into<Interval<N>>>(&self, interval: I) -> Vec<Entry<'_, N, D>>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A> where
A: Allocator,
A: Allocator,
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
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
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.