Source file "it/unimi/dsi/fastutil/shorts/ShortRBTreeSet.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 2,040 of 2,040 | 0% | 250 of 250 | 0% | 162 | 162 | 388 | 388 | 37 | 37 |
| remove(short) | | 0% | | 0% | 65 | 65 | 147 | 147 | 1 | 1 |
| add(short) | | 0% | | 0% | 28 | 28 | 89 | 89 | 1 | 1 |
| clone() | | 0% | | 0% | 8 | 8 | 37 | 37 | 1 | 1 |
| readTree(ObjectInputStream, int, ShortRBTreeSet.Entry, ShortRBTreeSet.Entry) | | 0% | | 0% | 4 | 4 | 22 | 22 | 1 | 1 |
| readObject(ObjectInputStream) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| locateKey(short) | | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| findKey(short) | | 0% | | 0% | 4 | 4 | 4 | 4 | 1 | 1 |
| ShortRBTreeSet(short[], int, int, Comparator) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| compare(short, short) | | 0% | | 0% | 4 | 4 | 1 | 1 | 1 | 1 |
| setActualComparator() | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| writeObject(ObjectOutputStream) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| ShortRBTreeSet(short[], Comparator) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| ShortRBTreeSet(short[]) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| ShortRBTreeSet(ShortIterator) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| clear() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| ShortRBTreeSet() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| firstShort() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| lastShort() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| ShortRBTreeSet(SortedSet) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| ShortRBTreeSet(ShortSortedSet) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| allocatePaths() | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| headSet(short) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| tailSet(short) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| subSet(short, short) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| ShortRBTreeSet(Comparator) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| contains(short) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| ShortRBTreeSet(Collection) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| ShortRBTreeSet(ShortCollection) | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | ||
| ShortRBTreeSet(short[], int, int) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| isEmpty() | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 | |
| iterator(short) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| ShortRBTreeSet(Iterator) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| iterator() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| size() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| comparator() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| checkTree(ShortRBTreeSet.Entry, int, int) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| checkNodePath() | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |