Struct bio::data_structures::interval_tree::ArrayBackedIntervalTree

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

Implementations

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)

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

Find overlapping intervals in the index. Returns a vector of entries, consisting of the interval and its associated data.

Arguments

• interval - The interval for which overlaps are to be found in the index. Can also be a Range.

Panics

Panics if this IITree instance has not been indexed yet.

pub fn find_into<'b, 'a: 'b, I: Into<Interval<N>>>(
    &'a self,
    interval: I,
    results: &'b mut Vec<Entry<'a, N, D>>
)

Find overlapping intervals in the index

Arguments

• interval - The interval for which overlaps are to be found in the index. Can also be a Range.
• results - A reusable buffer vector for storing the results.

Panics

Panics if this IITree instance has not been indexed yet.

Trait Implementations

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

fn default() -> Self

Returns the “default value” for a type.

impl<N, D, V> FromIterator<(V, D)> for ArrayBackedIntervalTree<N, D>where
    V: Into<Interval<N>>,
    N: Ord + Clone + Copy,
    D: Clone,

fn from_iter<T: IntoIterator<Item = (V, D)>>(iter: T) -> Self

Creates a value from an iterator.