Struct bio::data_structures::interval_tree::IntervalTree

pub struct IntervalTree<N: Ord + Clone, D> { /* private fields */ }

An interval tree for storing intervals with data

Implementations

impl<N: Clone + Ord, D> IntervalTree<N, D>

pub fn new() -> Self

Creates a new empty IntervalTree

pub fn insert<I: Into<Interval<N>>>(&mut self, interval: I, data: D)

Inserts an Interval into the tree and associates it with data

pub fn find<I: Into<Interval<N>>>( &self, interval: I, ) -> IntervalTreeIterator<'_, N, D>

Uses the provided Interval to find overlapping intervals in the tree and returns an IntervalTreeIterator

pub fn find_mut<I: Into<Interval<N>>>( &mut self, interval: I, ) -> IntervalTreeIteratorMut<'_, N, D>

Uses the provided Interval to find overlapping intervals in the tree and returns an IntervalTreeIteratorMut that allows mutable access to the data

Trait Implementations

impl<N: Clone + Ord + Clone, D: Clone> Clone for IntervalTree<N, D>

fn clone(&self) -> IntervalTree<N, D>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N: Debug + Ord + Clone, D: Debug> Debug for IntervalTree<N, D>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<N: Ord + Clone, D> Default for IntervalTree<N, D>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, N, D> Deserialize<'de> for IntervalTree<N, D>

where N: Deserialize<'de> + Ord + Clone, D: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<N: Clone + Ord, D, R: Into<Interval<N>>> FromIterator<(R, D)> for IntervalTree<N, D>

fn from_iter<I: IntoIterator<Item = (R, D)>>(iter: I) -> Self

Creates a value from an iterator.

impl<N: Hash + Ord + Clone, D: Hash> Hash for IntervalTree<N, D>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<N: PartialEq + Ord + Clone, D: PartialEq> PartialEq for IntervalTree<N, D>

fn eq(&self, other: &IntervalTree<N, D>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N, D> Serialize for IntervalTree<N, D>

where N: Serialize + Ord + Clone, D: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<N: Eq + Ord + Clone, D: Eq> Eq for IntervalTree<N, D>

impl<N: Ord + Clone, D> StructuralPartialEq for IntervalTree<N, D>