Struct AvlNode 

pub struct AvlNode<K: Ord, V> {
    pub key: K,
    pub value: V,
    pub hash: Hash,
    pub merkle_hash: Hash,
    pub height: u32,
    pub left: Option<Box<AvlNode<K, V>>>,
    pub right: Option<Box<AvlNode<K, V>>>,
}

A node in the AVL Tree.

Fields

key: K

value: V

hash: Hash

merkle_hash: Hash

height: u32

left: Option<Box<AvlNode<K, V>>>

right: Option<Box<AvlNode<K, V>>>

Implementations

impl<K: Ord + AsBytes, V> AvlNode<K, V>

where V: Borrow<[u8]>,

pub fn left_hash(&self) -> Option<&[u8]>

The left merkle hash, if any

pub fn right_hash(&self) -> Option<&[u8]>

The right merkle hash, if any

pub fn update(&mut self)

Update node meta data, such as its height and merkle hash, by looking at its two children.

pub fn balance_factor(&self) -> i32

Returns the node’s balance factor (left_height - right_height).

Trait Implementations

impl<K: Clone + Ord, V: Clone> Clone for AvlNode<K, V>

fn clone(&self) -> AvlNode<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Ord, V: Debug> Debug for AvlNode<K, V>

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

Formats the value using the given formatter.

impl<K: PartialEq + Ord, V: PartialEq> PartialEq for AvlNode<K, V>

fn eq(&self, other: &AvlNode<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: Eq + Ord, V: Eq> Eq for AvlNode<K, V>

impl<K: Ord, V> StructuralPartialEq for AvlNode<K, V>