Struct BeTree 

pub struct BeTree { /* private fields */ }

Buffered Bε-tree over (RowId, Epoch) → Row.

Implementations

impl BeTree

pub fn new() -> Self

pub fn mutations(&self) -> usize

Number of mutations buffered.

pub fn is_empty(&self) -> bool

pub fn insert_row(&mut self, row: Row)

Insert a row version (keyed by its own (row_id, committed_epoch)).

pub fn delete(&mut self, row_id: RowId, epoch: Epoch)

Insert a tombstone at (row_id, epoch).

pub fn get(&self, row_id: RowId, snapshot: Epoch) -> Option<Row>

Newest version of row_id with epoch <= snapshot, including tombstones (returned as a Row with deleted=true). None if no such version.

pub fn get_version( &self, row_id: RowId, snapshot: Epoch, ) -> Option<(Epoch, Row)>

Same as Self::get but also returns the version’s epoch — the shape the engine’s MVCC merge needs to pick the newest version across the memtable, the mutable-run tier, and sorted runs.

pub fn get_visible(&self, row_id: RowId, snapshot: Epoch) -> Option<Row>

Visible (non-deleted) row at row_id for snapshot.

pub fn versions(&self) -> Vec<Row>

Every buffered version (non-consuming), in no defined order — leaves plus every internal-node buffer. Used by the memtable adapter to dedup the newest visible version per RowId for a full visible-rows scan.

pub fn into_sorted_rows(self) -> Vec<Row>

Consume the tree, flushing all buffers to leaves, returning every version in ascending (RowId, Epoch) order.

Trait Implementations

impl Default for BeTree

fn default() -> Self

Returns the “default value” for a type.