248 |
|
* @param combiner the combiner |
249 |
|
* @return this (to simplify use in expressions) |
250 |
|
* @throws ArrayIndexOutOfBoundsException if other array has |
251 |
< |
* fewer elements than this array. |
251 |
> |
* fewer elements than this array |
252 |
|
*/ |
253 |
|
public ParallelDoubleArray replaceWithMapping |
254 |
|
(BinaryDoubleOp combiner, ParallelDoubleArrayWithDoubleMapping other) { |
263 |
|
* @param combiner the combiner |
264 |
|
* @return this (to simplify use in expressions) |
265 |
|
* @throws ArrayIndexOutOfBoundsException if other array has |
266 |
< |
* fewer elements than this array. |
266 |
> |
* fewer elements than this array |
267 |
|
*/ |
268 |
|
public ParallelDoubleArray replaceWithMapping(BinaryDoubleOp combiner, |
269 |
|
double[] other) { |
381 |
|
* 2, 3}, and the reducer operation adds numbers, then after |
382 |
|
* invocation of this method, the contents would be {@code 0, 1, |
383 |
|
* 3} (that is, {@code 0, 0+1, 0+1+2}, and the return value |
384 |
< |
* would be 6 (that is, {@code 1+2+3}). |
384 |
> |
* would be 6 (that is, {@code 1+2+3}). |
385 |
|
* @param reducer the reducer |
386 |
|
* @param base the result for an empty array |
387 |
|
* @return the total reduction |
406 |
|
* Sorts the array, assuming all elements are Comparable. Unlike |
407 |
|
* Arrays.sort, this sort does not guarantee that elements |
408 |
|
* with equal keys maintain their relative position in the array. |
409 |
– |
* @throws ClassCastException if any element is not Comparable |
409 |
|
* @return this (to simplify use in expressions) |
410 |
+ |
* @throws ClassCastException if any element is not Comparable |
411 |
|
*/ |
412 |
|
public ParallelDoubleArray sort() { |
413 |
|
super.sort(); |