Struct bio::data_structures::interval_tree::Node

pub struct Node<N, D> {
    // some fields omitted
}

Methods

impl<N: Debug + Num + Clone + Ord, D: Debug> Node<N, D>

fn new(interval: Range<N>, data: D) -> Self

fn insert(&mut self, interval: Range<N>, data: D)

fn find_iter<'a>(&'a self, interval: Range<N>) -> IntervalTreeIterator<'a, N, D>

fn has_match(&self, interval: &Range<N>) -> bool

Trait Implementations

impl<N: Clone, D: Clone> Clone for Node<N, D>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Debug, D: Debug> Debug for Node<N, D>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<N: Eq, D: Eq> Eq for Node<N, D>

impl<N: PartialEq, D: PartialEq> PartialEq for Node<N, D>

fn eq(&self, __arg_0: &Node<N, D>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &Node<N, D>) -> bool

This method tests for !=.