Struct hypertree::red_black_tree::RedBlackTreeReadOnly

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

A Red-Black tree which supports random access O(log n) and get max O(1), but does not require the data to be mutable.

Implementations

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

pub fn new(data: &'a [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. It is necessary to persist the root_index to re-initialize a tree, storing the max_index is recommended when in-order iteration is performance critical.

Depending on the index args this will behave differently:

root=NIL: initializes an empty tree, get_max() is defined

root!=NIL max=NIL: initializes an existing tree, get_max() is undefined & iter() will dynamically lookup the maximum

root!=NIL max!=NIL: initializes an existing tree, get_max() is defined

Trait Implementations

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

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

fn root_index(&self) -> DataIndex

fn max_index(&self) -> DataIndex