Struct SharedMemoryContents

pub struct SharedMemoryContents<K, V> { /* private fields */ }

Implementations

impl<K: Debug + PartialEq + Serialize + Deserialize<'static>, V: Debug + Serialize + Deserialize<'static>> SharedMemoryContents<K, V>

pub fn try_insert(&mut self, key: K, value: V) -> Result<Option<V>, Error>

Tries to insert a key-value pair into the shared hashmap. If the key already exists, it is removed before inserting the new value. If the size of the hashmap exceeds the maximum size, it will evict items until there is enough space to insert the new key-value pair. Returns a Result containing an Option of the removed value if the hashmap was full and an item had to be evicted, or an error if the hashmap is too large to insert the new key-value pair.

Arguments

• key - A key of type K to insert into the hashmap.
• value - A value of type V to insert into the hashmap.

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

Returns the value associated with the given key in the hashmap, or None if the key is not present. If the key is present, the last accessed time for the corresponding bucket is updated.

Arguments

• key - A reference to the key to search for in the hashmap.

Returns

• Some(V) - The value associated with the given key, if it exists in the hashmap.
• None - If the key is not present in the hashmap.

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

Returns the value associated with the given key, if it exists in the hashmap.

Arguments

• key - A reference to the key to search for in the hashmap.

Returns

• Some(V) - The value associated with the given key, if it exists in the hashmap.
• None - If the key does not exist in the hashmap.

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

Removes the entry with the specified key from the hashmap and returns the value of the removed entry. If the key is not present in the hashmap, returns None.

Arguments

• self - A mutable reference to the hashmap.
• key - The key of the entry to be removed.

Returns

• Some(V) - The value of the removed entry, if it existed in the hashmap.
• None - If the key was not present in the hashmap.

pub fn len(&self) -> usize

Returns the number of elements in the shared hashmap.

pub fn is_empty(&self) -> bool

Returns true if the shared hashmap contains no elements.

pub fn used(&self) -> usize

Returns the total size of the shared memory contents used by the hashmap.

pub fn free(&self) -> usize

Returns the number of free slots in the hashmap.

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

Returns true if the shared hashmap contains the specified key.

Arguments

• key - A reference to the key to search for in the shared hashmap.

pub fn clear(&mut self)

Clears the hashmap, removing all key-value pairs.

pub fn get_lru(&self) -> Option<&Bucket<K, V>>

Get the least recently used bucket.

pub fn evict(&mut self) -> Option<V>

Evict the least recently used bucket.

Trait Implementations

impl<K: Debug + PartialEq + Serialize + Deserialize<'static>, V: Debug + Serialize + Deserialize<'static>> Debug for SharedMemoryContents<K, V>

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

Formats the value using the given formatter.