Struct trie_db::TrieDBRawIterator

source ·
pub struct TrieDBRawIterator<L: TrieLayout> { /* private fields */ }
Expand description

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

Implementations§

source§

impl<L: TrieLayout> TrieDBRawIterator<L>

source

pub fn empty() -> Self

Create a new empty iterator.

source

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

Create a new iterator.

source

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.

source

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).

source

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.

source

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.

source

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.

source

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.

Auto Trait Implementations§

§

impl<L> Freeze for TrieDBRawIterator<L>

§

impl<L> RefUnwindSafe for TrieDBRawIterator<L>
where <<L as TrieLayout>::Hash as Hasher>::Out: RefUnwindSafe,

§

impl<L> Send for TrieDBRawIterator<L>

§

impl<L> Sync for TrieDBRawIterator<L>

§

impl<L> Unpin for TrieDBRawIterator<L>
where <<L as TrieLayout>::Hash as Hasher>::Out: Unpin,

§

impl<L> UnwindSafe for TrieDBRawIterator<L>
where <<L as TrieLayout>::Hash as Hasher>::Out: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.