Struct KvMap 

pub struct KvMap<K: Copy + Eq + Send + Sync + 'static, V: Copy + Send + Sync + 'static> { /* private fields */ }

Key-value lookup map, backed by SharedHashMap. Multiple processes can insert + look up concurrently via the shared MMF.

The dispatcher confirms SharedHashMap is the right family; if a different family is picked, the constructor returns ApiError::WrongFamily.

Implementations

impl<K, V> KvMap<K, V>

where K: Copy + Eq + Hash + Send + Sync + 'static, V: Copy + Send + Sync + 'static,

pub fn create( path: impl AsRef<Path>, shape: MmfWorkloadShape, capacity: usize, ) -> Result<Self, ApiError>

Create the map at path with the given workload shape. capacity is rounded up to next pow2.

pub fn insert(&self, key: K, value: V) -> Result<InsertOutcome, ApiError>

Insert a key-value pair.

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

Look up a value by key.

pub fn len(&self) -> usize

Current number of occupied slots.

pub fn is_empty(&self) -> bool

true if the map has no occupied slots.