Add `NtfsIndex` and `NtfsIndexEntries` to traverse an index in-order.

This introduces a hard dependency on alloc for a core feature.
It is required as long as we don't know the B-tree depth in advance, and need to maintain a stack with elements per layer during traversal.

1 files changed, 6 insertions, 0 deletions

diff --git a/src/structured_values/index_root.rs b/src/structured_values/index_root.rs
index 0a57631..0355fc0 100644
--- a/src/structured_values/index_root.rs
+++ b/src/structured_values/index_root.rs
@@ -67,6 +67,12 @@ impl<'n> NtfsIndexRoot<'n> {
     pub fn is_large_index(&self) -> bool {
         (self.index_node_header.flags & LARGE_INDEX_FLAG) != 0
     }
+
+    pub fn position(&self) -> u64 {
+        // A structured value is always created from a valid seek position,
+        // and therefore we can safely unwrap here.
+        self.value.data_position().unwrap()
+    }
 }
 
 impl<'n> NewNtfsStructuredValue<'n> for NtfsIndexRoot<'n> {