22 |
|
* matching a predicate or ranges of indices, and to <em>reduce</em> |
23 |
|
* all elements into a single value such as a sum. |
24 |
|
* |
25 |
< |
* <p> A ParallelArray is constructed by allocating, using, or copying |
25 |
> |
* <p>A ParallelArray is constructed by allocating, using, or copying |
26 |
|
* an array, using one of the static factory methods {@link #create}, |
27 |
|
* {@link #createEmpty}, {@link #createUsingHandoff} and {@link |
28 |
|
* #createFromCopy}. Upon construction, the encapsulated array managed |
31 |
|
* array, access by another thread of an element of a ParallelArray |
32 |
|
* while another operation is in progress has undefined effects. |
33 |
|
* |
34 |
< |
* <p> The ForkJoinPool used to construct a ParallelArray can be |
34 |
> |
* <p>The ForkJoinPool used to construct a ParallelArray can be |
35 |
|
* shared safely by other threads (and used in other |
36 |
|
* ParallelArrays). To avoid the overhead associated with creating |
37 |
|
* multiple executors, it is often a good idea to use the {@link |
67 |
|
* significantly improving performance beyond that of the Long and |
68 |
|
* Double versions.) |
69 |
|
* |
70 |
< |
* <p> Most usages of ParallelArray involve sets of operations prefixed |
70 |
> |
* <p>Most usages of ParallelArray involve sets of operations prefixed |
71 |
|
* with range bounds, filters, and mappings (including mappings that |
72 |
|
* combine elements from other ParallelArrays), using |
73 |
|
* <tt>withBounds</tt>, <tt>withFilter</tt>, and <tt>withMapping</tt>, |