1524 |
|
continue; |
1525 |
|
double x = src[k]; |
1526 |
|
long bits = Double.doubleToLongBits(x); |
1527 |
< |
int hash = hash((int)(bits ^ (bits >>> 32)));; |
1527 |
> |
int hash = hash((int)(bits ^ (bits >>> 32))); |
1528 |
|
long entry = (((long)hash) << 32) + (k + 1); |
1529 |
|
int idx = hash & mask; |
1530 |
|
for (;;) { |
1875 |
|
final RecursiveAction right; |
1876 |
|
final RecursiveAction merger; |
1877 |
|
FJSubSorter(RecursiveAction left, RecursiveAction right, |
1878 |
< |
RecursiveAction merger){ |
1878 |
> |
RecursiveAction merger) { |
1879 |
|
this.left = left; this.right = right; this.merger = merger; |
1880 |
|
} |
1881 |
|
public void compute() { |
2351 |
|
if (left - lo <= hi - right) { |
2352 |
|
oquickSort(a, cmp, lo, left); |
2353 |
|
lo = left + 1; |
2354 |
< |
} |
2354 |
> |
} |
2355 |
|
else { |
2356 |
|
oquickSort(a, cmp, right, hi); |
2357 |
|
hi = left; |
2455 |
|
if (left - lo <= hi - right) { |
2456 |
|
dquickSort(a, cmp, lo, left); |
2457 |
|
lo = left + 1; |
2458 |
< |
} |
2458 |
> |
} |
2459 |
|
else { |
2460 |
|
dquickSort(a, cmp, right, hi); |
2461 |
|
hi = left; |
2559 |
|
if (left - lo <= hi - right) { |
2560 |
|
lquickSort(a, cmp, lo, left); |
2561 |
|
lo = left + 1; |
2562 |
< |
} |
2562 |
> |
} |
2563 |
|
else { |
2564 |
|
lquickSort(a, cmp, right, hi); |
2565 |
|
hi = left; |
2709 |
|
int cb; |
2710 |
|
for (;;) { // Establish action: sum, cumulate, or both |
2711 |
|
int b = phase; |
2712 |
< |
if ((b & FINISHED) != 0) // already done |
2712 |
> |
if ((b & FINISHED) != 0) // already done |
2713 |
|
return false; |
2714 |
|
if ((b & CUMULATE) != 0) |
2715 |
|
cb = FINISHED; |