Struct s_tree::STree

#[non_exhaustive]pub struct STree<K, V>(_);

Methods

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

pub fn new() -> Self

Makes a empty tree

pub fn get(&self, key: &K) -> Option<&V>

Returns a reference to the value corresponding to the key

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

Inserts a key-value pair into the tree

If the tree did not have this key present, None is returned

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

Removes a key from the tree, returning the value at the key if the key was previously in the tree

impl<V> STree<u64, V>

pub fn find_best(&self, target: &u64, common_bits: u64) -> Option<(&u64, &V)>

Finds the best element by counting leading zeroes of target xor key within common bits threshold

pub fn find_best_grouped(
    &self,
    target: &u64,
    common_bits: u64
) -> Vec<Vec<(&u64, &V)>>

Finds elements within common bits threshold and returns them in buckets grouped by leading zeroes