Source file "it/unimi/dsi/fastutil/longs/Long2IntRBTreeMap.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 2,159 of 2,159 | 0% | 262 of 262 | 0% | 169 | 169 | 406 | 406 | 38 | 38 |
| remove(long) | 0% | 0% | 65 | 65 | 149 | 149 | 1 | 1 | ||
| put(long, int) | 0% | 0% | 28 | 28 | 93 | 93 | 1 | 1 | ||
| clone() | 0% | 0% | 8 | 8 | 40 | 40 | 1 | 1 | ||
| readTree(ObjectInputStream, int, Long2IntRBTreeMap.Entry, Long2IntRBTreeMap.Entry) | 0% | 0% | 4 | 4 | 23 | 23 | 1 | 1 | ||
| Long2IntRBTreeMap(long[], int[], Comparator) | 0% | 0% | 3 | 3 | 4 | 4 | 1 | 1 | ||
| readObject(ObjectInputStream) | 0% | 0% | 4 | 4 | 12 | 12 | 1 | 1 | ||
| locateKey(long) | 0% | 0% | 5 | 5 | 6 | 6 | 1 | 1 | ||
| writeObject(ObjectOutputStream) | 0% | 0% | 2 | 2 | 8 | 8 | 1 | 1 | ||
| findKey(long) | 0% | 0% | 4 | 4 | 3 | 3 | 1 | 1 | ||
| compare(long, long) | 0% | 0% | 4 | 4 | 1 | 1 | 1 | 1 | ||
| containsValue(int) | 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(Long, Integer) | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| remove(Object) | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| keySet() | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| get(long) | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| long2IntEntrySet() | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| values() | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| Long2IntRBTreeMap() | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | ||
| firstLongKey() | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| lastLongKey() | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| allocatePaths() | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| headMap(long) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| tailMap(long) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| subMap(long, long) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| Long2IntRBTreeMap(Comparator) | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| Long2IntRBTreeMap(SortedMap) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| Long2IntRBTreeMap(Long2IntSortedMap) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| containsKey(long) | 0% | 0% | 2 | 2 | 1 | 1 | 1 | 1 | ||
| isEmpty() | 0% | 0% | 2 | 2 | 1 | 1 | 1 | 1 | ||
| Long2IntRBTreeMap(Map) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| Long2IntRBTreeMap(Long2IntMap) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| Long2IntRBTreeMap(long[], int[]) | 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(Long2IntRBTreeMap.Entry, int, int) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| checkNodePath() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |