Struct LmdbParallelRawKeyScanner 

pub struct LmdbParallelRawKeyScanner { /* private fields */ }

Ordered, bounded-memory raw-key scanner backed by concurrent LMDB cursors.

The scanner divides the SHA-256 keyspace into 4096 ordered 12-bit ranges. Every worker owns an independent read transaction with the same LMDB transaction ID, so all cursors observe one coherent snapshot. Ranges are prefetched through a bounded sliding window and are emitted only in lexicographic order. Values are never requested from LMDB.

Implementations

impl LmdbParallelRawKeyScanner

pub fn snapshot_transaction_id(&self) -> usize

LMDB transaction ID shared by every worker cursor.

pub fn next_page(&mut self, limit: usize) -> Result<Vec<Hash>, StoreError>

Return the next globally ordered page of exact raw blob hashes.

The final page may be shorter than limit; a subsequent call returns an empty vector. limit bounds caller-visible allocation independently of the internal range-prefetch window.

Trait Implementations

impl Drop for LmdbParallelRawKeyScanner

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.