(key T, child *BTreeNode[T])
| 79 | } |
| 80 | |
| 81 | func (node *BTreeNode[T]) InsertKeyChild(key T, child *BTreeNode[T]) { |
| 82 | i := node.numKeys |
| 83 | node.children[i+1] = node.children[i] |
| 84 | for ; i > 0; i-- { |
| 85 | if key > node.keys[i-1] { |
| 86 | node.keys[i] = key |
| 87 | node.children[i] = child |
| 88 | break |
| 89 | } |
| 90 | node.keys[i] = node.keys[i-1] |
| 91 | node.children[i] = node.children[i-1] |
| 92 | } |
| 93 | if i == 0 { |
| 94 | node.keys[0] = key |
| 95 | node.children[0] = child |
| 96 | } |
| 97 | node.numKeys++ |
| 98 | } |
| 99 | |
| 100 | func (node *BTreeNode[T]) Append(key T, child *BTreeNode[T]) { |
| 101 | node.keys[node.numKeys] = key |
no outgoing calls
no test coverage detected