Optimized iterator over a range of key-value pairs in the B+ tree. Uses tree navigation to find start, then linked list traversal for efficiency.
| 43 | /// Optimized iterator over a range of key-value pairs in the B+ tree. |
| 44 | /// Uses tree navigation to find start, then linked list traversal for efficiency. |
| 45 | pub struct RangeIterator<'a, K, V> { |
| 46 | iterator: Option<ItemIterator<'a, K, V>>, |
| 47 | skip_first: bool, |
| 48 | first_key: Option<K>, |
| 49 | } |
| 50 | |
| 51 | // ============================================================================ |
| 52 | // BPLUSTREE ITERATOR METHODS |
nothing calls this directly
no outgoing calls
no test coverage detected