| 183 |
|
* |
| 184 |
|
* <p><b>Searching.</b> A tree of CountedCompleters can search for a |
| 185 |
|
* value or property in different parts of a data structure, and |
| 186 |
< |
* report a result in an {@link java.util.concurrent.AtomicReference} |
| 187 |
< |
* as soon as one is found. The others can poll the result to avoid |
| 188 |
< |
* unnecessary work. (You could additionally {@link #cancel} other |
| 189 |
< |
* tasks, but it is usually simpler and more efficient to just let |
| 190 |
< |
* them notice that the result is set and if so skip further |
| 191 |
< |
* processing.) Illustrating again with an array using full |
| 186 |
> |
* report a result in an {@link |
| 187 |
> |
* java.util.concurrent.atomic.AtomicReference AtomicReference} as |
| 188 |
> |
* soon as one is found. The others can poll the result to avoid |
| 189 |
> |
* unnecessary work. (You could additionally {@linkplain #cancel |
| 190 |
> |
* cancel} other tasks, but it is usually simpler and more efficient |
| 191 |
> |
* to just let them notice that the result is set and if so skip |
| 192 |
> |
* further processing.) Illustrating again with an array using full |
| 193 |
|
* partitioning (again, in practice, leaf tasks will almost always |
| 194 |
|
* process more than one element): |
| 195 |
|
* |
