Source file "it/unimi/dsi/fastutil/doubles/DoubleRBTreeSet.java" was not found during generation of report.
Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
Total | 2,032 of 2,032 | 0% | 246 of 246 | 0% | 160 | 160 | 388 | 388 | 37 | 37 |
remove(double) | ![]() | 0% | ![]() | 0% | 65 | 65 | 147 | 147 | 1 | 1 |
add(double) | ![]() | 0% | ![]() | 0% | 28 | 28 | 89 | 89 | 1 | 1 |
clone() | ![]() | 0% | ![]() | 0% | 8 | 8 | 37 | 37 | 1 | 1 |
readTree(ObjectInputStream, int, DoubleRBTreeSet.Entry, DoubleRBTreeSet.Entry) | ![]() | 0% | ![]() | 0% | 4 | 4 | 22 | 22 | 1 | 1 |
readObject(ObjectInputStream) | ![]() | 0% | ![]() | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
locateKey(double) | ![]() | 0% | ![]() | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
findKey(double) | ![]() | 0% | ![]() | 0% | 4 | 4 | 4 | 4 | 1 | 1 |
DoubleRBTreeSet(double[], int, int, Comparator) | ![]() | 0% | ![]() | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
setActualComparator() | ![]() | 0% | ![]() | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
writeObject(ObjectOutputStream) | ![]() | 0% | ![]() | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
DoubleRBTreeSet(double[], Comparator) | ![]() | 0% | ![]() | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
DoubleRBTreeSet(double[]) | ![]() | 0% | ![]() | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
DoubleRBTreeSet(DoubleIterator) | ![]() | 0% | ![]() | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
compare(double, double) | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
clear() | ![]() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
DoubleRBTreeSet() | ![]() | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
firstDouble() | ![]() | 0% | ![]() | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
lastDouble() | ![]() | 0% | ![]() | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
DoubleRBTreeSet(SortedSet) | ![]() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
DoubleRBTreeSet(DoubleSortedSet) | ![]() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
allocatePaths() | ![]() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
headSet(double) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
tailSet(double) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
subSet(double, double) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
DoubleRBTreeSet(Comparator) | ![]() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
contains(double) | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
DoubleRBTreeSet(Collection) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
DoubleRBTreeSet(DoubleCollection) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
DoubleRBTreeSet(double[], int, int) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
isEmpty() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | 1 | 1 | |
iterator(double) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
DoubleRBTreeSet(Iterator) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
iterator() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
size() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
comparator() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
checkTree(DoubleRBTreeSet.Entry, int, int) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
checkNodePath() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |