Struct IntDegreeSet 

pub struct IntDegreeSet { /* private fields */ }

A set of IntDegree values, efficiently implemented as a bitfield.

It is internally implemented as a single u16 integer value. The N-th least significant bit of the value is set to 1 if the N-th variant is present in the set, and 0 otherwise.

Representation

It is guaranteed that the layout and ABI of a IntDegreeSet is exactly the same of a u16. This is true regardless of any #[repr(..)] attribute set on IntDegree.

Invariant

Only the last 10 (the number of variants in IntDegree) may be non-zero. That is, the value of bits that do not correspond to an existing variant must always be set to 0. All the intrinsic methods will respect this invariant, but please take this into account when manipulating the state of the set via unsafe or using it in FFI.

Implementations

impl IntDegreeSet

pub const fn new() -> Self

Creates a new empty IntDegreeSet.

pub fn from<T: IntoIterator<Item = I>, I: Borrow<IntDegree>>(iter: T) -> Self

Creates a new IntDegreeSet from an iterator that yields any borrowed type of IntDegree variants. Duplicated values are ignored.

pub const fn from_slice(slice: &[IntDegree]) -> Self

Creates a new IntDegreeSet from a slice of the variants of the set. Can be used in const contexts.

pub const fn from_array<const N: usize>(array: [IntDegree; N]) -> Self

Creates a new IntDegreeSet from an array of the variants of the set. Can be used in const contexts.

pub const fn empty() -> Self

Creates a new empty IntDegreeSet.

pub const fn all() -> Self

Creates a new IntDegreeSet that contains all the variants of IntDegree.

pub const fn is_empty(&self) -> bool

Returns true if the set is empty.

pub const fn is_all(&self) -> bool

Returns true if the set contains all 10 possible variants of IntDegree.

pub const fn len(&self) -> usize

Returns the number of variants of IntDegree present in the set.

pub fn contains<T: Borrow<IntDegree>>(&self, item: T) -> bool

Returns true if the set contains the given variant. The variant can be specified by any borrow of IntDegree.

pub fn contains_const(&self, item: &IntDegree) -> bool

Returns true if the set contains the given variant. This version of contains can be used in const contexts, but does not allow using a borrowed type of IntDegree.

pub const fn union(&self, other: &Self) -> Self

Creates a new IntDegreeSet that contains all the variants that are in either self or other, leaving both input sets unchanged.

pub const fn intersection(&self, other: &Self) -> Self

Creates a new IntDegreeSet that contains all the variants that are in both self and other, leaving both input sets unchanged.

pub const fn difference(&self, other: &Self) -> Self

Creates a new IntDegreeSet that contains all the variants that are in self but not in other, leaving both input sets unchanged.

pub const fn symmetric_difference(&self, other: &Self) -> Self

Creates a new IntDegreeSet that contains all the variants that are in either self or other, but not in both, leaving both input sets unchanged.

pub const fn complement(&self) -> Self

Creates a new IntDegreeSet that contains all the variants that are not in self, leaving the input set unchanged.

pub fn is_subset_of(&self, other: &Self) -> bool

Returns true if self is a subset of other. That is, if self contains all the items that exist in other.

pub fn is_superset_of(&self, other: &Self) -> bool

Returns true if self is a superset of other. That is, if other contains all the items that exist in self.

pub const fn is_disjoint(&self, other: &Self) -> bool

Returns true if self has no elements in common with other.

pub const fn is_complementary(&self, other: &Self) -> bool

Returns true if self and other are complementary sets. Two sets are complementary if their union contains all variants and their intersection is empty.

pub fn insert<T: Borrow<IntDegree>>(&mut self, item: T)

Inserts a variant into the set. The variant can be specified by any borrow of IntDegree.

pub fn remove<T: Borrow<IntDegree>>(&mut self, item: T)

Removes a variant from the set. The variant can be specified by any borrow of IntDegree.

pub const fn insert_const(&mut self, item: &IntDegree)

Inserts a variant into the set. This version of insert can be used in const contexts, but does not allow using a borrowed type of IntDegree.

pub const fn remove_const(&mut self, item: &IntDegree)

Removes a variant from the set. This version of remove can be used in const contexts, but does not allow using a borrowed type of IntDegree.

pub const fn iter(&self) -> IntDegreeSetSetIter

Returns an iterator over the variants of IntDegree contained in the set. Variants are yielded in the order in which they appear in the definition of IntDegree, regardless of insertion order.

pub const fn to_repr(&self) -> u16

Returns the integer representation of the set as a bitset. The N-th variant of IntDegree corresponds to the N-th least significative bit of the integer.

pub const fn from_repr(repr: u16) -> Option<Self>

Creates a new IntDegreeSet from an integer interpreted as a bitset. The N-th variant of IntDegree corresponds to the N-th least significative bit of the integer.

Returns None if the integer is not a valid bitset representation of the set (i.e, a bit that does not correspond to any variant of IntDegree is set to 1.).

pub const fn is_valid_repr(repr: u16) -> bool

Checks whether the provided value is a valid representation for a IntDegreeSet.

pub const unsafe fn from_repr_unchecked(repr: u16) -> Self

Creates a new IntDegreeSet from an integer interpreted as a bitset. The N-th variant of IntDegree corresponds to the N-th least significative bit of the integer.

Safety

The integer must be a valid bitset representation of the set, but the invariant that bits that do not correspond to a variant of IntDegree is not checked, so must be guaranteed by the calling code.

It is undefined behavior to pass an invalid value. Methods and iterators obtained from the generated set might exhibit incorrect behavior, including possible panics.

Safe alternatives

Note the from_repr_masked method that silently discards invalid bits at the cost of a (cheap) single bit-wise and operation.

Also the from_repr_discarded method that returns the discarded bits alongide the new set instance (where those bits are safely masked out). This can be useful as an error hanlding mechanism.

pub const unsafe fn from_repr_masked(repr: u16) -> Self

Creates a new IntDegreeSet from an integer interpreted as a bitset, silently discarding invalid bits. The N-th variant of IntDegree corresponds to the N-th least significative bit of the integer.

If the provided repr has bits that do not map to a variant of the original enum set to one, they are masked out and ignored to uphold the bitset integrity invariant.

pub const unsafe fn from_repr_discarded(repr: u16) -> (Self, u16)

Creates a new IntDegreeSet from an integer interpreted as a bitset, discarding invalid bits. Returns the created set and an integer where only the discarded bits are set to 1. The N-th variant of IntDegree corresponds to the N-th least significative bit of the integer.

If the provided repr has bits that do not map to a variant of the original enum set to one, they are masked out to uphold the bitset integrity invariant. The discarded bits that were set are returned as the second member of the tuple.

pub fn collect<B: FromIterator<IntDegree>>(&self) -> B

Collects the values present in the set into any value that can be formed by an iterator of IntDegree. That is, any value that implements FromIterator<IntDegree`>.

Trait Implementations

impl Add<&IntDegree> for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the + operator.

fn add(self, rhs: &IntDegree) -> Self

Performs the + operation.

impl Add<&IntDegreeSet> for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the + operator.

fn add(self, rhs: &Self) -> Self

Performs the + operation.

impl Add<IntDegree> for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the + operator.

fn add(self, rhs: IntDegree) -> Self

Performs the + operation.

impl Add for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self

Performs the + operation.

impl AddAssign<&IntDegree> for IntDegreeSet

fn add_assign(&mut self, rhs: &IntDegree)

Performs the += operation.

impl AddAssign<&IntDegreeSet> for IntDegreeSet

fn add_assign(&mut self, rhs: &Self)

Performs the += operation.

impl AddAssign<IntDegree> for IntDegreeSet

fn add_assign(&mut self, rhs: IntDegree)

Performs the += operation.

impl AddAssign for IntDegreeSet

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl BitAnd<&IntDegreeSet> for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the & operator.

fn bitand(self, rhs: &Self) -> Self

Performs the & operation.

impl BitAnd for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the & operator.

fn bitand(self, rhs: Self) -> Self

Performs the & operation.

impl BitAndAssign<&IntDegreeSet> for IntDegreeSet

fn bitand_assign(&mut self, rhs: &Self)

Performs the &= operation.

impl BitAndAssign for IntDegreeSet

fn bitand_assign(&mut self, rhs: Self)

Performs the &= operation.

impl BitOr<&IntDegree> for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the | operator.

fn bitor(self, rhs: &IntDegree) -> Self

Performs the | operation.

impl BitOr<&IntDegreeSet> for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the | operator.

fn bitor(self, rhs: &Self) -> Self

Performs the | operation.

impl BitOr<IntDegree> for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the | operator.

fn bitor(self, rhs: IntDegree) -> Self

Performs the | operation.

impl BitOr for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the | operator.

fn bitor(self, rhs: Self) -> Self

Performs the | operation.

impl BitOrAssign<&IntDegreeSet> for IntDegreeSet

fn bitor_assign(&mut self, rhs: &Self)

Performs the |= operation.

impl BitOrAssign for IntDegreeSet

fn bitor_assign(&mut self, rhs: Self)

Performs the |= operation.

impl BitXor<&IntDegreeSet> for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &Self) -> Self

Performs the ^ operation.

impl BitXor for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: Self) -> Self

Performs the ^ operation.

impl BitXorAssign<&IntDegreeSet> for IntDegreeSet

fn bitxor_assign(&mut self, rhs: &Self)

Performs the ^= operation.

impl BitXorAssign for IntDegreeSet

fn bitxor_assign(&mut self, rhs: Self)

Performs the ^= operation.

impl Clone for IntDegreeSet

fn clone(&self) -> IntDegreeSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IntDegreeSet

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

Formats the value using the given formatter.

impl Default for IntDegreeSet

fn default() -> Self

Returns the “default value” for a type.

impl<'a> Extend<&'a IntDegree> for IntDegreeSet

fn extend<T: IntoIterator<Item = &'a IntDegree>>(&mut self, iter: T)

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 Extend<IntDegree> for IntDegreeSet

fn extend<T: IntoIterator<Item = IntDegree>>(&mut self, iter: T)

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 From<&IntDegree> for IntDegreeSet

fn from(item: &IntDegree) -> Self

Converts to this type from the input type.

impl From<&IntervalSet> for IntDegreeSet

fn from(value: &IntervalSet) -> Self

Converts to this type from the input type.

impl From<IntDegree> for IntDegreeSet

fn from(item: IntDegree) -> Self

Converts to this type from the input type.

impl<'a> FromIterator<&'a IntDegree> for IntDegreeSet

fn from_iter<T: IntoIterator<Item = &'a IntDegree>>(iter: T) -> Self

Creates a value from an iterator.

impl<'a> FromIterator<&'a IntDegreeSet> for IntDegreeSet

fn from_iter<T: IntoIterator<Item = &'a IntDegreeSet>>(iter: T) -> Self

Creates a value from an iterator.

impl FromIterator<IntDegree> for IntDegreeSet

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

Creates a value from an iterator.

impl FromIterator<IntDegreeSet> for IntDegreeSet

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

Creates a value from an iterator.

impl Hash for IntDegreeSet

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 IntoIterator for IntDegreeSet

type Item = IntDegree

The type of the elements being iterated over.

type IntoIter = IntDegreeSetSetIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl Not for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the ! operator.

fn not(self) -> Self

Performs the unary ! operation.

impl Ord for IntDegreeSet

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

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

fn partial_cmp(&self, other: &IntDegreeSet) -> 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 Sub<&IntDegree> for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the - operator.

fn sub(self, rhs: &IntDegree) -> Self

Performs the - operation.

impl Sub<&IntDegreeSet> for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the - operator.

fn sub(self, rhs: &Self) -> Self

Performs the - operation.

impl Sub<IntDegree> for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the - operator.

fn sub(self, rhs: IntDegree) -> Self

Performs the - operation.

impl Sub for IntDegreeSet

type Output = IntDegreeSet

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self

Performs the - operation.

impl SubAssign<&IntDegree> for IntDegreeSet

fn sub_assign(&mut self, rhs: &IntDegree)

Performs the -= operation.

impl SubAssign<&IntDegreeSet> for IntDegreeSet

fn sub_assign(&mut self, rhs: &Self)

Performs the -= operation.

impl SubAssign<IntDegree> for IntDegreeSet

fn sub_assign(&mut self, rhs: IntDegree)

Performs the -= operation.

impl SubAssign for IntDegreeSet

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.

impl Copy for IntDegreeSet

impl Eq for IntDegreeSet

impl StructuralPartialEq for IntDegreeSet