Struct AdaptiveHashMap 

pub struct AdaptiveHashMap<K, V>
where
    K: Hash + Eq + Clone,
    V: Clone,
{ /* private fields */ }

Simplified adaptive HashMap that chooses mode at creation time This avoids runtime switching complexity while providing the benefits

Implementations

impl<K, V> AdaptiveHashMap<K, V>

where K: Hash + Eq + Clone, V: Clone,

pub fn new() -> Self

Create new adaptive HashMap starting in simple mode

pub fn with_capacity(capacity: usize) -> Self

Create with initial capacity

pub fn new_sharded() -> Self

Create in sharded mode for high contention scenarios

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

Insert a key-value pair

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

Get a value by key

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

Remove a key-value pair

pub fn contention_ratio(&self) -> f64

Get current contention ratio

pub fn is_sharded(&self) -> bool

Check if currently using sharded mode

pub fn len(&self) -> usize

Get number of entries (approximate for sharded mode)

pub fn is_empty(&self) -> bool

Check if empty

Trait Implementations

impl<K, V> Default for AdaptiveHashMap<K, V>

where K: Hash + Eq + Clone, V: Clone,

fn default() -> Self

Returns the “default value” for a type.

impl<K, V> Send for AdaptiveHashMap<K, V>

where K: Hash + Eq + Clone + Send, V: Clone + Send,

impl<K, V> Sync for AdaptiveHashMap<K, V>

where K: Hash + Eq + Clone + Send + Sync, V: Clone + Send + Sync,