Struct ArrayMap 

pub struct ArrayMap<K, V, const N: usize>
where
    K: PartialEq + Default,
    V: Default,
{ /* private fields */ }

A generic tinyvec::ArrayVec backed map with O(n) lookup. Maintains insertion order and tracks the last updated entry index.

Implementations

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

where K: PartialEq + Default, V: Default,

pub fn new() -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn last_updated_index(&self) -> Option<usize>

pub fn get_by_index(&self, index: usize) -> Option<&(K, V)>

pub fn get_by_index_mut(&mut self, index: usize) -> Option<&mut (K, V)>

pub fn get_by_index_u8(&self, index: u8) -> Option<&(K, V)>

pub fn get_by_index_mut_u8(&mut self, index: u8) -> Option<&mut (K, V)>

pub fn get_by_key(&self, key: &K) -> Option<&V>

pub fn get_mut_by_key(&mut self, key: &K) -> Option<&mut V>

pub fn find(&self, key: &K) -> Option<(usize, &(K, V))>

pub fn find_mut(&mut self, key: &K) -> Option<(usize, &mut (K, V))>

pub fn find_index(&self, key: &K) -> Option<usize>

pub fn set_last_updated_index<E>(&mut self, index: usize) -> Result<(), E>

where E: From<ArrayMapError>,

pub fn insert<E>(&mut self, key: K, value: V, error: E) -> Result<usize, E>

impl<V, const N: usize> ArrayMap<[u8; 32], V, N>

where V: Default,

pub fn get_by_pubkey(&self, key: &[u8; 32]) -> Option<&V>

pub fn get_mut_by_pubkey(&mut self, key: &[u8; 32]) -> Option<&mut V>

pub fn find_by_pubkey(&self, key: &[u8; 32]) -> Option<(usize, &([u8; 32], V))>

pub fn find_mut_by_pubkey( &mut self, key: &[u8; 32], ) -> Option<(usize, &mut ([u8; 32], V))>

pub fn find_pubkey_index(&self, key: &[u8; 32]) -> Option<usize>

Trait Implementations

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

where K: PartialEq + Default, V: Default,

fn default() -> Self

Returns the “default value” for a type.