Struct RangeSet 

pub struct RangeSet<T, C: Storage<Item<AnyRange<T>, ()>>> { /* private fields */ }

Range set.

This is based on a range map, where the values are ().

Implementations

impl<T, C: Storage<Item<AnyRange<T>, ()>>> RangeSet<T, C>

pub fn new() -> RangeSet<T, C>

impl<T, C: Storage<Item<AnyRange<T>, ()>>> RangeSet<T, C>

pub fn range_count(&self) -> usize

pub fn len(&self) -> T::Len

where T: Measure + PartialEnum + Bounded,

pub fn bounded_len(&self) -> Option<T::Len>

where T: Measure + PartialEnum,

pub fn is_empty(&self) -> bool

where T: Measure + PartialEnum,

pub fn intersects<R: AsRange<Item = T>>(&self, values: R) -> bool

where T: Clone + PartialEnum + Measure,

pub fn contains(&self, value: T) -> bool

where T: Clone + PartialEnum + RangePartialOrd + Measure,

pub fn iter(&self) -> Iter<'_, T, C>

pub fn gaps(&self) -> Gaps<'_, T, C>

Returns an iterator over the gaps (missing values) of the set.

impl<T, C: Storage<Item<AnyRange<T>, ()>>> RangeSet<T, C>

pub fn insert<R: IntoRange<Item = T>>(&mut self, key: R)

where T: Clone + PartialEnum + Measure,

pub fn remove<R: AsRange<Item = T>>(&mut self, key: R)

where T: Clone + PartialEnum + Measure,

pub fn complement(&self) -> Self

where T: Clone + Measure + PartialEnum,

Trait Implementations

impl<T: Clone, C: Storage<Item<AnyRange<T>, ()>>> Clone for RangeSet<T, C>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug, C: Storage<Item<AnyRange<T>, ()>>> Debug for RangeSet<T, C>

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

Formats the value using the given formatter.

impl<T, C: Storage<Item<AnyRange<T>, ()>>> Default for RangeSet<T, C>

fn default() -> Self

Returns the “default value” for a type.

impl<K, C: Storage<Item<AnyRange<K>, ()>>> Eq for RangeSet<K, C>

where K: Measure + PartialEnum + Ord,

impl<R: IntoRange, C: Storage<Item<AnyRange<R::Item>, ()>>> Extend<R> for RangeSet<R::Item, C>

where R::Item: Clone + Measure + PartialOrd,

fn extend<I: IntoIterator<Item = R>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<R: IntoRange, C: Storage<Item<AnyRange<R::Item>, ()>>> FromIterator<R> for RangeSet<R::Item, C>

where R::Item: Clone + Measure + PartialOrd,

fn from_iter<I: IntoIterator<Item = R>>(iter: I) -> Self

Creates a value from an iterator.

impl<K, C: Storage<Item<AnyRange<K>, ()>>> Hash for RangeSet<K, C>

where K: Hash + PartialEnum,

fn hash<H: Hasher>(&self, h: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, T, C: Storage<Item<AnyRange<T>, ()>>> IntoIterator for &'a RangeSet<T, C>

type Item = &'a AnyRange<T>

The type of the elements being iterated over.

type IntoIter = Iter<'a, T, C>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, C: Storage<Item<AnyRange<T>, ()>>> IntoIterator for RangeSet<T, C>

type Item = AnyRange<T>

The type of the elements being iterated over.

type IntoIter = IntoIter<T, C>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K, C: Storage<Item<AnyRange<K>, ()>>> Ord for RangeSet<K, C>

where K: Measure + PartialEnum + Ord,

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<K, C, D> PartialEq<RangeSet<K, D>> for RangeSet<K, C>

where K: Measure + PartialOrd + PartialEnum, C: Storage<Item<AnyRange<K>, ()>>, D: Storage<Item<AnyRange<K>, ()>>,

fn eq(&self, other: &RangeSet<K, D>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<K, C, D> PartialOrd<RangeSet<K, D>> for RangeSet<K, C>

where K: Measure + PartialOrd + PartialEnum, C: Storage<Item<AnyRange<K>, ()>>, D: Storage<Item<AnyRange<K>, ()>>,

fn partial_cmp(&self, other: &RangeSet<K, D>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.