Struct AsyncReadSession 

pub struct AsyncReadSession<'manager, 'tree, S: AsyncStore> { /* private fields */ }

Reusable root-bound read context for an asynchronous store.

All visitors are synchronous. A node is fully loaded before a visitor sees a borrowed slice, and the visitor returns before traversal can await again.

Implementations

impl<'manager, 'tree, S> AsyncReadSession<'manager, 'tree, S>

where S: AsyncStore, S::Error: Send + Sync,

pub fn tree(&self) -> &Tree

Return the immutable tree bound to this session.

pub async fn len(&self) -> Result<u64, Error>

Return the number of logical entries using the retained root.

pub async fn is_empty(&self) -> Result<bool, Error>

Return whether the bound tree contains no entries.

pub async fn rank(&mut self, key: &[u8]) -> Result<u64, Error>

Return the number of keys strictly less than key.

pub async fn select_with<R>( &mut self, ordinal: u64, read: impl for<'entry> FnOnce(EntryRef<'entry>) -> R, ) -> Result<Option<R>, Error>

Visit the zero-based entry at ordinal without copying it.

pub async fn first_entry_with<R>( &mut self, read: impl for<'entry> FnOnce(EntryRef<'entry>) -> R, ) -> Result<Option<R>, Error>

Visit the first entry in key order.

pub async fn last_entry_with<R>( &mut self, read: impl for<'entry> FnOnce(EntryRef<'entry>) -> R, ) -> Result<Option<R>, Error>

Visit the last entry in key order.

pub async fn lower_bound_with<R>( &mut self, key: &[u8], read: impl for<'entry> FnOnce(EntryRef<'entry>) -> R, ) -> Result<Option<R>, Error>

Visit the first entry whose key is at least key.

pub async fn upper_bound_with<R>( &mut self, key: &[u8], read: impl for<'entry> FnOnce(EntryRef<'entry>) -> R, ) -> Result<Option<R>, Error>

Visit the first entry whose key is strictly greater than key.

pub async fn get_with<R>( &mut self, key: &[u8], read: impl FnOnce(&[u8]) -> R, ) -> Result<Option<R>, Error>

Read a value after all required I/O and before any subsequent await.

pub async fn get_value_ref_with<R>( &mut self, key: &[u8], read: impl for<'value> FnOnce(ValueRefView<'value>) -> R, ) -> Result<Option<R>, Error>

Inspect an async-store large-value envelope without copying inline data.

pub async fn get_many_with<K, F>( &mut self, keys: &[K], visit: F, ) -> Result<(), Error>

where K: AsRef<[u8]>, F: for<'value> FnMut(usize, &[u8], Option<&'value [u8]>),

Visit async multi-get results in input order without owning hit values.

pub async fn scan_range( &mut self, start: &[u8], end: Option<&[u8]>, visit: impl for<'entry> FnMut(EntryRef<'entry>), ) -> Result<u64, Error>

Visit a half-open range, never holding a borrowed entry across await.

pub async fn scan_range_until<B>( &mut self, start: &[u8], end: Option<&[u8]>, visit: impl for<'entry> FnMut(EntryRef<'entry>) -> ControlFlow<B>, ) -> Result<ScanOutcome<B>, Error>

pub async fn scan_prefix( &mut self, prefix: &[u8], visit: impl for<'entry> FnMut(EntryRef<'entry>), ) -> Result<u64, Error>

Visit every key under a prefix without allocating entries.

pub async fn scan_prefix_until<B>( &mut self, prefix: &[u8], visit: impl for<'entry> FnMut(EntryRef<'entry>) -> ControlFlow<B>, ) -> Result<ScanOutcome<B>, Error>

pub async fn scan_range_reverse( &mut self, start: &[u8], end: Option<&[u8]>, visit: impl for<'entry> FnMut(EntryRef<'entry>), ) -> Result<u64, Error>

pub async fn scan_range_reverse_until<B>( &mut self, start: &[u8], end: Option<&[u8]>, visit: impl for<'entry> FnMut(EntryRef<'entry>) -> ControlFlow<B>, ) -> Result<ScanOutcome<B>, Error>

pub async fn scan_prefix_reverse( &mut self, prefix: &[u8], visit: impl for<'entry> FnMut(EntryRef<'entry>), ) -> Result<u64, Error>

pub async fn scan_prefix_reverse_until<B>( &mut self, prefix: &[u8], visit: impl for<'entry> FnMut(EntryRef<'entry>) -> ControlFlow<B>, ) -> Result<ScanOutcome<B>, Error>