Struct NewestFirst 

pub struct NewestFirst { /* private fields */ }

A shard’s runs from the highest run number down: the newest start first, since a shard numbers its runs in the order they start. (After a reshard, runs that had to be renumbered count as newer than they are.)

Batches let the caller release the shard between them. The cursor probes each number below the last one issued, so the newest k runs cost about k lookups; once probing has cost two passes over the table (old numbers mostly expired), it sorts the runs left instead. Runs started after the cursor was made are not visited; a run removed meanwhile may still be returned once.

Implementations

impl NewestFirst

pub fn next_batch(&mut self, core: &ShardCore, n: usize) -> Vec<RunId>

The next at most n runs.

Trait Implementations

impl Debug for NewestFirst

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

Formats the value using the given formatter.