Struct BTreeIndex 

pub struct BTreeIndex<K: Ord, V: Copy> { /* private fields */ }

A concurrent BTree index for range queries.

This index provides O(log n) lookup and efficient range scans.

Implementations

impl<K: Ord + Clone, V: Copy> BTreeIndex<K, V>

pub fn new() -> Self

Creates a new empty BTree index.

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

Inserts a key-value pair into the index.

Returns the previous value if the key was already present.

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

Gets the value for a key.

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

Removes a key from the index.

Returns the value if the key was present.

pub fn contains(&self, key: &K) -> bool

Checks if a key exists in the index.

pub fn range<R: RangeBounds<K>>(&self, range: R) -> Vec<(K, V)>

Returns all values in the given range.

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

Returns the minimum key-value pair.

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

Returns the maximum key-value pair.

pub fn len(&self) -> usize

Returns the number of entries in the index.

pub fn is_empty(&self) -> bool

Returns true if the index is empty.

pub fn clear(&self)

Clears all entries from the index.

Trait Implementations

impl<K: Ord + Clone, V: Copy> Default for BTreeIndex<K, V>

fn default() -> Self

Returns the “default value” for a type.