(tree *BTree[T])
| 43 | } |
| 44 | |
| 45 | func (node *BTreeNode[T]) Verify(tree *BTree[T]) { |
| 46 | minKeys := minKeys(tree.maxKeys) |
| 47 | if node != tree.root && node.numKeys < minKeys { |
| 48 | panic("node has too few keys") |
| 49 | } else if node.numKeys > tree.maxKeys { |
| 50 | panic("node has too many keys") |
| 51 | } |
| 52 | } |
| 53 | |
| 54 | func (node *BTreeNode[T]) IsFull(maxKeys int) bool { |
| 55 | return node.numKeys == maxKeys |
no test coverage detected