Struct merklebtree::merklebtree::MerkleBTree

pub struct MerkleBTree {
    pub rootid: i32,
    pub m: u32,
}

Fields

rootid: i32

m: u32

Methods

impl MerkleBTree

pub fn new_empty<T>(order: u32, nodes: &mut Nodes<T>) -> Self where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn new_with<T>(order: u32, value: T, nodes: &mut Nodes<T>) -> Self where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn put<T>(&mut self, value: T, nodes: &mut Nodes<T>) where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn put_clone<T>(&mut self, value: T, nodes: &mut Nodes<T>) -> Nodes<T> where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn remove<T>(&mut self, value: T, nodes: &mut Nodes<T>) where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn remove_clone<T>(&mut self, value: T, nodes: &mut Nodes<T>) -> Nodes<T> where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn height<T>(&self, nodes: &Nodes<T>) -> i32 where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn get<T>(&mut self, value: T, nodes: &mut Nodes<T>) -> (T, bool) where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn get_clone<T>(
    &mut self,
    value: T,
    nodes: &mut Nodes<T>
) -> (T, bool, Nodes<T>) where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn search_recursively<T>(
    &mut self,
    start_node_id: i32,
    value: &T,
    nodes: &mut Nodes<T>
) -> (i32, i32, bool) where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn clone_search_subnode_from_root<T>(
    &mut self,
    start_node_id: i32,
    value: &T,
    nodes: &mut Nodes<T>
) -> (i32, i32, bool, Nodes<T>) where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn left<T>(&self, node_id: i32, nodes: &Nodes<T>) -> i32 where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn leftItem<T>(&self, node_id: i32, nodes: &mut Nodes<T>) -> Option<T> where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn right<T>(&self, node_id: i32, nodes: &Nodes<T>) -> i32 where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

pub fn rightItem<T>(&self, node_id: i32, nodes: &mut Nodes<T>) -> Option<T> where
    T: PartialEq + PartialOrd + Ord + Clone + Debug + CalculateHash, 

Trait Implementations

impl Clone for MerkleBTree

fn clone(&self) -> MerkleBTree

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for MerkleBTree

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

Formats the value using the given formatter.