STRtree

ElementMissed InstructionsCov.Missed BranchesCov.MissedCxtyMissedLinesMissedMethods
Total540 of 5400%58 of 580%60601351353131
nearestNeighbourK(BoundablePair, double, int)770%120%77222211
nearestNeighbour(BoundablePair)670%100%66191911
isWithinDistance(BoundablePair, double)510%100%66171711
verticalSlices(List, int)500%60%44121211
createParentBoundables(List, int)390%20%227711
createParentBoundablesFromVerticalSlices(List[], int)300%40%336611
nearestNeighbour(Envelope, Object, ItemDistance)250%20%224411
nearestNeighbour(Envelope, Object, ItemDistance, int)250%20%224411
getItems(PriorityQueue)250%20%228811
nearestNeighbour(STRtree, ItemDistance)210%40%333311
nearestNeighbour(ItemDistance)180%20%223311
isWithinDistance(STRtree, ItemDistance, double)140%n/a112211
static {...}130%n/a113311
insert(Envelope, Object)90%20%223311
centreX(Envelope)60%n/a111111
centreY(Envelope)60%n/a111111
avg(double, double)60%n/a111111
nearestNeighbourK(BoundablePair, int)60%n/a111111
createParentBoundablesFromVerticalSlice(List, int)50%n/a111111
STRtree(int, STRtree.STRtreeNode)50%n/a112211
STRtree(int, ArrayList)50%n/a112211
createNode(int)50%n/a111111
query(Envelope, ItemVisitor)50%n/a112211
remove(Envelope, Object)50%n/a111111
STRtree()40%n/a112211
STRtree(int)40%n/a112211
query(Envelope)40%n/a111111
size()30%n/a111111
depth()30%n/a111111
getIntersectsOp()20%n/a111111
getComparator()20%n/a111111