Struct RBTree 

pub struct RBTree<'a, K, V, const KSIZE: usize, const VSIZE: usize>(/* private fields */)
where
    K: Ord + BorshDeserialize + BorshSerialize,
    V: BorshDeserialize + BorshSerialize;

A slice-based Red-Black tree

See module level documentation for more info.

Implementations

impl<'a, K, V, const KSIZE: usize, const VSIZE: usize> RBTree<'a, K, V, KSIZE, VSIZE>

where K: Ord + BorshDeserialize + BorshSerialize, V: BorshDeserialize + BorshSerialize,

pub fn init_slice(slice: &'a mut [u8]) -> Result<Self, Error>

Initializes RBTree in a given slice

pub unsafe fn from_slice(slice: &'a mut [u8]) -> Result<Self, Error>

Returns RBTree, contained in the given slice

Safety

This function must be called only on slices, previously initialized as RBTree using init_tree or RBTree::init_slice

pub fn len(&self) -> usize

Returns the number of occupied nodes

This function runs in O(n), where n - is the number of nodes

pub fn clear(&mut self)

Clears the tree

This function runs in O(n), where n - is the number of nodes

pub fn free_nodes_left(&self) -> usize

Returns the number of free nodes

This function runs in O(n), where n - is the number of nodes

pub fn contains_key<Q>(&self, k: &Q) -> bool

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Returns true if the map contains a value for the specified key

This function runs in O(log(n)), where n - is the number of nodes

pub fn get_entry<Q>(&self, k: &Q) -> Option<(K, V)>

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Returns a key-value pair corresponding to the supplied key

This function runs in O(log(n)), where n - is the number of nodes

pub fn get<Q>(&self, k: &Q) -> Option<V>

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Returns the value corresponding to the key

This function runs in O(log(n)), where n - is the number of nodes

pub fn insert(&mut self, k: K, v: V) -> Result<Option<V>, Error>

Inserts a new key-value pair and returns the old value if it was present

This function runs in O(log(n)), where n - is the number of nodes

pub fn is_empty(&self) -> bool

Returns true if the tree contains no elements

pub fn remove<Q>(&mut self, key: &Q) -> Option<V>

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Deletes entry and returns deserialized value

This function runs in O(log(n)), where n - is the number of nodes

pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Deletes entry and returns deserialized key-value pair

This function runs in O(log(n)), where n - is the number of nodes

pub fn delete<Q>(&mut self, key: &Q) -> bool

where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Deletes entry without deserializing the value

Returns true if there was a value with the given key.

pub fn first_entry(&self) -> Option<(K, V)>

Returns the first key-value pair in the map

This function runs in O(log(n)), where n - is the number of nodes

pub fn last_entry(&self) -> Option<(K, V)>

Returns the last key-value pair in the map

This function runs in O(log(n)), where n - is the number of nodes

pub fn pairs<'b>(&'b self) -> PairsIterator<'b, 'a, K, V, KSIZE, VSIZE>

Creates an iterator over key-value pairs, in order by key

pub fn keys<'b>(&'b self) -> KeysIterator<'b, 'a, K, V, KSIZE, VSIZE>

Creates an iterator over keys, from smallest to biggest

pub fn values<'b>(&'b self) -> ValuesIterator<'b, 'a, K, V, KSIZE, VSIZE>

Creates an iterator over values, in order by key

Trait Implementations

impl<'a, K, V, const KSIZE: usize, const VSIZE: usize> Debug for RBTree<'a, K, V, KSIZE, VSIZE>

where K: Ord + BorshDeserialize + BorshSerialize + Debug, V: BorshDeserialize + BorshSerialize + Debug,

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

Formats the value using the given formatter.

impl<'a, K, V, const KSIZE: usize, const VSIZE: usize> Extend<(K, V)> for RBTree<'a, K, V, KSIZE, VSIZE>

where K: Ord + BorshDeserialize + BorshSerialize, V: BorshDeserialize + BorshSerialize,

fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.