Struct HashMapData 

pub struct HashMapData {
    pub keys: Vec<ValueWord>,
    pub values: Vec<ValueWord>,
    pub index: HashMap<u64, Vec<usize>>,
    pub shape_id: Option<ShapeId>,
}

Data for HashMap variant (boxed to keep HeapValue small).

Uses bucket chaining (HashMap<u64, Vec<usize>>) so that hash collisions are handled correctly — each bucket stores all indices whose key hashes to the same u64.

Fields

keys: Vec<ValueWord>

values: Vec<ValueWord>

index: HashMap<u64, Vec<usize>>

shape_id: Option<ShapeId>

Optional shape (hidden class) for O(1) index-based access. None means “dictionary mode” (fallback to hash-based lookup).

Implementations

impl HashMapData

pub fn find_key(&self, key: &ValueWord) -> Option<usize>

Look up the index of key in this HashMap, returning Some(idx) if found.

pub fn rebuild_index(keys: &[ValueWord]) -> HashMap<u64, Vec<usize>>

Build a bucketed index from the keys vector.

pub fn compute_shape(keys: &[ValueWord]) -> Option<ShapeId>

Compute a ShapeId for this HashMap if all keys are strings and count <= 64.

Returns None (dictionary mode) if any key is non-string or there are more than 64 properties.

pub fn shape_get(&self, property: &str) -> Option<&ValueWord>

Look up a string property using the shape for O(1) index-based access.

Returns the value at the shape-determined index, or None if this HashMap has no shape or the property isn’t in the shape.

Trait Implementations

impl Clone for HashMapData

fn clone(&self) -> HashMapData

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for HashMapData

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

Formats the value using the given formatter.