Struct trie_db::TrieDBRawIterator

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

Iterator for going through all nodes in the trie in pre-order traversal order.

Implementations

impl<L: TrieLayout> TrieDBRawIterator<L>

pub fn empty() -> Self

Create a new empty iterator.

pub fn new(db: &TrieDB<'_, '_, L>) -> Result<Self, TrieHash<L>, CError<L>>

Create a new iterator.

pub fn new_prefixed( db: &TrieDB<'_, '_, L>, prefix: &[u8] ) -> Result<Self, TrieHash<L>, CError<L>>

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<Self, TrieHash<L>, CError<L>>

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<TrieItem<TrieHash<L>, CError<L>>>

Fetches the next trie item.

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

pub fn prev_item( &mut self, db: &TrieDB<'_, '_, L> ) -> Option<TrieItem<TrieHash<L>, CError<L>>>

Fetches the previous 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<TrieKeyItem<TrieHash<L>, CError<L>>>

Fetches the next key.

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

pub fn prev_key( &mut self, db: &TrieDB<'_, '_, L> ) -> Option<TrieKeyItem<TrieHash<L>, CError<L>>>

Fetches the previous key.

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