| remove(Object, AbstractNode, Object) |  | 0% | | 0% | 8 | 8 | 18 | 18 | 1 | 1 |
| createParentBoundables(List, int) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| itemsTree(AbstractNode) | | 0% | | 0% | 6 | 6 | 15 | 15 | 1 | 1 |
| boundablesAtLevel(int, AbstractNode, Collection) | | 0% | | 0% | 6 | 6 | 12 | 12 | 1 | 1 |
| queryInternal(Object, AbstractNode, List) | | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| queryInternal(Object, AbstractNode, ItemVisitor) | | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| removeItem(AbstractNode, Object) | | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| size(AbstractNode) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| depth(AbstractNode) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| createHigherLevels(List, int) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| query(Object) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| build() | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| AbstractSTRtree(int) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| query(Object, ItemVisitor) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| remove(Object, Object) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| insert(Object, Object) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| itemsTree() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| compareDoubles(double, double) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| AbstractSTRtree(int, AbstractNode) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| size() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| depth() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| boundablesAtLevel(int) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| isEmpty() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| lastNode(List) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| AbstractSTRtree(int, ArrayList) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| getRoot() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| AbstractSTRtree() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getNodeCapacity() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getItemBoundables() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |