Struct sstable::TableIterator

pub struct TableIterator { /* fields omitted */ }

This iterator is a "TwoLevelIterator"; it uses an index block in order to get an offset hint into the data blocks.

Trait Implementations

impl SSIterator for TableIterator

fn advance(&mut self) -> bool

Advances the position of the iterator by one element (which can be retrieved using current(). If no more elements are available, advance() returns false, and the iterator becomes invalid (i.e. as if reset() had been called).

fn seek(&mut self, to: &[u8])

Seek the iterator to key or the next bigger key. If the seek is invalid (past last element, or before first element), the iterator is reset() and not valid.

fn prev(&mut self) -> bool

Go to the previous item; if the iterator is moved beyond the first element, prev() returns false and it will be !valid(). This is inefficient for most iterator implementations.

fn reset(&mut self)

Resets the iterator to be !valid(), i.e. positioned before the first element.

fn valid(&self) -> bool

Returns true if the iterator is not positioned before the first or after the last element, i.e. if current() would succeed.

fn current(&self, key: &mut Vec<u8>, val: &mut Vec<u8>) -> bool

Return the current item (i.e. the item most recently returned by next()).

fn next(&mut self) -> Option<(Vec<u8>, Vec<u8>)>

next is like Iterator::next(). It's implemented here because Rust disallows implementing a foreign trait for any type, thus we can't do impl<T: SSIterator> Iterator<Item=Vec<u8>> for T {}.

fn seek_to_first(&mut self)

seek_to_first seeks to the first element.