Struct MmapCursor 

pub struct MmapCursor<'a> { /* private fields */ }

Cursor over one dimension of an mmap’d index: a position within the dimension’s entries, read straight from the mapping.

Implementations

impl<'a> MmapCursor<'a>

pub fn new(entries: &'a [PostingEntry]) -> Self

Cursor at the start of entries, which must be sorted by id with no duplicates (the writer guarantees it).

pub fn open(data: &'a MmapPostingData, dim: DimId) -> Option<Self>

Cursor for dim (a remapped dimension index), None when the dimension has no postings.

Trait Implementations

impl<'a> Clone for MmapCursor<'a>

fn clone(&self) -> MmapCursor<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for MmapCursor<'a>

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

Formats the value using the given formatter.

impl PostingCursor for MmapCursor<'_>

fn peek(&self) -> Option<Posting>

The current element, or None once the cursor is past the end.

fn advance(&mut self)

Move to the next element (no-op past the end).

fn seek(&mut self, target: RecordId) -> Option<Posting>

Move forward to the first element whose id is >= target and return it. Returns None when no such element exists; the cursor is then past the end. Never moves backwards.

fn remaining(&self) -> usize

Number of elements not yet consumed, the current one included.

fn last_id(&self) -> Option<RecordId>

Id of the last element of the whole list (regardless of position); None for an empty list.

fn exhaust(&mut self)

Move past the end.

fn drain_through(&mut self, hi: RecordId, visit: impl FnMut(RecordId, Weight))

Consume every element with id <= hi, handing each (id, weight) to visit in id order. Leaves the cursor on the first element above hi (or past the end).

fn upper_bound(&self) -> Weight

An upper bound on the weights of the elements not yet consumed, the current one included. f32::NEG_INFINITY once past the end.

fn lower_bound(&self) -> Weight

A lower bound on the weights of the elements not yet consumed. The default is unbounded, which is always correct; storages that track a suffix minimum can tighten it so negative query weights prune too.

fn is_exhausted(&self) -> bool

True once the cursor is past the end.