DoubleArrays

Source file "it/unimi/dsi/fastutil/doubles/DoubleArrays.java" was not found during generation of report.

Element	Missed Instructions	Cov.	Missed Branches	Cov.	Missed	Cxty	Missed	Lines	Missed	Methods
Total	3,383 of 3,383	0%	364 of 364	0%	236	236	591	591	54	54
radixSort(double[][], int, int)		0%		0%	17	17	56	56	1	1
radixSortIndirect(int[], double[], double[], int, int, boolean)		0%		0%	19	19	59	59	1	1
radixSortIndirect(int[], double[], int, int, boolean)		0%		0%	17	17	56	56	1	1
radixSort(double[], double[], int, int)		0%		0%	14	14	58	58	1	1
radixSort(double[], int, int)		0%		0%	12	12	50	50	1	1
quickSort(double[], int, int, DoubleComparator)		0%		0%	13	13	32	32	1	1
quickSort(double[], int, int)		0%		0%	13	13	32	32	1	1
selectionSort(double[][], int, int, int)		0%		0%	8	8	17	17	1	1
mergeSort(double[], int, int, DoubleComparator, double[])		0%		0%	7	7	14	14	1	1
mergeSort(double[], int, int, double[])		0%		0%	7	7	14	14	1	1
selectionSort(double[], double[], int, int)		0%		0%	7	7	12	12	1	1
insertionSortIndirect(int[], double[], double[], int, int)		0%		0%	6	6	11	11	1	1
insertionSortIndirect(int[], double[], int, int)		0%		0%	4	4	11	11	1	1
med3(double[], int, int, int, DoubleComparator)		0%		0%	6	6	4	4	1	1
selectionSort(double[], int, int, DoubleComparator)		0%		0%	5	5	8	8	1	1
insertionSort(double[], int, int, DoubleComparator)		0%		0%	4	4	11	11	1	1
selectionSort(double[], int, int)		0%		0%	5	5	8	8	1	1
insertionSort(double[], int, int)		0%		0%	4	4	11	11	1	1
med3(double[], int, int, int)		0%		0%	6	6	4	4	1	1
binarySearch(double[], int, int, double, DoubleComparator)		0%		0%	4	4	10	10	1	1
binarySearch(double[], int, int, double)		0%		0%	4	4	9	9	1	1
shuffle(double[], int, int, Random)		0%		0%	2	2	7	7	1	1
reverse(double[])		0%		0%	2	2	7	7	1	1
grow(double[], int)		0%		0%	2	2	6	6	1	1
grow(double[], int, int)		0%		0%	2	2	6	6	1	1
shuffle(double[], Random)		0%		0%	2	2	7	7	1	1
fill(double[], int, int, double)		0%		0%	4	4	4	4	1	1
equals(double[], double[])		0%		0%	4	4	4	4	1	1
trim(double[], int)		0%		0%	3	3	4	4	1	1
copy(double[], int, int)		0%		0%	2	2	4	4	1	1
ensureCapacity(double[], int)		0%		0%	2	2	5	5	1	1
setLength(double[], int)		0%		0%	3	3	3	3	1	1
ensureCapacity(double[], int, int)		0%		0%	2	2	5	5	1	1
swap(double[], int, int)		0%		n/a	1	1	4	4	1	1
vecSwap(double[], int, int, int)		0%		0%	2	2	2	2	1	1
fixDouble(double)		0%		0%	2	2	2	2	1	1
fill(double[], double)		0%		0%	2	2	3	3	1	1
mergeSort(double[], int, int, DoubleComparator)		0%		n/a	1	1	2	2	1	1
radixSortIndirect(int[], double[], double[], boolean)		0%		n/a	1	1	2	2	1	1
static {...}		0%		n/a	1	1	2	2	1	1
mergeSort(double[], int, int)		0%		n/a	1	1	2	2	1	1
binarySearch(double[], double, DoubleComparator)		0%		n/a	1	1	1	1	1	1
radixSortIndirect(int[], double[], boolean)		0%		n/a	1	1	2	2	1	1
radixSort(double[][])		0%		n/a	1	1	2	2	1	1
quickSort(double[], DoubleComparator)		0%		n/a	1	1	2	2	1	1
mergeSort(double[], DoubleComparator)		0%		n/a	1	1	2	2	1	1
binarySearch(double[], double)		0%		n/a	1	1	1	1	1	1
radixSort(double[], double[])		0%		n/a	1	1	2	2	1	1
ensureFromTo(double[], int, int)		0%		n/a	1	1	2	2	1	1
ensureOffsetLength(double[], int, int)		0%		n/a	1	1	2	2	1	1
quickSort(double[])		0%		n/a	1	1	2	2	1	1
mergeSort(double[])		0%		n/a	1	1	2	2	1	1
radixSort(double[])		0%		n/a	1	1	2	2	1	1
copy(double[])		0%		n/a	1	1	1	1	1	1