Struct HashIndex 

pub struct HashIndex<K: Hash + Eq, V: Copy> { /* private fields */ }

A concurrent hash index for fast key lookups.

This index provides O(1) average-case lookup, insertion, and deletion.

Implementations

impl<K: Hash + Eq, V: Copy> HashIndex<K, V>

pub fn new() -> Self

Creates a new empty hash index.

pub fn with_capacity(capacity: usize) -> Self

Creates a new hash index with the given capacity.

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

Inserts a key-value pair into the index.

Returns the previous value if the key was already present.

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

Gets the value for a key.

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

Removes a key from the index.

Returns the value if the key was present.

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

Checks if a key exists in the index.

pub fn len(&self) -> usize

Returns the number of entries in the index.

pub fn is_empty(&self) -> bool

Returns true if the index is empty.

pub fn clear(&self)

Clears all entries from the index.

Trait Implementations

impl<K: Hash + Eq, V: Copy> Default for HashIndex<K, V>

fn default() -> Self

Returns the “default value” for a type.