Class files must be compiled with debug information to show line coverage.
Class files must be compiled with debug information to link with source files.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Methods |
| Total | 1,278 of 1,278 | 0% | 160 of 160 | 0% | 130 | 130 | 50 | 50 |
| replaceFromToWithFromTo(int, int, ObjectArrayList, int, int) | | 0% | | 0% | 8 | 8 | 1 | 1 |
| equals(Object, boolean) | | 0% | | 0% | 13 | 13 | 1 | 1 |
| retainAll(ObjectArrayList, boolean) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| beforeInsert(int, Object) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| removeAll(ObjectArrayList, boolean) | | 0% | | 0% | 5 | 5 | 1 | 1 |
| beforeInsertDummies(int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| removeFromTo(int, int) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| shuffleFromTo(int, int) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| indexOfFromTo(Object, int, int, boolean) | | 0% | | 0% | 8 | 8 | 1 | 1 |
| lastIndexOfFromTo(Object, int, int, boolean) | | 0% | | 0% | 8 | 8 | 1 | 1 |
| binarySearchFromTo(Object, int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| toArray(Object[]) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| reverse() | | 0% | | 0% | 2 | 2 | 1 | 1 |
| isSortedFromTo(int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| partFromTo(int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| replaceFromWith(int, Collection) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| replaceFromToWithFrom(int, int, ObjectArrayList, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| set(int, Object) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| get(int) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| toList() | | 0% | | 0% | 2 | 2 | 1 | 1 |
| add(Object) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| times(int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| forEach(ObjectProcedure) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| beforeInsertAllOfFromTo(int, ObjectArrayList, int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSortFromTo(int, int, Comparator) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| quickSortFromTo(int, int, Comparator) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| delete(Object, boolean) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| fillFromToWith(int, int, Object) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| mergeSortFromTo(int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| quickSortFromTo(int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| contains(Object, boolean) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| clone() | | 0% | n/a | 1 | 1 | 1 | 1 | |
| indexOf(Object, boolean) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| lastIndexOf(Object, boolean) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| toString() | | 0% | n/a | 1 | 1 | 1 | 1 | |
| binarySearch(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| elements(Object[]) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| ObjectArrayList(int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| addAllOfFromTo(ObjectArrayList, int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| binarySearchFromTo(Object, int, int, Comparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| trimToSize() | | 0% | n/a | 1 | 1 | 1 | 1 | |
| ObjectArrayList(Object[]) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| ensureCapacity(int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| setQuick(int, Object) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| equals(Object) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| getQuick(int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| ObjectArrayList() | | 0% | n/a | 1 | 1 | 1 | 1 | |
| copy() | | 0% | n/a | 1 | 1 | 1 | 1 | |
| elements() | | 0% | n/a | 1 | 1 | 1 | 1 | |
| size() | | 0% | n/a | 1 | 1 | 1 | 1 |