Enum AVL 

pub enum AVL<K, V = ()> {
    Empty,
    Node {
        key: RefCounter<K>,
        value: RefCounter<V>,
        left: RefCounter<AVL<K, V>>,
        right: RefCounter<AVL<K, V>>,
    },
}

Variants

Empty

Node

Fields

key: RefCounter<K>

value: RefCounter<V>

left: RefCounter<AVL<K, V>>

right: RefCounter<AVL<K, V>>

Implementations

impl<K: Ord> AVL<K>

pub fn insert(&self, value: K) -> Self

pub fn search(&self, value: &K) -> bool

impl<K: Ord, V> AVL<K, V>

pub fn empty() -> AVL<K, V>

pub fn is_empty(&self) -> bool

pub fn find(&self, target_value: &K) -> Option<&V>

pub fn put(&self, key: K, value: V) -> AVL<K, V>

pub fn delete(&self, target_key: &K) -> AVL<K, V>

Trait Implementations

impl<K, V> Clone for AVL<K, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.