/* * Copyright (c) 2009, 2019, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions.
*/
privatestaticfinal PrintStream out = System.out; privatestaticfinal PrintStream err = System.err;
// Array lengths used in a long run (default) privatestaticfinalint[] LONG_RUN_LENGTHS = {
1, 3, 8, 21, 55, 100, 1_000, 10_000, 100_000 };
// Array lengths used in a short run privatestaticfinalint[] SHORT_RUN_LENGTHS = {
1, 8, 55, 100, 10_000 };
// Random initial values used in a long run (default) privatestaticfinal TestRandom[] LONG_RUN_RANDOMS = {
TestRandom.BABA, TestRandom.DEDA, TestRandom.C0FFEE };
// Random initial values used in a short run privatestaticfinal TestRandom[] SHORT_RUN_RANDOMS = {
TestRandom.C0FFEE };
// Constants used in subarray sorting privatestaticfinalint A380 = 0xA380; privatestaticfinalint B747 = 0xB747;
new Sorting(SortingHelper.DUAL_PIVOT_QUICKSORT, randoms, lengths).testCore(); new Sorting(SortingHelper.PARALLEL_SORT, randoms, lengths).testCore(); new Sorting(SortingHelper.HEAP_SORT, randoms, lengths).testBasic(); new Sorting(SortingHelper.ARRAYS_SORT, randoms, lengths).testAll(); new Sorting(SortingHelper.ARRAYS_PARALLEL_SORT, randoms, lengths).testAll();
long end = System.currentTimeMillis();
out.format("PASSED in %d sec.\n", (end - start) / 1000);
}
privatevoid testSubArray(int length, TestRandom random) { if (length < 4) { return;
} for (int m = 1; m < length / 2; m <<= 1) { int fromIndex = m; int toIndex = length - m;
for (int i = 0; i < test.length; i++) {
printTestName("Test subarray", random, length, ", m = " + m + ", " + getType(i));
sortingHelper.sort(test[i], fromIndex, toIndex);
checkSubArray(test[i], fromIndex, toIndex);
}
}
out.println();
}
privatevoid testRange(int length, TestRandom random) { if (length < 2) { return;
} for (int m = 1; m < length; m <<= 1) { for (int i = 1; i <= length; i++) {
((int[]) gold[0]) [i - 1] = i % m + m % i;
}
convertData(length);
for (int i = 0; i < test.length; i++) {
printTestName("Test range check", random, length, ", m = " + m + ", " + getType(i));
checkRange(test[i], m);
}
}
out.println();
}
privatevoid checkSorted(Pair[] a) { for (int i = 0; i < a.length - 1; i++) { if (a[i].getKey() > a[i + 1].getKey()) {
fail("Array is not sorted at " + i + "-th position: " +
a[i].getKey() + " and " + a[i + 1].getKey());
}
}
}
privatevoid checkStable(Pair[] a) { for (int i = 0; i < a.length / 4; ) { int key1 = a[i].getKey(); int value1 = a[i++].getValue(); int key2 = a[i].getKey(); int value2 = a[i++].getValue(); int key3 = a[i].getKey(); int value3 = a[i++].getValue(); int key4 = a[i].getKey(); int value4 = a[i++].getValue();
if (!(key1 == key2 && key2 == key3 && key3 == key4)) {
fail("Keys are different " + key1 + ", " + key2 + ", " +
key3 + ", " + key4 + " at position " + i);
} if (!(value1 < value2 && value2 < value3 && value3 < value4)) {
fail("Sorting is not stable at position " + i + ". Second values have been changed: " + value1 + ", " +
value2 + ", " + value3 + ", " + value4);
}
}
}
private Pair[] build(int length, Random random) {
Pair[] a = new Pair[length * 4];
for (int i = 0; i < a.length; ) { int key = random.nextInt();
a[i++] = new Pair(key, 1);
a[i++] = new Pair(key, 2);
a[i++] = new Pair(key, 3);
a[i++] = new Pair(key, 4);
} return a;
}
privatevoid testWithInsertionSort(int length, TestRandom random) { if (length > 1000) { return;
} for (int m = 1; m <= length; m <<= 1) { for (UnsortedBuilder builder : UnsortedBuilder.values()) {
builder.build((int[]) gold[0], m, random);
convertData(length);
for (int i = 0; i < test.length; i++) {
printTestName("Test with insertion sort", random, length, ", m = " + m + ", " + getType(i) + " " + builder);
sortingHelper.sort(test[i]);
sortByInsertionSort(gold[i]);
compare(test[i], gold[i]);
}
}
}
out.println();
}
for (int m = PERIOD - 2; m <= PERIOD + 2; m++) { for (MergingBuilder builder : MergingBuilder.values()) {
builder.build((int[]) gold[0], m);
convertData(length);
for (int i = 0; i < test.length; i++) {
printTestName("Test merging sort", random, length, ", m = " + m + ", " + getType(i) + " " + builder);
sortingHelper.sort(test[i]);
checkSorted(test[i]);
}
}
}
out.println();
}
privatevoid testWithCheckSum(int length, TestRandom random) { for (int m = 1; m <= length; m <<= 1) { for (UnsortedBuilder builder : UnsortedBuilder.values()) {
builder.build((int[]) gold[0], m, random);
convertData(length);
for (int i = 0; i < test.length; i++) {
printTestName("Test with check sum", random, length, ", m = " + m + ", " + getType(i) + " " + builder);
sortingHelper.sort(test[i]);
checkWithCheckSum(test[i], gold[i]);
}
}
}
out.println();
}
privatevoid testWithScrambling(int length, TestRandom random) { for (int m = 1; m <= length; m <<= 1) { for (SortedBuilder builder : SortedBuilder.values()) {
builder.build((int[]) gold[0], m);
convertData(length);
for (int i = 0; i < test.length; i++) {
printTestName("Test with scrambling", random, length, ", m = " + m + ", " + getType(i) + " " + builder);
scramble(test[i], random);
sortingHelper.sort(test[i]);
compare(test[i], gold[i]);
}
}
}
out.println();
}
privatevoid testNegativeZero(int length, TestRandom random) { for (int i = 5; i < test.length; i++) {
printTestName("Test negative zero -0.0", random, length, " " + getType(i));
privatevoid testFloatingPointSorting(int length, TestRandom random) { if (length < 2) { return;
} finalint MAX = 13;
for (int a = 0; a < MAX; a++) { for (int g = 0; g < MAX; g++) { for (int z = 0; z < MAX; z++) { for (int n = 0; n < MAX; n++) { for (int p = 0; p < MAX; p++) { if (a + g + z + n + p != length) { continue;
} for (int i = 5; i < test.length; i++) {
printTestName("Test float-pointing sorting", random, length, ", a = " + a + ", g = " + g + ", z = " + z + ", n = " + n + ", p = " + p + ", " + getType(i));
FloatingPointBuilder builder = FloatingPointBuilder.values()[i - 5];
builder.build(gold[i], a, g, z, n, p, random);
copy(test[i], gold[i]);
scramble(test[i], random);
sortingHelper.sort(test[i]);
compare(test[i], gold[i], a, n, g);
}
}
}
}
}
}
for (int m = 13; m > 4; m--) { int t = length / m; int g = t, z = t, n = t, p = t; int a = length - g - z - n - p;
for (int i = 5; i < test.length; i++) {
printTestName("Test float-pointing sorting", random, length, ", a = " + a + ", g = " + g + ", z = " + z + ", n = " + n + ", p = " + p + ", " + getType(i));
FloatingPointBuilder builder = FloatingPointBuilder.values() [i - 5];
builder.build(gold[i], a, g, z, n, p, random);
copy(test[i], gold[i]);
scramble(test[i], random);
sortingHelper.sort(test[i]);
compare(test[i], gold[i], a, n, g);
}
}
out.println();
}
privatevoid prepareSubArray(int[] a, int fromIndex, int toIndex) { for (int i = 0; i < fromIndex; i++) {
a[i] = A380;
} int middle = (fromIndex + toIndex) >>> 1; int k = 0;
for (int i = fromIndex; i < middle; i++) {
a[i] = k++;
}
for (int i = middle; i < toIndex; i++) {
a[i] = k--;
}
for (int i = toIndex; i < a.length; i++) {
a[i] = B747;
}
}
privatevoid scramble(Object a, Random random) { if (a instanceofint[]) {
scramble((int[]) a, random);
} elseif (a instanceoflong[]) {
scramble((long[]) a, random);
} elseif (a instanceofbyte[]) {
scramble((byte[]) a, random);
} elseif (a instanceofchar[]) {
scramble((char[]) a, random);
} elseif (a instanceofshort[]) {
scramble((short[]) a, random);
} elseif (a instanceoffloat[]) {
scramble((float[]) a, random);
} elseif (a instanceofdouble[]) {
scramble((double[]) a, random);
} else {
fail("Unknown type of array: " + a.getClass().getName());
}
}
privatevoid scramble(int[] a, Random random) { for (int i = 0; i < a.length * 7; i++) {
swap(a, random.nextInt(a.length), random.nextInt(a.length));
}
}
privatevoid scramble(long[] a, Random random) { for (int i = 0; i < a.length * 7; i++) {
swap(a, random.nextInt(a.length), random.nextInt(a.length));
}
}
privatevoid scramble(byte[] a, Random random) { for (int i = 0; i < a.length * 7; i++) {
swap(a, random.nextInt(a.length), random.nextInt(a.length));
}
}
privatevoid scramble(char[] a, Random random) { for (int i = 0; i < a.length * 7; i++) {
swap(a, random.nextInt(a.length), random.nextInt(a.length));
}
}
privatevoid scramble(short[] a, Random random) { for (int i = 0; i < a.length * 7; i++) {
swap(a, random.nextInt(a.length), random.nextInt(a.length));
}
}
privatevoid scramble(float[] a, Random random) { for (int i = 0; i < a.length * 7; i++) {
swap(a, random.nextInt(a.length), random.nextInt(a.length));
}
}
privatevoid scramble(double[] a, Random random) { for (int i = 0; i < a.length * 7; i++) {
swap(a, random.nextInt(a.length), random.nextInt(a.length));
}
}
privatevoid swap(int[] a, int i, int j) { int t = a[i]; a[i] = a[j]; a[j] = t;
}
privatevoid swap(long[] a, int i, int j) { long t = a[i]; a[i] = a[j]; a[j] = t;
}
privatevoid swap(byte[] a, int i, int j) { byte t = a[i]; a[i] = a[j]; a[j] = t;
}
privatevoid swap(char[] a, int i, int j) { char t = a[i]; a[i] = a[j]; a[j] = t;
}
privatevoid swap(short[] a, int i, int j) { short t = a[i]; a[i] = a[j]; a[j] = t;
}
privatevoid swap(float[] a, int i, int j) { float t = a[i]; a[i] = a[j]; a[j] = t;
}
privatevoid swap(double[] a, int i, int j) { double t = a[i]; a[i] = a[j]; a[j] = t;
}
privatevoid checkNegativeZero(Object a) { if (a instanceoffloat[]) {
checkNegativeZero((float[]) a);
} elseif (a instanceofdouble[]) {
checkNegativeZero((double[]) a);
} else {
fail("Unknown type of array: " + a.getClass().getName());
}
}
privatevoid checkNegativeZero(float[] a) { for (int i = 0; i < a.length - 1; i++) { if (Float.floatToRawIntBits(a[i]) == 0 && Float.floatToRawIntBits(a[i + 1]) < 0) {
fail(a[i] + " before " + a[i + 1] + " at position " + i);
}
}
}
privatevoid checkNegativeZero(double[] a) { for (int i = 0; i < a.length - 1; i++) { if (Double.doubleToRawLongBits(a[i]) == 0 && Double.doubleToRawLongBits(a[i + 1]) < 0) {
fail(a[i] + " before " + a[i + 1] + " at position " + i);
}
}
}
privatevoid compare(Object a, Object b, int numNaN, int numNeg, int numNegZero) { if (a instanceoffloat[]) {
compare((float[]) a, (float[]) b, numNaN, numNeg, numNegZero);
} elseif (a instanceofdouble[]) {
compare((double[]) a, (double[]) b, numNaN, numNeg, numNegZero);
} else {
fail("Unknown type of array: " + a.getClass().getName());
}
}
privatevoid compare(float[] a, float[] b, int numNaN, int numNeg, int numNegZero) { for (int i = a.length - numNaN; i < a.length; i++) { if (a[i] == a[i]) {
fail("There must be NaN instead of " + a[i] + " at position " + i);
}
} finalint NEGATIVE_ZERO = Float.floatToIntBits(-0.0f);
for (int i = numNeg; i < numNeg + numNegZero; i++) { if (NEGATIVE_ZERO != Float.floatToIntBits(a[i])) {
fail("There must be -0.0 instead of " + a[i] + " at position " + i);
}
}
for (int i = 0; i < a.length - numNaN; i++) { if (a[i] != b[i]) {
fail("There must be " + b[i] + " instead of " + a[i] + " at position " + i);
}
}
}
privatevoid compare(double[] a, double[] b, int numNaN, int numNeg, int numNegZero) { for (int i = a.length - numNaN; i < a.length; i++) { if (a[i] == a[i]) {
fail("There must be NaN instead of " + a[i] + " at position " + i);
}
} finallong NEGATIVE_ZERO = Double.doubleToLongBits(-0.0d);
for (int i = numNeg; i < numNeg + numNegZero; i++) { if (NEGATIVE_ZERO != Double.doubleToLongBits(a[i])) {
fail("There must be -0.0 instead of " + a[i] + " at position " + i);
}
}
for (int i = 0; i < a.length - numNaN; i++) { if (a[i] != b[i]) {
fail("There must be " + b[i] + " instead of " + a[i] + " at position " + i);
}
}
}
privatevoid compare(Object a, Object b) { if (a instanceofint[]) {
compare((int[]) a, (int[]) b);
} elseif (a instanceoflong[]) {
compare((long[]) a, (long[]) b);
} elseif (a instanceofbyte[]) {
compare((byte[]) a, (byte[]) b);
} elseif (a instanceofchar[]) {
compare((char[]) a, (char[]) b);
} elseif (a instanceofshort[]) {
compare((short[]) a, (short[]) b);
} elseif (a instanceoffloat[]) {
compare((float[]) a, (float[]) b);
} elseif (a instanceofdouble[]) {
compare((double[]) a, (double[]) b);
} else {
fail("Unknown type of array: " + a.getClass().getName());
}
}
privatevoid compare(int[] a, int[] b) { for (int i = 0; i < a.length; i++) { if (a[i] != b[i]) {
fail("There must be " + b[i] + " instead of " + a[i] + " at position " + i);
}
}
}
privatevoid compare(long[] a, long[] b) { for (int i = 0; i < a.length; i++) { if (a[i] != b[i]) {
fail("There must be " + b[i] + " instead of " + a[i] + " at position " + i);
}
}
}
privatevoid compare(byte[] a, byte[] b) { for (int i = 0; i < a.length; i++) { if (a[i] != b[i]) {
fail("There must be " + b[i] + " instead of " + a[i] + " at position " + i);
}
}
}
privatevoid compare(char[] a, char[] b) { for (int i = 0; i < a.length; i++) { if (a[i] != b[i]) {
fail("There must be " + b[i] + " instead of " + a[i] + " at position " + i);
}
}
}
privatevoid compare(short[] a, short[] b) { for (int i = 0; i < a.length; i++) { if (a[i] != b[i]) {
fail("There must be " + b[i] + " instead of " + a[i] + " at position " + i);
}
}
}
privatevoid compare(float[] a, float[] b) { for (int i = 0; i < a.length; i++) { if (a[i] != b[i]) {
fail("There must be " + b[i] + " instead of " + a[i] + " at position " + i);
}
}
}
privatevoid compare(double[] a, double[] b) { for (int i = 0; i < a.length; i++) { if (a[i] != b[i]) {
fail("There must be " + b[i] + " instead of " + a[i] + " at position " + i);
}
}
}
private String getType(int i) {
Object a = test[i];
if (a instanceofint[]) { return"INT ";
} if (a instanceoflong[]) { return"LONG ";
} if (a instanceofbyte[]) { return"BYTE ";
} if (a instanceofchar[]) { return"CHAR ";
} if (a instanceofshort[]) { return"SHORT ";
} if (a instanceoffloat[]) { return"FLOAT ";
} if (a instanceofdouble[]) { return"DOUBLE";
}
fail("Unknown type of array: " + a.getClass().getName()); returnnull;
}
privatevoid checkSorted(Object a) { if (a instanceofint[]) {
checkSorted((int[]) a);
} elseif (a instanceoflong[]) {
checkSorted((long[]) a);
} elseif (a instanceofbyte[]) {
checkSorted((byte[]) a);
} elseif (a instanceofchar[]) {
checkSorted((char[]) a);
} elseif (a instanceofshort[]) {
checkSorted((short[]) a);
} elseif (a instanceoffloat[]) {
checkSorted((float[]) a);
} elseif (a instanceofdouble[]) {
checkSorted((double[]) a);
} else {
fail("Unknown type of array: " + a.getClass().getName());
}
}
privatevoid checkSorted(int[] a) { for (int i = 0; i < a.length - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
}
privatevoid checkSorted(long[] a) { for (int i = 0; i < a.length - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
}
privatevoid checkSorted(byte[] a) { for (int i = 0; i < a.length - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
}
privatevoid checkSorted(char[] a) { for (int i = 0; i < a.length - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
}
privatevoid checkSorted(short[] a) { for (int i = 0; i < a.length - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
}
privatevoid checkSorted(float[] a) { for (int i = 0; i < a.length - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
}
privatevoid checkSorted(double[] a) { for (int i = 0; i < a.length - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
}
privatevoid checkCheckSum(Object test, Object gold) { if (checkSumXor(test) != checkSumXor(gold)) {
fail("Original and sorted arrays are not identical [^]");
} if (checkSumPlus(test) != checkSumPlus(gold)) {
fail("Original and sorted arrays are not identical [+]");
}
}
privateint checkSumXor(Object a) { if (a instanceofint[]) { return checkSumXor((int[]) a);
} if (a instanceoflong[]) { return checkSumXor((long[]) a);
} if (a instanceofbyte[]) { return checkSumXor((byte[]) a);
} if (a instanceofchar[]) { return checkSumXor((char[]) a);
} if (a instanceofshort[]) { return checkSumXor((short[]) a);
} if (a instanceoffloat[]) { return checkSumXor((float[]) a);
} if (a instanceofdouble[]) { return checkSumXor((double[]) a);
}
fail("Unknown type of array: " + a.getClass().getName()); return -1;
}
privateint checkSumXor(int[] a) { int checkSum = 0;
for (int e : a) {
checkSum ^= e;
} return checkSum;
}
privateint checkSumXor(long[] a) { long checkSum = 0;
for (long e : a) {
checkSum ^= e;
} return (int) checkSum;
}
privateint checkSumXor(byte[] a) { byte checkSum = 0;
for (byte e : a) {
checkSum ^= e;
} return (int) checkSum;
}
privateint checkSumXor(char[] a) { char checkSum = 0;
for (char e : a) {
checkSum ^= e;
} return (int) checkSum;
}
privateint checkSumXor(short[] a) { short checkSum = 0;
for (short e : a) {
checkSum ^= e;
} return (int) checkSum;
}
privateint checkSumXor(float[] a) { int checkSum = 0;
for (float e : a) {
checkSum ^= (int) e;
} return checkSum;
}
privateint checkSumXor(double[] a) { int checkSum = 0;
for (double e : a) {
checkSum ^= (int) e;
} return checkSum;
}
privateint checkSumPlus(Object a) { if (a instanceofint[]) { return checkSumPlus((int[]) a);
} if (a instanceoflong[]) { return checkSumPlus((long[]) a);
} if (a instanceofbyte[]) { return checkSumPlus((byte[]) a);
} if (a instanceofchar[]) { return checkSumPlus((char[]) a);
} if (a instanceofshort[]) { return checkSumPlus((short[]) a);
} if (a instanceoffloat[]) { return checkSumPlus((float[]) a);
} if (a instanceofdouble[]) { return checkSumPlus((double[]) a);
}
fail("Unknown type of array: " + a.getClass().getName()); return -1;
}
privateint checkSumPlus(int[] a) { int checkSum = 0;
for (int e : a) {
checkSum += e;
} return checkSum;
}
privateint checkSumPlus(long[] a) { long checkSum = 0;
for (long e : a) {
checkSum += e;
} return (int) checkSum;
}
privateint checkSumPlus(byte[] a) { byte checkSum = 0;
for (byte e : a) {
checkSum += e;
} return (int) checkSum;
}
privateint checkSumPlus(char[] a) { char checkSum = 0;
for (char e : a) {
checkSum += e;
} return (int) checkSum;
}
privateint checkSumPlus(short[] a) { short checkSum = 0;
for (short e : a) {
checkSum += e;
} return (int) checkSum;
}
privateint checkSumPlus(float[] a) { int checkSum = 0;
for (float e : a) {
checkSum += (int) e;
} return checkSum;
}
privateint checkSumPlus(double[] a) { int checkSum = 0;
for (double e : a) {
checkSum += (int) e;
} return checkSum;
}
privatevoid sortByInsertionSort(Object a) { if (a instanceofint[]) {
sortByInsertionSort((int[]) a);
} elseif (a instanceoflong[]) {
sortByInsertionSort((long[]) a);
} elseif (a instanceofbyte[]) {
sortByInsertionSort((byte[]) a);
} elseif (a instanceofchar[]) {
sortByInsertionSort((char[]) a);
} elseif (a instanceofshort[]) {
sortByInsertionSort((short[]) a);
} elseif (a instanceoffloat[]) {
sortByInsertionSort((float[]) a);
} elseif (a instanceofdouble[]) {
sortByInsertionSort((double[]) a);
} else {
fail("Unknown type of array: " + a.getClass().getName());
}
}
privatevoid sortByInsertionSort(int[] a) { for (int j, i = 1; i < a.length; i++) { int ai = a[i];
for (j = i - 1; j >= 0 && ai < a[j]; j--) {
a[j + 1] = a[j];
}
a[j + 1] = ai;
}
}
privatevoid sortByInsertionSort(long[] a) { for (int j, i = 1; i < a.length; i++) { long ai = a[i];
for (j = i - 1; j >= 0 && ai < a[j]; j--) {
a[j + 1] = a[j];
}
a[j + 1] = ai;
}
}
privatevoid sortByInsertionSort(byte[] a) { for (int j, i = 1; i < a.length; i++) { byte ai = a[i];
for (j = i - 1; j >= 0 && ai < a[j]; j--) {
a[j + 1] = a[j];
}
a[j + 1] = ai;
}
}
privatevoid sortByInsertionSort(char[] a) { for (int j, i = 1; i < a.length; i++) { char ai = a[i];
for (j = i - 1; j >= 0 && ai < a[j]; j--) {
a[j + 1] = a[j];
}
a[j + 1] = ai;
}
}
privatevoid sortByInsertionSort(short[] a) { for (int j, i = 1; i < a.length; i++) { short ai = a[i];
for (j = i - 1; j >= 0 && ai < a[j]; j--) {
a[j + 1] = a[j];
}
a[j + 1] = ai;
}
}
privatevoid sortByInsertionSort(float[] a) { for (int j, i = 1; i < a.length; i++) { float ai = a[i];
for (j = i - 1; j >= 0 && ai < a[j]; j--) {
a[j + 1] = a[j];
}
a[j + 1] = ai;
}
}
privatevoid sortByInsertionSort(double[] a) { for (int j, i = 1; i < a.length; i++) { double ai = a[i];
for (j = i - 1; j >= 0 && ai < a[j]; j--) {
a[j + 1] = a[j];
}
a[j + 1] = ai;
}
}
privatevoid checkSubArray(Object a, int fromIndex, int toIndex) { if (a instanceofint[]) {
checkSubArray((int[]) a, fromIndex, toIndex);
} elseif (a instanceoflong[]) {
checkSubArray((long[]) a, fromIndex, toIndex);
} elseif (a instanceofbyte[]) {
checkSubArray((byte[]) a, fromIndex, toIndex);
} elseif (a instanceofchar[]) {
checkSubArray((char[]) a, fromIndex, toIndex);
} elseif (a instanceofshort[]) {
checkSubArray((short[]) a, fromIndex, toIndex);
} elseif (a instanceoffloat[]) {
checkSubArray((float[]) a, fromIndex, toIndex);
} elseif (a instanceofdouble[]) {
checkSubArray((double[]) a, fromIndex, toIndex);
} else {
fail("Unknown type of array: " + a.getClass().getName());
}
}
privatevoid checkSubArray(int[] a, int fromIndex, int toIndex) { for (int i = 0; i < fromIndex; i++) { if (a[i] != A380) {
fail("Range sort changes left element at position " + i + hex(a[i], A380));
}
}
for (int i = fromIndex; i < toIndex - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
for (int i = toIndex; i < a.length; i++) { if (a[i] != B747) {
fail("Range sort changes right element at position " + i + hex(a[i], B747));
}
}
}
privatevoid checkSubArray(long[] a, int fromIndex, int toIndex) { for (int i = 0; i < fromIndex; i++) { if (a[i] != (long) A380) {
fail("Range sort changes left element at position " + i + hex(a[i], A380));
}
}
for (int i = fromIndex; i < toIndex - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
for (int i = toIndex; i < a.length; i++) { if (a[i] != (long) B747) {
fail("Range sort changes right element at position " + i + hex(a[i], B747));
}
}
}
privatevoid checkSubArray(byte[] a, int fromIndex, int toIndex) { for (int i = 0; i < fromIndex; i++) { if (a[i] != (byte) A380) {
fail("Range sort changes left element at position " + i + hex(a[i], A380));
}
}
for (int i = fromIndex; i < toIndex - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
for (int i = toIndex; i < a.length; i++) { if (a[i] != (byte) B747) {
fail("Range sort changes right element at position " + i + hex(a[i], B747));
}
}
}
privatevoid checkSubArray(char[] a, int fromIndex, int toIndex) { for (int i = 0; i < fromIndex; i++) { if (a[i] != (char) A380) {
fail("Range sort changes left element at position " + i + hex(a[i], A380));
}
}
for (int i = fromIndex; i < toIndex - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
for (int i = toIndex; i < a.length; i++) { if (a[i] != (char) B747) {
fail("Range sort changes right element at position " + i + hex(a[i], B747));
}
}
}
privatevoid checkSubArray(short[] a, int fromIndex, int toIndex) { for (int i = 0; i < fromIndex; i++) { if (a[i] != (short) A380) {
fail("Range sort changes left element at position " + i + hex(a[i], A380));
}
}
for (int i = fromIndex; i < toIndex - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
for (int i = toIndex; i < a.length; i++) { if (a[i] != (short) B747) {
fail("Range sort changes right element at position " + i + hex(a[i], B747));
}
}
}
privatevoid checkSubArray(float[] a, int fromIndex, int toIndex) { for (int i = 0; i < fromIndex; i++) { if (a[i] != (float) A380) {
fail("Range sort changes left element at position " + i + hex((long) a[i], A380));
}
}
for (int i = fromIndex; i < toIndex - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
for (int i = toIndex; i < a.length; i++) { if (a[i] != (float) B747) {
fail("Range sort changes right element at position " + i + hex((long) a[i], B747));
}
}
}
privatevoid checkSubArray(double[] a, int fromIndex, int toIndex) { for (int i = 0; i < fromIndex; i++) { if (a[i] != (double) A380) {
fail("Range sort changes left element at position " + i + hex((long) a[i], A380));
}
}
for (int i = fromIndex; i < toIndex - 1; i++) { if (a[i] > a[i + 1]) {
fail("Array is not sorted at " + i + "-th position: " + a[i] + " and " + a[i + 1]);
}
}
for (int i = toIndex; i < a.length; i++) { if (a[i] != (double) B747) {
fail("Range sort changes right element at position " + i + hex((long) a[i], B747));
}
}
}
privatevoid checkRange(Object a, int m) { if (a instanceofint[]) {
checkRange((int[]) a, m);
} elseif (a instanceoflong[]) {
checkRange((long[]) a, m);
} elseif (a instanceofbyte[]) {
checkRange((byte[]) a, m);
} elseif (a instanceofchar[]) {
checkRange((char[]) a, m);
} elseif (a instanceofshort[]) {
checkRange((short[]) a, m);
} elseif (a instanceoffloat[]) {
checkRange((float[]) a, m);
} elseif (a instanceofdouble[]) {
checkRange((double[]) a, m);
} else {
fail("Unknown type of array: " + a.getClass().getName());
}
}
for (int i = 0; i < src.length; i++) {
b[i] = (double) src[i];
}
}
};
abstractvoid convert(int[] src, Object dst);
}
privatestaticenum SortedBuilder {
STEPS { void build(int[] a, int m) { for (int i = 0; i < m; i++) {
a[i] = 0;
}
for (int i = m; i < a.length; i++) {
a[i] = 1;
}
}
};
abstractvoid build(int[] a, int m);
}
privatestaticenum UnsortedBuilder {
RANDOM { void build(int[] a, int m, Random random) { for (int i = 0; i < a.length; i++) {
a[i] = random.nextInt();
}
}
},
ASCENDING { void build(int[] a, int m, Random random) { for (int i = 0; i < a.length; i++) {
a[i] = m + i;
}
}
},
DESCENDING { void build(int[] a, int m, Random random) { for (int i = 0; i < a.length; i++) {
a[i] = a.length - m - i;
}
}
},
EQUAL { void build(int[] a, int m, Random random) { for (int i = 0; i < a.length; i++) {
a[i] = m;
}
}
},
SAW { void build(int[] a, int m, Random random) { int incCount = 1; int decCount = a.length; int i = 0; int period = m--;
while (true) { for (int k = 1; k <= period; k++) { if (i >= a.length) { return;
}
a[i++] = incCount++;
}
period += m;
for (int k = 1; k <= period; k++) { if (i >= a.length) { return;
}
a[i++] = decCount--;
}
period += m;
}
}
},
REPEATED { void build(int[] a, int m, Random random) { for (int i = 0; i < a.length; i++) {
a[i] = i % m;
}
}
},
DUPLICATED { void build(int[] a, int m, Random random) { for (int i = 0; i < a.length; i++) {
a[i] = random.nextInt(m);
}
}
},
ORGAN_PIPES { void build(int[] a, int m, Random random) { int middle = a.length / (m + 1);
for (int i = 0; i < middle; i++) {
a[i] = i;
}
for (int i = middle; i < a.length; i++) {
a[i] = a.length - i - 1;
}
}
},
STAGGER { void build(int[] a, int m, Random random) { for (int i = 0; i < a.length; i++) {
a[i] = (i * m + i) % a.length;
}
}
},
PLATEAU { void build(int[] a, int m, Random random) { for (int i = 0; i < a.length; i++) {
a[i] = Math.min(i, m);
}
}
},
SHUFFLE { void build(int[] a, int m, Random random) { int x = 0, y = 0;
for (int i = 0; i < a.length; i++) {
a[i] = random.nextBoolean() ? (x += 2) : (y += 2);
}
}
},
LATCH { void build(int[] a, int m, Random random) { int max = a.length / m;
max = max < 2 ? 2 : max;
for (int i = 0; i < a.length; i++) {
a[i] = i % max;
}
}
};
abstractvoid build(int[] a, int m, Random random);
}
privatestaticenum MergingBuilder {
ASCENDING { void build(int[] a, int m) { int period = a.length / m; int v = 1, i = 0;
for (int k = 0; k < m; k++) {
v = 1;
for (int p = 0; p < period; p++) {
a[i++] = v++;
}
}
POINT { void build(int[] a, int m) { for (int i = 0; i < a.length; i++) {
a[i] = 0;
}
a[a.length / 2] = m;
}
},
LINE { void build(int[] a, int m) { for (int i = 0; i < a.length; i++) {
a[i] = i;
}
reverse(a, 0, a.length - 1);
}
},
PEARL { void build(int[] a, int m) { for (int i = 0; i < a.length; i++) {
a[i] = i;
}
reverse(a, 0, 2);
}
},
RING { void build(int[] a, int m) { int k1 = a.length / 3; int k2 = a.length / 3 * 2; int level = a.length / 3;
for (int i = 0, k = level; i < k1; i++) {
a[i] = k--;
}
for (int i = k1; i < k2; i++) {
a[i] = 0;
}
for (int i = k2, k = level; i < a.length; i++) {
a[i] = k--;
}
}
};
abstractvoid build(int[] a, int m);
privatestaticvoid reverse(int[] a, int lo, int hi) { for (--hi; lo < hi; ) { int tmp = a[lo];
a[lo++] = a[hi];
a[hi--] = tmp;
}
}
}
privatestaticenum NegativeZeroBuilder { FLOAT { void build(Object o, Random random) { float[] a = (float[]) o;
for (int i = 0; i < a.length; i++) {
a[i] = random.nextBoolean() ? -0.0f : 0.0f;
}
}
},
DOUBLE { void build(Object o, Random random) { double[] a = (double[]) o;
for (int i = 0; i < a.length; i++) {
a[i] = random.nextBoolean() ? -0.0d : 0.0d;
}
}
};
abstractvoid build(Object o, Random random);
}
privatestaticenum FloatingPointBuilder { FLOAT { void build(Object o, int a, int g, int z, int n, int p, Random random) { float negativeValue = -random.nextFloat(); float positiveValue = random.nextFloat(); float[] x = (float[]) o; int fromIndex = 0;
DOUBLE { void build(Object o, int a, int g, int z, int n, int p, Random random) { double negativeValue = -random.nextFloat(); double positiveValue = random.nextFloat(); double[] x = (double[]) o; int fromIndex = 0;
abstractvoid build(Object o, int a, int g, int z, int n, int p, Random random);
privatestaticvoid writeValue(float[] a, float value, int fromIndex, int count) { for (int i = fromIndex; i < fromIndex + count; i++) {
a[i] = value;
}
}
privatestaticvoid writeValue(double[] a, double value, int fromIndex, int count) { for (int i = fromIndex; i < fromIndex + count; i++) {
a[i] = value;
}
}
}
privatestatic Comparator<Pair> pairComparator = new Comparator<Pair>() {
@Override public String toString() { return"(" + key + ", " + value + ")";
}
privateint key; privateint value;
}
privatestaticclass TestRandom extends Random {
privatestaticfinal TestRandom BABA = new TestRandom(0xBABA); privatestaticfinal TestRandom DEDA = new TestRandom(0xDEDA); privatestaticfinal TestRandom C0FFEE = new TestRandom(0xC0FFEE);
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.