Trait TrieIterator

pub trait TrieIterator<L: TrieLayout>: Iterator {
    // Required method
    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, 'cache, L: TrieLayout> TrieIterator<L> for TrieDBNodeDoubleEndedIterator<'a, 'cache, L>

impl<'a, 'cache, L: TrieLayout> TrieIterator<L> for TrieDBNodeIterator<'a, 'cache, L>

impl<'a, 'cache, L: TrieLayout> TrieIterator<L> for TrieDBDoubleEndedIterator<'a, 'cache, L>

impl<'a, 'cache, L: TrieLayout> TrieIterator<L> for TrieDBIterator<'a, 'cache, L>

impl<'a, 'cache, L: TrieLayout> TrieIterator<L> for TrieDBKeyDoubleEndedIterator<'a, 'cache, L>

impl<'a, 'cache, L: TrieLayout> TrieIterator<L> for TrieDBKeyIterator<'a, 'cache, L>

impl<'db, 'cache, L> TrieIterator<L> for FatDBIterator<'db, 'cache, L>

where L: TrieLayout,