Source file "it/unimi/dsi/fastutil/longs/LongRBTreeSet.java" was not found during generation of report.
Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
Total | 2,042 of 2,042 | 0% | 250 of 250 | 0% | 162 | 162 | 388 | 388 | 37 | 37 |
remove(long) | ![]() | 0% | ![]() | 0% | 65 | 65 | 147 | 147 | 1 | 1 |
add(long) | ![]() | 0% | ![]() | 0% | 28 | 28 | 89 | 89 | 1 | 1 |
clone() | ![]() | 0% | ![]() | 0% | 8 | 8 | 37 | 37 | 1 | 1 |
readTree(ObjectInputStream, int, LongRBTreeSet.Entry, LongRBTreeSet.Entry) | ![]() | 0% | ![]() | 0% | 4 | 4 | 22 | 22 | 1 | 1 |
readObject(ObjectInputStream) | ![]() | 0% | ![]() | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
locateKey(long) | ![]() | 0% | ![]() | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
findKey(long) | ![]() | 0% | ![]() | 0% | 4 | 4 | 4 | 4 | 1 | 1 |
LongRBTreeSet(long[], int, int, Comparator) | ![]() | 0% | ![]() | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
compare(long, long) | ![]() | 0% | ![]() | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
setActualComparator() | ![]() | 0% | ![]() | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
writeObject(ObjectOutputStream) | ![]() | 0% | ![]() | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
LongRBTreeSet(long[], Comparator) | ![]() | 0% | ![]() | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
LongRBTreeSet(long[]) | ![]() | 0% | ![]() | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
LongRBTreeSet(LongIterator) | ![]() | 0% | ![]() | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
clear() | ![]() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
LongRBTreeSet() | ![]() | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
firstLong() | ![]() | 0% | ![]() | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
lastLong() | ![]() | 0% | ![]() | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
LongRBTreeSet(SortedSet) | ![]() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
LongRBTreeSet(LongSortedSet) | ![]() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
allocatePaths() | ![]() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
headSet(long) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
tailSet(long) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
subSet(long, long) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
LongRBTreeSet(Comparator) | ![]() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
contains(long) | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
LongRBTreeSet(Collection) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
LongRBTreeSet(LongCollection) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
LongRBTreeSet(long[], int, int) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
isEmpty() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | 1 | 1 | |
iterator(long) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
LongRBTreeSet(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(LongRBTreeSet.Entry, int, int) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
checkNodePath() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |