IntIndex

ElementMissed InstructionsCov.Missed BranchesCov.MissedCxtyMissedLinesMissedMethods
Total921 of 9210%126 of 1260%99992382383636
quickSort(int, int)920%140%88222211
fastQuickSort()680%40%33161611
findFirstConsecutiveKeys(int)580%140%88151511
addUnique(int)550%100%66151511
add(int)500%80%55131311
binaryFirstSearch()500%80%55171711
addUnsorted(int)440%100%66101011
addSorted(int)400%80%55101011
binaryEmptySlotSearch()380%60%44131311
binarySlotSearch()340%40%33111111
partition(int, int, int)310%40%338811
insertionSort(int, int)310%80%557711
remove(int)250%n/a114411
removeFirstConsecutiveKeys(int, int)220%20%226611
getTotalValues()200%20%224411
moveAndInsertRow(int, int)200%n/a114411
compare(int)200%40%335511
IntIndex(int, boolean)190%n/a117711
setKey(int, int)190%40%335511
swap(int, int)190%n/a114411
removeRange(int, int)190%n/a113311
findFirstIndexUnsorted(int)180%40%334411
fastQuickSortRecursive()180%n/a114411
doubleCapacity()170%n/a113311
getKey(int)150%40%333311
lessThan(int, int)130%20%221111
findFirstGreaterEqualKeyIndex(int)120%20%224411
findFirstEqualKeyIndex(int)110%20%224411
findFirstGreaterEqualSlotIndex(int)110%20%224411
moveRows(int, int, int)90%n/a112211
removeAll()80%n/a113311
size()30%n/a111111
capacity()30%n/a111111
getKeys()30%n/a111111
clear()30%n/a112211
sort()30%n/a112211