Source file "it/unimi/dsi/fastutil/doubles/Double2CharRBTreeMap.java" was not found during generation of report.
Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
Total | 2,149 of 2,149 | 0% | 258 of 258 | 0% | 167 | 167 | 406 | 406 | 38 | 38 |
remove(double) | ![]() | 0% | ![]() | 0% | 65 | 65 | 149 | 149 | 1 | 1 |
put(double, char) | ![]() | 0% | ![]() | 0% | 28 | 28 | 93 | 93 | 1 | 1 |
clone() | ![]() | 0% | ![]() | 0% | 8 | 8 | 40 | 40 | 1 | 1 |
readTree(ObjectInputStream, int, Double2CharRBTreeMap.Entry, Double2CharRBTreeMap.Entry) | ![]() | 0% | ![]() | 0% | 4 | 4 | 23 | 23 | 1 | 1 |
Double2CharRBTreeMap(double[], char[], Comparator) | ![]() | 0% | ![]() | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
readObject(ObjectInputStream) | ![]() | 0% | ![]() | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
locateKey(double) | ![]() | 0% | ![]() | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
writeObject(ObjectOutputStream) | ![]() | 0% | ![]() | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
findKey(double) | ![]() | 0% | ![]() | 0% | 4 | 4 | 3 | 3 | 1 | 1 |
containsValue(char) | ![]() | 0% | ![]() | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
clear() | ![]() | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
setActualComparator() | ![]() | 0% | ![]() | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
put(Double, Character) | ![]() | 0% | ![]() | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
remove(Object) | ![]() | 0% | ![]() | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
compare(double, double) | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
keySet() | ![]() | 0% | ![]() | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
get(double) | ![]() | 0% | ![]() | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
double2CharEntrySet() | ![]() | 0% | ![]() | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
values() | ![]() | 0% | ![]() | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
Double2CharRBTreeMap() | ![]() | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
firstDoubleKey() | ![]() | 0% | ![]() | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
lastDoubleKey() | ![]() | 0% | ![]() | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
allocatePaths() | ![]() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
headMap(double) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
tailMap(double) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
subMap(double, double) | ![]() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
Double2CharRBTreeMap(Comparator) | ![]() | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
Double2CharRBTreeMap(SortedMap) | ![]() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
Double2CharRBTreeMap(Double2CharSortedMap) | ![]() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
containsKey(double) | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
isEmpty() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | 1 | 1 | |
Double2CharRBTreeMap(Map) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
Double2CharRBTreeMap(Double2CharMap) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
Double2CharRBTreeMap(double[], char[]) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
size() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
comparator() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
checkTree(Double2CharRBTreeMap.Entry, int, int) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
checkNodePath() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |