| 4 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
| 5 |
|
*/ |
| 6 |
|
|
| 7 |
– |
import java.util.concurrent.*; |
| 7 |
|
import java.util.*; |
| 8 |
+ |
import java.util.concurrent.*; |
| 9 |
|
|
| 10 |
|
class BoxedLongSort { |
| 11 |
|
static final long NPS = (1000L * 1000 * 1000); |
| 165 |
|
* and finding index of right closest to split point. |
| 166 |
|
* Uses left-spine decomposition to generate all |
| 167 |
|
* merge tasks before bottomming out at base case. |
| 168 |
– |
* |
| 168 |
|
*/ |
| 169 |
|
public final void compute() { |
| 170 |
|
Merger rights = null; |
| 217 |
|
// merge(nleft, nright); |
| 218 |
|
if (rights != null) |
| 219 |
|
collectRights(rights); |
| 221 |
– |
|
| 220 |
|
} |
| 221 |
|
|
| 222 |
|
final void merge(int nleft, int nright) { |
| 288 |
|
} |
| 289 |
|
} |
| 290 |
|
|
| 293 |
– |
|
| 291 |
|
static final class RandomRepacker extends RecursiveAction { |
| 292 |
|
final Long[] src; |
| 293 |
|
final Long[] dst; |
