Struct DetMap 

pub struct DetMap { /* private fields */ }

A deterministic hash map with insertion-order iteration. Uses open addressing with Fibonacci hashing.

Implementations

impl DetMap

pub fn new() -> Self

Create a new empty DetMap with an initial capacity of 8 slots.

pub fn insert(&mut self, key: Value, value: Value)

Insert a key-value pair into the map.

If the key already exists, its value is overwritten and its original insertion position is preserved. Triggers a rehash (doubling capacity) when the load factor exceeds 75%.

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

Look up a value by key. Returns None if the key is not present.

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

Return true if the map contains the given key.

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

Remove a key from the map, returning its value if it was present.

Uses Robin Hood-style backward-shift deletion to maintain probe chain correctness. The insertion-order vector is updated in place so that iteration order of remaining entries is preserved.

pub fn iter(&self) -> impl Iterator<Item = (&Value, &Value)>

Iterate in insertion order.

pub fn keys(&self) -> Vec<Value>

Collect all keys in insertion order.

pub fn values_vec(&self) -> Vec<Value>

Collect all values in insertion order.

pub fn len(&self) -> usize

Return the number of key-value pairs in the map.

pub fn is_empty(&self) -> bool

Return true if the map contains no entries.

Trait Implementations

impl Clone for DetMap

fn clone(&self) -> DetMap

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DetMap

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

Formats the value using the given formatter.

impl Default for DetMap

fn default() -> Self

Returns the “default value” for a type.