BTreeSet

ElementMissed InstructionsCov.Missed BranchesCov.MissedCxtyMissedLinesMissedMethods
Total289 of 36520%8 of 1020%455953694154
toArray(Object[], int)210%20%225511
hashCode()210%20%224411
containsAll(Collection)180%40%334411
copy(SortedSet, Comparator)160%n/a113311
subList(int, int)120%n/a111111
subSet(Object, boolean, Object, boolean)120%n/a111111
headSet(Object, boolean)120%n/a111111
tailSet(Object, boolean)120%n/a111111
descendingSet()90%n/a111111
subSet(Object, Object)70%n/a111111
last()70%n/a111111
lower(Object)70%n/a111111
floor(Object)70%n/a111111
ceiling(Object)70%n/a111111
higher(Object)70%n/a111111
of(Collection)70%n/a111111
of(Comparable)70%n/a111111
builder(Comparator, int)60%n/a111111
toArray()50%n/a111111
toArray(Object[])50%n/a111111
headSet(Object)50%n/a111111
tailSet(Object)50%n/a111111
lastIndexOf(Object)40%n/a111111
descendingIterator()40%n/a111111
spliterator()40%n/a111111
addAll(Collection)40%n/a111111
addAll(int, Collection)40%n/a111111
retainAll(Collection)40%n/a111111
removeAll(Collection)40%n/a111111
clear()40%n/a111111
pollFirst()40%n/a111111
pollLast()40%n/a111111
add(Object)40%n/a111111
remove(Object)40%n/a111111
set(int, Object)40%n/a111111
add(int, Object)40%n/a111111
remove(int)40%n/a111111
listIterator()40%n/a111111
listIterator(int)40%n/a111111
comparator()30%n/a111111
tree()30%n/a111111
BTreeSet(Object[], Comparator)9100%n/a010401
contains(Object)8100%2100%020101
slice(BTree.Dir)7100%n/a010101
indexOf(Object)7100%n/a010101
of(Comparator, Object)7100%n/a010101
wrap(Object[], Comparator)6100%n/a010101
empty(Comparator)6100%n/a010101
get(int)5100%n/a010101
builder(Comparator)5100%n/a010101
size()4100%n/a010101
isEmpty()4100%n/a010101
iterator()4100%n/a010101
first()4100%n/a010101