Struct IndexStorage 

pub struct IndexStorage {
    pub columns: Vec<(String, SortDirection)>,
    pub tree: BTreeMap<IndexKey, Vec<IndexEntry>>,
}

Storage for one declared index: BTreeMap keyed by IndexKey (direction- wrapped per column) to a Vec of posting entries with MVCC visibility.

Fields

columns: Vec<(String, SortDirection)>

tree: BTreeMap<IndexKey, Vec<IndexEntry>>

Non-unique keys map to Vec; tie-break by row_id ascending is maintained at insert time (I18).

Implementations

impl IndexStorage

pub fn new(columns: Vec<(String, SortDirection)>) -> Self

pub fn total_entries(&self) -> u64

Number of live (non-tombstoned) postings, useful for leak detection.

pub fn total_entries_including_tombstones(&self) -> u64

Total postings including tombstones (for DROP TABLE leak detection).

pub fn insert_posting(&mut self, key: IndexKey, entry: IndexEntry)

Insert a posting at the given key, placing it in row_id-ascending order.

pub fn tombstone_posting( &mut self, key: &IndexKey, row_id: RowId, deleted_tx: TxId, )

Stamp deleted_tx on the posting matching row_id at key.

Trait Implementations

impl Debug for IndexStorage

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

Formats the value using the given formatter.

impl Default for IndexStorage

fn default() -> IndexStorage

Returns the “default value” for a type.