Source file "it/unimi/dsi/fastutil/ints/IntAVLTreeSet.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,665 of 1,665 | 0% | 254 of 254 | 0% | 164 | 164 | 427 | 427 | 37 | 37 |
| remove(int) | | 0% | | 0% | 57 | 57 | 157 | 157 | 1 | 1 |
| add(int) | | 0% | | 0% | 29 | 29 | 106 | 106 | 1 | 1 |
| clone() | | 0% | | 0% | 8 | 8 | 37 | 37 | 1 | 1 |
| readTree(ObjectInputStream, int, IntAVLTreeSet.Entry, IntAVLTreeSet.Entry) | | 0% | | 0% | 4 | 4 | 20 | 20 | 1 | 1 |
| parent(IntAVLTreeSet.Entry) | | 0% | | 0% | 10 | 10 | 16 | 16 | 1 | 1 |
| readObject(ObjectInputStream) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| locateKey(int) | | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| findKey(int) | | 0% | | 0% | 4 | 4 | 4 | 4 | 1 | 1 |
| IntAVLTreeSet(int[], int, int, Comparator) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| compare(int, int) | | 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 |
| IntAVLTreeSet(int[], Comparator) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| IntAVLTreeSet(int[]) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| IntAVLTreeSet(IntIterator) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| clear() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| IntAVLTreeSet() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| firstInt() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| lastInt() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| IntAVLTreeSet(SortedSet) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| IntAVLTreeSet(IntSortedSet) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| headSet(int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| tailSet(int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| subSet(int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| IntAVLTreeSet(Comparator) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| contains(int) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| IntAVLTreeSet(Collection) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| IntAVLTreeSet(IntCollection) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| IntAVLTreeSet(int[], int, int) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| isEmpty() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| iterator(int) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| IntAVLTreeSet(Iterator) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| allocatePaths() | | 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(IntAVLTreeSet.Entry) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |