Struct sp_trie::TrieDBRawIterator

pub struct TrieDBRawIterator<L>where
    L: TrieLayout,{ /* private fields */ }

Various re-exports from the trie-db crate. Iterator for going through all nodes in the trie in pre-order traversal order.

Implementations

impl<L> TrieDBRawIterator<L>where L: TrieLayout,

pub fn empty() -> TrieDBRawIterator<L>

Create a new empty iterator.

pub fn new( db: &TrieDB<'_, '_, L> ) -> Result<TrieDBRawIterator<L>, Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>>>

Create a new iterator.

pub fn new_prefixed( db: &TrieDB<'_, '_, L>, prefix: &[u8] ) -> Result<TrieDBRawIterator<L>, Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>>>

Create a new iterator, but limited to a given prefix.

pub fn new_prefixed_then_seek( db: &TrieDB<'_, '_, L>, prefix: &[u8], start_at: &[u8] ) -> Result<TrieDBRawIterator<L>, Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>>>

Create a new iterator, but limited to a given prefix. It then do a seek operation from prefixed context (using seek lose prefix context by default).

pub fn next_item( &mut self, db: &TrieDB<'_, '_, L> ) -> Option<Result<(Vec<u8>, Vec<u8>), Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>>>>

Fetches the next trie item.

Must be called with the same db as when the iterator was created.

pub fn next_key( &mut self, db: &TrieDB<'_, '_, L> ) -> Option<Result<Vec<u8>, Box<TrieError<<<L as TrieLayout>::Hash as Hasher>::Out, <<L as TrieLayout>::Codec as NodeCodec>::Error>>>>

Fetches the next key.

Must be called with the same db as when the iterator was created.