Struct discrete_range_map::discrete_range_set::DiscreteRangeSet

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

An ordered set of non-overlapping ranges based on DiscreteRangeMap.

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

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

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

See DiscreteRangeMap for more details.

Implementations

impl<I, K> DiscreteRangeSet<I, K>

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

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

where Q: RangeType<I>,

See DiscreteRangeMap::overlaps() for more details.

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

where Q: RangeType<I>,

See DiscreteRangeMap::overlapping() for more details.

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

See DiscreteRangeMap::get_entry_at_point() for more details.

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

See DiscreteRangeMap::contains_point() for more details.

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

where Q: RangeType<I> + 'a,

See DiscreteRangeMap::remove_overlapping() for more details.

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

where Q: RangeType<I> + 'a,

See DiscreteRangeMap::cut() for more details.

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

where Q: RangeType<I> + 'a,

See DiscreteRangeMap::gaps() for more details.

pub fn contains_range<Q>(&self, range: Q) -> bool

where Q: RangeType<I>,

See DiscreteRangeMap::contains_range() for more details.

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

See DiscreteRangeMap::insert_strict() for more details.

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

See DiscreteRangeMap::insert_merge_touching() for more details.

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

See DiscreteRangeMap::insert_merge_overlapping() for more details.

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

See DiscreteRangeMap::insert_merge_touching_or_overlapping() for more details.

pub fn insert_overwrite(&mut self, range: K)

See DiscreteRangeMap::insert_overwrite() for more details.

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

See DiscreteRangeMap::from_slice_strict() for more details.

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

See DiscreteRangeMap::from_iter_strict() for more details.

impl<I, K> DiscreteRangeSet<I, K>

pub fn new() -> Self

See DiscreteRangeMap::new() for more details.

pub fn len(&self) -> usize

See DiscreteRangeMap::len() for more details.

pub fn is_empty(&self) -> bool

See DiscreteRangeMap::is_empty() for more details.

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

See DiscreteRangeMap::iter() for more details.

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

See DiscreteRangeMap::first_entry() for more details.

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

See DiscreteRangeMap::last_entry() for more details.

Trait Implementations

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

fn clone(&self) -> DiscreteRangeSet<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 DiscreteRangeSet<I, K>

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

Formats the value using the given formatter.

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

where I: PointType,

fn default() -> Self

Returns the “default value” for a type.

impl<'de, I, K> Deserialize<'de> for DiscreteRangeSet<I, K>

where I: PointType, K: RangeType<I> + Deserialize<'de>,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<I, K> IntoIterator for DiscreteRangeSet<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 DiscreteRangeSet<I, K>

fn eq(&self, other: &DiscreteRangeSet<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, K> Serialize for DiscreteRangeSet<I, K>

where K: Serialize,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

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

impl<I, K> StructuralEq for DiscreteRangeSet<I, K>

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