Trait OrderedScan 

pub trait OrderedScan: Sealed + Copy {
    type Key: Key;
    type Row;
    type Iter: Iterator<Item = Self::Row>;
    type KeyIter: Iterator<Item = Self::Key>;

    // Required methods
    fn scan(
        self,
        start: Bound<Self::Key>,
        end: Bound<Self::Key>,
        dir: Dir,
    ) -> Self::Iter;
    fn scan_keys(
        self,
        start: Bound<Self::Key>,
        end: Bound<Self::Key>,
        dir: Dir,
    ) -> Self::KeyIter;
    fn peek_row_key(row: &Self::Row) -> Self::Key;
}

Ordered, direction-aware scan seam. Implemented only on TreeScan / MapScan — never on collection types directly — so a non-iterable Map cannot obtain a value of this trait.

Required Associated Types

type Key: Key

type Row

type Iter: Iterator<Item = Self::Row>

type KeyIter: Iterator<Item = Self::Key>

Required Methods

fn scan( self, start: Bound<Self::Key>, end: Bound<Self::Key>, 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<Self::Key>, end: Bound<Self::Key>, dir: Dir, ) -> Self::KeyIter

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

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

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementors

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>

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>

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>

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>

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>

impl<'a, K: Key, H: WriteHook<K>> OrderedScan for TreeScan<&'a VarTree<K, H>>

type Key = K

type Row = (K, ByteView)

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

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

impl<'a, K: Key, T: Send + Sync, C: Codec<T> + Clone, H: TypedWriteHook<K, T>> OrderedScan for TreeScan<&'a VarTypedTree<K, T, C, H>>

type Key = K

type Row = (K, T)

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

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

impl<'a, K: Key, T: Send + Sync, C: Codec<T> + Sync, H: TypedWriteHook<K, T>> OrderedScan for TreeScan<&'a TypedTree<K, T, C, H>>

type Key = K

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

type Iter = TreeRowIter<'a, K, T>

type KeyIter = TreeKeyIter<'a, K, T>

impl<'a, K: Key, const V: usize, H: WriteHook<K>, D: Durability> OrderedScan for TreeScan<&'a ConstTree<K, V, H, D>>

type Key = K

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

type Iter = ConstTreeRowIter<'a, K, V, <D as Durability>::Loc>

type KeyIter = ConstTreeKeyIter<'a, K, V, <D as Durability>::Loc>

impl<'a, K: Key, const V: usize, T: Copy + IntoBytes + FromBytes + Immutable, H: TypedWriteHook<K, T>, D: Durability> OrderedScan for TreeScan<&'a ZeroTree<K, V, T, H, D>>

type Key = K

type Row = (K, T)

type Iter = ZeroTreeRowIter<'a, K, V, T, <D as Durability>::Loc>

type KeyIter = ZeroTreeKeyIter<'a, K, V, <D as Durability>::Loc>