Struct ArrayMap 

pub struct ArrayMap<K: Eq, V: Sized + PartialEq, const LENGTH: usize> { /* private fields */ }

Implementations

impl<K: Eq, V: Sized + PartialEq, const LENGTH: usize> ArrayMap<K, V, LENGTH>

pub const unsafe fn from_array_unchecked( array: [(K, V); LENGTH], ) -> ArrayMap<K, V, LENGTH>

Please only use this method to create map literals if the “macros” feature is unavailable to you “macros” provides safe, checked alternatives to initialize linear maps with compile time checking of the invariants of each type.

Creates a new ArrayMap from the supplied array.

SAFETY: improper use of this method - initializing with duplicate keys -will NOT create memory unsafety, but will result in every identical key beyond the first never getting accessed as LinearMaps short circuit on the first matching key.

pub const fn len(&self) -> usize

Returns the number of elements in the ArrayMap

pub const fn is_empty(&self) -> bool

Returns true if the store is empty, false otherwise.

Trait Implementations

impl<K: Clone + Eq, V: Clone + Sized + PartialEq, const LENGTH: usize> Clone for ArrayMap<K, V, LENGTH>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Eq, V: Debug + Sized + PartialEq, const LENGTH: usize> Debug for ArrayMap<K, V, LENGTH>

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

Formats the value using the given formatter.

impl<K: Hash + Eq, V: Hash + Sized + PartialEq, const LENGTH: usize> Hash for ArrayMap<K, V, LENGTH>

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: Eq, V: Sized + PartialEq, const LENGTH: usize> LinearMap<K, V> for ArrayMap<K, V, LENGTH>

type Backing = [(K, V); LENGTH]

fn as_slice(&self) -> &[(K, V)]

The keys and values of the map.

fn into_inner(self) -> Self::Backing

Consumes self, returning the underlying store.

fn contains_key(&self, key: &K) -> bool

Returns true if this map contains the given key. False otherwise.

fn contains_value(&self, value: &V) -> bool

Returns true if this map contains a given value. False otherwise.

fn get<'a>(&'a self, key: &'a K) -> Option<&'a V>

Gets a reference with the associated key. Will return None if that i key is not in the map.

fn get_mut<'a>(&'a mut self, key: &'a K) -> Option<&'a mut V>

Gets a mutable reference with the associated key. Will return None if that key is not in the map.

fn nth_value<'a>(&'a self, index: usize) -> Option<&'a V>

where K: 'a,

Gets a reference to the nth value in the map. Will return None if index is out of bounds.

fn nth_value_mut<'a>(&'a mut self, index: usize) -> Option<&'a mut V>

where K: 'a,

Gets a reference to the nth value in the map. Will return None if index is out of bounds.

fn nth_key<'a>(&'a self, index: usize) -> Option<&'a K>

where V: 'a,

Gets a reference to the nth value in the map. Will return None if index is out of bounds.

fn nth_key_mut<'a>(&'a mut self, index: usize) -> Option<&'a mut K>

where V: 'a,

Gets a reference to the nth key in the map. Will return None if index is out of bounds.

fn replace(&mut self, key: &K, value: V)

Searches for a key == key in the map. If it is present replaces its value with “value”. If not, it does nothing.

fn merge_from_iter<'a>(&'a mut self, iter: impl Iterator<Item = &'a (K, V)>)

where K: 'a, V: 'a + Clone,

For every key in iter which matches a key in self, this method replaces the value from iter in self, “merging” the iterator and the map.

impl<K: Ord + Eq, V: Ord + Sized + PartialEq, const LENGTH: usize> Ord for ArrayMap<K, V, LENGTH>

fn cmp(&self, other: &ArrayMap<K, V, LENGTH>) -> 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<K: PartialEq + Eq, V: PartialEq + Sized + PartialEq, const LENGTH: usize> PartialEq for ArrayMap<K, V, LENGTH>

fn eq(&self, other: &ArrayMap<K, V, LENGTH>) -> 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 + Eq, V: PartialOrd + Sized + PartialEq, const LENGTH: usize> PartialOrd for ArrayMap<K, V, LENGTH>

fn partial_cmp(&self, other: &ArrayMap<K, V, LENGTH>) -> 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: Eq + Eq, V: Eq + Sized + PartialEq, const LENGTH: usize> Eq for ArrayMap<K, V, LENGTH>

impl<K: Eq, V: Sized + PartialEq, const LENGTH: usize> StructuralPartialEq for ArrayMap<K, V, LENGTH>