wip

src/disktree/iter.rs

@@ -106,6 +106,43 @@ impl<'a> Iter<'a> {
             node_stack,
         })
     }
+
+    pub(crate) fn empty(disktree_buf: &'a [u8]) -> Iter<'a> {
+        let disktree_csr = Cursor::new(disktree_buf);
+        let cell_stack = CellStack::new();
+        let node_stack = Vec::new();
+        let recycle_bin = Vec::new();
+        let curr_node = None;
+        Self {
+            cell_stack,
+            curr_node,
+            disktree_buf,
+            disktree_csr,
+            recycle_bin,
+            node_stack,
+        }
+    }
+
+    // pub(crate) fn subtree(disktree: &'a DiskTreeMap, cell: Cell) -> Result<Iter<'a>> {
+    //     let mut disktree_csr = Cursor::new(disktree_buf);
+    //     let mut cell_stack = CellStack::new();
+    //     let mut node_stack = Vec::new();
+    //     let recycle_bin = Vec::new();
+    //     let mut base_nodes = Self::read_base_nodes(&mut disktree_csr)?;
+    //     let curr_node = base_nodes.pop();
+    //     node_stack.push(base_nodes);
+    //     if let Some((digit, _)) = curr_node {
+    //         cell_stack.push(digit);
+    //     }
+    //     Ok(Self {
+    //         cell_stack,
+    //         curr_node,
+    //         disktree_buf,
+    //         disktree_csr,
+    //         recycle_bin,
+    //         node_stack,
+    //     })
+    // }
 }
 
 impl<'a> Iterator for Iter<'a> {

src/disktree/tree.rs

@@ -116,8 +116,24 @@ impl DiskTreeMap {
     }
 
     /// Returns an iterator visiting the specified `cell` or its descendants.
-    pub fn subtree_iter(&self, _cell: Cell) -> Result<impl Iterator<Item = Result<(Cell, &[u8])>>> {
-        Ok(None.into_iter())
+    pub fn subtree_iter(&self, cell: Cell) -> Result<impl Iterator<Item = Result<(Cell, &[u8])>>> {
+        let iter = match self.get_raw(cell)? {
+            None => {
+                let iter = crate::disktree::iter::Iter::empty((*self.0).as_ref());
+                None.into_iter().chain(iter)
+            }
+            Some((cell, Node::Leaf(range))) => {
+                let iter = crate::disktree::iter::Iter::empty((*self.0).as_ref());
+                let val_bytes = &(*self.0).as_ref()[range];
+                Some(Ok((cell, val_bytes))).into_iter().chain(iter)
+            }
+            Some((cell, Node::Parent(children))) => {
+                let iter = crate::disktree::iter::Iter::empty((*self.0).as_ref());
+                let val_bytes = &(*self.0).as_ref()[range];
+                Some(Ok((cell, val_bytes))).into_iter().chain(iter)
+            }
+        };
+        Ok(iter)
     }
 
     /// Returns the DPtr to a base (res0) cell dptr.