pub fn create_hashed_empty_trie<K: ToBytes, V: ToBytes>(
    ) -> Result<(Digest, Trie<K, V>), bytesrepr::Error> {
        let root: Trie<K, V> = Trie::Node {
            pointer_block: Default::default(),
        };
        let root_bytes: Vec<u8> = root.to_bytes()?;
        Ok((Digest::hash(&root_bytes), root))
    }
/// Creates a tuple containing an empty root hash and an empty root (a node
/// with an empty pointer block)
Creates a tuple containing an empty root hash and an empty root (a node
with an empty pointer block)
Creates a tuple containing an empty root hash and an empty root ( a node with an empty pointer block )
pub fn create_hashed_empty_trie<K: ToBytes, V: ToBytes>(
    ) -> Result<(Digest, Trie<K, V>), bytesrepr::Error> {
        let root: Trie<K, V> = Trie::Node {
            pointer_block: Default::default(),
        };
        let root_bytes: Vec<u8> = root.to_bytes()?;
        Ok((Digest::hash(&root_bytes), root))
    }
pub fn create_hashed_empty_trie < K : ToBytes , V : ToBytes > ( ) -> Result < ( Digest , Trie < K , V > ) , bytesrepr :: Error > { let root : Trie < K , V > = Trie :: Node { pointer_block : Default :: default ( ) , } ; let root_bytes : Vec < u8 > = root . to_bytes ( ) ? ; Ok ( ( Digest :: hash ( & root_bytes ) , root ) ) }
Creates a tuple containing an empty root hash and an empty root (a node
with an empty pointer block)
Creates a tuple containing an empty root hash and an empty root ( a node with an empty pointer block )