Enum MapValue 

pub enum MapValue {
    Array(GcPtr<PersistentArrayMap>),
    Hash(GcPtr<PersistentHashMap>),
    Sorted(GcPtr<SortedMap>),
}

A map value: either a small array-map or a HAMT-based hash-map.

Variants

Array(GcPtr<PersistentArrayMap>)

Hash(GcPtr<PersistentHashMap>)

Sorted(GcPtr<SortedMap>)

Implementations

impl MapValue

pub fn empty() -> Self

pub fn from_pairs(pairs: Vec<(Value, Value)>) -> Self

Build a map from pre-evaluated key-value pairs.

Chooses the optimal representation based on size: ArrayMap for small maps (≤8 entries), HashTrieMap for larger ones. This avoids N intermediate allocations that empty() + assoc + assoc + ... would create.

pub fn from_flat_entries(entries: Vec<Value>) -> Self

Build a map from a flat evaluated entries vector [k0, v0, k1, v1, ...].

Similar to from_pairs but takes flat key-value entries. Handles duplicate keys (last wins via assoc). Avoids intermediate allocations.

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

pub fn count(&self) -> usize

pub fn assoc(&self, k: Value, v: Value) -> Self

pub fn dissoc(&self, key: &Value) -> Self

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

pub fn for_each<F: FnMut(&Value, &Value)>(&self, f: F)

Iterate over all (key, value) pairs.

pub fn iter(&self) -> Box<dyn Iterator<Item = (&Value, &Value)> + '_>

Iterate over key/value pairs.

Trait Implementations

impl Clone for MapValue

fn clone(&self) -> MapValue

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MapValue

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

Formats the value using the given formatter.

impl Trace for MapValue

fn trace(&self, visitor: &mut MarkVisitor)