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

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

Required methods

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

Implementors