Struct Walker 

pub struct Walker { /* private fields */ }

Traverser of an atproto MST

Walks the tree from left-to-right in depth-first order

Implementations

impl Walker

pub fn new(tree_root_cid: Cid) -> Self

pub fn step<T: Clone, E: Error>( &mut self, blocks: &mut HashMap<Cid, MaybeProcessedBlock<T, E>>, process: impl Fn(&[u8]) -> Result<T, E>, ) -> Result<Step<T>, Trip<E>>

Advance through nodes until we find a record or can’t go further

Trait Implementations

impl Debug for Walker

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.