Struct MapScan 

pub struct MapScan<V> { /* private fields */ }

Opaque Map scan view. No public constructor. V is typically &'a S: ShardSource.

Trait Implementations

impl<'a, K: Key + Send + Sync + Hash + Eq, T: Send + Sync, C: Codec<T> + Sync, H: TypedWriteHook<K, T>> BulkScan for MapScan<&'a TypedMap<K, T, C, H>>

type TryKeys = InfallibleKeys<K, MapKeyIter<'a, K, T, C, H>>

Strict key iterator for a bounded bulk pass.

fn try_keys(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::TryKeys

Walk keys in the supplied bounds and direction through the strict path.

fn delete_key(&self, key: &K) -> DbResult<bool>

Delete one key through the collection’s ordinary non-transactional write path, returning whether that key was actually removed.

fn reject_nontx_bulk(&self) -> DbResult<()>

Refuse a non-transactional bulk mutation before it scans or deletes a row when this source requires transactional stream or claim handling.

impl<'a, K: Key + Send + Sync + Hash + Eq, const V: usize, H: WriteHook<K>, D: Durability> BulkScan for MapScan<&'a ConstMap<K, V, H, D>>

type TryKeys = InfallibleKeys<K, ConstMapKeyIter<'a, K, V, H, D>>

Strict key iterator for a bounded bulk pass.

fn try_keys(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::TryKeys

Walk keys in the supplied bounds and direction through the strict path.

fn delete_key(&self, key: &K) -> DbResult<bool>

Delete one key through the collection’s ordinary non-transactional write path, returning whether that key was actually removed.

fn reject_nontx_bulk(&self) -> DbResult<()>

Refuse a non-transactional bulk mutation before it scans or deletes a row when this source requires transactional stream or claim handling.

impl<'a, K: Key + Send + Sync + Hash + Eq, const V: usize, T: Copy + IntoBytes + FromBytes + Immutable, H: TypedWriteHook<K, T>, D: Durability> BulkScan for MapScan<&'a ZeroMap<K, V, T, H, D>>

type TryKeys = InfallibleKeys<K, ZeroMapKeyIter<'a, K, V, T, H, D>>

Strict key iterator for a bounded bulk pass.

fn try_keys(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::TryKeys

Walk keys in the supplied bounds and direction through the strict path.

fn delete_key(&self, key: &K) -> DbResult<bool>

Delete one key through the collection’s ordinary non-transactional write path, returning whether that key was actually removed.

fn reject_nontx_bulk(&self) -> DbResult<()>

Refuse a non-transactional bulk mutation before it scans or deletes a row when this source requires transactional stream or claim handling.

impl<'a, K: Key + Send + Sync + Hash + Eq, H: WriteHook<K>> BulkScan for MapScan<&'a VarMap<K, H>>

type TryKeys = InfallibleKeys<K, VarMapKeyIter<'a, K, H>>

Strict key iterator for a bounded bulk pass.

fn try_keys(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::TryKeys

Walk keys in the supplied bounds and direction through the strict path.

fn delete_key(&self, key: &K) -> DbResult<bool>

Delete one key through the collection’s ordinary non-transactional write path, returning whether that key was actually removed.

fn reject_nontx_bulk(&self) -> DbResult<()>

Refuse a non-transactional bulk mutation before it scans or deletes a row when this source requires transactional stream or claim handling.

impl<'a, K: Key + Send + Sync + Hash + Eq, T: Send + Sync, C: Codec<T> + Clone + Sync, H: TypedWriteHook<K, T>> BulkScan for MapScan<&'a VarTypedMap<K, T, C, H>>

type TryKeys = InfallibleKeys<K, VarTypedMapKeyIter<'a, K, T, C, H>>

Strict key iterator for a bounded bulk pass.

fn try_keys(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::TryKeys

Walk keys in the supplied bounds and direction through the strict path.

fn delete_key(&self, key: &K) -> DbResult<bool>

Delete one key through the collection’s ordinary non-transactional write path, returning whether that key was actually removed.

fn reject_nontx_bulk(&self) -> DbResult<()>

Refuse a non-transactional bulk mutation before it scans or deletes a row when this source requires transactional stream or claim handling.

impl<V: Clone> Clone for MapScan<V>

fn clone(&self) -> MapScan<V>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<V: Copy> Copy for MapScan<V>

impl<V> Debug for MapScan<V>

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

Formats the value using the given formatter.

impl<'a, K: Key + Send + Sync + Hash + Eq, T: Send + Sync, C: Codec<T> + Sync, H: TypedWriteHook<K, T>> OrderedScan for MapScan<&'a TypedMap<K, T, C, H>>

type Key = K

type Row = (K, TypedRef<'a, T>)

type Iter = MapRowIter<'a, K, T, C, H>

type KeyIter = MapKeyIter<'a, K, T, C, H>

fn scan(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::Iter

Takes self by value (TreeScan/MapScan are Copy) so the returned iterator is not tied to a temporary &Self borrow — required for Scope::iter(self) fluent chains under a generic S: OrderedScan.

fn scan_keys(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::KeyIter

fn peek_row_key(row: &Self::Row) -> K

Key of row without consuming it — used by pagination before handing the row to a closure.

impl<'a, K: Key + Send + Sync + Hash + Eq, const V: usize, H: WriteHook<K>, D: Durability> OrderedScan for MapScan<&'a ConstMap<K, V, H, D>>

type Key = K

type Row = (K, [u8; V])

type Iter = ConstMapRowIter<'a, K, V, H, D>

type KeyIter = ConstMapKeyIter<'a, K, V, H, D>

fn scan(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::Iter

Takes self by value (TreeScan/MapScan are Copy) so the returned iterator is not tied to a temporary &Self borrow — required for Scope::iter(self) fluent chains under a generic S: OrderedScan.

fn scan_keys(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::KeyIter

fn peek_row_key(row: &Self::Row) -> K

Key of row without consuming it — used by pagination before handing the row to a closure.

impl<'a, K: Key + Send + Sync + Hash + Eq, const V: usize, T: Copy + IntoBytes + FromBytes + Immutable, H: TypedWriteHook<K, T>, D: Durability> OrderedScan for MapScan<&'a ZeroMap<K, V, T, H, D>>

type Key = K

type Row = (K, T)

type Iter = ZeroMapRowIter<'a, K, V, T, H, D>

type KeyIter = ZeroMapKeyIter<'a, K, V, T, H, D>

fn scan(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::Iter

Takes self by value (TreeScan/MapScan are Copy) so the returned iterator is not tied to a temporary &Self borrow — required for Scope::iter(self) fluent chains under a generic S: OrderedScan.

fn scan_keys(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::KeyIter

fn peek_row_key(row: &Self::Row) -> K

Key of row without consuming it — used by pagination before handing the row to a closure.

impl<'a, K: Key + Send + Sync + Hash + Eq, H: WriteHook<K>> OrderedScan for MapScan<&'a VarMap<K, H>>

type Key = K

type Row = (K, ByteView)

type Iter = VarMapRowIter<'a, K, H>

type KeyIter = VarMapKeyIter<'a, K, H>

fn scan(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::Iter

Takes self by value (TreeScan/MapScan are Copy) so the returned iterator is not tied to a temporary &Self borrow — required for Scope::iter(self) fluent chains under a generic S: OrderedScan.

fn scan_keys(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::KeyIter

fn peek_row_key(row: &Self::Row) -> K

Key of row without consuming it — used by pagination before handing the row to a closure.

impl<'a, K: Key + Send + Sync + Hash + Eq, T: Send + Sync, C: Codec<T> + Clone + Sync, H: TypedWriteHook<K, T>> OrderedScan for MapScan<&'a VarTypedMap<K, T, C, H>>

type Key = K

type Row = (K, T)

type Iter = VarTypedMapRowIter<'a, K, T, C, H>

type KeyIter = VarTypedMapKeyIter<'a, K, T, C, H>

fn scan(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::Iter

Takes self by value (TreeScan/MapScan are Copy) so the returned iterator is not tied to a temporary &Self borrow — required for Scope::iter(self) fluent chains under a generic S: OrderedScan.

fn scan_keys(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::KeyIter

fn peek_row_key(row: &Self::Row) -> K

Key of row without consuming it — used by pagination before handing the row to a closure.

impl<K: Key + Send + Sync + Hash + Eq, T: Clone + Send + Sync, C: Codec<T> + Sync, H: TypedWriteHook<K, T>> OwnedRows for MapScan<&TypedMap<K, T, C, H>>

type Val = T

fn own(row: Self::Row) -> (Self::Key, Self::Val)

impl<K: Key + Send + Sync + Hash + Eq, const V: usize, H: WriteHook<K>, D: Durability> OwnedRows for MapScan<&ConstMap<K, V, H, D>>

type Val = [u8; V]

fn own(row: Self::Row) -> (Self::Key, Self::Val)

impl<K: Key + Send + Sync + Hash + Eq, const V: usize, T: Copy + IntoBytes + FromBytes + Immutable, H: TypedWriteHook<K, T>, D: Durability> OwnedRows for MapScan<&ZeroMap<K, V, T, H, D>>

type Val = T

fn own(row: Self::Row) -> (Self::Key, Self::Val)

impl<K: Key + Send + Sync + Hash + Eq, H: WriteHook<K>> OwnedRows for MapScan<&VarMap<K, H>>

type Val = ByteView

fn own(row: Self::Row) -> (Self::Key, Self::Val)

impl<K: Key + Send + Sync + Hash + Eq, T: Send + Sync, C: Codec<T> + Clone + Sync, H: TypedWriteHook<K, T>> OwnedRows for MapScan<&VarTypedMap<K, T, C, H>>

type Val = T

fn own(row: Self::Row) -> (Self::Key, Self::Val)

impl<'a, K: Key + Send + Sync + Hash + Eq, T: Clone + PartialEq + Send + Sync, C: Codec<T> + Sync, H: TypedWriteHook<K, T>> StrictRows for MapScan<&'a TypedMap<K, T, C, H>>

type TryRows = InfallibleRows<K, T, OwnedRowsIter<MapScan<&'a TypedMap<K, T, C, H>>, MapRowIter<'a, K, T, C, H>>>

Strict, owned key/value iterator for a bounded retention pass.

fn try_rows(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::TryRows

Walk strict owned rows in the supplied bounds and direction.

fn delete_if_unchanged(&self, key: &K, expected: &T) -> DbResult<bool>

Delete key only when it still stores expected.

impl<'a, K: Key + Send + Sync + Hash + Eq, const V: usize, H: WriteHook<K>, D: Durability> StrictRows for MapScan<&'a ConstMap<K, V, H, D>>

type TryRows = InfallibleRows<K, [u8; V], ConstMapRowIter<'a, K, V, H, D>>

Strict, owned key/value iterator for a bounded retention pass.

fn try_rows(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::TryRows

Walk strict owned rows in the supplied bounds and direction.

fn delete_if_unchanged(&self, key: &K, expected: &[u8; V]) -> DbResult<bool>

Delete key only when it still stores expected.

impl<'a, K: Key + Send + Sync + Hash + Eq, const V: usize, T: Copy + IntoBytes + FromBytes + Immutable, H: TypedWriteHook<K, T>, D: Durability> StrictRows for MapScan<&'a ZeroMap<K, V, T, H, D>>

type TryRows = InfallibleRows<K, T, ZeroMapRowIter<'a, K, V, T, H, D>>

Strict, owned key/value iterator for a bounded retention pass.

fn try_rows(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::TryRows

Walk strict owned rows in the supplied bounds and direction.

fn delete_if_unchanged(&self, key: &K, expected: &T) -> DbResult<bool>

Delete key only when it still stores expected.

impl<'a, K: Key + Send + Sync + Hash + Eq, H: WriteHook<K>> StrictRows for MapScan<&'a VarMap<K, H>>

type TryRows = VarMapTryIter<'a, K, H>

Strict, owned key/value iterator for a bounded retention pass.

fn try_rows(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::TryRows

Walk strict owned rows in the supplied bounds and direction.

fn delete_if_unchanged(&self, key: &K, expected: &ByteView) -> DbResult<bool>

Delete key only when it still stores expected.

impl<'a, K: Key + Send + Sync + Hash + Eq, T: Send + Sync, C: Codec<T> + Clone + Sync, H: TypedWriteHook<K, T>> StrictRows for MapScan<&'a VarTypedMap<K, T, C, H>>

type TryRows = VarTypedMapTryIter<'a, K, T, C, H>

Strict, owned key/value iterator for a bounded retention pass.

fn try_rows(self, start: Bound<K>, end: Bound<K>, dir: Dir) -> Self::TryRows

Walk strict owned rows in the supplied bounds and direction.

fn delete_if_unchanged(&self, key: &K, expected: &T) -> DbResult<bool>

Delete key only when it still stores expected.