pub fn traverse<V: Visitor>(state: &ReplicatedState, mut v: V) -> V::Output {
    let t = LazyTree::from(state);
    match traverse_lazy_tree(&t, &mut v) {
        Err(output) => output,
        _ => v.finish(),
    }
}
/// Traverses `state` as if it was a state in canonical form using visitor `v`.
///
/// By supplying different visitors, one can use `traverse` to serialize the
/// `state` for transmitting it over the network to another replica, compute a
/// hash tree for certification or extract a specific value.
Traverses `state` as if it was a state in canonical form using visitor `v`.
By supplying different visitors, one can use `traverse` to serialize the
`state` for transmitting it over the network to another replica, compute a
hash tree for certification or extract a specific value.
Traverses ` state ` as if it was a state in canonical form using visitor ` v ` . By supplying different visitors one can use ` traverse ` to serialize the ` state ` for transmitting it over the network to another replica compute a hash tree for certification or extract a specific value .
pub fn traverse<V: Visitor>(state: &ReplicatedState, mut v: V) -> V::Output {
    let t = LazyTree::from(state);
    match traverse_lazy_tree(&t, &mut v) {
        Err(output) => output,
        _ => v.finish(),
    }
}
pub fn traverse < V : Visitor > ( state : & ReplicatedState , mut v : V ) -> V :: Output { let t = LazyTree :: from ( state ) ; match traverse_lazy_tree ( & t , & mut v ) { Err ( output ) => output , _ => v . finish ( ) , } }
Traverses `state` as if it was a state in canonical form using visitor `v`.
Traverses ` state ` as if it was a state in canonical form using visitor ` v ` .
state
&ReplicatedState
v
V
state
&ReplicatedState
v
V