mina-tree: remove documented code

Author: dannywillems

ledger/src/mask/mask.rs

@@ -448,14 +448,6 @@ impl BaseLedger for Mask {
         let addr_length = addr.length();
         let res = self.with(|this| this.merkle_path(addr.clone()));
         assert_eq!(res.len(), addr_length);
-
-        // elog!(
-        //     "merkle_path addr={:?} path_len={:?} path={:?}",
-        //     addr,
-        //     res.len(),
-        //     res
-        // );
-
         res
     }
 

ledger/src/tree.rs

@@ -16,7 +16,6 @@ struct Leaf<T: TreeVersion> {
 #[derive(PartialEq)]
 pub struct HashesMatrix {
     /// 2 dimensions matrix
-    // matrix: Vec<Option<Fp>>,
     matrix: BTreeMap<u64, Fp>,
     empty_hashes: Vec<Option<Fp>>,
     ledger_depth: usize,
@@ -36,46 +35,16 @@ impl Clone for HashesMatrix {
 
 impl Debug for HashesMatrix {
     fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
-        // const SPACES: &[usize] = &[
-        //     0, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192,
-        // ];
-
-        // let mut s = String::with_capacity(self.matrix.len() * 2);
-        // let mut spaces = SPACES;
-        // let mut current = 0;
-        // let naccounts = 2u64.pow(self.ledger_depth as u32) as usize;
-
-        // for h in self.matrix.iter() {
-        //     let c = if h.is_some() { 'I' } else { '0' };
-        //     s.push(c);
-
-        //     if current == spaces[0] && current != naccounts {
-        //         s.push(' ');
-        //         current = 0;
-        //         spaces = &spaces[1..];
-        //     }
-
-        //     current += 1;
-        // }
-
         f.debug_struct("HashesMatrix")
-            // .field("matrix", &s)
             .field("matrix_len", &self.matrix.len())
-            // .field("real_matrix", &real)
-            // .field("empty_hashes", &self.empty_hashes)
-            // .field("ledger_depth", &self.ledger_depth)
             .field("nhashes", &self.nhashes)
-            // .field("capacity", &self.matrix.capacity())
             .finish()
     }
 }
 
 impl HashesMatrix {
     pub fn new(ledger_depth: usize) -> Self {
-        // let capacity = 2 * 2usize.pow(ledger_depth as u32) - 1;
-
         Self {
-            // matrix: vec![None; capacity],
             matrix: BTreeMap::new(),
             ledger_depth,
             empty_hashes: vec![None; ledger_depth],
@@ -85,20 +54,11 @@ impl HashesMatrix {
 
     pub fn get(&self, addr: &Address) -> Option<&Fp> {
         let linear: u64 = addr.to_linear_index();
-
-        // self.matrix.get(linear)?.as_ref()
         self.matrix.get(&linear)
     }
 
     pub fn set(&mut self, addr: &Address, hash: Fp) {
         let linear: u64 = addr.to_linear_index();
-
-        // if self.matrix.len() <= linear {
-        //     self.matrix.resize(linear + 1, None);
-        // }
-
-        // assert!(self.matrix[linear].is_none());
-        // self.matrix[linear] = Some(hash);
         let old = self.matrix.insert(linear, hash);
         assert!(old.is_none());
         self.nhashes += 1;
@@ -122,16 +82,6 @@ impl HashesMatrix {
         if old.is_some() {
             self.nhashes -= 1;
         }
-
-        // let hash = match self.matrix.get_mut(index) {
-        //     Some(hash) => hash,
-        //     None => return,
-        // };
-
-        // if hash.is_some() {
-        //     self.nhashes -= 1;
-        //     *hash = None;
-        // }
     }
 
     pub(super) fn transfert_hashes(&mut self, hashes: HashesMatrix) {
@@ -170,18 +120,12 @@ impl HashesMatrix {
 
     pub fn clear(&mut self) {
         let ledger_depth = self.ledger_depth;
-        // let capacity = 2 * 2usize.pow(ledger_depth as u32) - 1;
-
         *self = Self {
-            // matrix: vec![None; capacity],
             matrix: BTreeMap::new(),
             ledger_depth,
             empty_hashes: vec![None; ledger_depth],
             nhashes: 0,
         }
-        // self.matrix.clear();
-        // self.empty_hashes.clear();
-        // self.nhashes = 0;
     }
 
     pub fn take(&mut self) -> Self {