| nodeSplit(Node, Node, int) |  | 0% | | 0% | 8 | 8 | 23 | 23 | 1 | 1 |
| rotatedLeft(Node, int, Node, Node) | | 0% | | 0% | 9 | 9 | 25 | 25 | 1 | 1 |
| nodeMergedWith(Node, Node, int) | | 0% | | 0% | 6 | 6 | 21 | 21 | 1 | 1 |
| next() | | 0% | | 0% | 7 | 7 | 15 | 15 | 1 | 1 |
| valueAdded(Node, int) | | 0% | | 0% | 8 | 8 | 10 | 10 | 1 | 1 |
| valueRemoved(Node, int) | | 0% | | 0% | 8 | 8 | 10 | 10 | 1 | 1 |
| rotatedRight(Node, int, Node, Node) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| findMinimum() | | 0% | | 0% | 5 | 5 | 17 | 17 | 1 | 1 |
| close() | | 0% | | 0% | 8 | 8 | 11 | 11 | 1 | 1 |
| findNext(boolean) | | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| RangeIterator(BTree, byte[], byte[], byte[], byte[]) | | 0% | | n/a | 1 | 1 | 12 | 12 | 1 | 1 |
| popStacks() | | 0% | | 0% | 3 | 3 | 12 | 12 | 1 | 1 |
| set(byte[]) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| pushStacks(Node) | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| static {...} | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| toString() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |