Struct RowStore 

pub struct RowStore { /* private fields */ }

Row storage for a single table.

Implementations

impl RowStore

pub fn new(schema: Table) -> Self

Creates a new row store for the given table schema.

pub fn schema(&self) -> &Table

Returns the table schema.

pub fn len(&self) -> usize

Returns the number of rows.

pub fn is_empty(&self) -> bool

Returns true if the store is empty.

pub fn insert(&mut self, row: Row) -> Result<RowId>

Inserts a row into the store.

pub fn update(&mut self, row_id: RowId, new_row: Row) -> Result<()>

Updates a row in the store.

pub fn delete(&mut self, row_id: RowId) -> Result<Rc<Row>>

Deletes a row from the store.

pub fn get(&self, row_id: RowId) -> Option<Rc<Row>>

Gets a row by ID.

pub fn get_mut(&mut self, row_id: RowId) -> Option<&mut Row>

Gets a mutable reference to a row by ID (requires exclusive access). Note: This clones the Rc and returns a new Row if mutation is needed.

pub fn scan(&self) -> impl Iterator<Item = Rc<Row>> + '_

Returns an iterator over all rows.

pub fn row_ids(&self) -> Vec<RowId>

Returns all row IDs.

pub fn get_by_pk(&self, pk_value: &Value) -> Vec<Rc<Row>>

Gets rows by primary key value.

pub fn find_row_id_by_pk(&self, row: &Row) -> Option<RowId>

Finds existing row ID by primary key.

pub fn pk_exists(&self, pk_value: &Value) -> bool

Checks if a primary key value exists.

pub fn index_scan( &self, index_name: &str, range: Option<&KeyRange<Value>>, ) -> Vec<Rc<Row>>

Gets rows by index scan.

pub fn index_scan_with_limit( &self, index_name: &str, range: Option<&KeyRange<Value>>, limit: Option<usize>, ) -> Vec<Rc<Row>>

Gets rows by index scan with limit.

pub fn index_scan_with_limit_offset( &self, index_name: &str, range: Option<&KeyRange<Value>>, limit: Option<usize>, offset: usize, ) -> Vec<Rc<Row>>

Gets rows by index scan with limit and offset. This enables true pushdown of LIMIT/OFFSET to the storage layer.

pub fn index_scan_with_options( &self, index_name: &str, range: Option<&KeyRange<Value>>, limit: Option<usize>, offset: usize, reverse: bool, ) -> Vec<Rc<Row>>

Gets rows by index scan with limit, offset, and reverse option. This enables true pushdown of LIMIT/OFFSET/ORDER to the storage layer.

pub fn clear(&mut self)

Clears all rows and indices.

pub fn get_many(&self, row_ids: &[RowId]) -> Vec<Option<Rc<Row>>>

Gets multiple rows by IDs.

pub fn insert_or_replace(&mut self, row: Row) -> Result<(RowId, bool)>

Inserts a row or replaces an existing row with the same primary key. Returns the row ID and whether it was a replacement.

pub fn secondary_index_contains(&self, index_name: &str, key: &Value) -> bool

Checks if a secondary index contains a key (for unique constraint checking).

pub fn pk_columns(&self) -> &[usize]

Gets the primary key columns indices.

pub fn extract_pk(&self, row: &Row) -> Option<Value>

Extracts the primary key value from a row.

pub fn insert_with_delta(&mut self, row: Row) -> Result<Delta<Row>>

Inserts a row and returns a Delta for IVM propagation.

pub fn delete_with_delta(&mut self, row_id: RowId) -> Result<Delta<Row>>

Deletes a row and returns a Delta for IVM propagation.

pub fn update_with_delta( &mut self, row_id: RowId, new_row: Row, ) -> Result<(Delta<Row>, Delta<Row>)>

Updates a row and returns Deltas for IVM propagation (delete old + insert new).

pub fn gin_index_get_by_key_value( &self, index_name: &str, key: &str, value: &str, ) -> Vec<Rc<Row>>

Queries the GIN index by key-value pair.

pub fn gin_index_get_by_key(&self, index_name: &str, key: &str) -> Vec<Rc<Row>>

Queries the GIN index by key existence.

pub fn gin_index_get_by_key_values_all( &self, index_name: &str, pairs: &[(&str, &str)], ) -> Vec<Rc<Row>>

Queries the GIN index by multiple key-value pairs (AND query). Returns rows that match ALL of the given key-value pairs.