| findFarthestEntry(Point) |  | 0% |  | 0% | 8 | 8 | 26 | 26 | 1 | 1 |
| findNearestEntryInChildren(Point, double) |  | 0% |  | 0% | 7 | 7 | 19 | 19 | 1 | 1 |
| findNearestEntry(Point, double) |  | 0% |  | 0% | 4 | 4 | 10 | 10 | 1 | 1 |
| removeEntry(Point) |  | 0% |  | 0% | 4 | 4 | 11 | 11 | 1 | 1 |
| removeEntryFromChildren(Point) |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
| findEntryByValue(Object) |  | 0% |  | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| findEntryByValueInChildren(Object) |  | 0% |  | 0% | 4 | 4 | 7 | 7 | 1 | 1 |
| removeFromChild(int, Point) |  | 0% |  | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| getMaxDistance(double, double, double) |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| iterator(int) |   | 68% |   | 50% | 1 | 2 | 0 | 5 | 0 | 1 |
| findNearestEntry(Point) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getChildIndex() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getParent() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| removeEntryAlongIndexPath(int) |   | 96% |   | 80% | 2 | 6 | 1 | 17 | 0 | 1 |
| isDestroyed() |   | 71% |   | 50% | 1 | 2 | 0 | 1 | 0 | 1 |
| insertEntry(Map.Entry) |  | 100% |   | 87% | 1 | 5 | 0 | 12 | 0 | 1 |
| subtreeEntryRemoved() |  | 100% |   | 80% | 2 | 6 | 0 | 9 | 0 | 1 |
| collectSubtreeEntriesRecursive(List, boolean) |  | 100% |  | 100% | 0 | 5 | 0 | 9 | 0 | 1 |
| findEntry(Point) |  | 100% |  | 100% | 0 | 4 | 0 | 7 | 0 | 1 |
| removeEntryAlongIndexPathFromChild(int, int) |  | 100% |   | 83% | 1 | 4 | 0 | 10 | 0 | 1 |
| findEntryInChildren(Point) |  | 100% |  | 100% | 0 | 4 | 0 | 7 | 0 | 1 |
| moveToChild(Map.Entry) |  | 100% |   | 75% | 1 | 3 | 0 | 7 | 0 | 1 |
| splitNode() |  | 100% |  | 100% | 0 | 2 | 0 | 7 | 0 | 1 |
| getOrCreateChild(int) |  | 100% |  | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| destroy() |  | 100% | | n/a | 0 | 1 | 0 | 7 | 0 | 1 |
| AbstractBucketPointMap.BucketNode(AbstractBucketPointMap, AbstractBucketPointMap.BucketNode, int) |  | 100% | | n/a | 0 | 1 | 0 | 6 | 0 | 1 |
| getEntryInChild(int, Point) |  | 100% |  | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| getSearchLocationValue(int, int, int) |  | 100% |  | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| isEmpty() |  | 100% |  | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| append(Map.Entry) |  | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| isLeaf() |  | 100% |  | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| makeLeaf(List) |  | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| subtreeEntryAdded() |  | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| getInsertLocationValue(int, int, int) |  | 100% |  | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
| iterator() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getPrecision() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getEntryCount() |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |