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 |
|
* |
278 |
|
* } |
279 |
|
* public void onCompletion(CountedCompleter<?> caller) { |
280 |
|
* if (caller != this) { |
281 |
< |
* MapReducer<E> child = (MapReducer<E>)caller; |
282 |
< |
* MapReducer<E> sib = child.sibling; |
283 |
< |
* if (sib == null || sib.result == null) |
284 |
< |
* result = child.result; |
285 |
< |
* else |
286 |
< |
* result = reducer.apply(child.result, sib.result); |
281 |
> |
* MapReducer<E> child = (MapReducer<E>)caller; |
282 |
> |
* MapReducer<E> sib = child.sibling; |
283 |
> |
* if (sib == null || sib.result == null) |
284 |
> |
* result = child.result; |
285 |
> |
* else |
286 |
> |
* result = reducer.apply(child.result, sib.result); |
287 |
|
* } |
288 |
|
* } |
289 |
|
* public E getRawResult() { return result; } |
389 |
|
* Creates a new CountedCompleter with the given completer |
390 |
|
* and initial pending count. |
391 |
|
* |
392 |
< |
* @param completer this tasks completer, or {@code null} if none |
392 |
> |
* @param completer this task's completer, or {@code null} if none |
393 |
|
* @param initialPendingCount the initial pending count |
394 |
|
*/ |
395 |
|
protected CountedCompleter(CountedCompleter<?> completer, |
402 |
|
* Creates a new CountedCompleter with the given completer |
403 |
|
* and an initial pending count of zero. |
404 |
|
* |
405 |
< |
* @param completer this tasks completer, or {@code null} if none |
405 |
> |
* @param completer this task's completer, or {@code null} if none |
406 |
|
*/ |
407 |
|
protected CountedCompleter(CountedCompleter<?> completer) { |
408 |
|
this.completer = completer; |
423 |
|
|
424 |
|
/** |
425 |
|
* Performs an action when method {@link #tryComplete} is invoked |
426 |
< |
* and there are no pending counts, or when the unconditional |
426 |
> |
* and the pending count is zero, or when the unconditional |
427 |
|
* method {@link #complete} is invoked. By default, this method |
428 |
|
* does nothing. You can distinguish cases by checking the |
429 |
|
* identity of the given caller argument. If not equal to {@code |
451 |
|
* @param caller the task invoking this method (which may |
452 |
|
* be this task itself). |
453 |
|
* @return true if this exception should be propagated to this |
454 |
< |
* tasks completer, if one exists. |
454 |
> |
* task's completer, if one exists. |
455 |
|
*/ |
456 |
|
public boolean onExceptionalCompletion(Throwable ex, CountedCompleter<?> caller) { |
457 |
|
return true; |