Struct SortedIndexes 

pub struct SortedIndexes { /* private fields */ }

In-memory sorted index per (collection, field). Rebuilt from object store on startup. O(log n) ORDER BY queries.

Implementations

impl SortedIndexes

pub fn new() -> Self

pub fn ensure(&self, coll: &str, field: &str)

Register a field as sorted-indexed for a collection. Must be called before any puts for that field to be indexed.

pub fn insert(&self, coll: &str, field: &str, value: &Value, hash: &str)

Insert (or update) a value → hash mapping.

pub fn remove(&self, coll: &str, field: &str, value: &Value, hash: &str)

Remove a hash from the index (on overwrite/delete of a doc version).

pub fn top_k_asc(&self, coll: &str, field: &str, k: usize) -> Vec<String>

Return the top-k hashes ordered by field ASC.

pub fn top_k_desc(&self, coll: &str, field: &str, k: usize) -> Vec<String>

Return the top-k hashes ordered by field DESC.

pub fn range( &self, coll: &str, field: &str, low: Option<&Value>, high: Option<&Value>, low_incl: bool, high_incl: bool, ) -> Vec<String>

Hashes whose indexed value falls within the given bounds.

The BTreeMap already orders by value, so a bounded predicate is a range walk rather than a full collection scan. None for either bound means unbounded on that side, which serves a one-sided inequality (fee > 10) as well as a two-sided BETWEEN.

Documents where the field is ABSENT are not in this index at all, and are therefore not returned. That is correct for every predicate this serves: a missing field compares as null, which satisfies no ordering comparison.

pub fn exact(&self, coll: &str, field: &str, value: &Value) -> Vec<String>

Hashes whose indexed value equals value — an O(log n) point lookup, used for = and for each arm of an IN (...) list.

pub fn range_len( &self, coll: &str, field: &str, low: Option<&Value>, high: Option<&Value>, low_incl: bool, high_incl: bool, ) -> usize

How many hashes a range covers, without materialising them.

Lets the planner compare two candidate indexes and pick the more selective one, rather than committing to whichever field it saw first.

pub fn has(&self, coll: &str, field: &str) -> bool

Check if a sorted index exists for a (coll, field) pair.

pub fn is_empty(&self) -> bool

True if no sorted indexes have been registered yet.