Struct hypertree::llrb::LLRB

pub struct LLRB<'a, V: Payload> { /* private fields */ }

A Left Leaning Red-Black tree which supports random access O(log n) and get max O(1) https://tjkendev.github.io/bst-visualization/red-black-tree/left-leaning.html This does not properly handle equal key values like the regular RBTree because this does top-down deletions and does not branch when it finds an equal key, just stops there.

Implementations

impl<'a, V: Payload> LLRB<'a, V>

pub fn new( data: &'a mut [u8], root_index: DataIndex, max_index: DataIndex ) -> Self

Creates a new LLRB. Does not mutate data yet. Assumes the actual data in data is already well formed as a red black tree.

Trait Implementations

impl<'a, V: Payload> GetRedBlackTreeData<'a> for LLRB<'a, V>

fn data(&mut self) -> &mut [u8]

fn set_root_index(&mut self, root_index: DataIndex)

impl<'a, V: Payload> GetRedBlackTreeReadOnlyData<'a> for LLRB<'a, V>

fn data(&self) -> &[u8]

fn root_index(&self) -> DataIndex

fn max_index(&self) -> DataIndex

impl<'a, V: Payload> HyperTreeWriteOperations<'a, V> for LLRB<'a, V>

fn insert(&mut self, index: DataIndex, value: V)

Insert and rebalance. The data at index should be already zeroed.

fn remove_by_index(&mut self, index: DataIndex)

Remove a node by index and rebalance.