Janis
b11805aacd
- Replaced `InternalNode` with a unified `LeafNode` structure to simplify the node hierarchy and reduce redundancy. - Introduced `capacity` field in `LeafNode` to dynamically manage keys and edges, replacing fixed-size arrays. - Added methods for growing node capacity and handling dynamic memory allocation for keys and edges. - Updated `NodeRef` methods to work with the new `LeafNode` structure, including safe handling of raw pointers and memory operations. - Adjusted tests to reflect the new node structure and ensure correctness. |
||
|---|---|---|
| .. | ||
| atomic.rs | ||
| bytes.rs | ||
| cachepadded.rs | ||
| drop_guard.rs | ||
| iter.rs | ||
| lib.rs | ||
| mem.rs | ||
| option.rs | ||
| ptr.rs | ||
| rand.rs | ||
| smallbox.rs | ||
| sync.rs | ||
| tree.rs | ||
| util.rs | ||