Struct DetOpenMap 

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

Implementations

impl<K: Hash + Eq + Ord + Clone, V: Clone> DetOpenMap<K, V>

pub fn new() -> Self

pub fn with_capacity(cap: usize) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn overflow_count(&self) -> u64

How many entries spilled into the BTreeMap fallback. Surfaces adversarial-collision health for tests / monitoring. Not part of the user-visible map contract.

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

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

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

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

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)> + '_

Iterate (K, V) pairs in deterministic-but-undefined order (combination of slot order + fallback order). Callers MUST sort before public output.

pub fn iter_sorted(&self) -> Vec<(&K, &V)>

Sorted iteration. Use this for any path that surfaces iteration order to public output.

Trait Implementations

impl<K: Debug + Hash + Eq + Ord + Clone, V: Debug + Clone> Debug for DetOpenMap<K, V>

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

Formats the value using the given formatter.

impl<K: Hash + Eq + Ord + Clone, V: Clone> Default for DetOpenMap<K, V>

fn default() -> Self

Returns the “default value” for a type.