Struct bio::data_structures::interval_tree::ArrayBackedIntervalTree
source · Implementations§
source§impl<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)
Trait Implementations§
source§impl<N: Clone + Ord + Clone + Copy, D: Clone> Clone for ArrayBackedIntervalTree<N, D>
impl<N: Clone + Ord + Clone + Copy, D: Clone> Clone for ArrayBackedIntervalTree<N, D>
source§fn clone(&self) -> ArrayBackedIntervalTree<N, D>
fn clone(&self) -> ArrayBackedIntervalTree<N, D>
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<'de, N, D> Deserialize<'de> for ArrayBackedIntervalTree<N, D>where
N: Deserialize<'de> + Ord + Clone + Copy,
D: Deserialize<'de>,
impl<'de, N, D> Deserialize<'de> for ArrayBackedIntervalTree<N, D>where
N: Deserialize<'de> + Ord + Clone + Copy,
D: Deserialize<'de>,
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<N, D, V> FromIterator<(V, D)> for ArrayBackedIntervalTree<N, D>where
V: Into<Interval<N>>,
N: Ord + Clone + Copy,
D: Clone,
impl<N, D, V> FromIterator<(V, D)> for ArrayBackedIntervalTree<N, D>where
V: Into<Interval<N>>,
N: Ord + Clone + Copy,
D: Clone,
source§impl<N: PartialEq + Ord + Clone + Copy, D: PartialEq> PartialEq<ArrayBackedIntervalTree<N, D>> for ArrayBackedIntervalTree<N, D>
impl<N: PartialEq + Ord + Clone + Copy, D: PartialEq> PartialEq<ArrayBackedIntervalTree<N, D>> for ArrayBackedIntervalTree<N, D>
source§fn eq(&self, other: &ArrayBackedIntervalTree<N, D>) -> bool
fn eq(&self, other: &ArrayBackedIntervalTree<N, D>) -> bool
source§impl<N, D> Serialize for ArrayBackedIntervalTree<N, D>where
N: Serialize + Ord + Clone + Copy,
D: Serialize,
impl<N, D> Serialize for ArrayBackedIntervalTree<N, D>where
N: Serialize + Ord + Clone + Copy,
D: Serialize,
impl<N: Eq + Ord + Clone + Copy, D: Eq> Eq for ArrayBackedIntervalTree<N, D>
impl<N: Ord + Clone + Copy, D> StructuralEq for ArrayBackedIntervalTree<N, D>
impl<N: Ord + Clone + Copy, D> StructuralPartialEq for ArrayBackedIntervalTree<N, D>
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§
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.