Struct hypertree::red_black_tree::RedBlackTree

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

A Red-Black tree which supports random access O(log n), insert O(log n), delete O(log n), and get max O(1)

Implementations

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

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

Creates a new RedBlackTree. 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 RedBlackTree<'a, V>

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

fn set_root_index(&mut self, root_index: DataIndex)

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

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

fn root_index(&self) -> DataIndex

fn max_index(&self) -> DataIndex

impl<'a, V: Payload> HyperTreeWriteOperations<'a, V> for RedBlackTree<'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.