pub fn from_hashes(left: &Node, right: &Node) -> Self {
        let (node1, node2) = if left.index <= right.index {
            (left, right)
        } else {
            (right, left)
        };

        let size = u64_as_be((node1.length + node2.length) as u64);

        let mut hasher = Blake2b::new(32);
        hasher.update(&PARENT_TYPE);
        hasher.update(&size);
        hasher.update(node1.hash());
        hasher.update(node2.hash());

        Self {
            hash: hasher.finalize(),
        }
    }
/// Hash two `Leaf` nodes hashes together to form a `Parent` hash.
Hash two `Leaf` nodes hashes together to form a `Parent` hash.
Hash two ` Leaf ` nodes hashes together to form a ` Parent ` hash .
pub fn from_hashes(left: &Node, right: &Node) -> Self {
        let (node1, node2) = if left.index <= right.index {
            (left, right)
        } else {
            (right, left)
        };
        let size = u64_as_be((node1.length + node2.length) as u64);
        let mut hasher = Blake2b::new(32);
        hasher.update(&PARENT_TYPE);
        hasher.update(&size);
        hasher.update(node1.hash());
        hasher.update(node2.hash());
        Self {
            hash: hasher.finalize(),
        }
    }
pub fn from_hashes ( left : & Node , right : & Node ) -> Self { let ( node1 , node2 ) = if left . index <= right . index { ( left , right ) } else { ( right , left ) } ; let size = u64_as_be ( ( node1 . length + node2 . length ) as u64 ) ; let mut hasher = Blake2b :: new ( 32 ) ; hasher . update ( & PARENT_TYPE ) ; hasher . update ( & size ) ; hasher . update ( node1 . hash ( ) ) ; hasher . update ( node2 . hash ( ) ) ; Self { hash : hasher . finalize ( ) , } }
Hash two `Leaf` nodes hashes together to form a `Parent` hash.
Hash two ` Leaf ` nodes hashes together to form a ` Parent ` hash .
left
&Node
right
&Node