Struct differential_dataflow::trace::layers::ordered_leaf::OrderedLeafCursor

pub struct OrderedLeafCursor { /* fields omitted */ }

A cursor for walking through an unordered sequence of values.

This cursor does not support seek, though I'm not certain how to expose this.

Trait Implementations

impl<K: Clone, R: Clone> Cursor<OrderedLeaf<K, R>> for OrderedLeafCursor

type Key = (K, R)

The type revealed by the cursor.

fn key<'a>(&self, storage: &'a OrderedLeaf<K, R>) -> &'a Self::Key

Reveals the current key.

fn step(&mut self, storage: &OrderedLeaf<K, R>)

Advances the cursor by one element.

fn seek(&mut self, _storage: &OrderedLeaf<K, R>, _key: &Self::Key)

Advances the cursor until the location where key would be expected.

fn valid(&self, _storage: &OrderedLeaf<K, R>) -> bool

Returns true if the cursor points at valid data. Returns false if the cursor is exhausted.

fn rewind(&mut self, _storage: &OrderedLeaf<K, R>)

Rewinds the cursor to its initial state.

fn reposition(
    &mut self,
    _storage: &OrderedLeaf<K, R>,
    lower: usize,
    upper: usize
)

Repositions the cursor to a different range of values.

impl Debug for OrderedLeafCursor

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

Formats the value using the given formatter.