build: add get_root_hash for filled tree

Cargo.toml

@@ -13,6 +13,7 @@ license = "Apache-2.0"
 license-file = "LICENSE"
 
 [workspace.dependencies]
+derive_more = "0.99.17"
 pretty_assertions = "1.2.1"
 rstest = "0.17.0"
 starknet-types-core = { version = "0.0.11", features = ["hash"] }

crates/committer/Cargo.toml

@@ -14,5 +14,5 @@ pretty_assertions.workspace = true
 rstest.workspace = true
 
 [dependencies]
+derive_more.workspace = true
 starknet-types-core.workspace = true
-derive_more = "0.99.17"

crates/committer/src/hash/types.rs

@@ -6,6 +6,7 @@ use crate::types::Felt;
 pub(crate) struct HashInputPair(pub Felt, pub Felt);
 
 #[allow(dead_code)]
+#[derive(Clone, Copy)]
 pub(crate) struct HashOutput(pub Felt);
 
 #[allow(dead_code)]

crates/committer/src/patricia_merkle_tree/errors.rs

@@ -5,5 +5,6 @@ pub(crate) enum CurrentSkeletonTreeError {}
 #[derive(Debug)]
 pub(crate) enum UpdatedSkeletonTreeError {}
 
-#[derive(Debug)]
-pub(crate) enum FilledTreeError {}
+pub(crate) enum FilledTreeError {
+    MissingRoot,
+}

crates/committer/src/patricia_merkle_tree/filled_node.rs

@@ -9,7 +9,7 @@ pub(crate) struct Nonce(pub Felt);
 #[allow(dead_code)]
 /// A node in a Patricia-Merkle tree which was modified during an update.
 pub(crate) struct FilledNode<L: LeafDataTrait> {
-    hash: HashOutput,
+    pub(crate) hash: HashOutput,
     data: NodeData<L>,
 }
 

crates/committer/src/patricia_merkle_tree/filled_tree.rs

@@ -2,10 +2,10 @@ use std::collections::HashMap;
 use std::collections::HashSet;
 use std::sync::Mutex;
 
+use crate::hash::types::HashOutput;
 use crate::patricia_merkle_tree::errors::FilledTreeError;
 use crate::patricia_merkle_tree::filled_node::FilledNode;
-use crate::patricia_merkle_tree::types::LeafDataTrait;
-use crate::patricia_merkle_tree::types::NodeIndex;
+use crate::patricia_merkle_tree::types::{LeafDataTrait, NodeIndex};
 use crate::storage::storage_trait::Storage;
 
 /// Consider a Patricia-Merkle Tree which has been updated with new leaves.
@@ -29,4 +29,11 @@ impl<L: LeafDataTrait> FilledTreeImpl<L> {
     fn get_all_nodes(&self) -> &HashMap<NodeIndex, Mutex<FilledNode<L>>> {
         &self.tree_map
     }
+
+    fn get_root_hash(&self) -> Result<HashOutput, FilledTreeError> {
+        match self.tree_map.get(&NodeIndex::root_index()) {
+            Some(root_node) => Ok(root_node.lock().expect("Lock poisoned.").hash),
+            None => Err(FilledTreeError::MissingRoot),
+        }
+    }
 }

crates/committer/src/patricia_merkle_tree/types.rs

@@ -15,7 +15,7 @@ pub(crate) trait TreeHashFunction<L: LeafDataTrait, H: HashFunction> {
 }
 
 #[allow(dead_code)]
-#[derive(Debug, Clone, Copy, PartialEq, Eq)]
+#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
 pub(crate) struct NodeIndex(pub Felt);
 
 #[allow(dead_code)]

crates/committer/src/types.rs

@@ -11,7 +11,7 @@ impl From<StarknetTypesFelt> for Felt {
 
 impl From<u128> for Felt {
     fn from(value: u128) -> Self {
-        Self(StarknetTypesFelt::from(value))
+        Self(value.into())
     }
 }