Struct gap_query_interval_tree::naive::NaiveGapQueryIntervalTree

pub struct NaiveGapQueryIntervalTree<I, K, D> { /* private fields */ }

Implementations

impl<I, K, D> NaiveGapQueryIntervalTree<I, K, D>

pub fn new() -> Self

Trait Implementations

impl<I: Clone, K: Clone, D: Clone> Clone for NaiveGapQueryIntervalTree<I, K, D>

fn clone(&self) -> NaiveGapQueryIntervalTree<I, K, D>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Debug, K: Debug, D: Debug> Debug for NaiveGapQueryIntervalTree<I, K, D>

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

Formats the value using the given formatter.

impl<I, K, D> Default for NaiveGapQueryIntervalTree<I, K, D>

fn default() -> Self

Returns the “default value” for a type.

impl<I, K, D> GapQueryIntervalTree<I, K, D> for NaiveGapQueryIntervalTree<I, K, D>

where I: PointType, K: RangeType<I>, D: IdType,

fn gap_query<Q>(&self, with_identifier: Option<D>, interval: Q) -> Vec<K>

where Q: RangeType<I>,

Gets the maximally-sized gaps that overlap the given interval for the given identifier if one is given.

fn insert(&mut self, identifiers: BTreeSet<D>, interval: K)

Inserts an interval into the collection for the given identifiers.

fn cut<Q>(&mut self, with_identifiers: Option<BTreeSet<D>>, interval: Q)

where Q: RangeType<I>,

Cuts an interval from the collection for the given identifiers, if no identifiers are given all identifiers are cut.

fn append(&mut self, other: &mut Self)

Append one interval tree with another by inserting all the intervals from other into self.

fn identifiers_at_point(&self, at_point: I) -> BTreeSet<D>

Get all identifiers which have an interval overlapping the given point.

fn gap_query_at_point( &self, with_identifier: Option<D>, at_point: I ) -> Option<K>

where I: PointType,

A convenience method for getting the maximally-sized gap at a specific point for the given identifier if one is given, this is equivalent to calling. gap_query() with a point interval.

impl<I, K, D> PartialEq for NaiveGapQueryIntervalTree<I, K, D>

where I: PartialEq, K: PartialEq, D: IdType,

fn eq(&self, other: &Self) -> bool

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

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

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