Struct OrdinalSet64 

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

Set for implementations of Ordinal with a maximum ordinal size of 64.

This is implemented using a single u64 value to store the set of elements. To store set of arbitrary size, consider using OrdinalSet.

Implementations

impl<T: Ordinal> OrdinalSet64<T>

pub const fn new() -> Self

Create a new empty set.

pub fn all() -> Self

Create a set containing all possible elements of K.

pub fn insert(&mut self, ordinal: T) -> bool

Insert an element into the set, returning true if the element was not already present.

pub fn iter(&self) -> Iter64<T>

Iterate over the elements of the set.

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

Check if the set contains an element.

Trait Implementations

impl<T> Clone for OrdinalSet64<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Ordinal + Debug> Debug for OrdinalSet64<T>

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

Formats the value using the given formatter.

impl<T: Ordinal> Default for OrdinalSet64<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Eq> Eq for OrdinalSet64<T>

impl<T: Ordinal> FromIterator<T> for OrdinalSet64<T>

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

Creates a value from an iterator.

impl<T: PartialEq> PartialEq for OrdinalSet64<T>

fn eq(&self, other: &OrdinalSet64<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> StructuralPartialEq for OrdinalSet64<T>