Struct MutableRun 

pub struct MutableRun { /* private fields */ }

The PMA-backed mutable run tier. Holds flushed-but-not-yet-spilled rows in sorted (RowId, Epoch) order.

Implementations

impl MutableRun

pub fn new() -> Self

pub fn insert_many(&mut self, rows: Vec<Row>)

Fold drained memtable rows (already ascending by (RowId, Epoch)) into the tier via one bulk merge + re-spread — far cheaper than per-element inserts, which would cluster at the tail on sorted input.

pub fn len(&self) -> usize

Number of stored versions.

pub fn is_empty(&self) -> bool

pub fn approx_bytes(&self) -> u64

Approximate bytes held — the spill-threshold signal.

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

Newest version of row_id with epoch <= snapshot (including tombstones), mirroring Memtable::get_version. Returns None if no version is visible. Seeks straight to row_id’s versions via the PMA’s gappy binary search instead of scanning from the front.

pub fn visible_versions(&self, snapshot_epoch: Epoch) -> Vec<Row>

Newest visible version per RowId at snapshot (including tombstones), ascending by RowId — mirroring Memtable::visible_versions.

pub fn drain_sorted(&mut self) -> Vec<Row>

Drain every version in ascending (RowId, Epoch) order — the order RunWriter::write requires when spilling to an immutable run.

Trait Implementations

impl Default for MutableRun

fn default() -> Self

Returns the “default value” for a type.