| 74 | /// - Lower capacity = more tree levels but smaller nodes |
| 75 | #[derive(Debug)] |
| 76 | pub struct BPlusTreeMap<K, V> { |
| 77 | /// Maximum number of keys per node. |
| 78 | pub(crate) capacity: usize, |
| 79 | /// The root node of the tree. |
| 80 | pub(crate) root: NodeRef<K, V>, |
| 81 | |
| 82 | // Compact arena-based allocation for better performance |
| 83 | /// Compact arena storage for leaf nodes (eliminates Option wrapper overhead). |
| 84 | pub(crate) leaf_arena: CompactArena<LeafNode<K, V>>, |
| 85 | /// Compact arena storage for branch nodes (eliminates Option wrapper overhead). |
| 86 | pub(crate) branch_arena: CompactArena<BranchNode<K, V>>, |
| 87 | } |
| 88 | |
| 89 | /// Leaf node containing key-value pairs. |
| 90 | #[derive(Debug, Clone)] |
nothing calls this directly
no outgoing calls
no test coverage detected