Source file "it/unimi/dsi/fastutil/bytes/Byte2ShortRBTreeMap.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 2,157 of 2,157 | 0% | 262 of 262 | 0% | 169 | 169 | 406 | 406 | 38 | 38 |
| remove(byte) | | 0% | | 0% | 65 | 65 | 149 | 149 | 1 | 1 |
| put(byte, short) | | 0% | | 0% | 28 | 28 | 93 | 93 | 1 | 1 |
| clone() | | 0% | | 0% | 8 | 8 | 40 | 40 | 1 | 1 |
| readTree(ObjectInputStream, int, Byte2ShortRBTreeMap.Entry, Byte2ShortRBTreeMap.Entry) | | 0% | | 0% | 4 | 4 | 23 | 23 | 1 | 1 |
| Byte2ShortRBTreeMap(byte[], short[], Comparator) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| readObject(ObjectInputStream) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| locateKey(byte) | | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| writeObject(ObjectOutputStream) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| findKey(byte) | | 0% | | 0% | 4 | 4 | 3 | 3 | 1 | 1 |
| containsValue(short) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| clear() | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| compare(byte, byte) | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| setActualComparator() | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| put(Byte, Short) | | 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(byte) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| byte2ShortEntrySet() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| values() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| Byte2ShortRBTreeMap() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| firstByteKey() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| lastByteKey() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| allocatePaths() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| headMap(byte) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| tailMap(byte) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| subMap(byte, byte) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| Byte2ShortRBTreeMap(Comparator) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| Byte2ShortRBTreeMap(SortedMap) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| Byte2ShortRBTreeMap(Byte2ShortSortedMap) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| containsKey(byte) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| isEmpty() | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 | |
| Byte2ShortRBTreeMap(Map) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| Byte2ShortRBTreeMap(Byte2ShortMap) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| Byte2ShortRBTreeMap(byte[], short[]) | 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(Byte2ShortRBTreeMap.Entry, int, int) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| checkNodePath() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |