Struct RowState 

pub struct RowState<V> { /* private fields */ }

One table, key and audience’s merged state. Removed rows retain this state; a removal never advances their generation (§8.4).

Implementations

impl<V> RowState<V>

pub fn new(row: RowId) -> Self

A row that has never been inserted, at generation zero.

pub fn from_parts<O: WriteOracle>( row: RowId, generations: BTreeMap<u64, WriteId>, cells: BTreeMap<String, Cell<V>>, lost: BTreeMap<LostKey, LostValue<V>>, oracle: &O, ) -> Result<Self, O::Error>

Load the compact records kept by the database or a snapshot. Validate their generation sequence, cell presence, reference metadata and lost replacers without replaying write bodies. As with apply, the oracle is the causally closed applied set; it supplies timestamps and past.

pub fn validate_loss<O: WriteOracle>( &self, key: &LostKey, value: &LostValue<V>, oracle: &O, ) -> Result<(), O::Error>

Validate an independently decoded cell loss against this row’s validated generations and winning cells. The oracle is the causally closed applied set, as for from_parts; existing losses do not affect this check.

pub fn row(&self) -> &RowId

The table, key and audience this state belongs to.

pub fn generation(&self) -> u64

How many times the row has been created, deleted or re-added.

pub fn present(&self) -> bool

Whether the row is present in merged state, before removal rules.

pub fn generations(&self) -> &BTreeMap<u64, WriteId>

The smallest-stamped write that moved the row to each generation.

pub fn cells(&self) -> &BTreeMap<String, Cell<V>>

The winning write and value of every set column.

pub fn lost(&self) -> &BTreeMap<LostKey, LostValue<V>>

Every lost value, its incarnation and what replaced it.

pub fn map_schema( self, row: RowId, column: impl FnMut(String, ColumnValue<V>) -> Option<(String, ColumnValue<V>)>, ) -> Self

Carry a row through a schema change. The caller supplies the surviving identity and maps each column value, including its reference identities. Dropped columns disappear; generations, setters and replacers stay fixed.

Trait Implementations

impl<V: Clone> Clone for RowState<V>

fn clone(&self) -> RowState<V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug> Debug for RowState<V>

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

Formats the value using the given formatter.

impl<V: PartialEq> PartialEq for RowState<V>

fn eq(&self, other: &RowState<V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<V: Eq> Eq for RowState<V>

impl<V> StructuralPartialEq for RowState<V>