Source file "it/unimi/dsi/fastutil/doubles/Double2BooleanRBTreeMap.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, boolean) | | 0% | | 0% | 28 | 28 | 93 | 93 | 1 | 1 |
| clone() | | 0% | | 0% | 8 | 8 | 40 | 40 | 1 | 1 |
| readTree(ObjectInputStream, int, Double2BooleanRBTreeMap.Entry, Double2BooleanRBTreeMap.Entry) | | 0% | | 0% | 4 | 4 | 23 | 23 | 1 | 1 |
| Double2BooleanRBTreeMap(double[], boolean[], 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(boolean) | | 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, Boolean) | | 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 |
| double2BooleanEntrySet() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| values() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| Double2BooleanRBTreeMap() | | 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 | |
| Double2BooleanRBTreeMap(Comparator) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| Double2BooleanRBTreeMap(SortedMap) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| Double2BooleanRBTreeMap(Double2BooleanSortedMap) | | 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 | |
| Double2BooleanRBTreeMap(Map) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| Double2BooleanRBTreeMap(Double2BooleanMap) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| Double2BooleanRBTreeMap(double[], boolean[]) | 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(Double2BooleanRBTreeMap.Entry, int, int) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| checkNodePath() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |