5 |
|
*/ |
6 |
|
|
7 |
|
import static java.util.concurrent.TimeUnit.MILLISECONDS; |
8 |
– |
import static java.util.concurrent.TimeUnit.SECONDS; |
8 |
|
|
9 |
|
import java.util.HashSet; |
10 |
|
import java.util.concurrent.CancellationException; |
12 |
|
import java.util.concurrent.ExecutionException; |
13 |
|
import java.util.concurrent.ForkJoinPool; |
14 |
|
import java.util.concurrent.ForkJoinTask; |
16 |
– |
import java.util.concurrent.ThreadLocalRandom; |
15 |
|
import java.util.concurrent.TimeoutException; |
16 |
|
import java.util.concurrent.atomic.AtomicInteger; |
17 |
|
import java.util.concurrent.atomic.AtomicReference; |
20 |
– |
import java.util.function.BiConsumer; |
21 |
– |
import java.util.function.Consumer; |
18 |
|
|
19 |
|
import junit.framework.Test; |
20 |
|
import junit.framework.TestSuite; |
47 |
|
null, true); |
48 |
|
} |
49 |
|
|
50 |
< |
private void testInvokeOnPool(ForkJoinPool pool, ForkJoinTask a) { |
50 |
> |
private void testInvokeOnPool(ForkJoinPool pool, ForkJoinTask<?> a) { |
51 |
|
try (PoolCleaner cleaner = cleaner(pool)) { |
52 |
|
assertFalse(a.isDone()); |
53 |
|
assertFalse(a.isCompletedNormally()); |
67 |
|
} |
68 |
|
} |
69 |
|
|
70 |
< |
void checkNotDone(CountedCompleter a) { |
70 |
> |
void checkNotDone(CountedCompleter<?> a) { |
71 |
|
assertFalse(a.isDone()); |
72 |
|
assertFalse(a.isCompletedNormally()); |
73 |
|
assertFalse(a.isCompletedAbnormally()); |
76 |
|
assertNull(a.getRawResult()); |
77 |
|
|
78 |
|
try { |
79 |
< |
a.get(0L, SECONDS); |
79 |
> |
a.get(randomExpiredTimeout(), randomTimeUnit()); |
80 |
|
shouldThrow(); |
81 |
|
} catch (TimeoutException success) { |
82 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
94 |
|
Thread.currentThread().interrupt(); |
95 |
|
long startTime = System.nanoTime(); |
96 |
|
assertNull(a.join()); |
97 |
< |
assertTrue(millisElapsedSince(startTime) < SMALL_DELAY_MS); |
97 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
98 |
|
Thread.interrupted(); |
99 |
|
} |
100 |
|
|
102 |
|
Thread.currentThread().interrupt(); |
103 |
|
long startTime = System.nanoTime(); |
104 |
|
a.quietlyJoin(); // should be no-op |
105 |
< |
assertTrue(millisElapsedSince(startTime) < SMALL_DELAY_MS); |
105 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
106 |
|
Thread.interrupted(); |
107 |
|
} |
108 |
|
|
109 |
|
assertFalse(a.cancel(false)); |
110 |
|
assertFalse(a.cancel(true)); |
111 |
+ |
|
112 |
+ |
Object v1 = null, v2 = null; |
113 |
|
try { |
114 |
< |
assertNull(a.get()); |
115 |
< |
} catch (Throwable fail) { threadUnexpectedException(fail); } |
118 |
< |
try { |
119 |
< |
assertNull(a.get(5L, SECONDS)); |
114 |
> |
v1 = a.get(); |
115 |
> |
v2 = a.get(randomTimeout(), randomTimeUnit()); |
116 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
117 |
+ |
assertNull(v1); |
118 |
+ |
assertNull(v2); |
119 |
|
} |
120 |
|
|
121 |
< |
void checkCancelled(CountedCompleter a) { |
121 |
> |
void checkCancelled(CountedCompleter<?> a) { |
122 |
|
assertTrue(a.isDone()); |
123 |
|
assertTrue(a.isCancelled()); |
124 |
|
assertFalse(a.isCompletedNormally()); |
139 |
|
{ |
140 |
|
long startTime = System.nanoTime(); |
141 |
|
a.quietlyJoin(); // should be no-op |
142 |
< |
assertTrue(millisElapsedSince(startTime) < SMALL_DELAY_MS); |
142 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
143 |
|
} |
144 |
|
|
145 |
|
try { |
149 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
150 |
|
|
151 |
|
try { |
152 |
< |
a.get(5L, SECONDS); |
152 |
> |
a.get(randomTimeout(), randomTimeUnit()); |
153 |
|
shouldThrow(); |
154 |
|
} catch (CancellationException success) { |
155 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
156 |
|
} |
157 |
|
|
158 |
< |
void checkCompletedAbnormally(CountedCompleter a, Throwable t) { |
158 |
> |
void checkCompletedAbnormally(CountedCompleter<?> a, Throwable t) { |
159 |
|
assertTrue(a.isDone()); |
160 |
|
assertFalse(a.isCancelled()); |
161 |
|
assertFalse(a.isCompletedNormally()); |
177 |
|
{ |
178 |
|
long startTime = System.nanoTime(); |
179 |
|
a.quietlyJoin(); // should be no-op |
180 |
< |
assertTrue(millisElapsedSince(startTime) < SMALL_DELAY_MS); |
180 |
> |
assertTrue(millisElapsedSince(startTime) < LONG_DELAY_MS); |
181 |
|
} |
182 |
|
|
183 |
|
try { |
188 |
|
} catch (Throwable fail) { threadUnexpectedException(fail); } |
189 |
|
|
190 |
|
try { |
191 |
< |
a.get(5L, SECONDS); |
191 |
> |
a.get(randomTimeout(), randomTimeUnit()); |
192 |
|
shouldThrow(); |
193 |
|
} catch (ExecutionException success) { |
194 |
|
assertSame(t.getClass(), success.getCause().getClass()); |
211 |
|
final AtomicInteger onCompletionN = new AtomicInteger(0); |
212 |
|
final AtomicInteger onExceptionalCompletionN = new AtomicInteger(0); |
213 |
|
final AtomicInteger setRawResultN = new AtomicInteger(0); |
214 |
< |
final AtomicReference<Object> rawResult = new AtomicReference<Object>(null); |
214 |
> |
final AtomicReference<Object> rawResult = new AtomicReference<>(null); |
215 |
|
int computeN() { return computeN.get(); } |
216 |
|
int onCompletionN() { return onCompletionN.get(); } |
217 |
|
int onExceptionalCompletionN() { return onExceptionalCompletionN.get(); } |
218 |
|
int setRawResultN() { return setRawResultN.get(); } |
219 |
|
|
220 |
|
CheckedCC() { super(); } |
221 |
< |
CheckedCC(CountedCompleter p) { super(p); } |
222 |
< |
CheckedCC(CountedCompleter p, int n) { super(p, n); } |
221 |
> |
CheckedCC(CountedCompleter<?> p) { super(p); } |
222 |
> |
CheckedCC(CountedCompleter<?> p, int n) { super(p, n); } |
223 |
|
abstract void realCompute(); |
224 |
|
public final void compute() { |
225 |
|
computeN.incrementAndGet(); |
226 |
|
realCompute(); |
227 |
|
} |
228 |
< |
public void onCompletion(CountedCompleter caller) { |
228 |
> |
public void onCompletion(CountedCompleter<?> caller) { |
229 |
|
onCompletionN.incrementAndGet(); |
230 |
|
super.onCompletion(caller); |
231 |
|
} |
232 |
|
public boolean onExceptionalCompletion(Throwable ex, |
233 |
< |
CountedCompleter caller) { |
233 |
> |
CountedCompleter<?> caller) { |
234 |
|
onExceptionalCompletionN.incrementAndGet(); |
235 |
|
assertNotNull(ex); |
236 |
|
assertTrue(isCompletedAbnormally()); |
278 |
|
|
279 |
|
final class NoopCC extends CheckedCC { |
280 |
|
NoopCC() { super(); } |
281 |
< |
NoopCC(CountedCompleter p) { super(p); } |
282 |
< |
NoopCC(CountedCompleter p, int initialPendingCount) { |
281 |
> |
NoopCC(CountedCompleter<?> p) { super(p); } |
282 |
> |
NoopCC(CountedCompleter<?> p, int initialPendingCount) { |
283 |
|
super(p, initialPendingCount); |
284 |
|
} |
285 |
|
protected void realCompute() {} |
400 |
|
public void testGetCompleter() { |
401 |
|
NoopCC a = new NoopCC(); |
402 |
|
assertNull(a.getCompleter()); |
403 |
< |
CountedCompleter b = new NoopCC(a); |
403 |
> |
NoopCC b = new NoopCC(a); |
404 |
|
assertSame(a, b.getCompleter()); |
405 |
< |
CountedCompleter c = new NoopCC(b); |
405 |
> |
NoopCC c = new NoopCC(b); |
406 |
|
assertSame(b, c.getCompleter()); |
407 |
|
} |
408 |
|
|
525 |
|
int number; |
526 |
|
int rnumber; |
527 |
|
|
528 |
< |
public CCF(CountedCompleter parent, int n) { |
528 |
> |
public CCF(CountedCompleter<?> parent, int n) { |
529 |
|
super(parent, 1); |
530 |
|
this.number = n; |
531 |
|
} |
543 |
|
|
544 |
|
final class LCCF extends CCF { |
545 |
|
public LCCF(int n) { this(null, n); } |
546 |
< |
public LCCF(CountedCompleter parent, int n) { |
546 |
> |
public LCCF(CountedCompleter<?> parent, int n) { |
547 |
|
super(parent, n); |
548 |
|
} |
549 |
< |
public final void onCompletion(CountedCompleter caller) { |
549 |
> |
public final void onCompletion(CountedCompleter<?> caller) { |
550 |
|
super.onCompletion(caller); |
551 |
|
CCF p = (CCF)getCompleter(); |
552 |
|
int n = number + rnumber; |
557 |
|
} |
558 |
|
} |
559 |
|
final class RCCF extends CCF { |
560 |
< |
public RCCF(CountedCompleter parent, int n) { |
560 |
> |
public RCCF(CountedCompleter<?> parent, int n) { |
561 |
|
super(parent, n); |
562 |
|
} |
563 |
< |
public final void onCompletion(CountedCompleter caller) { |
563 |
> |
public final void onCompletion(CountedCompleter<?> caller) { |
564 |
|
super.onCompletion(caller); |
565 |
|
CCF p = (CCF)getCompleter(); |
566 |
|
int n = number + rnumber; |
576 |
|
int number; |
577 |
|
int rnumber; |
578 |
|
|
579 |
< |
public FailingCCF(CountedCompleter parent, int n) { |
579 |
> |
public FailingCCF(CountedCompleter<?> parent, int n) { |
580 |
|
super(parent, 1); |
581 |
|
this.number = n; |
582 |
|
} |
594 |
|
|
595 |
|
final class LFCCF extends FailingCCF { |
596 |
|
public LFCCF(int n) { this(null, n); } |
597 |
< |
public LFCCF(CountedCompleter parent, int n) { |
597 |
> |
public LFCCF(CountedCompleter<?> parent, int n) { |
598 |
|
super(parent, n); |
599 |
|
} |
600 |
< |
public final void onCompletion(CountedCompleter caller) { |
600 |
> |
public final void onCompletion(CountedCompleter<?> caller) { |
601 |
|
super.onCompletion(caller); |
602 |
|
FailingCCF p = (FailingCCF)getCompleter(); |
603 |
|
int n = number + rnumber; |
608 |
|
} |
609 |
|
} |
610 |
|
final class RFCCF extends FailingCCF { |
611 |
< |
public RFCCF(CountedCompleter parent, int n) { |
611 |
> |
public RFCCF(CountedCompleter<?> parent, int n) { |
612 |
|
super(parent, n); |
613 |
|
} |
614 |
< |
public final void onCompletion(CountedCompleter caller) { |
614 |
> |
public final void onCompletion(CountedCompleter<?> caller) { |
615 |
|
super.onCompletion(caller); |
616 |
|
completeExceptionally(new FJException()); |
617 |
|
} |
623 |
|
* completed tasks; getRawResult returns null. |
624 |
|
*/ |
625 |
|
public void testInvoke() { |
626 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
626 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
627 |
|
protected void realCompute() { |
628 |
|
CCF f = new LCCF(8); |
629 |
|
assertNull(f.invoke()); |
639 |
|
* completed tasks |
640 |
|
*/ |
641 |
|
public void testQuietlyInvoke() { |
642 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
642 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
643 |
|
protected void realCompute() { |
644 |
|
CCF f = new LCCF(8); |
645 |
|
f.quietlyInvoke(); |
653 |
|
* join of a forked task returns when task completes |
654 |
|
*/ |
655 |
|
public void testForkJoin() { |
656 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
656 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
657 |
|
protected void realCompute() { |
658 |
|
CCF f = new LCCF(8); |
659 |
|
assertSame(f, f.fork()); |
668 |
|
* get of a forked task returns when task completes |
669 |
|
*/ |
670 |
|
public void testForkGet() { |
671 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
671 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
672 |
|
protected void realCompute() throws Exception { |
673 |
|
CCF f = new LCCF(8); |
674 |
|
assertSame(f, f.fork()); |
683 |
|
* timed get of a forked task returns when task completes |
684 |
|
*/ |
685 |
|
public void testForkTimedGet() { |
686 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
686 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
687 |
|
protected void realCompute() throws Exception { |
688 |
|
CCF f = new LCCF(8); |
689 |
|
assertSame(f, f.fork()); |
698 |
|
* timed get with null time unit throws NPE |
699 |
|
*/ |
700 |
|
public void testForkTimedGetNPE() { |
701 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
701 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
702 |
|
protected void realCompute() throws Exception { |
703 |
|
CCF f = new LCCF(8); |
704 |
|
assertSame(f, f.fork()); |
705 |
|
try { |
706 |
< |
f.get(5L, null); |
706 |
> |
f.get(randomTimeout(), null); |
707 |
|
shouldThrow(); |
708 |
|
} catch (NullPointerException success) {} |
709 |
|
}}; |
714 |
|
* quietlyJoin of a forked task returns when task completes |
715 |
|
*/ |
716 |
|
public void testForkQuietlyJoin() { |
717 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
717 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
718 |
|
protected void realCompute() { |
719 |
|
CCF f = new LCCF(8); |
720 |
|
assertSame(f, f.fork()); |
730 |
|
* getQueuedTaskCount returns 0 when quiescent |
731 |
|
*/ |
732 |
|
public void testForkHelpQuiesce() { |
733 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
733 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
734 |
|
protected void realCompute() { |
735 |
|
CCF f = new LCCF(8); |
736 |
|
assertSame(f, f.fork()); |
737 |
|
helpQuiesce(); |
738 |
+ |
while (!f.isDone()) // wait out race |
739 |
+ |
; |
740 |
|
assertEquals(21, f.number); |
741 |
|
assertEquals(0, getQueuedTaskCount()); |
742 |
|
checkCompletedNormally(f); |
748 |
|
* invoke task throws exception when task completes abnormally |
749 |
|
*/ |
750 |
|
public void testAbnormalInvoke() { |
751 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
751 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
752 |
|
protected void realCompute() { |
753 |
|
FailingCCF f = new LFCCF(8); |
754 |
|
try { |
765 |
|
* quietlyInvoke task returns when task completes abnormally |
766 |
|
*/ |
767 |
|
public void testAbnormalQuietlyInvoke() { |
768 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
768 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
769 |
|
protected void realCompute() { |
770 |
|
FailingCCF f = new LFCCF(8); |
771 |
|
f.quietlyInvoke(); |
779 |
|
* join of a forked task throws exception when task completes abnormally |
780 |
|
*/ |
781 |
|
public void testAbnormalForkJoin() { |
782 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
782 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
783 |
|
protected void realCompute() { |
784 |
|
FailingCCF f = new LFCCF(8); |
785 |
|
assertSame(f, f.fork()); |
797 |
|
* get of a forked task throws exception when task completes abnormally |
798 |
|
*/ |
799 |
|
public void testAbnormalForkGet() { |
800 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
800 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
801 |
|
protected void realCompute() throws Exception { |
802 |
|
FailingCCF f = new LFCCF(8); |
803 |
|
assertSame(f, f.fork()); |
817 |
|
* timed get of a forked task throws exception when task completes abnormally |
818 |
|
*/ |
819 |
|
public void testAbnormalForkTimedGet() { |
820 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
820 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
821 |
|
protected void realCompute() throws Exception { |
822 |
|
FailingCCF f = new LFCCF(8); |
823 |
|
assertSame(f, f.fork()); |
837 |
|
* quietlyJoin of a forked task returns when task completes abnormally |
838 |
|
*/ |
839 |
|
public void testAbnormalForkQuietlyJoin() { |
840 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
840 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
841 |
|
protected void realCompute() { |
842 |
|
FailingCCF f = new LFCCF(8); |
843 |
|
assertSame(f, f.fork()); |
852 |
|
* invoke task throws exception when task cancelled |
853 |
|
*/ |
854 |
|
public void testCancelledInvoke() { |
855 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
855 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
856 |
|
protected void realCompute() { |
857 |
|
CCF f = new LCCF(8); |
858 |
|
assertTrue(f.cancel(true)); |
870 |
|
* join of a forked task throws exception when task cancelled |
871 |
|
*/ |
872 |
|
public void testCancelledForkJoin() { |
873 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
873 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
874 |
|
protected void realCompute() { |
875 |
|
CCF f = new LCCF(8); |
876 |
|
assertTrue(f.cancel(true)); |
889 |
|
* get of a forked task throws exception when task cancelled |
890 |
|
*/ |
891 |
|
public void testCancelledForkGet() { |
892 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
892 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
893 |
|
protected void realCompute() throws Exception { |
894 |
|
CCF f = new LCCF(8); |
895 |
|
assertTrue(f.cancel(true)); |
908 |
|
* timed get of a forked task throws exception when task cancelled |
909 |
|
*/ |
910 |
|
public void testCancelledForkTimedGet() throws Exception { |
911 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
911 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
912 |
|
protected void realCompute() throws Exception { |
913 |
|
CCF f = new LCCF(8); |
914 |
|
assertTrue(f.cancel(true)); |
927 |
|
* quietlyJoin of a forked task returns when task cancelled |
928 |
|
*/ |
929 |
|
public void testCancelledForkQuietlyJoin() { |
930 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
930 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
931 |
|
protected void realCompute() { |
932 |
|
CCF f = new LCCF(8); |
933 |
|
assertTrue(f.cancel(true)); |
943 |
|
*/ |
944 |
|
public void testGetPool() { |
945 |
|
final ForkJoinPool mainPool = mainPool(); |
946 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
946 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
947 |
|
protected void realCompute() { |
948 |
|
assertSame(mainPool, getPool()); |
949 |
|
}}; |
954 |
|
* getPool of non-FJ task returns null |
955 |
|
*/ |
956 |
|
public void testGetPool2() { |
957 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
957 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
958 |
|
protected void realCompute() { |
959 |
|
assertNull(getPool()); |
960 |
|
}}; |
965 |
|
* inForkJoinPool of executing task returns true |
966 |
|
*/ |
967 |
|
public void testInForkJoinPool() { |
968 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
968 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
969 |
|
protected void realCompute() { |
970 |
|
assertTrue(inForkJoinPool()); |
971 |
|
}}; |
976 |
|
* inForkJoinPool of non-FJ task returns false |
977 |
|
*/ |
978 |
|
public void testInForkJoinPool2() { |
979 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
979 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
980 |
|
protected void realCompute() { |
981 |
|
assertFalse(inForkJoinPool()); |
982 |
|
}}; |
987 |
|
* setRawResult(null) succeeds |
988 |
|
*/ |
989 |
|
public void testSetRawResult() { |
990 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
990 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
991 |
|
protected void realCompute() { |
992 |
|
setRawResult(null); |
993 |
|
assertNull(getRawResult()); |
999 |
|
* invoke task throws exception after invoking completeExceptionally |
1000 |
|
*/ |
1001 |
|
public void testCompleteExceptionally2() { |
1002 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1002 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1003 |
|
protected void realCompute() { |
1004 |
|
CCF n = new LCCF(8); |
1005 |
|
CCF f = new LCCF(n, 8); |
1015 |
|
* invokeAll(t1, t2) invokes all task arguments |
1016 |
|
*/ |
1017 |
|
public void testInvokeAll2() { |
1018 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1018 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1019 |
|
protected void realCompute() { |
1020 |
|
CCF f = new LCCF(8); |
1021 |
|
CCF g = new LCCF(9); |
1032 |
|
* invokeAll(tasks) with 1 argument invokes task |
1033 |
|
*/ |
1034 |
|
public void testInvokeAll1() { |
1035 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1035 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1036 |
|
protected void realCompute() { |
1037 |
|
CCF f = new LCCF(8); |
1038 |
|
invokeAll(f); |
1046 |
|
* invokeAll(tasks) with > 2 argument invokes tasks |
1047 |
|
*/ |
1048 |
|
public void testInvokeAll3() { |
1049 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1049 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1050 |
|
protected void realCompute() { |
1051 |
|
CCF f = new LCCF(8); |
1052 |
|
CCF g = new LCCF(9); |
1066 |
|
* invokeAll(collection) invokes all tasks in the collection |
1067 |
|
*/ |
1068 |
|
public void testInvokeAllCollection() { |
1069 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1069 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1070 |
|
protected void realCompute() { |
1071 |
|
CCF f = new LCCF(8); |
1072 |
|
CCF g = new LCCF(9); |
1073 |
|
CCF h = new LCCF(7); |
1074 |
< |
HashSet set = new HashSet(); |
1074 |
> |
HashSet<CCF> set = new HashSet<CCF>(); |
1075 |
|
set.add(f); |
1076 |
|
set.add(g); |
1077 |
|
set.add(h); |
1090 |
|
* invokeAll(tasks) with any null task throws NPE |
1091 |
|
*/ |
1092 |
|
public void testInvokeAllNPE() { |
1093 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1093 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1094 |
|
protected void realCompute() { |
1095 |
|
CCF f = new LCCF(8); |
1096 |
|
CCF g = new LCCF(9); |
1107 |
|
* invokeAll(t1, t2) throw exception if any task does |
1108 |
|
*/ |
1109 |
|
public void testAbnormalInvokeAll2() { |
1110 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1110 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1111 |
|
protected void realCompute() { |
1112 |
|
CCF f = new LCCF(8); |
1113 |
|
FailingCCF g = new LFCCF(9); |
1125 |
|
* invokeAll(tasks) with 1 argument throws exception if task does |
1126 |
|
*/ |
1127 |
|
public void testAbnormalInvokeAll1() { |
1128 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1128 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1129 |
|
protected void realCompute() { |
1130 |
|
FailingCCF g = new LFCCF(9); |
1131 |
|
try { |
1142 |
|
* invokeAll(tasks) with > 2 argument throws exception if any task does |
1143 |
|
*/ |
1144 |
|
public void testAbnormalInvokeAll3() { |
1145 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1145 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1146 |
|
protected void realCompute() { |
1147 |
|
CCF f = new LCCF(8); |
1148 |
|
FailingCCF g = new LFCCF(9); |
1161 |
|
* invokeAll(collection) throws exception if any task does |
1162 |
|
*/ |
1163 |
|
public void testAbnormalInvokeAllCollection() { |
1164 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1164 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1165 |
|
protected void realCompute() { |
1166 |
|
FailingCCF f = new LFCCF(8); |
1167 |
|
CCF g = new LCCF(9); |
1168 |
|
CCF h = new LCCF(7); |
1169 |
< |
HashSet set = new HashSet(); |
1169 |
> |
HashSet<ForkJoinTask<?>> set = new HashSet<ForkJoinTask<?>>(); |
1170 |
|
set.add(f); |
1171 |
|
set.add(g); |
1172 |
|
set.add(h); |
1185 |
|
* and suppresses execution |
1186 |
|
*/ |
1187 |
|
public void testTryUnfork() { |
1188 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1188 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1189 |
|
protected void realCompute() { |
1190 |
|
CCF g = new LCCF(9); |
1191 |
|
assertSame(g, g.fork()); |
1204 |
|
* there are more tasks than threads |
1205 |
|
*/ |
1206 |
|
public void testGetSurplusQueuedTaskCount() { |
1207 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1207 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1208 |
|
protected void realCompute() { |
1209 |
|
CCF h = new LCCF(7); |
1210 |
|
assertSame(h, h.fork()); |
1226 |
|
* peekNextLocalTask returns most recent unexecuted task. |
1227 |
|
*/ |
1228 |
|
public void testPeekNextLocalTask() { |
1229 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1229 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1230 |
|
protected void realCompute() { |
1231 |
|
CCF g = new LCCF(9); |
1232 |
|
assertSame(g, g.fork()); |
1246 |
|
* executing it |
1247 |
|
*/ |
1248 |
|
public void testPollNextLocalTask() { |
1249 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1249 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1250 |
|
protected void realCompute() { |
1251 |
|
CCF g = new LCCF(9); |
1252 |
|
assertSame(g, g.fork()); |
1265 |
|
* pollTask returns an unexecuted task without executing it |
1266 |
|
*/ |
1267 |
|
public void testPollTask() { |
1268 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1268 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1269 |
|
protected void realCompute() { |
1270 |
|
CCF g = new LCCF(9); |
1271 |
|
assertSame(g, g.fork()); |
1283 |
|
* peekNextLocalTask returns least recent unexecuted task in async mode |
1284 |
|
*/ |
1285 |
|
public void testPeekNextLocalTaskAsync() { |
1286 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1286 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1287 |
|
protected void realCompute() { |
1288 |
|
CCF g = new LCCF(9); |
1289 |
|
assertSame(g, g.fork()); |
1304 |
|
* executing it, in async mode |
1305 |
|
*/ |
1306 |
|
public void testPollNextLocalTaskAsync() { |
1307 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1307 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1308 |
|
protected void realCompute() { |
1309 |
|
CCF g = new LCCF(9); |
1310 |
|
assertSame(g, g.fork()); |
1324 |
|
* async mode |
1325 |
|
*/ |
1326 |
|
public void testPollTaskAsync() { |
1327 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1327 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1328 |
|
protected void realCompute() { |
1329 |
|
CCF g = new LCCF(9); |
1330 |
|
assertSame(g, g.fork()); |
1347 |
|
* completed tasks; getRawResult returns null. |
1348 |
|
*/ |
1349 |
|
public void testInvokeSingleton() { |
1350 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1350 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1351 |
|
protected void realCompute() { |
1352 |
|
CCF f = new LCCF(8); |
1353 |
|
assertNull(f.invoke()); |
1363 |
|
* completed tasks |
1364 |
|
*/ |
1365 |
|
public void testQuietlyInvokeSingleton() { |
1366 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1366 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1367 |
|
protected void realCompute() { |
1368 |
|
CCF f = new LCCF(8); |
1369 |
|
f.quietlyInvoke(); |
1377 |
|
* join of a forked task returns when task completes |
1378 |
|
*/ |
1379 |
|
public void testForkJoinSingleton() { |
1380 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1380 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1381 |
|
protected void realCompute() { |
1382 |
|
CCF f = new LCCF(8); |
1383 |
|
assertSame(f, f.fork()); |
1392 |
|
* get of a forked task returns when task completes |
1393 |
|
*/ |
1394 |
|
public void testForkGetSingleton() { |
1395 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1395 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1396 |
|
protected void realCompute() throws Exception { |
1397 |
|
CCF f = new LCCF(8); |
1398 |
|
assertSame(f, f.fork()); |
1407 |
|
* timed get of a forked task returns when task completes |
1408 |
|
*/ |
1409 |
|
public void testForkTimedGetSingleton() { |
1410 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1410 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1411 |
|
protected void realCompute() throws Exception { |
1412 |
|
CCF f = new LCCF(8); |
1413 |
|
assertSame(f, f.fork()); |
1422 |
|
* timed get with null time unit throws NPE |
1423 |
|
*/ |
1424 |
|
public void testForkTimedGetNPESingleton() { |
1425 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1425 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1426 |
|
protected void realCompute() throws Exception { |
1427 |
|
CCF f = new LCCF(8); |
1428 |
|
assertSame(f, f.fork()); |
1429 |
|
try { |
1430 |
< |
f.get(5L, null); |
1430 |
> |
f.get(randomTimeout(), null); |
1431 |
|
shouldThrow(); |
1432 |
|
} catch (NullPointerException success) {} |
1433 |
|
}}; |
1438 |
|
* quietlyJoin of a forked task returns when task completes |
1439 |
|
*/ |
1440 |
|
public void testForkQuietlyJoinSingleton() { |
1441 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1441 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1442 |
|
protected void realCompute() { |
1443 |
|
CCF f = new LCCF(8); |
1444 |
|
assertSame(f, f.fork()); |
1454 |
|
* getQueuedTaskCount returns 0 when quiescent |
1455 |
|
*/ |
1456 |
|
public void testForkHelpQuiesceSingleton() { |
1457 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1457 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1458 |
|
protected void realCompute() { |
1459 |
|
CCF f = new LCCF(8); |
1460 |
|
assertSame(f, f.fork()); |
1470 |
|
* invoke task throws exception when task completes abnormally |
1471 |
|
*/ |
1472 |
|
public void testAbnormalInvokeSingleton() { |
1473 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1473 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1474 |
|
protected void realCompute() { |
1475 |
|
FailingCCF f = new LFCCF(8); |
1476 |
|
try { |
1487 |
|
* quietlyInvoke task returns when task completes abnormally |
1488 |
|
*/ |
1489 |
|
public void testAbnormalQuietlyInvokeSingleton() { |
1490 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1490 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1491 |
|
protected void realCompute() { |
1492 |
|
FailingCCF f = new LFCCF(8); |
1493 |
|
f.quietlyInvoke(); |
1501 |
|
* join of a forked task throws exception when task completes abnormally |
1502 |
|
*/ |
1503 |
|
public void testAbnormalForkJoinSingleton() { |
1504 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1504 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1505 |
|
protected void realCompute() { |
1506 |
|
FailingCCF f = new LFCCF(8); |
1507 |
|
assertSame(f, f.fork()); |
1519 |
|
* get of a forked task throws exception when task completes abnormally |
1520 |
|
*/ |
1521 |
|
public void testAbnormalForkGetSingleton() { |
1522 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1522 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1523 |
|
protected void realCompute() throws Exception { |
1524 |
|
FailingCCF f = new LFCCF(8); |
1525 |
|
assertSame(f, f.fork()); |
1539 |
|
* timed get of a forked task throws exception when task completes abnormally |
1540 |
|
*/ |
1541 |
|
public void testAbnormalForkTimedGetSingleton() { |
1542 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1542 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1543 |
|
protected void realCompute() throws Exception { |
1544 |
|
FailingCCF f = new LFCCF(8); |
1545 |
|
assertSame(f, f.fork()); |
1559 |
|
* quietlyJoin of a forked task returns when task completes abnormally |
1560 |
|
*/ |
1561 |
|
public void testAbnormalForkQuietlyJoinSingleton() { |
1562 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1562 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1563 |
|
protected void realCompute() { |
1564 |
|
FailingCCF f = new LFCCF(8); |
1565 |
|
assertSame(f, f.fork()); |
1574 |
|
* invoke task throws exception when task cancelled |
1575 |
|
*/ |
1576 |
|
public void testCancelledInvokeSingleton() { |
1577 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1577 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1578 |
|
protected void realCompute() { |
1579 |
|
CCF f = new LCCF(8); |
1580 |
|
assertTrue(f.cancel(true)); |
1592 |
|
* join of a forked task throws exception when task cancelled |
1593 |
|
*/ |
1594 |
|
public void testCancelledForkJoinSingleton() { |
1595 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1595 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1596 |
|
protected void realCompute() { |
1597 |
|
CCF f = new LCCF(8); |
1598 |
|
assertTrue(f.cancel(true)); |
1611 |
|
* get of a forked task throws exception when task cancelled |
1612 |
|
*/ |
1613 |
|
public void testCancelledForkGetSingleton() { |
1614 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1614 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1615 |
|
protected void realCompute() throws Exception { |
1616 |
|
CCF f = new LCCF(8); |
1617 |
|
assertTrue(f.cancel(true)); |
1630 |
|
* timed get of a forked task throws exception when task cancelled |
1631 |
|
*/ |
1632 |
|
public void testCancelledForkTimedGetSingleton() throws Exception { |
1633 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1633 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1634 |
|
protected void realCompute() throws Exception { |
1635 |
|
CCF f = new LCCF(8); |
1636 |
|
assertTrue(f.cancel(true)); |
1649 |
|
* quietlyJoin of a forked task returns when task cancelled |
1650 |
|
*/ |
1651 |
|
public void testCancelledForkQuietlyJoinSingleton() { |
1652 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1652 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1653 |
|
protected void realCompute() { |
1654 |
|
CCF f = new LCCF(8); |
1655 |
|
assertTrue(f.cancel(true)); |
1664 |
|
* invoke task throws exception after invoking completeExceptionally |
1665 |
|
*/ |
1666 |
|
public void testCompleteExceptionallySingleton() { |
1667 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1667 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1668 |
|
protected void realCompute() { |
1669 |
|
CCF n = new LCCF(8); |
1670 |
|
CCF f = new LCCF(n, 8); |
1680 |
|
* invokeAll(t1, t2) invokes all task arguments |
1681 |
|
*/ |
1682 |
|
public void testInvokeAll2Singleton() { |
1683 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1683 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1684 |
|
protected void realCompute() { |
1685 |
|
CCF f = new LCCF(8); |
1686 |
|
CCF g = new LCCF(9); |
1697 |
|
* invokeAll(tasks) with 1 argument invokes task |
1698 |
|
*/ |
1699 |
|
public void testInvokeAll1Singleton() { |
1700 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1700 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1701 |
|
protected void realCompute() { |
1702 |
|
CCF f = new LCCF(8); |
1703 |
|
invokeAll(f); |
1711 |
|
* invokeAll(tasks) with > 2 argument invokes tasks |
1712 |
|
*/ |
1713 |
|
public void testInvokeAll3Singleton() { |
1714 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1714 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1715 |
|
protected void realCompute() { |
1716 |
|
CCF f = new LCCF(8); |
1717 |
|
CCF g = new LCCF(9); |
1731 |
|
* invokeAll(collection) invokes all tasks in the collection |
1732 |
|
*/ |
1733 |
|
public void testInvokeAllCollectionSingleton() { |
1734 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1734 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1735 |
|
protected void realCompute() { |
1736 |
|
CCF f = new LCCF(8); |
1737 |
|
CCF g = new LCCF(9); |
1738 |
|
CCF h = new LCCF(7); |
1739 |
< |
HashSet set = new HashSet(); |
1739 |
> |
HashSet<ForkJoinTask<?>> set = new HashSet<ForkJoinTask<?>>(); |
1740 |
|
set.add(f); |
1741 |
|
set.add(g); |
1742 |
|
set.add(h); |
1755 |
|
* invokeAll(tasks) with any null task throws NPE |
1756 |
|
*/ |
1757 |
|
public void testInvokeAllNPESingleton() { |
1758 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1758 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1759 |
|
protected void realCompute() { |
1760 |
|
CCF f = new LCCF(8); |
1761 |
|
CCF g = new LCCF(9); |
1772 |
|
* invokeAll(t1, t2) throw exception if any task does |
1773 |
|
*/ |
1774 |
|
public void testAbnormalInvokeAll2Singleton() { |
1775 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1775 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1776 |
|
protected void realCompute() { |
1777 |
|
CCF f = new LCCF(8); |
1778 |
|
FailingCCF g = new LFCCF(9); |
1790 |
|
* invokeAll(tasks) with 1 argument throws exception if task does |
1791 |
|
*/ |
1792 |
|
public void testAbnormalInvokeAll1Singleton() { |
1793 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1793 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1794 |
|
protected void realCompute() { |
1795 |
|
FailingCCF g = new LFCCF(9); |
1796 |
|
try { |
1807 |
|
* invokeAll(tasks) with > 2 argument throws exception if any task does |
1808 |
|
*/ |
1809 |
|
public void testAbnormalInvokeAll3Singleton() { |
1810 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1810 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1811 |
|
protected void realCompute() { |
1812 |
|
CCF f = new LCCF(8); |
1813 |
|
FailingCCF g = new LFCCF(9); |
1826 |
|
* invokeAll(collection) throws exception if any task does |
1827 |
|
*/ |
1828 |
|
public void testAbnormalInvokeAllCollectionSingleton() { |
1829 |
< |
ForkJoinTask a = new CheckedRecursiveAction() { |
1829 |
> |
CheckedRecursiveAction a = new CheckedRecursiveAction() { |
1830 |
|
protected void realCompute() { |
1831 |
|
FailingCCF f = new LFCCF(8); |
1832 |
|
CCF g = new LCCF(9); |
1833 |
|
CCF h = new LCCF(7); |
1834 |
< |
HashSet set = new HashSet(); |
1834 |
> |
HashSet<ForkJoinTask<?>> set = new HashSet<ForkJoinTask<?>>(); |
1835 |
|
set.add(f); |
1836 |
|
set.add(g); |
1837 |
|
set.add(h); |
1845 |
|
testInvokeOnPool(singletonPool(), a); |
1846 |
|
} |
1847 |
|
|
1848 |
– |
/** CountedCompleter class javadoc code sample, version 1. */ |
1849 |
– |
public static <E> void forEach1(E[] array, Consumer<E> action) { |
1850 |
– |
class Task extends CountedCompleter<Void> { |
1851 |
– |
final int lo, hi; |
1852 |
– |
Task(Task parent, int lo, int hi) { |
1853 |
– |
super(parent); this.lo = lo; this.hi = hi; |
1854 |
– |
} |
1855 |
– |
|
1856 |
– |
public void compute() { |
1857 |
– |
if (hi - lo >= 2) { |
1858 |
– |
int mid = (lo + hi) >>> 1; |
1859 |
– |
// must set pending count before fork |
1860 |
– |
setPendingCount(2); |
1861 |
– |
new Task(this, mid, hi).fork(); // right child |
1862 |
– |
new Task(this, lo, mid).fork(); // left child |
1863 |
– |
} |
1864 |
– |
else if (hi > lo) |
1865 |
– |
action.accept(array[lo]); |
1866 |
– |
tryComplete(); |
1867 |
– |
} |
1868 |
– |
} |
1869 |
– |
new Task(null, 0, array.length).invoke(); |
1870 |
– |
} |
1871 |
– |
|
1872 |
– |
/** CountedCompleter class javadoc code sample, version 2. */ |
1873 |
– |
public static <E> void forEach2(E[] array, Consumer<E> action) { |
1874 |
– |
class Task extends CountedCompleter<Void> { |
1875 |
– |
final int lo, hi; |
1876 |
– |
Task(Task parent, int lo, int hi) { |
1877 |
– |
super(parent); this.lo = lo; this.hi = hi; |
1878 |
– |
} |
1879 |
– |
|
1880 |
– |
public void compute() { |
1881 |
– |
if (hi - lo >= 2) { |
1882 |
– |
int mid = (lo + hi) >>> 1; |
1883 |
– |
setPendingCount(1); // not off by one ! |
1884 |
– |
new Task(this, mid, hi).fork(); // right child |
1885 |
– |
new Task(this, lo, mid).compute(); // direct invoke |
1886 |
– |
} else { |
1887 |
– |
if (hi > lo) |
1888 |
– |
action.accept(array[lo]); |
1889 |
– |
tryComplete(); |
1890 |
– |
} |
1891 |
– |
} |
1892 |
– |
} |
1893 |
– |
new Task(null, 0, array.length).invoke(); |
1894 |
– |
} |
1895 |
– |
|
1896 |
– |
/** CountedCompleter class javadoc code sample, version 3. */ |
1897 |
– |
public static <E> void forEach3(E[] array, Consumer<E> action) { |
1898 |
– |
class Task extends CountedCompleter<Void> { |
1899 |
– |
final int lo, hi; |
1900 |
– |
Task(Task parent, int lo, int hi) { |
1901 |
– |
super(parent); this.lo = lo; this.hi = hi; |
1902 |
– |
} |
1903 |
– |
|
1904 |
– |
public void compute() { |
1905 |
– |
int n = hi - lo; |
1906 |
– |
for (; n >= 2; n /= 2) { |
1907 |
– |
addToPendingCount(1); |
1908 |
– |
new Task(this, lo + n/2, lo + n).fork(); |
1909 |
– |
} |
1910 |
– |
if (n > 0) |
1911 |
– |
action.accept(array[lo]); |
1912 |
– |
propagateCompletion(); |
1913 |
– |
} |
1914 |
– |
} |
1915 |
– |
new Task(null, 0, array.length).invoke(); |
1916 |
– |
} |
1917 |
– |
|
1918 |
– |
/** CountedCompleter class javadoc code sample, version 4. */ |
1919 |
– |
public static <E> void forEach4(E[] array, Consumer<E> action) { |
1920 |
– |
class Task extends CountedCompleter<Void> { |
1921 |
– |
final int lo, hi; |
1922 |
– |
Task(Task parent, int lo, int hi) { |
1923 |
– |
super(parent, 31 - Integer.numberOfLeadingZeros(hi - lo)); |
1924 |
– |
this.lo = lo; this.hi = hi; |
1925 |
– |
} |
1926 |
– |
|
1927 |
– |
public void compute() { |
1928 |
– |
for (int n = hi - lo; n >= 2; n /= 2) |
1929 |
– |
new Task(this, lo + n/2, lo + n).fork(); |
1930 |
– |
action.accept(array[lo]); |
1931 |
– |
propagateCompletion(); |
1932 |
– |
} |
1933 |
– |
} |
1934 |
– |
if (array.length > 0) |
1935 |
– |
new Task(null, 0, array.length).invoke(); |
1936 |
– |
} |
1937 |
– |
|
1938 |
– |
void testRecursiveDecomposition( |
1939 |
– |
BiConsumer<Integer[], Consumer<Integer>> action) { |
1940 |
– |
int n = ThreadLocalRandom.current().nextInt(8); |
1941 |
– |
Integer[] a = new Integer[n]; |
1942 |
– |
for (int i = 0; i < n; i++) a[i] = i + 1; |
1943 |
– |
AtomicInteger ai = new AtomicInteger(0); |
1944 |
– |
action.accept(a, (x) -> ai.addAndGet(x)); |
1945 |
– |
assertEquals(n * (n + 1) / 2, ai.get()); |
1946 |
– |
} |
1947 |
– |
|
1948 |
– |
/** |
1949 |
– |
* Variants of divide-by-two recursive decomposition into leaf tasks, |
1950 |
– |
* as described in the CountedCompleter class javadoc code samples |
1951 |
– |
*/ |
1952 |
– |
public void testRecursiveDecomposition() { |
1953 |
– |
testRecursiveDecomposition(CountedCompleterTest::forEach1); |
1954 |
– |
testRecursiveDecomposition(CountedCompleterTest::forEach2); |
1955 |
– |
testRecursiveDecomposition(CountedCompleterTest::forEach3); |
1956 |
– |
testRecursiveDecomposition(CountedCompleterTest::forEach4); |
1957 |
– |
} |
1958 |
– |
|
1848 |
|
} |