| 5 |
|
*/ |
| 6 |
|
|
| 7 |
|
package extra166y; |
| 8 |
+ |
|
| 9 |
|
import jsr166y.*; |
| 10 |
|
import static extra166y.Ops.*; |
| 11 |
|
import java.util.*; |
| 223 |
|
* Replaces elements with the results of applying the given |
| 224 |
|
* generator. For example, to fill the array with uniform random |
| 225 |
|
* values, use |
| 226 |
< |
* <tt>replaceWithGeneratedValue(Ops.doubleRandom())</tt>. |
| 226 |
> |
* {@code replaceWithGeneratedValue(Ops.doubleRandom())}. |
| 227 |
|
* @param generator the generator |
| 228 |
|
* @return this (to simplify use in expressions) |
| 229 |
|
*/ |
| 244 |
|
|
| 245 |
|
/** |
| 246 |
|
* Replaces elements with results of applying |
| 247 |
< |
* <tt>op(thisElement, otherElement)</tt>. |
| 247 |
> |
* {@code op(thisElement, otherElement)}. |
| 248 |
|
* @param other the other array |
| 249 |
|
* @param combiner the combiner |
| 250 |
|
* @return this (to simplify use in expressions) |
| 251 |
|
* @throws ArrayIndexOutOfBoundsException if other array has |
| 252 |
< |
* fewer elements than this array. |
| 252 |
> |
* fewer elements than this array |
| 253 |
|
*/ |
| 254 |
|
public ParallelDoubleArray replaceWithMapping |
| 255 |
|
(BinaryDoubleOp combiner, ParallelDoubleArrayWithDoubleMapping other) { |
| 259 |
|
|
| 260 |
|
/** |
| 261 |
|
* Replaces elements with results of applying |
| 262 |
< |
* <tt>op(thisElement, otherElement)</tt>. |
| 262 |
> |
* {@code op(thisElement, otherElement)}. |
| 263 |
|
* @param other the other array |
| 264 |
|
* @param combiner the combiner |
| 265 |
|
* @return this (to simplify use in expressions) |
| 266 |
|
* @throws ArrayIndexOutOfBoundsException if other array has |
| 267 |
< |
* fewer elements than this array. |
| 267 |
> |
* fewer elements than this array |
| 268 |
|
*/ |
| 269 |
|
public ParallelDoubleArray replaceWithMapping(BinaryDoubleOp combiner, |
| 270 |
|
double[] other) { |
| 363 |
|
/** |
| 364 |
|
* Replaces each element with the running cumulation of applying |
| 365 |
|
* the given reducer. For example, if the contents are the numbers |
| 366 |
< |
* <tt>1, 2, 3</tt>, and the reducer operation adds numbers, then |
| 367 |
< |
* after invocation of this method, the contents would be <tt>1, |
| 368 |
< |
* 3, 6</tt> (that is, <tt>1, 1+2, 1+2+3</tt>); |
| 366 |
> |
* {@code 1, 2, 3}, and the reducer operation adds numbers, then |
| 367 |
> |
* after invocation of this method, the contents would be {@code 1, |
| 368 |
> |
* 3, 6} (that is, {@code 1, 1+2, 1+2+3}). |
| 369 |
|
* @param reducer the reducer |
| 370 |
|
* @param base the result for an empty array |
| 371 |
|
* @return this (to simplify use in expressions) |
| 378 |
|
/** |
| 379 |
|
* Replaces each element with the cumulation of applying the given |
| 380 |
|
* reducer to all previous values, and returns the total |
| 381 |
< |
* reduction. For example, if the contents are the numbers <tt>1, |
| 382 |
< |
* 2, 3</tt>, and the reducer operation adds numbers, then after |
| 383 |
< |
* invocation of this method, the contents would be <tt>0, 1, |
| 384 |
< |
* 3</tt> (that is, <tt>0, 0+1, 0+1+2</tt>, and the return value |
| 385 |
< |
* would be 6 (that is, <tt> 1+2+3</tt>); |
| 381 |
> |
* reduction. For example, if the contents are the numbers {@code 1, |
| 382 |
> |
* 2, 3}, and the reducer operation adds numbers, then after |
| 383 |
> |
* invocation of this method, the contents would be {@code 0, 1, |
| 384 |
> |
* 3} (that is, {@code 0, 0+1, 0+1+2}, and the return value |
| 385 |
> |
* would be 6 (that is, {@code 1+2+3}). |
| 386 |
|
* @param reducer the reducer |
| 387 |
|
* @param base the result for an empty array |
| 388 |
|
* @return the total reduction |
| 407 |
|
* Sorts the array, assuming all elements are Comparable. Unlike |
| 408 |
|
* Arrays.sort, this sort does not guarantee that elements |
| 409 |
|
* with equal keys maintain their relative position in the array. |
| 409 |
– |
* @throws ClassCastException if any element is not Comparable |
| 410 |
|
* @return this (to simplify use in expressions) |
| 411 |
+ |
* @throws ClassCastException if any element is not Comparable |
| 412 |
|
*/ |
| 413 |
|
public ParallelDoubleArray sort() { |
| 414 |
|
super.sort(); |
| 440 |
|
} |
| 441 |
|
|
| 442 |
|
/** |
| 443 |
< |
* Equivalent to <tt>asList().addAll</tt> but specialized for |
| 443 |
> |
* Equivalent to {@code asList().addAll} but specialized for |
| 444 |
|
* array arguments and likely to be more efficient. |
| 445 |
|
* @param other the elements to add |
| 446 |
|
* @return this (to simplify use in expressions) |
| 798 |
|
* Returns an iterator stepping through each element of the array |
| 799 |
|
* up to the current limit. This iterator does <em>not</em> |
| 800 |
|
* support the remove operation. However, a full |
| 801 |
< |
* <tt>ListIterator</tt> supporting add, remove, and set |
| 801 |
> |
* {@code ListIterator} supporting add, remove, and set |
| 802 |
|
* operations is available via {@link #asList}. |
| 803 |
|
* @return an iterator stepping through each element |
| 804 |
|
*/ |
| 873 |
|
public void set(int i, double x) { array[i] = x; } |
| 874 |
|
|
| 875 |
|
/** |
| 876 |
< |
* Equivalent to <tt>asList().toString()</tt>. |
| 876 |
> |
* Equivalent to {@code asList().toString()}. |
| 877 |
|
* @return a string representation |
| 878 |
|
*/ |
| 879 |
|
public String toString() { |
