Struct differential_dataflow::trace::layers::hashed::HashedCursor

pub struct HashedCursor<L: Trie> {
    pub child: L::Cursor,
    // some fields omitted
}

A cursor with a child cursor that is updated as we move.

Fields

child: L::Cursor

A cursor for the layer below this one.

Trait Implementations

impl<L: Debug + Trie> Debug for HashedCursor<L> where     L::Cursor: Debug,

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

Formats the value using the given formatter.

impl<K: HashOrdered, L: Trie> Cursor<HashedLayer<K, L>> for HashedCursor<L>

type Key = K

The type revealed by the cursor.

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

Reveals the current key.

fn step(&mut self, storage: &HashedLayer<K, L>)

Advances the cursor by one element.

fn seek(&mut self, storage: &HashedLayer<K, L>, key: &Self::Key)

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

fn valid(&self, _storage: &HashedLayer<K, L>) -> bool

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

fn rewind(&mut self, storage: &HashedLayer<K, L>)

Rewinds the cursor to its initial state.

fn reposition(     &mut self,     storage: &HashedLayer<K, L>,     lower: usize,     upper: usize )

Repositions the cursor to a different range of values.