feat(BonsaiStorage): added new methods for retrieving key-value pairs…

… and change id for `BonsaiStorage` (#25)

* test(insert): added tests for insertions into `BonsaiStorage` without skiping first 5 bites

* test(keys): updated key retrieval test

* feat(key-value): added function `get_key_value_pairs`

Also updated `get_keys` to filter out non-leaf nodes + remove the length byte at index 0 when returning
keys.

> Please note that this currently poses problems with the implementation of `HashMapDb`, due to it not
differenciating leaf nodes from branch nodes. This will have to be fixed at a later date.

* feat(id): added `get_latest_id`

* fix(clippy): code now uses `filter_map` and fixed clippy errors

---------

Co-authored-by: Timothée Delabrouille <[email protected]>

Cargo.toml

@@ -46,6 +46,8 @@ pathfinder-storage = { git = "https://github.com/massalabs/pathfinder.git", pack
 rand = "0.8.5"
 tempfile = "3.8.0"
 rstest = "0.18.2"
+test-log = "0.2.15"
+indexmap = "2.2.6"
 criterion = "0.5.1"
 
 [[bench]]

src/key_value_db.rs

@@ -171,6 +171,10 @@ where
         Ok(self.db.get(&key.into())?)
     }
 
+    pub(crate) fn get_latest_id(&self) -> Option<ID> {
+        self.changes_store.id_queue.back().cloned()
+    }
+
     pub(crate) fn contains(
         &self,
         key: &TrieKey,

src/lib.rs

@@ -411,6 +411,20 @@ where
         self.tries.get_keys(identifier)
     }
 
+    /// Get all the key-value pairs in a specific trie.
+    #[allow(clippy::type_complexity)]
+    pub fn get_key_value_pairs(
+        &self,
+        identifier: &[u8],
+    ) -> Result<Vec<(Vec<u8>, Vec<u8>)>, BonsaiStorageError<DB::DatabaseError>> {
+        self.tries.get_key_value_pairs(identifier)
+    }
+
+    /// Get the id from the latest commit, or `None` if no commit has taken place yet.
+    pub fn get_latest_id(&self) -> Option<ChangeID> {
+        self.tries.db_ref().get_latest_id()
+    }
+
     /// Verifies a merkle-proof for a given `key` and `value`.
     pub fn verify_proof(
         root: Felt,