Struct ArraySet 

#[repr(transparent)]
pub struct ArraySet<T, const N: usize>(pub [T; N]);

An array wrapper representing a fixed-size set (modulo duplicate items).

Tuple Fields

0: [T; N]

Trait Implementations

impl<T, const N: usize> Clone for ArraySet<T, N>

where T: Clone,

fn clone(&self) -> ArraySet<T, N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T, const N: usize> Collection for ArraySet<T, N>

type Item = T

Type of the items of the collection.

impl<T, const N: usize> CollectionMut for ArraySet<T, N>

type ItemMut<'a> = &'a mut T where ArraySet<T, N>: 'a

Type of mutable references to items of the collection.

fn upcast_item_mut<'short, 'long>( r: <ArraySet<T, N> as CollectionMut>::ItemMut<'long>, ) -> <ArraySet<T, N> as CollectionMut>::ItemMut<'short>

where 'long: 'short, ArraySet<T, N>: 'long,

Changes an item mutable reference into a shorter lived mutable reference.

impl<T, const N: usize> CollectionRef for ArraySet<T, N>

type ItemRef<'a> = &'a T where ArraySet<T, N>: 'a

Type of references to items of the collection.

fn upcast_item_ref<'short, 'long>( r: <ArraySet<T, N> as CollectionRef>::ItemRef<'long>, ) -> <ArraySet<T, N> as CollectionRef>::ItemRef<'short>

where 'long: 'short, ArraySet<T, N>: 'long,

Changes an item reference into a shorter lived reference.

impl<T, const N: usize> From<[T; N]> for ArraySet<T, N>

fn from(value: [T; N]) -> ArraySet<T, N>

Converts to this type from the input type.

impl<'a, Q, T, const N: usize> Get<&'a Q> for ArraySet<T, N>

where T: Borrow<Q>, Q: Eq + ?Sized,

fn get( &self, key: &'a Q, ) -> Option<<ArraySet<T, N> as CollectionRef>::ItemRef<'_>>

Returns a reference to the item stored behind the given key (if any).

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

Checks if the collection contains an item behind the given key.

impl<'a, Q, T, const N: usize> GetMut<&'a Q> for ArraySet<T, N>

where T: Borrow<Q>, Q: Eq + ?Sized,

fn get_mut( &mut self, key: &'a Q, ) -> Option<<ArraySet<T, N> as CollectionMut>::ItemMut<'_>>

Returns a mutable reference to the item stored behind the given key (if any).

impl<T, const N: usize> Hash for ArraySet<T, N>

where T: Hash,

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<T, const N: usize> IntoIterator for ArraySet<T, N>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T, N>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <ArraySet<T, N> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T, const N: usize> Iter for ArraySet<T, N>

type Iter<'a> = Iter<'a, T> where ArraySet<T, N>: 'a

Iterator type.

fn iter(&self) -> <ArraySet<T, N> as Iter>::Iter<'_>

Create an iterator over the items of the collection.

impl<T, const N: usize> Len for ArraySet<T, N>

fn len(&self) -> usize

Returns the number of elements in the collection.

fn is_empty(&self) -> bool

Checks if the collection is empty.

impl<T, const N: usize> Ord for ArraySet<T, N>

where T: Ord,

fn cmp(&self, other: &ArraySet<T, N>) -> 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<T, const N: usize> PartialEq for ArraySet<T, N>

where T: PartialEq,

fn eq(&self, other: &ArraySet<T, N>) -> 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, const N: usize> PartialOrd for ArraySet<T, N>

where T: PartialOrd,

fn partial_cmp(&self, other: &ArraySet<T, N>) -> 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<T, const N: usize> SimpleCollectionRef for ArraySet<T, N>

fn into_ref<'r>( r: <ArraySet<T, N> as CollectionRef>::ItemRef<'r>, ) -> &'r <ArraySet<T, N> as Collection>::Item

where ArraySet<T, N>: 'r,

impl<T, const N: usize> Copy for ArraySet<T, N>

where T: Copy,

impl<T, const N: usize> Eq for ArraySet<T, N>

where T: Eq,

impl<T, const N: usize> StructuralPartialEq for ArraySet<T, N>