getBounds() | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
insert(Envelope, Object) | | 82% | | 50% | 1 | 2 | 1 | 6 | 0 | 1 |
size() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
remove(Envelope, Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
query(Envelope, ItemVisitor) | | 95% | | 75% | 1 | 3 | 1 | 7 | 0 | 1 |
prepareItems() | | 100% | | 100% | 0 | 2 | 0 | 14 | 0 | 1 |
updateNodeBounds(int, double, double, double, double) | | 100% | | 100% | 0 | 5 | 0 | 5 | 0 | 1 |
prepareIndex() | | 100% | | 100% | 0 | 3 | 0 | 9 | 0 | 1 |
queryNode(int, int, Envelope, ItemVisitor) | | 100% | | 100% | 0 | 3 | 0 | 10 | 0 | 1 |
intersects(double[], int, Envelope) | | 100% | | 100% | 0 | 6 | 0 | 5 | 0 | 1 |
computeNodeBounds(int, int, int) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
sortItems() | | 100% | | 100% | 0 | 2 | 0 | 8 | 0 | 1 |
createBoundsArray(int) | | 100% | | 100% | 0 | 2 | 0 | 8 | 0 | 1 |
computeLayerNodes(int) | | 100% | | 100% | 0 | 2 | 0 | 8 | 0 | 1 |
queryNodeChildren(int, int, Envelope, ItemVisitor) | | 100% | | 100% | 0 | 3 | 0 | 7 | 0 | 1 |
hoarePartition(int[], int, int) | | 100% | | 100% | 0 | 4 | 0 | 7 | 0 | 1 |
computeLeafNodeBounds(int, int) | | 100% | | 100% | 0 | 3 | 0 | 6 | 0 | 1 |
swapItems(int[], int, int) | | 100% | | n/a | 0 | 1 | 0 | 7 | 0 | 1 |
queryItems(int, Envelope, ItemVisitor) | | 100% | | 100% | 0 | 4 | 0 | 6 | 0 | 1 |
quickSortItemsIntoNodes(int[], int, int) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
computeLayerIndices(int, int) | | 100% | | 100% | 0 | 2 | 0 | 8 | 0 | 1 |
queryTopLayer(Envelope, ItemVisitor) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
HPRtree(int) | | 100% | | n/a | 0 | 1 | 0 | 7 | 0 | 1 |
query(Envelope) | | 100% | | 100% | 0 | 2 | 0 | 6 | 0 | 1 |
build() | | 100% | | 75% | 1 | 3 | 0 | 8 | 0 | 1 |
computeLeafNodes(int) | | 100% | | 100% | 0 | 2 | 0 | 3 | 0 | 1 |
numNodesToCover(int, int) | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
layerSize(int) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
HPRtree() | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |