1 |
|
/* |
2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
|
* Expert Group and released to the public domain, as explained at |
4 |
< |
* http://creativecommons.org/licenses/publicdomain |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
|
import java.util.concurrent.*; |
30 |
|
System.out.println("Usage: java BoxedLongSort threads n reps"); |
31 |
|
return; |
32 |
|
} |
33 |
< |
ForkJoinPool pool = procs == 0? new ForkJoinPool() : |
33 |
> |
ForkJoinPool pool = (procs == 0) ? new ForkJoinPool() : |
34 |
|
new ForkJoinPool(procs); |
35 |
|
|
36 |
|
Long[] a = new Long[n]; |
88 |
|
this.a = a; this.w = w; this.origin = origin; this.n = n; |
89 |
|
} |
90 |
|
|
91 |
< |
public void compute() { |
91 |
> |
public void compute() { |
92 |
|
int l = origin; |
93 |
|
if (n <= THRESHOLD) |
94 |
|
Arrays.sort(a, l, l+n); |
206 |
|
|
207 |
|
} |
208 |
|
|
209 |
< |
static void checkSorted (Long[] a) { |
209 |
> |
static void checkSorted (Long[] a) { |
210 |
|
int n = a.length; |
211 |
|
for (int i = 0; i < n - 1; i++) { |
212 |
|
if (a[i] > a[i+1]) { |