Struct IndexablePager 

pub struct IndexablePager { /* private fields */ }

Deterministic pager for IndexableSource.

Encapsulates shuffle seed and cursor math so callers can reuse a stable paging algorithm without implementing permutation logic themselves.

Implementations

impl IndexablePager

pub fn new(source_id: impl Into<SourceId>) -> Self

Create a new deterministic pager for source_id.

pub fn refresh( &self, source: &dyn IndexableSource, cursor: Option<&SourceCursor>, limit: Option<usize>, ) -> Result<SourceSnapshot, SamplerError>

Page records from an IndexableSource using the provided cursor.

pub fn refresh_with<F>( &self, total: usize, cursor: Option<&SourceCursor>, limit: Option<usize>, fetch: F, ) -> Result<SourceSnapshot, SamplerError>

where F: Fn(usize) -> Result<Option<DataRecord>, SamplerError> + Send + Sync,

Page records using a custom index fetcher.

Useful when records are indexable but not exposed through IndexableSource (for example, temporary index stores or precomputed path lists).

The fetcher is called concurrently using rayon. It must be Fn + Send + Sync (not merely FnMut). All callers that pass a closure over a shared &IndexableSource satisfy this because record_at takes &self.

pub fn seed_for_sampler( source_id: &SourceId, total: usize, sampler_seed: u64, ) -> u64

Build a deterministic seed for a source/total pair with explicit sampler seed.