1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
use std::{
	fmt::Debug,
	hint::unreachable_unchecked,
	mem::{replace, MaybeUninit},
	ptr::{copy, copy_nonoverlapping, drop_in_place, null_mut},
};

const B: u8 = 4;

#[derive(Debug)]
pub struct BTree<K, V>
where
	K: Ord,
{
	root: Node<K, V>,
}

impl<K, V> BTree<K, V>
where
	K: Ord,
{
	pub fn new() -> Self { Self { root: Node::new() } }

	pub fn insert(&mut self, key: K, value: V) -> Option<V> {
		match self.root.insert(key, value) {
			NodeInsertResult::Split {
				new_node,
				bubble: (key, value),
			} => {
				let old_root = replace(&mut self.root, Node::new());
				self.root.keys[0] = MaybeUninit::new(key);
				self.root.values[0] = MaybeUninit::new(value);
				self.root.children[0] = MaybeUninit::new(Box::into_raw(Box::new(old_root)));
				self.root.children[1] = MaybeUninit::new(Box::into_raw(new_node));
				self.root.len = 1;
				None
			}
			NodeInsertResult::Existed(v) => Some(v),
			NodeInsertResult::Ok => None,
		}
	}

	pub fn remove(&mut self, key: K) -> Option<V> {
		match self.root.remove(key) {
			NodeRemoveResult::NotThere => None,
			NodeRemoveResult::Removed(value) => Some(value),
			NodeRemoveResult::Merged(value) => {
				if self.root.len() == 0 {
					// Switch root

					let new_root_ptr = unsafe { self.root.children.get_unchecked(0).assume_init() };
					let new_root_box = unsafe { Box::from_raw(new_root_ptr) };
					self.root = *new_root_box;
				}
				Some(value)
			}
		}
	}
}

pub struct Node<K, V>
where
	K: Ord,
{
	len: u8,
	keys: [MaybeUninit<K>; (B - 1) as usize],
	values: [MaybeUninit<V>; (B - 1) as usize],
	children: [MaybeUninit<*mut Node<K, V>>; B as usize],
}

impl<K, V> Drop for Node<K, V>
where
	K: Ord,
{
	fn drop(&mut self) {
		let len = self.len;

		let keys_valid =
			unsafe { self.keys.get_unchecked_mut(..len as usize) as *mut _ as *mut [K] };
		let values_valid =
			unsafe { self.values.get_unchecked_mut(..len as usize) as *mut _ as *mut [V] };
		let children_valid = unsafe {
			let bound = if len != 0 { len as usize + 1 } else { 0 };
			&mut *(self.children.get_unchecked_mut(..bound) as *mut _ as *mut [*mut Node<K, V>])
		};

		unsafe {
			drop_in_place(keys_valid);
			drop_in_place(values_valid);
		}
		children_valid
			.into_iter()
			.filter(|p| !p.is_null())
			.for_each(|p| unsafe {
				Box::from_raw(*p);
			});
	}
}

impl<K, V> Debug for Node<K, V>
where
	K: Ord,
	K: Debug,
	V: Debug,
{
	fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
		let children = self
			.children
			.iter()
			.take(if self.len == 0 {
				0
			}
			else {
				self.len as usize + 1
			})
			.enumerate()
			.take_while(|(_, p)| !unsafe { p.assume_init().is_null() })
			.map(|(n, p)| (n, unsafe { (*p).assume_init().as_ref().unwrap() }))
			.map(|(_, p)| p)
			.collect::<Vec<_>>();
		f.debug_struct("Node")
			.field("len", &self.len)
			.field("keys", &unsafe {
				&*(&self.keys[..self.len as usize] as *const _ as *const [K])
			})
			.field("values", &unsafe {
				&*(&self.values[..self.len as usize] as *const _ as *const [V])
			})
			.field("children", &children)
			.finish()
	}
}

#[must_use]
#[derive(Debug)]
pub enum NodeInsertResult<K, V>
where
	K: Ord,
{
	Split {
		new_node: Box<Node<K, V>>,
		bubble: (K, V),
	},
	Existed(V),
	Ok,
}

#[must_use]
#[derive(Debug)]
pub enum NodeRemoveResult<V> {
	NotThere,
	Removed(V),
	Merged(V),
}

impl<K, V> Node<K, V>
where
	K: Ord,
{
	#[inline(never)]
	pub fn new() -> Self {
		Self {
			len: 0,
			keys: unsafe { MaybeUninit::uninit().assume_init() },
			values: unsafe { MaybeUninit::uninit().assume_init() },
			children: [MaybeUninit::new(null_mut()); B as usize],
		}
	}

	pub fn insert(&mut self, key: K, value: V) -> NodeInsertResult<K, V> {
		let keys_valid = unsafe {
			&mut *(self.keys.get_unchecked_mut(..self.len as usize) as *mut _ as *mut [K])
		};

		let greater_index = match keys_valid.binary_search(&key) {
			Ok(index) => {
				// Key exists already - swap value and return

				let value_in_array = unsafe { self.values.get_unchecked_mut(index) };
				let old_value_maybeuninit = replace(value_in_array, MaybeUninit::new(value));
				let old_value = unsafe { old_value_maybeuninit.assume_init() };

				return NodeInsertResult::Existed(old_value);
			}
			Err(index) => index,
		};

		let child_link = unsafe { self.children.get_unchecked_mut(greater_index).assume_init() };

		match unsafe { child_link.as_mut() } {
			None => {
				// We are a leaf node - insert and bubble back up

				if self.len < (B - 1) {
					// Add to node

					unsafe { self.insert_at_index_unchecked_leaf(key, value, greater_index) };

					NodeInsertResult::Ok
				}
				else {
					let (new_node, bubble) =
						unsafe { self.split_leaf_node_unchecked(key, value, greater_index) };
					NodeInsertResult::Split { new_node, bubble }
				}
			}
			Some(child) => {
				// We have a child - recurse

				match child.insert(key, value) {
					NodeInsertResult::Split { new_node, bubble } => {
						// Insert the bubbled-up node into this node

						if self.len < (B - 1) {
							// Add to node

							unsafe {
								self.insert_at_index_unchecked_internal(
									new_node,
									bubble,
									greater_index,
								)
							};
							NodeInsertResult::Ok
						}
						else {
							let (new_node, bubble) = unsafe {
								self.split_internal_node_unchecked(new_node, bubble, greater_index)
							};
							NodeInsertResult::Split { new_node, bubble }
						}
					}
					NodeInsertResult::Existed(v) => NodeInsertResult::Existed(v),
					NodeInsertResult::Ok => NodeInsertResult::Ok,
				}
			}
		}
	}

	pub fn remove(&mut self, key: K) -> NodeRemoveResult<V> {
		let keys_valid = unsafe {
			&mut *(self.keys.get_unchecked_mut(..self.len as usize) as *mut _ as *mut [K])
		};

		match keys_valid.binary_search(&key) {
			Ok(index) => {
				let left_child_link =
					unsafe { self.children.get_unchecked_mut(index).assume_init() };
				match unsafe { left_child_link.as_mut() } {
					None => {
						// We are a leaf node - simply remove the item
						let (_, value) = unsafe { self.remove_at_index_unchecked_leaf(index) };
						NodeRemoveResult::Removed(value)
					}
					Some(child) => {
						// We are not a leaf node

						// Get pointers to the key and value to pass into the recursion
						let indexed_key_ptr =
							unsafe { self.keys.get_unchecked_mut(index).as_mut_ptr() };
						let indexed_value_ptr =
							unsafe { self.values.get_unchecked_mut(index).as_mut_ptr() };

						// Read out the value for returning
						let value = unsafe { indexed_value_ptr.read() };

						// Replace value with new value from leaf node
						unsafe { child.swap_with_left_leaf(indexed_key_ptr, indexed_value_ptr) };

						// Unroll recursion - rebalancing along the way
						match unsafe { self.rebalance(index) } {
							false => NodeRemoveResult::Removed(value),
							true => NodeRemoveResult::Merged(value),
						}
					}
				}
			}
			Err(index) => {
				// Have not yet found the key
				let child_link = unsafe { self.children.get_unchecked_mut(index).assume_init() };
				match unsafe { child_link.as_mut() } {
					None => NodeRemoveResult::NotThere,
					Some(child) => match child.remove(key) {
						NodeRemoveResult::NotThere => NodeRemoveResult::NotThere,
						NodeRemoveResult::Removed(value) => {
							match unsafe { self.rebalance(index) } {
								false => NodeRemoveResult::Removed(value),
								true => NodeRemoveResult::Merged(value),
							}
						}

						NodeRemoveResult::Merged(value) => match unsafe { self.rebalance(index) } {
							false => NodeRemoveResult::Removed(value),
							true => NodeRemoveResult::Merged(value),
						},
					},
				}
			}
		}
	}

	fn len(&self) -> u8 { self.len }

	// Insert an element into the leaf node at an index
	// Makes the assumption that the node has enough capacity for the new element
	unsafe fn insert_at_index_unchecked_leaf(&mut self, key: K, value: V, index: usize) {
		debug_assert!(index <= self.len as usize);

		let copy_len = self.len as usize - index;

		// Copy keys forward
		let keys_ptr = self.keys.as_mut_ptr();
		let copy_src = keys_ptr.add(index);
		let copy_dst = keys_ptr.add(index + 1);
		copy(copy_src, copy_dst, copy_len);

		// Copy values forward
		let values_ptr = self.values.as_mut_ptr();
		let copy_src = values_ptr.add(index);
		let copy_dst = values_ptr.add(index + 1);
		copy(copy_src, copy_dst, copy_len);

		// Insert new key / value
		*self.keys.get_unchecked_mut(index) = MaybeUninit::new(key);
		*self.values.get_unchecked_mut(index) = MaybeUninit::new(value);

		self.len += 1;
	}

	unsafe fn split_leaf_node_unchecked(
		&mut self,
		key: K,
		value: V,
		index: usize,
	) -> (Box<Node<K, V>>, (K, V)) {
		debug_assert!(self.len > 0);

		// Split node

		// Create pivot while also accounting for the to-be-inserted element
		// Left bias because the bubble will be picked from the left node
		let (insert_left, pivot) = if index as u8 <= self.len / 2 {
			// New element goes to the left of the pivot
			(true, self.len / 2)
		}
		else {
			// New element goes to the right of the pivot
			(false, self.len / 2 + 1)
		};

		let new_len = self.len - pivot;

		// Create our right node
		let mut new_node = Self {
			len: new_len,
			keys: MaybeUninit::uninit().assume_init(),
			values: MaybeUninit::uninit().assume_init(),
			children: [MaybeUninit::new(null_mut()); B as usize],
		};

		// Copy half of keys
		let copy_src = self.keys.as_ptr().add(pivot as usize);
		let copy_dst = new_node.keys.as_mut_ptr();
		copy_nonoverlapping(copy_src, copy_dst, new_len as usize);

		// Copy half of values
		let copy_src = self.values.as_ptr().add(pivot as usize);
		let copy_dst = new_node.values.as_mut_ptr();
		copy_nonoverlapping(copy_src, copy_dst, new_len as usize);

		// Update length
		self.len = pivot;

		// Insert new element - now we're sure that whichever node has room
		if insert_left {
			self.insert_at_index_unchecked_leaf(key, value, index);
		}
		else {
			new_node.insert_at_index_unchecked_leaf(key, value, index - pivot as usize);
		}

		// Decrement left node length since we are about to remove the bubble
		let new_left_len = self.len - 1;

		let bubble_key = self
			.keys
			.get_unchecked(new_left_len as usize)
			.as_ptr()
			.read();
		let bubble_value = self
			.values
			.get_unchecked(new_left_len as usize)
			.as_ptr()
			.read();

		self.len = new_left_len;

		(Box::new(new_node), (bubble_key, bubble_value))
	}

	// Insert a bubbled-up element into the internal node at an index
	// Makes the assumption that the node has enough capacity for the new element
	unsafe fn insert_at_index_unchecked_internal(
		&mut self,
		new_node: Box<Node<K, V>>,
		(key, value): (K, V),
		index: usize,
	) {
		debug_assert!(index <= self.len as usize);

		let copy_len = self.len as usize - index;

		// Copy keys forward
		let keys_ptr = self.keys.as_mut_ptr();
		let copy_src = keys_ptr.add(index);
		let copy_dst = keys_ptr.add(index + 1);
		copy(copy_src, copy_dst, copy_len);

		// Copy keys forward
		let values_ptr = self.keys.as_mut_ptr();
		let copy_src = values_ptr.add(index);
		let copy_dst = values_ptr.add(index + 1);
		copy(copy_src, copy_dst, copy_len);

		// Copy children forward
		let children_ptr = self.keys.as_mut_ptr();
		let copy_src = children_ptr.add(index + 1);
		let copy_dst = children_ptr.add(index + 2);
		copy(copy_src, copy_dst, copy_len);

		// Insert new key / value / child
		*self.keys.get_unchecked_mut(index) = MaybeUninit::new(key);
		*self.values.get_unchecked_mut(index) = MaybeUninit::new(value);
		*self.children.get_unchecked_mut(index + 1) = MaybeUninit::new(Box::into_raw(new_node));

		self.len += 1;
	}

	unsafe fn split_internal_node_unchecked(
		&mut self,
		new_right_node: Box<Node<K, V>>,
		bubble: (K, V),
		index: usize,
	) -> (Box<Node<K, V>>, (K, V)) {
		// Split node

		// Create pivot while also accounting for the to-be-inserted element
		// Left bias because the bubble will be picked from the left node
		let (insert_left, pivot) = if index as u8 <= self.len / 2 {
			// New element goes to the left of the pivot
			(true, self.len / 2)
		}
		else {
			// New element goes to the right of the pivot
			(false, self.len / 2 + 1)
		};

		let new_len = self.len - pivot;

		// Create our right node
		let mut new_node = Self {
			len: new_len,
			keys: MaybeUninit::uninit().assume_init(),
			values: MaybeUninit::uninit().assume_init(),
			children: MaybeUninit::uninit().assume_init(),
		};

		// Copy half of keys
		let src = self.keys.as_ptr().add(pivot as usize);
		let dest = new_node.keys.as_mut_ptr();
		copy_nonoverlapping(src, dest, new_len as usize);

		// Copy half of values
		let src = self.values.as_ptr().add(pivot as usize);
		let dest = new_node.values.as_mut_ptr();
		copy_nonoverlapping(src, dest, new_len as usize);

		// Insert new element - now we're sure that whichever node has room
		// Insert bubbled-up key and value only - we will handle the new right node later
		if insert_left {
			let copy_len = self.len - pivot;
			let src = self.children.get_unchecked(pivot as usize + 1).as_ptr();
			let dest = new_node.children.get_unchecked_mut(1).as_mut_ptr();

			// Copy child values to the right node - leave a space at the start for later transfer from the left node
			copy_nonoverlapping(src, dest, copy_len as usize);

			// Update length
			self.len = pivot;

			self.insert_at_index_unchecked_internal(new_right_node, bubble, index);

			// Move child from end of left node to start of right node
			*new_node.children.get_unchecked_mut(0).as_mut_ptr() =
				*self.children.get_unchecked(pivot as usize).as_ptr();
		}
		else {
			let copy_len = self.len - pivot + 1;
			let src = self.children.get_unchecked(pivot as usize).as_ptr();
			let dest = new_node.children.get_unchecked_mut(0).as_mut_ptr();

			// Copy child values to the right node
			copy_nonoverlapping(src, dest, copy_len as usize);

			// Update length
			self.len = pivot;

			new_node.insert_at_index_unchecked_internal(
				new_right_node,
				bubble,
				index - pivot as usize,
			);
		}

		// Decrement left node length since we are about to remove the bubble
		let new_left_len = self.len - 1;

		let bubble_key = self
			.keys
			.get_unchecked(new_left_len as usize)
			.as_ptr()
			.read();
		let bubble_value = self
			.values
			.get_unchecked(new_left_len as usize)
			.as_ptr()
			.read();

		self.len = new_left_len;

		(Box::new(new_node), (bubble_key, bubble_value))
	}

	unsafe fn swap_with_left_leaf(&mut self, key_hole: *mut K, value_hole: *mut V) {
		let len = self.len() as usize;
		let rightmost_child = self.children.get_unchecked_mut(len).assume_init();
		match rightmost_child.as_mut() {
			None => {
				// We are a leaf node
				// Replace the key and value of the ancestor node
				let (key, value, _) = self.remove_last();
				*key_hole = key;
				*value_hole = value;
			}
			Some(child) => {
				// We are an internal node - recurse
				child.swap_with_left_leaf(key_hole, value_hole);
				self.rebalance(len);
			}
		}
	}

	unsafe fn remove_at_index_unchecked_leaf(&mut self, index: usize) -> (K, V) {
		debug_assert!(index <= self.len as usize);

		let removed_key = self.keys.get_unchecked(index).as_ptr().read();
		let removed_value = self.values.get_unchecked(index).as_ptr().read();

		let copy_len = self.len as usize - index - 1;

		// Copy keys backwards
		let keys_ptr = self.keys.as_mut_ptr();
		let copy_src = keys_ptr.add(index + 1);
		let copy_dst = keys_ptr.add(index);
		copy(copy_src, copy_dst, copy_len);

		// Copy values backwards
		let values_ptr = self.values.as_mut_ptr();
		let copy_src = values_ptr.add(index + 1);
		let copy_dst = values_ptr.add(index);
		copy(copy_src, copy_dst, copy_len);

		self.len -= 1;

		(removed_key, removed_value)
	}

	unsafe fn remove_at_index_unchecked_internal(
		&mut self,
		index: usize,
	) -> (K, V, Box<Node<K, V>>) {
		debug_assert!(index <= self.len as usize);

		let removed_key = self.keys.get_unchecked(index).as_ptr().read();
		let removed_value = self.values.get_unchecked(index).as_ptr().read();
		let removed_child = self.children.get_unchecked(index + 1).assume_init();

		let copy_len = self.len as usize - index - 1;

		// Copy keys backwards
		let keys_ptr = self.keys.as_mut_ptr();
		let copy_src = keys_ptr.add(index + 1);
		let copy_dst = keys_ptr.add(index);
		copy(copy_src, copy_dst, copy_len);

		// Copy values backwards
		let values_ptr = self.values.as_mut_ptr();
		let copy_src = values_ptr.add(index + 1);
		let copy_dst = values_ptr.add(index);
		copy(copy_src, copy_dst, copy_len);

		// Copy keys backwards
		let children_ptr = self.keys.as_mut_ptr();
		let copy_src = children_ptr.add(index + 2);
		let copy_dst = children_ptr.add(index + 1);
		copy(copy_src, copy_dst, copy_len);

		self.len -= 1;

		(removed_key, removed_value, Box::from_raw(removed_child))
	}

	unsafe fn remove_last(&mut self) -> (K, V, *mut Node<K, V>) {
		let len = self.len() as usize;

		let removed_key = self.keys.get_unchecked(len - 1).as_ptr().read();
		let removed_value = self.values.get_unchecked(len - 1).as_ptr().read();
		let removed_child = self.children.get_unchecked(len).assume_init();

		self.len -= 1;

		(removed_key, removed_value, removed_child)
	}

	unsafe fn remove_first(&mut self) -> (K, V, Box<Node<K, V>>) {
		let removed_key = self.keys.get_unchecked(0).as_ptr().read();
		let removed_value = self.values.get_unchecked(0).as_ptr().read();
		let removed_child = self.children.get_unchecked(0).assume_init();

		let copy_len = self.len as usize - 1;

		// Copy keys backwards
		let keys_ptr = self.keys.as_mut_ptr();
		let copy_src = keys_ptr.add(1);
		let copy_dst = keys_ptr.add(0);
		copy(copy_src, copy_dst, copy_len);

		// Copy values backwards
		let values_ptr = self.values.as_mut_ptr();
		let copy_src = values_ptr.add(1);
		let copy_dst = values_ptr.add(0);
		copy(copy_src, copy_dst, copy_len);

		// Copy children backwards
		let children_ptr = self.children.as_mut_ptr();
		let copy_src = children_ptr.add(1);
		let copy_dst = children_ptr.add(0);
		copy(copy_src, copy_dst, copy_len + 1);

		self.len -= 1;

		(removed_key, removed_value, Box::from_raw(removed_child))
	}

	unsafe fn insert_first(&mut self, key: K, value: V, child: *mut Node<K, V>) {
		let copy_len = self.len as usize;

		// Copy keys forward
		let keys_ptr = self.keys.as_mut_ptr();
		let copy_src = keys_ptr.add(0);
		let copy_dst = keys_ptr.add(1);
		copy(copy_src, copy_dst, copy_len);

		// Copy values forward
		let values_ptr = self.values.as_mut_ptr();
		let copy_src = values_ptr.add(0);
		let copy_dst = values_ptr.add(1);
		copy(copy_src, copy_dst, copy_len);

		// Copy children forward
		let children_ptr = self.children.as_mut_ptr();
		let copy_src = children_ptr.add(0);
		let copy_dst = children_ptr.add(1);
		copy(copy_src, copy_dst, copy_len + 1);

		// Insert new key / value / child
		*self.keys.get_unchecked_mut(0).as_mut_ptr() = key;
		*self.values.get_unchecked_mut(0).as_mut_ptr() = value;
		*self.children.get_unchecked_mut(0).as_mut_ptr() = child;

		self.len += 1;
	}

	unsafe fn rebalance(&mut self, child_index: usize) -> bool {
		let child_link = self
			.children
			.get_unchecked_mut(child_index as usize)
			.assume_init();
		let child = match child_link.as_mut() {
			None => unreachable_unchecked(),
			Some(child) => child,
		};

		let child_len = child.len();
		if child_len >= B / 2 - 1 {
			// No rebalancing needed - early exit
			return false;
		}

		let (selected_sibling_index, pivot_index, left_sibling) = match child_index {
			0 => (child_index + 1, child_index, false),
			_ => (child_index - 1, child_index - 1, true),
		};

		let sibling_link = self
			.children
			.get_unchecked_mut(selected_sibling_index as usize)
			.assume_init();
		let sibling = match sibling_link.as_mut() {
			None => unreachable_unchecked(),
			Some(sibling) => sibling,
		};

		let sibling_len = sibling.len();
		if sibling_len >= B / 2 {
			// Do rotation

			// Copy key / value out of parent
			let parent_key = self.keys.get_unchecked(pivot_index).as_ptr().read();
			let parent_value = self.values.get_unchecked(pivot_index).as_ptr().read();

			let (sibling_key, sibling_value) = match left_sibling {
				true => {
					let (key, value, node) = sibling.remove_last();
					child.insert_first(parent_key, parent_value, node);
					(key, value)
				}
				false => {
					let (key, value, node) = sibling.remove_first();
					child.insert_at_index_unchecked_internal(
						node,
						(parent_key, parent_value),
						child_len as usize,
					);
					(key, value)
				}
			};

			*self.keys.get_unchecked_mut(pivot_index) = MaybeUninit::new(sibling_key);
			*self.values.get_unchecked_mut(pivot_index) = MaybeUninit::new(sibling_value);

			false
		}
		else {
			// Do merge
			let (left_node, key, value, mut right_node) = match left_sibling {
				true => {
					let (key, value, child) = self.remove_at_index_unchecked_internal(pivot_index);
					(sibling, key, value, child)
				}
				false => {
					let (key, value, sibling) =
						self.remove_at_index_unchecked_internal(pivot_index);
					(child, key, value, sibling)
				}
			};

			let left_len = left_node.len() as usize;
			let right_len = right_node.len() as usize;

			// Copy orphaned key and value into the left node
			*left_node.keys.get_unchecked_mut(left_len).as_mut_ptr() = key;
			*left_node.values.get_unchecked_mut(left_len).as_mut_ptr() = value;

			// Copy keys from right node
			let copy_src = right_node.keys.get_unchecked(0).as_ptr();
			let copy_dst = left_node.keys.get_unchecked_mut(left_len + 1).as_mut_ptr();
			copy_nonoverlapping(copy_src, copy_dst, right_len);

			// Copy values from right node
			let copy_src = right_node.values.get_unchecked(0).as_ptr();
			let copy_dst = left_node
				.values
				.get_unchecked_mut(left_len + 1)
				.as_mut_ptr();
			copy_nonoverlapping(copy_src, copy_dst, right_len);

			// Copy children from right node
			let copy_src = right_node.children.get_unchecked(0).as_ptr();
			let copy_dst = left_node
				.children
				.get_unchecked_mut(left_len + 1)
				.as_mut_ptr();
			copy_nonoverlapping(copy_src, copy_dst, right_len + 1);

			// Set lengths
			left_node.len = (left_len + 1 + right_len) as u8;
			right_node.len = 0;
			true
		}
	}
}