fn fork(left_tree: HashTree, right_tree: HashTree) -> HashTree {
    HashTree::Fork {
        digest: fork_digest(&left_tree.digest().0, &right_tree.digest().0),
        left_tree: Box::new(left_tree),
        right_tree: Box::new(right_tree),
    }
}
// Returns a HashTree::HashNode that contains the given subtrees.
Returns a HashTree::HashNode that contains the given subtrees.
Returns a HashTree :: HashNode that contains the given subtrees .
fn fork(left_tree: HashTree, right_tree: HashTree) -> HashTree {
    HashTree::Fork {
        digest: fork_digest(&left_tree.digest().0, &right_tree.digest().0),
        left_tree: Box::new(left_tree),
        right_tree: Box::new(right_tree),
    }
}
fn fork ( left_tree : HashTree , right_tree : HashTree ) -> HashTree { HashTree :: Fork { digest : fork_digest ( & left_tree . digest ( ) . 0 , & right_tree . digest ( ) . 0 ) , left_tree : Box :: new ( left_tree ) , right_tree : Box :: new ( right_tree ) , } }
Returns a HashTree::HashNode that contains the given subtrees.
Returns a HashTree :: HashNode that contains the given subtrees .
left_tree
HashTree
right_tree
HashTree
left_tree
HashTree
right_tree
HashTree