Struct alloc::collections::btree::node::LeafNode

struct LeafNode<K, V> {
    parent: Option<NonNull<InternalNode<K, V>>>,
    parent_idx: MaybeUninit<u16>,
    len: u16,
    keys: [MaybeUninit<K>; 11],
    vals: [MaybeUninit<V>; 11],
}

The underlying representation of leaf nodes and part of the representation of internal nodes.

Fields

parent: Option<NonNull<InternalNode<K, V>>>

We want to be covariant in K and V.

parent_idx: MaybeUninit<u16>

This node’s index into the parent node’s edges array. *node.parent.edges[node.parent_idx] should be the same thing as node. This is only guaranteed to be initialized when parent is non-null.

len: u16

The number of keys and values this node stores.

keys: [MaybeUninit<K>; 11]

The arrays storing the actual data of the node. Only the first len elements of each array are initialized and valid.

vals: [MaybeUninit<V>; 11]

Implementations

impl<K, V> LeafNode<K, V>

unsafe fn init(this: *mut Self)

Initializes a new LeafNode in-place.

fn new<A: Allocator + Clone>(alloc: A) -> Box<Self, A>

Creates a new boxed LeafNode.