[−][src]Trait trie_db::TrieIterator

pub trait TrieIterator<L: TrieLayout>: Iterator {
    fn seek(&mut self, key: &[u8]) -> Result<(), TrieHash<L>, CError<L>>;
}
[−]

A trie iterator that also supports random access (seek()).

Required methods

fn seek(&mut self, key: &[u8]) -> Result<(), TrieHash<L>, CError<L>>[−]

Position the iterator on the first element with key >= key

Implementors

impl<'a, L: TrieLayout> TrieIterator<L> for TrieDBNodeIterator<'a, L>[src][+]

impl<'a, L: TrieLayout> TrieIterator<L> for TrieDBIterator<'a, L>[src][+]

fn seek(&mut self, key: &[u8]) -> Result<(), TrieHash<L>, CError<L>>[src][−]

Position the iterator on the first element with key >= key

impl<'db, L> TrieIterator<L> for FatDBIterator<'db, L> where
    L: TrieLayout, [src][+]