Struct nodit::nodit::set::NoditSet

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

An ordered set of non-overlapping intervals based on NoditMap.

I is the generic type parameter for the Ord type the K type is interval over.

K is the generic type parameter for the interval implementing type in the set.

Phrasing it another way: I is the point type and K is the interval type.

See NoditMap for more details.

Implementations

impl<I, K> NoditSet<I, K>

where I: PointType, K: IntervalType<I>,

pub fn overlaps<Q>(&self, interval: Q) -> bool

where Q: IntervalType<I>,

See NoditMap::overlaps() for more details.

pub fn overlapping<Q>(&self, interval: Q) -> impl DoubleEndedIterator<Item = &K>

where Q: IntervalType<I>,

See NoditMap::overlapping() for more details.

pub fn get_at_point(&self, point: I) -> Result<&K, K>

See NoditMap::get_key_value_at_point() for more details.

pub fn contains_point(&self, point: I) -> bool

See NoditMap::contains_point() for more details.

pub fn remove_overlapping<'a, Q>( &'a mut self, interval: Q ) -> impl Iterator<Item = K>

where Q: IntervalType<I> + 'a,

See NoditMap::remove_overlapping() for more details.

pub fn cut<'a, Q>(&'a mut self, interval: Q) -> impl Iterator<Item = K>

where Q: IntervalType<I> + 'a,

See NoditMap::cut() for more details.

pub fn gaps_untrimmed<'a, Q>( &'a self, interval: Q ) -> impl Iterator<Item = K> + '_

where Q: IntervalType<I> + 'a,

See NoditMap::gaps_untrimmed() for more details.

pub fn gaps_trimmed<'a, Q>( &'a self, interval: Q ) -> impl Iterator<Item = K> + '_

where Q: IntervalType<I> + 'a,

See NoditMap::gaps_trimmed() for more details.

pub fn contains_interval<Q>(&self, interval: Q) -> bool

where Q: IntervalType<I>,

See NoditMap::contains_interval() for more details.

pub fn insert_strict(&mut self, interval: K) -> Result<(), OverlapError<()>>

See NoditMap::insert_strict() for more details.

pub fn insert_merge_touching( &mut self, interval: K ) -> Result<K, OverlapError<()>>

See NoditMap::insert_merge_touching() for more details.

pub fn insert_merge_overlapping(&mut self, interval: K) -> K

See NoditMap::insert_merge_overlapping() for more details.

pub fn insert_merge_touching_or_overlapping(&mut self, interval: K) -> K

See NoditMap::insert_merge_touching_or_overlapping() for more details.

pub fn insert_overwrite(&mut self, interval: K) -> impl Iterator<Item = K>

See NoditMap::insert_overwrite() for more details.

pub fn from_slice_strict<const N: usize>( slice: [K; N] ) -> Result<NoditSet<I, K>, OverlapError<()>>

See NoditMap::from_slice_strict() for more details.

pub fn from_iter_strict( iter: impl Iterator<Item = K> ) -> Result<NoditSet<I, K>, OverlapError<()>>

See NoditMap::from_iter_strict() for more details.

impl<I, K> NoditSet<I, K>

pub fn new() -> Self

See NoditMap::new() for more details.

pub fn len(&self) -> usize

See NoditMap::len() for more details.

pub fn is_empty(&self) -> bool

See NoditMap::is_empty() for more details.

pub fn iter(&self) -> impl DoubleEndedIterator<Item = &K>

See NoditMap::iter() for more details.

pub fn first(&self) -> Option<&K>

See NoditMap::first_key_value() for more details.

pub fn last(&self) -> Option<&K>

See NoditMap::last_key_value() for more details.

Trait Implementations

impl<I: Clone, K: Clone> Clone for NoditSet<I, K>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Debug, K: Debug> Debug for NoditSet<I, K>

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

Formats the value using the given formatter.

impl<I, K> Default for NoditSet<I, K>

where I: PointType,

fn default() -> Self

Returns the “default value” for a type.

impl<I, K> IntoIterator for NoditSet<I, K>

type Item = K

The type of the elements being iterated over.

type IntoIter = IntoIter<I, K>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<I: PartialEq, K: PartialEq> PartialEq for NoditSet<I, K>

fn eq(&self, other: &NoditSet<I, K>) -> 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.

impl<I: Eq, K: Eq> Eq for NoditSet<I, K>

impl<I, K> StructuralPartialEq for NoditSet<I, K>