STRtree

ElementMissed InstructionsCov.Missed BranchesCov.MissedCxtyMissedLinesMissedMethods
Total358 of 54033%47 of 5818%4160921351631
nearestNeighbourK(BoundablePair, double, int)770%120%77222211
nearestNeighbour(BoundablePair)670%100%66191911
isWithinDistance(BoundablePair, double)510%100%66171711
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
nearestNeighbourK(BoundablePair, int)60%n/a111111
STRtree(int, STRtree.STRtreeNode)50%n/a112211
STRtree(int, ArrayList)50%n/a112211
query(Envelope, ItemVisitor)50%n/a112211
remove(Envelope, Object)50%n/a111111
size()30%n/a111111
depth()30%n/a111111
createParentBoundables(List, int)13897%1150%120701
createParentBoundablesFromVerticalSlices(List[], int)12996%1375%130601
insert(Envelope, Object)1888%1150%120301
verticalSlices(List, int)50100%6100%0401201
static {...}13100%n/a010301
centreX(Envelope)6100%n/a010101
centreY(Envelope)6100%n/a010101
avg(double, double)6100%n/a010101
createParentBoundablesFromVerticalSlice(List, int)5100%n/a010101
createNode(int)5100%n/a010101
STRtree()4100%n/a010201
STRtree(int)4100%n/a010201
query(Envelope)4100%n/a010101
getIntersectsOp()2100%n/a010101
getComparator()2100%n/a010101