Source file "it/unimi/dsi/fastutil/objects/Object2BooleanRBTreeMap.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 2,143 of 2,143 | 0% | 256 of 256 | 0% | 167 | 167 | 407 | 407 | 39 | 39 |
| removeBoolean(Object) | | 0% | | 0% | 65 | 65 | 149 | 149 | 1 | 1 |
| put(Object, boolean) | | 0% | | 0% | 28 | 28 | 93 | 93 | 1 | 1 |
| clone() | | 0% | | 0% | 8 | 8 | 40 | 40 | 1 | 1 |
| readTree(ObjectInputStream, int, Object2BooleanRBTreeMap.Entry, Object2BooleanRBTreeMap.Entry) | | 0% | | 0% | 4 | 4 | 23 | 23 | 1 | 1 |
| Object2BooleanRBTreeMap(Object[], boolean[], Comparator) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| readObject(ObjectInputStream) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| locateKey(Object) | | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| writeObject(ObjectOutputStream) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| findKey(Object) | | 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 | |
| compare(Object, Object) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| put(Object, Boolean) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| keySet() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| remove(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| getBoolean(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| object2BooleanEntrySet() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| values() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| Object2BooleanRBTreeMap() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| get(Object) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| firstKey() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| lastKey() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| allocatePaths() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| headMap(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| tailMap(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| subMap(Object, Object) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| Object2BooleanRBTreeMap(Comparator) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| Object2BooleanRBTreeMap(SortedMap) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| Object2BooleanRBTreeMap(Object2BooleanSortedMap) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| containsKey(Object) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| isEmpty() | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 | |
| Object2BooleanRBTreeMap(Map) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| Object2BooleanRBTreeMap(Object2BooleanMap) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| Object2BooleanRBTreeMap(Object[], boolean[]) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| setActualComparator() | 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(Object2BooleanRBTreeMap.Entry, int, int) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| checkNodePath() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |