Struct SparseTile 

pub struct SparseTile {
    pub dim_dicts: Vec<DimDict>,
    pub attr_cols: Vec<Vec<CellValue>>,
    pub surrogates: Vec<Surrogate>,
    pub valid_from_ms: Vec<i64>,
    pub valid_until_ms: Vec<i64>,
    pub row_kinds: Vec<u8>,
    pub mbr: TileMBR,
}

Sparse tile payload.

Fields

dim_dicts: Vec<DimDict>

One dictionary per schema dim, parallel to schema.dims.

attr_cols: Vec<Vec<CellValue>>

One column per schema attr, parallel to schema.attrs.

surrogates: Vec<Surrogate>

Per-cell global surrogate (one entry per row, parallel to the dim-dict index streams and attr_cols). Cross-engine bitmap joins read this column directly without translating coords back to user-visible primary keys.

valid_from_ms: Vec<i64>

Per-cell valid-time lower bound in milliseconds (inclusive). Parallel to surrogates.

valid_until_ms: Vec<i64>

Per-cell valid-time upper bound in milliseconds (exclusive). nodedb_types::OPEN_UPPER (i64::MAX) means open-ended. Parallel to surrogates.

row_kinds: Vec<u8>

Per-row RowKind encoded as u8. Parallel to surrogates. 0 = Live, 1 = Tombstone, 2 = GdprErased.

Older segments written before this column existed will deserialise with an empty Vec; readers treat a missing entry as Live.

mbr: TileMBR

Implementations

impl SparseTile

pub fn empty(schema: &ArraySchema) -> Self

Empty tile sized for the given schema.

pub fn nnz(&self) -> u32

Count of live (non-sentinel) rows. Used for MBR statistics and predicate-pushdown decisions. Sentinel rows are excluded.

Do not use this value as a row-iteration bound. Iteration must cover sentinel rows so callers can observe Tombstone / GdprErased markers when applying bitemporal visibility rules — use row_count and filter with row_kind instead.

pub fn row_count(&self) -> usize

Total physical row count including sentinel (Tombstone / GdprErased) rows. Use this as the upper bound when iterating over rows; check row_kind inside the loop and skip non-Live rows when reading attribute columns. The attribute column vectors are indexed by the live-row index (incremented only for Live rows), not by the iteration index — confusing the two yields incorrect or out-of-bounds reads.

pub fn row_kind(&self, row: usize) -> ArrayResult<RowKind>

Decode the RowKind for the given row index.

Returns RowKind::Live when row_kinds is empty (forward-compat with pre-v4 data still in memory during migration) or when the row index is out of range.

Trait Implementations

impl Clone for SparseTile

fn clone(&self) -> SparseTile

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SparseTile

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SparseTile

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'__msgpack_de> FromMessagePack<'__msgpack_de> for SparseTile

fn read<R: Read<'__msgpack_de>>(reader: &mut R) -> Result<Self, Error>

where Self: Sized,

Reads the MessagePack representation of this value from the provided reader.

impl PartialEq for SparseTile

fn eq(&self, other: &SparseTile) -> 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 Serialize for SparseTile

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl ToMessagePack for SparseTile

fn write<W: Write>(&self, writer: &mut W) -> Result<(), Error>

Writes the MessagePack representation of this value into the provided writer.

impl StructuralPartialEq for SparseTile