Source file "it/unimi/dsi/fastutil/doubles/DoubleAVLTreeSet.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,657 of 1,657 | 0% | 250 of 250 | 0% | 162 | 162 | 427 | 427 | 37 | 37 |
| remove(double) | | 0% | | 0% | 57 | 57 | 157 | 157 | 1 | 1 |
| add(double) | | 0% | | 0% | 29 | 29 | 106 | 106 | 1 | 1 |
| clone() | | 0% | | 0% | 8 | 8 | 37 | 37 | 1 | 1 |
| readTree(ObjectInputStream, int, DoubleAVLTreeSet.Entry, DoubleAVLTreeSet.Entry) | | 0% | | 0% | 4 | 4 | 20 | 20 | 1 | 1 |
| parent(DoubleAVLTreeSet.Entry) | | 0% | | 0% | 10 | 10 | 16 | 16 | 1 | 1 |
| readObject(ObjectInputStream) | | 0% | | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
| locateKey(double) | | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| findKey(double) | | 0% | | 0% | 4 | 4 | 4 | 4 | 1 | 1 |
| DoubleAVLTreeSet(double[], int, int, Comparator) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| setActualComparator() | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| writeObject(ObjectOutputStream) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| DoubleAVLTreeSet(double[], Comparator) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| DoubleAVLTreeSet(double[]) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| DoubleAVLTreeSet(DoubleIterator) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| compare(double, double) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| clear() | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| DoubleAVLTreeSet() | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| firstDouble() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| lastDouble() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| DoubleAVLTreeSet(SortedSet) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| DoubleAVLTreeSet(DoubleSortedSet) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| headSet(double) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| tailSet(double) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| subSet(double, double) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| DoubleAVLTreeSet(Comparator) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| contains(double) | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| DoubleAVLTreeSet(Collection) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| DoubleAVLTreeSet(DoubleCollection) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| DoubleAVLTreeSet(double[], int, int) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| isEmpty() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| iterator(double) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| DoubleAVLTreeSet(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(DoubleAVLTreeSet.Entry) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |