Struct imhamt::node::reference::Node

pub struct Node<K, V> {
    pub bitmap: SmallBitmap,
    pub children: Box<[Arc<Entry<K, V>>]>,
}

Node of the Hash Array Mapped Trie

The bitmap is indexed by a HashSubgroup and give an entry

Fields

bitmap: SmallBitmap

children: Box<[Arc<Entry<K, V>>]>

Implementations

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

pub fn new() -> Self

pub fn singleton(idx: LevelIndex, child: Arc<Entry<K, V>>) -> Self

pub fn is_empty(&self) -> bool

pub fn number_children(&self) -> usize

pub fn get_child(&self, at: ArrayIndex) -> &Arc<Entry<K, V>>

pub fn set_at(&self, idx: LevelIndex, child: Arc<Entry<K, V>>) -> Self

pub fn clear_at(&self, idx: LevelIndex) -> Option<Self>

pub fn replace_at(&self, idx: ArrayIndex, child: Arc<Entry<K, V>>) -> Self

pub fn clear_or_replace_at( &self, idx: LevelIndex, child: Option<Arc<Entry<K, V>>> ) -> Option<Self>

pub fn iter(&self) -> Iter<'_, Arc<Entry<K, V>>>

Trait Implementations

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

fn clone(&self) -> Node<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.