Differential D7890 Diff 28784 java/src/test/java/org/softwareheritage/graph/utils/ForkJoinBigQuickSort2Test.java
Changeset View
Changeset View
Standalone View
Standalone View
java/src/test/java/org/softwareheritage/graph/utils/ForkJoinBigQuickSort2Test.java
Show First 20 Lines • Show All 76 Lines • ▼ Show 20 Lines | public void testParallelQuickSort3() { | ||||
sortBig2(d[0], d[1]); | sortBig2(d[0], d[1]); | ||||
checkArraySorted(d[0], d[1]); | checkArraySorted(d[0], d[1]); | ||||
for (int i = 100; i-- != 10;) | for (int i = 100; i-- != 10;) | ||||
d[0][i] = random.nextInt(); | d[0][i] = random.nextInt(); | ||||
for (int i = 100; i-- != 10;) | for (int i = 100; i-- != 10;) | ||||
d[1][i] = random.nextInt(); | d[1][i] = random.nextInt(); | ||||
sortBig2(d[0], d[1], 10, 100); | sortBig2(d[0], d[1], 10, 100); | ||||
checkArraySorted(d[0], d[1], 10, 100); | checkArraySorted(d[0], d[1], 10, 100); | ||||
d[0] = new long[10000000]; | |||||
random = new Random(0); | |||||
for (int i = d[0].length; i-- != 0;) | |||||
d[0][i] = random.nextInt(); | |||||
d[1] = new long[d[0].length]; | |||||
for (int i = d[1].length; i-- != 0;) | |||||
d[1][i] = random.nextInt(); | |||||
sortBig2(d[0], d[1]); | |||||
checkArraySorted(d[0], d[1]); | |||||
} | } | ||||
} | } |