Struct ReadSession 

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

A reusable root-bound read context for one immutable tree.

The session retains the decoded root and a session-local recent leaf. It is intended to be reused by one worker; methods that update traversal state require &mut self.

Implementations

impl<'manager, 'tree, S: Store> ReadSession<'manager, 'tree, S>

pub fn tree(&self) -> &Tree

The immutable tree bound to this session.

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

Return the number of logical entries using the retained root.

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

Return whether the bound tree contains no entries.

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

Return the number of keys strictly less than key.

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

Read a value without copying it.

pub fn get_lease( &mut self, key: &[u8], ) -> Result<Option<OwnedValueLease>, Error>

Retain the packed leaf containing a value beyond this borrowed session’s next traversal. Native adapters release the returned lease after their synchronous callback completes.

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

Inspect a stored large-value envelope without copying inline bytes.

pub fn contains_key(&mut self, key: &[u8]) -> Result<bool, Error>

Check membership without copying the value.

pub 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 point-read results exactly once per input position and in order.

pub 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 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 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 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 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 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 in ascending order.

pub 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>

Visit a half-open range in ascending order with early termination.

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

Visit all entries under prefix in ascending order.

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

Visit all entries under prefix with early termination.

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

Visit a half-open range in descending order.

pub 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>

Visit a half-open range in descending order with early termination.

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

Visit a prefix in descending order.

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

Visit a prefix in descending order with early termination.