Source file "it/unimi/dsi/fastutil/bytes/Byte2DoubleAVLTreeMap.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,790 of 1,790 | 0% | 266 of 266 | 0% | 171 | 171 | 448 | 448 | 38 | 38 |
| remove(byte) | | 0% | | 0% | 57 | 57 | 159 | 159 | 1 | 1 |
| put(byte, double) | | 0% | | 0% | 29 | 29 | 113 | 113 | 1 | 1 |
| clone() | | 0% | | 0% | 8 | 8 | 40 | 40 | 1 | 1 |
| readTree(ObjectInputStream, int, Byte2DoubleAVLTreeMap.Entry, Byte2DoubleAVLTreeMap.Entry) | | 0% | | 0% | 4 | 4 | 21 | 21 | 1 | 1 |
| parent(Byte2DoubleAVLTreeMap.Entry) | | 0% | | 0% | 10 | 10 | 16 | 16 | 1 | 1 |
| Byte2DoubleAVLTreeMap(byte[], double[], 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(double) | | 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, Double) | | 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 |
| byte2DoubleEntrySet() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| values() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| Byte2DoubleAVLTreeMap() | | 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 |
| 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 | |
| Byte2DoubleAVLTreeMap(Comparator) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| Byte2DoubleAVLTreeMap(SortedMap) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| Byte2DoubleAVLTreeMap(Byte2DoubleSortedMap) | | 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 |
| Byte2DoubleAVLTreeMap(Map) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| Byte2DoubleAVLTreeMap(Byte2DoubleMap) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| Byte2DoubleAVLTreeMap(byte[], double[]) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| allocatePaths() | | 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(Byte2DoubleAVLTreeMap.Entry) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |