Struct BTree 

pub struct BTree {
    pub size: usize,
    /* private fields */
}

Fields

size: usize

Implementations

impl BTree

pub fn is_empty(&self) -> bool

pub fn contains(&self, value: &Value, row_id: u64) -> bool

pub fn lookup_eq(&self, value: &Value) -> Vec<u64>

All row ids whose key compares equal to value, in order.

pub fn range_scan(&self, low: &Value, high: &Value) -> Vec<u64>

All row ids with value in [low, high] inclusive, in key order.

pub fn scan_all(&self) -> Vec<(Value, u64)>

All (key, row_id) in order — full index scan.

pub fn insert(&mut self, value: Value, row_id: u64)

pub fn delete(&mut self, value: &Value, row_id: u64) -> bool

Remove one entry; returns true if found. Underflow is lazy: empty leaves remain in the linked structure until the tree itself becomes empty. This keeps separator maintenance simple while preserving ordered scans and allowing those leaves to be reused by later inserts.

Trait Implementations

impl Clone for BTree

fn clone(&self) -> BTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BTree

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

Formats the value using the given formatter.

impl Default for BTree

fn default() -> Self

Returns the “default value” for a type.