Struct RowMetaSet 

pub struct RowMetaSet { /* private fields */ }

An LSM chain of immutable segment maps (base + ascending deltas) viewed as one logical map. Rows are partitioned across segments by row_id (append is disjoint; compaction rebuilds the base), so key/meta lookups take the newest hit and counts sum across segments.

Implementations

impl RowMetaSet

pub fn open(paths: &ChainPaths) -> Result<Self>

Open every segment in paths (base first, then deltas ascending).

pub fn version(&self) -> u64

pub fn delta_count(&self) -> usize

Number of delta segments layered on the base.

pub fn is_empty(&self) -> bool

No rows in any segment - the first-ingest hint that lets the sync oracle short-circuit the per-session source last-id read.

pub fn lookup(&self, row_id: u64) -> Option<(&str, &str)>

Newest segment wins (a row lives in exactly one segment).

pub fn hydrate(&self, rowids: &[u64]) -> (Vec<RowMetaEntry>, Vec<u64>)

Hydrate rowids to owned metas, splitting out the ones no segment holds (appended since the build) for the caller’s take_rows fallback. Output order is unspecified (caller indexes by key). Rowids are visited in sorted order with a per-segment block cache, so the common case - many hits from a few row-id-adjacent sessions - decompresses each block once.

pub fn lookup_count(&self, session_id: &str) -> Option<usize>

A session’s rows are split across segments, so its count is the sum.

pub fn lookup_max_ts(&self, session_id: &str) -> Option<i64>

Max message timestamp (micros) for session_id across the chain - the max over every segment that holds it (a session’s rows can be split across base and deltas). None if no segment has it.

pub fn merged_entries(&self) -> Vec<RowMetaEntry>

Every row across all segments, newest-segment-wins on row_id collision - the input to a base rebuild at compaction.

Trait Implementations

impl Debug for RowMetaSet

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

Formats the value using the given formatter.