Struct DHarhtMemory 

pub struct DHarhtMemory<V: Clone> { /* private fields */ }

D-HARHT Memory profile — port of the user-supplied blueprint.

Implementations

impl<V: Clone> DHarhtMemory<V>

pub fn new() -> Self

pub fn is_sealed(&self) -> bool

pub fn len(&self) -> u64

pub fn is_empty(&self) -> bool

pub fn micro_overflow_count(&self) -> u64

pub fn max_collision_group(&self) -> u32

pub fn approx_memory_bytes(&self) -> usize

Approximate allocated memory in bytes. Counts shard slabs, front-directory pages, micro-bucket pools, and BTreeMap fallback. Useful for memory-comparison benches.

pub fn insert(&mut self, key: u64, value: V) -> Option<V>

Insert a (key, value). Pre-seal: O(log N_shard) BTreeMap insert. Update returns the previous value.

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

Lookup a key. Pre-seal goes through the BTreeMap; post-seal goes through the packed front directory + microbuckets.

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

pub fn seal_for_lookup(&mut self)

Build the sealed lookup index. Groups leaves by their 16-bit front prefix, packs each group into the smallest microbucket that fits, and writes the packed entry into the sparse paged front directory.

pub fn iter_sorted(&self) -> Vec<(u64, &V)>

Iterate all entries in canonical (key-sorted) order. The pre-seal BTreeMap iteration is already sorted; post-seal we re-sort because micro buckets aren’t key-sorted.

Trait Implementations

impl<V: Clone + Clone> Clone for DHarhtMemory<V>

fn clone(&self) -> DHarhtMemory<V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug + Clone> Debug for DHarhtMemory<V>

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

Formats the value using the given formatter.

impl<V: Clone> Default for DHarhtMemory<V>

fn default() -> Self

Returns the “default value” for a type.