Struct OrderedBinaryTreeMapper

pub struct OrderedBinaryTreeMapper<SA, T, A = CurrentStorage>
where
    SA: StorageMapperApi,
    A: StorageAddress<SA>,
    T: NestedEncode + NestedDecode + PartialOrd + PartialEq + Clone,
{ /* private fields */ }

Implementations

impl<SA, T, A> OrderedBinaryTreeMapper<SA, T, A>

where SA: StorageMapperApi, A: StorageAddress<SA>, T: NestedEncode + NestedDecode + PartialOrd + PartialEq + Clone,

pub fn get_root(&self) -> Option<OrderedBinaryTreeNode<T>>

pub fn get_depth(&self, node: &OrderedBinaryTreeNode<T>) -> usize

pub fn recursive_search( &self, opt_node: Option<OrderedBinaryTreeNode<T>>, data: &T, ) -> Option<OrderedBinaryTreeNode<T>>

pub fn iterative_search( &self, opt_node: Option<OrderedBinaryTreeNode<T>>, data: &T, ) -> Option<OrderedBinaryTreeNode<T>>

pub fn find_max( &self, node: OrderedBinaryTreeNode<T>, ) -> OrderedBinaryTreeNode<T>

pub fn find_min( &self, node: OrderedBinaryTreeNode<T>, ) -> OrderedBinaryTreeNode<T>

pub fn find_successor( &self, node: OrderedBinaryTreeNode<T>, ) -> Option<OrderedBinaryTreeNode<T>>

pub fn find_predecessor( &self, node: OrderedBinaryTreeNode<T>, ) -> Option<OrderedBinaryTreeNode<T>>

pub fn insert_element(&mut self, new_data: T) -> u64

pub fn delete_node(&mut self, data: T)

Trait Implementations

impl<SA, T> StorageMapper<SA> for OrderedBinaryTreeMapper<SA, T, CurrentStorage>

where SA: StorageMapperApi, T: NestedEncode + NestedDecode + PartialOrd + PartialEq + Clone + 'static,

fn new(base_key: StorageKey<SA>) -> Self

Will be called automatically by the #[storage_mapper] annotation generated code.