Struct U32Set

pub struct U32Set { /* private fields */ }

A fast, efficient, sparse, & ordered u32 set.

For a higher-level API that supports inversion and generic int types, use super::IntSet

Implementations

impl U32Set

pub fn insert(&mut self, val: u32) -> bool

Add val as a member of this set.

If the set did not previously contain this value, returns true.

pub fn insert_range(&mut self, range: RangeInclusive<u32>)

Add all values in range as members of this set.

pub fn extend_unsorted<U>(&mut self, iter: U)

where U: IntoIterator<Item = u32>,

An alternate version of extend() which is optimized for inserting an unsorted iterator of values.

pub fn remove(&mut self, val: u32) -> bool

Remove val from this set.

Returns true if the value was present.

pub fn remove_all<U>(&mut self, iter: U)

where U: IntoIterator<Item = u32>,

pub fn remove_range(&mut self, range: RangeInclusive<u32>)

Removes all values in range as members of this set.

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

Returns true if val is a member of this set.

pub fn intersects_set(&self, other: &U32Set) -> bool

pub const fn empty() -> U32Set

pub fn clear(&mut self)

Remove all members from this set.

pub fn is_empty(&self) -> bool

Return true if there are no members in this set.

pub fn len(&self) -> u64

Returns the number of members in this set.

pub fn union(&mut self, other: &U32Set)

Sets the members of this set to the union of self and other.

pub fn intersect(&mut self, other: &U32Set)

Sets the members of this set to the intersection of self and other.

pub fn subtract(&mut self, other: &U32Set)

Sets the members of this set to self - other.

pub fn reversed_subtract(&mut self, other: &U32Set)

Sets the members of this set to other - self.

pub fn iter(&self) -> impl DoubleEndedIterator

Iterator over the members of this set. In sorted order (ascending).

pub fn iter_from(&self, value: u32) -> impl Iterator<Item = u32>

Iterator over the members of this set starting from value.

So value is included in the iterator if it’s in the set.

pub fn iter_ranges(&self) -> impl Iterator<Item = RangeInclusive<u32>>

Iterate over the ranges of contiguous values in this set.

Trait Implementations

impl Clone for U32Set

fn clone(&self) -> U32Set

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for U32Set

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

Formats the value using the given formatter.

impl Default for U32Set

fn default() -> U32Set

Returns the “default value” for a type.

impl Extend<u32> for U32Set

fn extend<U>(&mut self, iter: U)

where U: IntoIterator<Item = u32>,

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 FromIterator<u32> for U32Set

fn from_iter<I>(iter: I) -> U32Set

where I: IntoIterator<Item = u32>,

Creates a value from an iterator.

impl Hash for U32Set

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

where H: Hasher,

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 Ord for U32Set

fn cmp(&self, other: &U32Set) -> 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 PartialEq for U32Set

fn eq(&self, other: &U32Set) -> 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 PartialOrd for U32Set

fn partial_cmp(&self, other: &U32Set) -> 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.

impl Eq for U32Set