Trait reference_trie::TrieIterator

pub trait TrieIterator<L>: Iterator where
    L: TrieLayout, {
    fn seek(
        &mut self, 
        key: &[u8]
    ) -> Result<(), Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>>>;
}

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

Required methods

fn seek(
    &mut self,
    key: &[u8]
) -> Result<(), Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>>>

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

Loading content...

Implementations on Foreign Types

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

fn seek(
    &mut self,
    key: &[u8]
) -> Result<(), Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>>>

Loading content...

Implementors

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

fn seek(
    &mut self,
    key: &[u8]
) -> Result<(), Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>>>

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

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

fn seek(
    &mut self,
    key: &[u8]
) -> Result<(), Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>>>

Loading content...