Type Alias LinearMap 

pub type LinearMap<K, V, const N: usize> = LinearMapInner<K, V, OwnedStorage<K, V, N>>;

A fixed capacity map/dictionary that performs lookups via linear search.

Note that as this map doesn’t use hashing so most operations are O(n) instead of O(1).

Aliased Type

pub struct LinearMap<K, V, const N: usize> { /* private fields */ }

Implementations

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

pub const fn new() -> Self

Creates an empty LinearMap.

Examples

use heapless::LinearMap;

// allocate the map on the stack
let mut map: LinearMap<&str, isize, 8> = LinearMap::new();

// allocate the map in a static variable
static mut MAP: LinearMap<&str, isize, 8> = LinearMap::new();

Trait Implementations

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

where K: Eq + Clone, V: Clone,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

where K: Eq,

fn default() -> Self

Returns the “default value” for a type.

impl<'de, K, V, const N: usize> Deserialize<'de> for LinearMap<K, V, N>

where K: Eq + Deserialize<'de>, V: Deserialize<'de>,

Available on crate feature serde only.

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<K, V, const N: usize> FromIterator<(K, V)> for LinearMap<K, V, N>

where K: Eq,

fn from_iter<I>(iter: I) -> Self

where I: IntoIterator<Item = (K, V)>,

Creates a value from an iterator.

impl<K, V, const N: usize> IntoIterator for LinearMap<K, V, N>

where K: Eq,

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<K, V, N>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.