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

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

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

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

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

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

Iterate in insertion order.

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

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

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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.