| 117,7 → 117,7 |
|---|
| lnode = leaf_node; |
| if (!lnode) { |
| if (btree_search(t, key, &lnode)) { |
| panic("B-tree %P already contains key %d\n", t, key); |
| panic("B-tree %p already contains key %d\n", t, key); |
| } |
| } |
| |
| 200,7 → 200,7 |
|---|
| lnode = leaf_node; |
| if (!lnode) { |
| if (!btree_search(t, key, &lnode)) { |
| panic("B-tree %P does not contain key %d\n", t, key); |
| panic("B-tree %p does not contain key %d\n", t, key); |
| } |
| } |
| |
| 500,7 → 500,7 |
|---|
| return; |
| } |
| } |
| panic("node %P does not contain key %d\n", node, key); |
| panic("node %p does not contain key %d\n", node, key); |
| } |
| |
| /** Remove key and its right subtree pointer from B-tree node. |
| 527,7 → 527,7 |
|---|
| return; |
| } |
| } |
| panic("node %P does not contain key %d\n", node, key); |
| panic("node %p does not contain key %d\n", node, key); |
| } |
| |
| /** Split full B-tree node and insert new key-value-right-subtree triplet. |
| 669,7 → 669,7 |
|---|
| if (subtree == node->subtree[i]) |
| return i - (int) (right != false); |
| } |
| panic("node %P does not contain subtree %P\n", node, subtree); |
| panic("node %p does not contain subtree %p\n", node, subtree); |
| } |
| |
| /** Rotate one key-value-rsubtree triplet from the left sibling to the right sibling. |