Struct SingleMapKeyProvider 

pub struct SingleMapKeyProvider { /* private fields */ }

Built-in provider for iterating keys from a single NitriteMap.

Purpose

SingleMapKeyProvider is the default implementation of KeyIteratorProvider for iterating over all keys in a single NitriteMap. It uses the map’s navigation methods to traverse keys in sorted order without retrieving values.

Characteristics

• Sorted Traversal: Iterates keys in sorted order
• Stateful: Tracks the current position using the last visited key
• Lazy Navigation: Uses key-based navigation rather than preloading all keys
• Bidirectional: Supports both forward and backward iteration
• Efficient: Only accesses keys, avoiding value retrieval overhead

Implementations

impl SingleMapKeyProvider

pub fn new(map: NitriteMap) -> Self

Creates a new key provider for a NitriteMap.

Arguments

• map - The NitriteMap to iterate over

Returns

A new SingleMapKeyProvider initialized at position before the first key.

Behavior

• Starts with current=None, indicating position before the first key
• First call to next_key() will return the key at map.first_key()
• First call to prev_key() will return the key at map.last_key()
• The map is cloned internally; changes to the original map are reflected

Trait Implementations

impl KeyIteratorProvider for SingleMapKeyProvider

fn next_key(&mut self) -> Option<NitriteResult<Key>>

Get the next key

fn prev_key(&mut self) -> Option<NitriteResult<Key>>

Get the previous key (for bidirectional iteration)