Trait tetsy_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

Loading content...

Implementors

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

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

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

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

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

impl<'db, L> TrieIterator<L> for FatDBIterator<'db, L> where
    L: TrieLayout, 

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

Loading content...