AbstractBucketPointMap.BucketNode

ElementMissed InstructionsCov.Missed BranchesCov.MissedCxtyMissedLinesMissedMethods
Total412 of 89854%67 of 13650%50105992321237
findFarthestEntry(Point)1150%140%88262611
findNearestEntryInChildren(Point, double)880%120%77191911
findNearestEntry(Point, double)450%60%44101011
removeEntry(Point)350%60%44111111
removeEntryFromChildren(Point)310%60%448811
findEntryByValue(Object)280%60%447711
findEntryByValueInChildren(Object)240%60%447711
removeFromChild(int, Point)140%20%224411
getMaxDistance(double, double, double)100%n/a113311
iterator(int)71568%1150%120501
findNearestEntry(Point)50%n/a111111
getChildIndex()30%n/a111111
getParent()30%n/a111111
removeEntryAlongIndexPath(int)26496%2880%2611701
isDestroyed()2571%1150%120101
insertEntry(Map.Entry)45100%1787%1501201
subtreeEntryRemoved()42100%2880%260901
collectSubtreeEntriesRecursive(List, boolean)32100%8100%050901
findEntry(Point)31100%6100%040701
removeEntryAlongIndexPathFromChild(int, int)31100%1583%1401001
findEntryInChildren(Point)29100%6100%040701
moveToChild(Map.Entry)29100%1375%130701
splitNode()26100%2100%020701
getOrCreateChild(int)22100%2100%020501
destroy()19100%n/a010701
AbstractBucketPointMap.BucketNode(AbstractBucketPointMap, AbstractBucketPointMap.BucketNode, int)16100%n/a010601
getEntryInChild(int, Point)14100%2100%020401
getSearchLocationValue(int, int, int)12100%4100%030501
isEmpty()8100%2100%020101
append(Map.Entry)8100%n/a010301
isLeaf()7100%2100%020101
makeLeaf(List)7100%n/a010301
subtreeEntryAdded()7100%n/a010201
getInsertLocationValue(int, int, int)6100%2100%020301
iterator()4100%n/a010101
getPrecision()4100%n/a010101
getEntryCount()3100%n/a010101