Struct lattices::collections::ArrayMap

pub struct ArrayMap<K, V, const N: usize> {
    pub keys: [K; N],
    pub vals: [V; N],
}

An array wrapper representing a fixed-size map.

Fields

keys: [K; N]

Keys, corresponding 1:1 with vals.

vals: [V; N]

Values, corresponding 1:1 with keys.

Trait Implementations

impl<K: Clone, V: Clone, const N: usize> Clone for ArrayMap<K, V, N>

fn clone(&self) -> ArrayMap<K, V, N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V, const N: usize> Collection for ArrayMap<K, V, N>

type Item = V

Type of the items of the collection.

impl<K, V, const N: usize> CollectionMut for ArrayMap<K, V, N>

type ItemMut<'a> = &'a mut <ArrayMap<K, V, N> as Collection>::Item where Self: 'a

Type of mutable references to items of the collection.

fn upcast_item_mut<'short, 'long: 'short>( r: Self::ItemMut<'long>, ) -> Self::ItemMut<'short>

where Self: 'long,

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

impl<K, V, const N: usize> CollectionRef for ArrayMap<K, V, N>

type ItemRef<'a> = &'a <ArrayMap<K, V, N> as Collection>::Item where Self: 'a

Type of references to items of the collection.

fn upcast_item_ref<'short, 'long: 'short>( r: Self::ItemRef<'long>, ) -> Self::ItemRef<'short>

where Self: 'long,

Changes an item reference into a shorter lived reference.

impl<K, V, const N: usize> From<[(K, V); N]> for ArrayMap<K, V, N>

fn from(value: [(K, V); N]) -> Self

Converts to this type from the input type.

impl<'a, Q, K, V, const N: usize> Get<&'a Q> for ArrayMap<K, V, N>

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

fn get(&self, key: &'a Q) -> Option<Self::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, K, V, const N: usize> GetKeyValue<&'a Q> for ArrayMap<K, V, N>

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

fn get_key_value( &self, key: &'a Q, ) -> Option<(Self::KeyRef<'_>, Self::ItemRef<'_>)>

Returns the key-value pair matching the given key.

impl<'a, Q, K, V, const N: usize> GetKeyValueMut<&'a Q> for ArrayMap<K, V, N>

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

fn get_key_value_mut( &mut self, key: &'a Q, ) -> Option<(Self::KeyRef<'_>, Self::ItemMut<'_>)>

Returns the key-value pair matching the given key, with a mutable reference to the value.

impl<'a, Q, K, V, const N: usize> GetMut<&'a Q> for ArrayMap<K, V, N>

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

fn get_mut(&mut self, key: &'a Q) -> Option<Self::ItemMut<'_>>

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

impl<K: Hash, V: Hash, const N: usize> Hash for ArrayMap<K, V, N>

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<K, V, const N: usize> IntoIterator for ArrayMap<K, V, N>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = Zip<IntoIter<K, N>, IntoIter<V, N>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K, V, const N: usize> Iter for ArrayMap<K, V, N>

type Iter<'a> = Iter<'a, V> where Self: 'a

Iterator type.

fn iter(&self) -> Self::Iter<'_>

Create an iterator over the items of the collection.

impl<K, V, const N: usize> Keyed for ArrayMap<K, V, N>

type Key = K

Type of the keys indexing each item of the collection.

impl<K, V, const N: usize> KeyedRef for ArrayMap<K, V, N>

type KeyRef<'a> = &'a <ArrayMap<K, V, N> as Keyed>::Key where Self: 'a

Type of references to keys of the collection.

fn upcast_key_ref<'short, 'long: 'short>( r: Self::KeyRef<'long>, ) -> Self::KeyRef<'short>

where Self: 'long,

Changes a key reference into a shorter lived reference.

impl<K, V, const N: usize> Len for ArrayMap<K, V, 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<K, V, const N: usize> MapIter for ArrayMap<K, V, N>

type Iter<'a> = Zip<Iter<'a, K>, Iter<'a, V>> where Self: 'a

fn iter(&self) -> Self::Iter<'_>

impl<K, V, const N: usize> MapIterMut for ArrayMap<K, V, N>

type IterMut<'a> = Zip<Iter<'a, K>, IterMut<'a, V>> where Self: 'a

fn iter_mut(&mut self) -> Self::IterMut<'_>

impl<K, OldVal, const N: usize> MapMapValues<OldVal> for ArrayMap<K, OldVal, N>

type MapValue<NewVal> = ArrayMap<K, NewVal, N>

Output type, should be Self but with OldVal replaced with NewVal.

fn map_values<NewVal, MapFn>(self, map_fn: MapFn) -> Self::MapValue<NewVal>

where MapFn: FnMut(OldVal) -> NewVal,

Map the values into using the map_fn.

impl<K: Ord, V: Ord, const N: usize> Ord for ArrayMap<K, V, N>

fn cmp(&self, other: &ArrayMap<K, V, 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 + PartialOrd,

Restrict a value to a certain interval.

impl<K: PartialEq, V: PartialEq, const N: usize> PartialEq for ArrayMap<K, V, N>

fn eq(&self, other: &ArrayMap<K, V, 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<K: PartialOrd, V: PartialOrd, const N: usize> PartialOrd for ArrayMap<K, V, N>

fn partial_cmp(&self, other: &ArrayMap<K, V, 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<K, V, const N: usize> SimpleCollectionRef for ArrayMap<K, V, N>

fn into_ref<'r>(r: Self::ItemRef<'r>) -> &'r Self::Item

where Self: 'r,

impl<K, V, const N: usize> SimpleKeyedRef for ArrayMap<K, V, N>

fn into_ref<'r>(r: Self::KeyRef<'r>) -> &'r Self::Key

where Self: 'r,

impl<K: Copy, V: Copy, const N: usize> Copy for ArrayMap<K, V, N>

impl<K: Eq, V: Eq, const N: usize> Eq for ArrayMap<K, V, N>

impl<K, V, const N: usize> StructuralPartialEq for ArrayMap<K, V, N>