test: add integration test for Memory_Sha case

Cargo.toml

@@ -3,4 +3,5 @@ name = "pmtree"
 version = "0.1.0"
 edition = "2021"
 
-[dependencies]
+[dev-dependencies]
+sha2 = "0.10.6"

src/tree.rs

@@ -11,7 +11,7 @@ const NEXT_INDEX_KEY: DBKey = usize::MAX.to_be_bytes();
 #[derive(Clone, Copy)]
 struct Key(usize, usize);
 impl From<Key> for DBKey {
-    fn from(key: Key) -> DBKey {
+    fn from(key: Key) -> Self {
         let cantor_pairing = (key.0 + key.1) * (key.0 + key.1 + 1) / 2 + key.1;
         cantor_pairing.to_be_bytes()
     }
@@ -122,7 +122,7 @@ where
         self.set(key, H::default_leaf());
     }
 
-    /// Sets a leaf at the specified tree index
+    // Sets a leaf at the specified tree index
     fn set(&mut self, key: usize, leaf: H::Fr) {
         self.db.put(Key(self.depth, key).into(), leaf.into());
         self.recalculate_from(key);

tests/memory_sha.rs

@@ -0,0 +1,98 @@
+use pmtree::*;
+use sha2::Sha256;
+use std::collections::HashMap;
+
+pub struct MemoryDB(HashMap<DBKey, Value>);
+pub struct MySha(Sha256);
+
+#[derive(Clone, Copy, Debug, Default, PartialEq, Eq)]
+pub struct MyFr([u8; 32]);
+
+impl Database for MemoryDB {
+    fn new(dbpath: &str) -> Self {
+        todo!()
+    }
+
+    fn load(dbpath: &str) -> Self {
+        todo!()
+    }
+
+    fn get(&self, key: DBKey) -> Option<Value> {
+        todo!()
+    }
+
+    fn put(&mut self, key: DBKey, value: Value) {
+        todo!()
+    }
+
+    fn delete(&mut self, key: DBKey) {
+        todo!()
+    }
+}
+
+impl From<Vec<u8>> for MyFr {
+    fn from(v: Vec<u8>) -> Self {
+        todo!()
+    }
+}
+
+impl From<MyFr> for Vec<u8> {
+    fn from(v: MyFr) -> Self {
+        todo!()
+    }
+}
+
+impl Hasher for MySha {
+    type Fr = MyFr;
+
+    fn new() -> Self {
+        todo!()
+    }
+
+    fn default_leaf() -> Self::Fr {
+        todo!()
+    }
+
+    fn hash(input: &[Self::Fr]) -> Self::Fr {
+        todo!()
+    }
+}
+
+#[test]
+fn insert_delete() {
+    let mut merkle_tree = MerkleTree::<MemoryDB, MySha>::new(3, "memory");
+    assert_eq!(merkle_tree.depth(), 3);
+    assert_eq!(merkle_tree.capacity(), 8);
+    assert_eq!(merkle_tree.leaves_set(), 0);
+    // assert_eq!(merkle_tree.root(), MyFr([10; 32]));
+
+    merkle_tree.insert(MyFr([5; 32]));
+    // assert_eq!(merkle_tree.root(), MyFr([10; 32]));
+    assert_eq!(merkle_tree.leaves_set(), 1);
+
+    merkle_tree.insert(MyFr([5; 32]));
+    // assert_eq!(merkle_tree.root(), MyFr([10; 32]));
+    assert_eq!(merkle_tree.leaves_set(), 2);
+
+    merkle_tree.insert(MyFr([5; 32]));
+    // assert_eq!(merkle_tree.root(), MyFr([10; 32]));
+    assert_eq!(merkle_tree.leaves_set(), 3);
+
+    merkle_tree.delete(1);
+    // assert_eq!(merkle_tree.root(), MyFr([10; 32]));
+    assert_eq!(merkle_tree.leaves_set(), 3);
+
+    // #[should_panic]
+    // merkle_tree.delete(3);
+
+    merkle_tree.insert(MyFr([5; 32]));
+    merkle_tree.insert(MyFr([5; 32]));
+    merkle_tree.insert(MyFr([5; 32]));
+    merkle_tree.insert(MyFr([5; 32]));
+    merkle_tree.insert(MyFr([5; 32]));
+    // assert_eq!(merkle_tree.root(), MyFr([10; 32]));
+    assert_eq!(merkle_tree.leaves_set(), 8);
+
+    // #[should_panic]
+    // merkle_tree.insert(MyFr([5; 32]));
+}