Struct RangeSet

pub struct RangeSet<T> { /* private fields */ }

A set of integers, implemented as a sorted list of (inclusive) ranges.

Implementations

impl<T: Debug + PrimInt> RangeSet<T>

pub fn new() -> RangeSet<T>

Creates a new empty RangeSet.

pub fn is_empty(&self) -> bool

Tests if this set is empty.

pub fn is_full(&self) -> bool

Tests whether this set contains every valid value of T.

pub fn num_ranges(&self) -> usize

Returns the number of ranges used to represent this set.

pub fn num_elements(&self) -> usize

Returns the number of elements in the set.

This saturates at usize::MAX.

pub fn ranges<'a>(&'a self) -> RangeIter<'a, T>

Returns an iterator over all ranges in this set.

pub fn elements<'a>(&'a self) -> EltIter<'a, T>

Returns an iterator over all elements in this set.

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

Checks if this set contains a value.

pub fn union(&self, other: &RangeSet<T>) -> RangeSet<T>

Returns the union between self and other.

pub fn full() -> RangeSet<T>

Creates a set that contains every value of T.

pub fn single(x: T) -> RangeSet<T>

Creates a set containing a single element.

pub fn except<I: Iterator<Item = T>>(it: I) -> Option<RangeSet<T>>

Creates a set containing all elements except the given ones. The input iterator must be sorted. If it is not, this will return None.

pub fn intersection(&self, other: &RangeSet<T>) -> RangeSet<T>

Finds the intersection between this set and other.

pub fn negated(&self) -> RangeSet<T>

Returns the set of all characters that are not in this set.

Trait Implementations

impl<T: Clone> Clone for RangeSet<T>

fn clone(&self) -> RangeSet<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + PrimInt> Debug for RangeSet<T>

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

Formats the value using the given formatter.

impl<T: Debug + PrimInt> FromIterator<Range<T>> for RangeSet<T>

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

Builds a RangeSet from an iterator over Ranges.

impl<T: Hash> Hash for RangeSet<T>

fn hash<__H: Hasher>(&self, state: &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<T: PartialEq> PartialEq for RangeSet<T>

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T: Eq> Eq for RangeSet<T>

impl<T> StructuralPartialEq for RangeSet<T>