5 |
|
*/ |
6 |
|
|
7 |
|
package extra166y; |
8 |
+ |
|
9 |
|
import jsr166y.*; |
10 |
|
import static extra166y.Ops.*; |
11 |
|
import java.util.*; |
12 |
|
import java.util.concurrent.atomic.*; |
12 |
– |
import java.lang.reflect.Array; |
13 |
|
|
14 |
|
/** |
15 |
|
* An array of longs supporting parallel operations. This class |
302 |
|
* @param combiner the combiner |
303 |
|
* @return this (to simplify use in expressions) |
304 |
|
* @throws ArrayIndexOutOfBoundsException if other array has |
305 |
< |
* fewer elements than this array. |
305 |
> |
* fewer elements than this array |
306 |
|
*/ |
307 |
|
public ParallelLongArray replaceWithMapping(BinaryLongOp combiner, |
308 |
|
long[] other) { |
420 |
|
* 2, 3}, and the reducer operation adds numbers, then after |
421 |
|
* invocation of this method, the contents would be {@code 0, 1, |
422 |
|
* 3} (that is, {@code 0, 0+1, 0+1+2}, and the return value |
423 |
< |
* would be 6 (that is, {@code 1+2+3}). |
423 |
> |
* would be 6 (that is, {@code 1+2+3}). |
424 |
|
* @param reducer the reducer |
425 |
|
* @param base the result for an empty array |
426 |
|
* @return the total reduction |
445 |
|
* Sorts the array, assuming all elements are Comparable. Unlike |
446 |
|
* Arrays.sort, this sort does not guarantee that elements |
447 |
|
* with equal keys maintain their relative position in the array. |
448 |
– |
* @throws ClassCastException if any element is not Comparable |
448 |
|
* @return this (to simplify use in expressions) |
449 |
+ |
* @throws ClassCastException if any element is not Comparable |
450 |
|
*/ |
451 |
|
public ParallelLongArray sort() { |
452 |
|
super.sort(); |