| trySplit(KdbTree.SplitDimension, int, int, Rectangle, List, KdbTree.LeafIdAllocator) |  | 0% | | 0% | 5 | 5 | 15 | 15 | 1 | 1 |
| buildKdbTreeNode(int, int, Rectangle, List, KdbTree.LeafIdAllocator) | | 0% | | 0% | 10 | 10 | 14 | 14 | 1 | 1 |
| findLeaves(Predicate) | | 0% | | 0% | 4 | 4 | 13 | 13 | 1 | 1 |
| shouldSplitVertically(Rectangle) | | 0% | | 0% | 8 | 8 | 13 | 13 | 1 | 1 |
| lambda$findIntersectingLeaves$1(Rectangle, KdbTree.Node) | | 0% | | 0% | 5 | 5 | 4 | 4 | 1 | 1 |
| buildKdbTree(int, List) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| equals(Object) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| KdbTree(KdbTree.Node) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| hashCode() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| findIntersectingLeaves(Rectangle) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getLeaves() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getRoot() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$getLeaves$0(KdbTree.Node) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |