bm
Binary merkle tree implementation with garbage collection support.
Basic Usage
use Sha256;
use Digest;
use MerkleVec;
type InMemory = InMemoryMerkleDB;
let mut db = default;
let mut vec = create;
for i in 0..100
vec.drop;
Binary merkle tree implementation with garbage collection support.
use sha2::Sha256;
use digest::Digest;
use bm::MerkleVec;
type InMemory = bm::InMemoryMerkleDB<Sha256, Vec<u8>>;
let mut db = InMemory::default();
let mut vec = MerkleVec::<InMemory>::create(&mut db);
for i in 0..100 {
vec.push(&mut db, vec![i as u8]);
}
vec.drop(&mut db);