Skip to main content

MutableRun

Struct MutableRun 

Source
pub struct MutableRun { /* private fields */ }

Implementations§

Source§

impl MutableRun

Source

pub fn new() -> Self

Source

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.

Source

pub fn len(&self) -> usize

Number of stored versions.

Source

pub fn is_empty(&self) -> bool

Source

pub fn approx_bytes(&self) -> u64

Approximate bytes held — the spill-threshold signal.

Source

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

Newest version of row_id with epoch <= snapshot (including tombstones). Legacy epoch-only entry point; prefer Self::get_version_at when the caller holds a full Snapshot.

Source

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

Newest version of row_id visible under snapshot (including tombstones), using HLC authority when stamps are present (P0.5-T3). Seeks to row_id’s versions via the PMA’s gappy binary search.

Source

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

Newest visible version per RowId at snapshot (including tombstones), ascending by RowId. Legacy epoch-only entry point; prefer Self::visible_versions_at.

Source

pub fn visible_versions_at(&self, snapshot: Snapshot) -> Vec<Row>

Newest visible version per RowId under a full Snapshot, including tombstones. HLC-stamped versions use HLC order (P0.5-T3).

Source

pub fn newest_visible_iter<'a>( &'a self, snapshot: &Snapshot, ) -> MutableRunVisibleVersionCursor<'a>

Borrowing ordered iterator over the newest visible version of each RowId under snapshot (including tombstones). Mirrors Self::newest_visible_map but never clones the row bytes — the yielded &Row borrows from the underlying Pmas for the cursor’s lifetime. The cursor dedups to one entry per RowId (the newest visible version), iterating them in ascending RowId order, exactly like draining the Self::newest_visible_map BTreeMap.

Source

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§

Source§

impl Clone for MutableRun

Source§

fn clone(&self) -> MutableRun

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Default for MutableRun

Source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.