Enum Node 

pub enum Node<K, V> {
    Inner {
        data_map: u32,
        node_map: u32,
        data_start: Idx<Entry<K, V>>,
        children_start: Idx<Idx<Self>>,
        adhash: u64,
    },
    Collision {
        hash: u64,
        entries_start: Idx<Entry<K, V>>,
        entries_len: u8,
        adhash: u64,
    },
}

CHAMP trie node.

Two variants maintain the canonical form invariant:

• Inner — bitmap-compressed node at depth d < D
• Collision — linear node for full 64-bit hash collisions

Variants

Inner

Bitmap-compressed inner node.

Invariant: data_map & node_map == 0 (disjoint positions).

Fields

data_map: u32

Bitmap of positions occupied by inline entries.

node_map: u32

Bitmap of positions occupied by child subtrees.

data_start: Idx<Entry<K, V>>

Index of the first inline entry in the entries arena.

children_start: Idx<Idx<Self>>

Index of the first child pointer in the children arena.

adhash: u64

AdHash of this subtree.

Collision

Collision node for keys sharing the same 64-bit hash.

Invariant: entries_len >= 2.

Fields

hash: u64

The shared 64-bit hash value.

entries_start: Idx<Entry<K, V>>

Index of the first entry in the entries arena.

entries_len: u8

Number of collision entries.

adhash: u64

AdHash of this subtree.

Implementations

impl<K, V> Node<K, V>

pub const fn adhash(&self) -> u64

Returns the AdHash of this node’s subtree.

pub const fn data_len(&self) -> usize

Returns the number of inline data entries.

pub const fn children_len(&self) -> usize

Returns the number of child subtrees (always 0 for collision nodes).

Trait Implementations

impl<K, V> Clone for Node<K, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for Node<K, V>

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

Formats the value using the given formatter.

impl<K, V> Copy for Node<K, V>