Lines Matching refs:LeafNode

37971 struct LeafNode<K, V> {
37989 impl<K, V> LeafNode<K, V> {  impl
38005             LeafNode::init(leaf.as_mut_ptr());
38019     data: LeafNode<K, V>,
38038             LeafNode::init(ptr::addr_of_mut!((*node.as_mut_ptr()).data));
38050 type BoxedNode<K, V> = NonNull<LeafNode<K, V>>;
38112     node: NonNull<LeafNode<K, V>>,
38138         Self::from_new_leaf(LeafNode::new())
38141     fn from_new_leaf(leaf: Box<LeafNode<K, V>>) -> Self {
38218     fn as_leaf_ptr(this: &Self) -> *mut LeafNode<K, V> {
38292     fn into_leaf(self) -> &'a LeafNode<K, V> {
38323                     Layout::new::<LeafNode<K, V>>()
38347     fn as_leaf_mut(&mut self) -> &mut LeafNode<K, V> {
38354     fn into_leaf_mut(mut self) -> &'a mut LeafNode<K, V> {
38974     fn split_leaf_data(&mut self, new_node: &mut LeafNode<K, V>) -> (K, V) {
39007         let mut new_node = LeafNode::new();
39195                 Global.deallocate(right_node.node.cast(), Layout::new::<LeafNode<K, V>>());
39726     assert_eq!(core::mem::size_of::<LeafNode<(), ()>>(), 16);
39727     assert_eq!(core::mem::size_of::<LeafNode<i64, i64>>(), 16 + CAPACITY * 2 * 8);