Struct VebTree 

pub struct VebTree<T> { /* private fields */ }

A tree stored in van Emde Boas memory layout for cache-oblivious traversal.

Implementations

impl<T: Clone> VebTree<T>

pub fn build(input: Vec<TreeNode<T>>) -> Self

Build a VebTree from a list of logical tree nodes.

The first node in input whose id does not appear as any other node’s child is treated as root. If input is empty, returns an empty tree.

pub fn len(&self) -> usize

Number of nodes.

pub fn is_empty(&self) -> bool

Whether the tree is empty.

pub fn get(&self, id: u32) -> Option<&VebEntry<T>>

Look up a node by its original ID. O(1) via hash map.

pub fn get_by_index(&self, idx: u32) -> Option<&VebEntry<T>>

Look up a node by its position in the flat array.

pub fn iter(&self) -> impl Iterator<Item = &VebEntry<T>>

Iterate nodes in vEB order (cache-friendly traversal).

pub fn iter_dfs(&self) -> Vec<&VebEntry<T>>

Iterate nodes in DFS pre-order (logical traversal order).

pub fn root(&self) -> Option<&VebEntry<T>>

Get the root entry (always at position 0 if tree is non-empty).

pub fn as_slice(&self) -> &[VebEntry<T>]

Return the raw flat array slice.

Trait Implementations

impl<T: Clone> Clone for VebTree<T>

fn clone(&self) -> VebTree<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for VebTree<T>

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

Formats the value using the given formatter.