Struct UltraHashMap 

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

Ultra-fast lock-free HashMap

Implementations

impl<K: Hash + Eq + Clone, V: Clone> UltraHashMap<K, V>

pub fn new() -> Self

Create new ultra-fast hashmap

pub fn with_capacity(capacity: usize) -> Self

Create with specified capacity

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

Insert with Robin Hood hashing

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

Get value by key with optimized lookup

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

Remove key-value pair

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

Check if key exists

pub fn len(&self) -> usize

Get number of elements

pub fn is_empty(&self) -> bool

Check if empty

Trait Implementations

impl<K, V> Drop for UltraHashMap<K, V>

fn drop(&mut self)

Executes the destructor for this type.

impl<K: Send, V: Send> Send for UltraHashMap<K, V>

impl<K: Send + Sync, V: Send + Sync> Sync for UltraHashMap<K, V>