Struct differential_dataflow::trace::layers::ordered_leaf::OrderedLeafCursor
[−]
[src]
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 Debug for OrderedLeafCursor
[src]
impl<K: Clone, R: Clone> Cursor<OrderedLeaf<K, R>> for OrderedLeafCursor
[src]
type Key = (K, R)
The type revealed by the cursor.
fn key<'a>(&self, storage: &'a OrderedLeaf<K, R>) -> &'a Self::Key
[src]
Reveals the current key.
fn step(&mut self, storage: &OrderedLeaf<K, R>)
[src]
Advances the cursor by one element.
fn seek(&mut self, _storage: &OrderedLeaf<K, R>, _key: &Self::Key)
[src]
Advances the cursor until the location where key
would be expected.
fn valid(&self, _storage: &OrderedLeaf<K, R>) -> bool
[src]
Returns true
if the cursor points at valid data. Returns false
if the cursor is exhausted.
fn rewind(&mut self, _storage: &OrderedLeaf<K, R>)
[src]
Rewinds the cursor to its initial state.
fn reposition(
&mut self,
_storage: &OrderedLeaf<K, R>,
lower: usize,
upper: usize
)
[src]
&mut self,
_storage: &OrderedLeaf<K, R>,
lower: usize,
upper: usize
)
Repositions the cursor to a different range of values.