173 |
|
final int number; |
174 |
|
int result; |
175 |
|
FibAction(int n) { number = n; } |
176 |
< |
public void realCompute() { |
176 |
> |
protected void realCompute() { |
177 |
|
int n = number; |
178 |
|
if (n <= 1) |
179 |
|
result = n; |
211 |
|
*/ |
212 |
|
public void testInvoke() { |
213 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
214 |
< |
public void realCompute() { |
214 |
> |
protected void realCompute() { |
215 |
|
FibAction f = new FibAction(8); |
216 |
|
assertNull(f.invoke()); |
217 |
|
assertEquals(21, f.result); |
227 |
|
*/ |
228 |
|
public void testQuietlyInvoke() { |
229 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
230 |
< |
public void realCompute() { |
230 |
> |
protected void realCompute() { |
231 |
|
FibAction f = new FibAction(8); |
232 |
|
f.quietlyInvoke(); |
233 |
|
assertEquals(21, f.result); |
241 |
|
*/ |
242 |
|
public void testForkJoin() { |
243 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
244 |
< |
public void realCompute() { |
244 |
> |
protected void realCompute() { |
245 |
|
FibAction f = new FibAction(8); |
246 |
|
assertSame(f, f.fork()); |
247 |
|
assertNull(f.join()); |
256 |
|
*/ |
257 |
|
public void testJoinIgnoresInterrupts() { |
258 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
259 |
< |
public void realCompute() { |
259 |
> |
protected void realCompute() { |
260 |
|
FibAction f = new FibAction(8); |
261 |
|
final Thread myself = Thread.currentThread(); |
262 |
|
|
336 |
|
final SynchronousQueue<FibAction[]> sq = |
337 |
|
new SynchronousQueue<FibAction[]>(); |
338 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
339 |
< |
public void realCompute() throws InterruptedException { |
339 |
> |
protected void realCompute() throws InterruptedException { |
340 |
|
FibAction[] fibActions = new FibAction[6]; |
341 |
|
for (int i = 0; i < fibActions.length; i++) |
342 |
|
fibActions[i] = new FibAction(8); |
436 |
|
*/ |
437 |
|
public void testForkGet() { |
438 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
439 |
< |
public void realCompute() throws Exception { |
439 |
> |
protected void realCompute() throws Exception { |
440 |
|
FibAction f = new FibAction(8); |
441 |
|
assertSame(f, f.fork()); |
442 |
|
assertNull(f.get()); |
451 |
|
*/ |
452 |
|
public void testForkTimedGet() { |
453 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
454 |
< |
public void realCompute() throws Exception { |
454 |
> |
protected void realCompute() throws Exception { |
455 |
|
FibAction f = new FibAction(8); |
456 |
|
assertSame(f, f.fork()); |
457 |
|
assertNull(f.get(5L, SECONDS)); |
466 |
|
*/ |
467 |
|
public void testForkTimedGetNPE() { |
468 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
469 |
< |
public void realCompute() throws Exception { |
469 |
> |
protected void realCompute() throws Exception { |
470 |
|
FibAction f = new FibAction(8); |
471 |
|
assertSame(f, f.fork()); |
472 |
|
try { |
482 |
|
*/ |
483 |
|
public void testForkQuietlyJoin() { |
484 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
485 |
< |
public void realCompute() { |
485 |
> |
protected void realCompute() { |
486 |
|
FibAction f = new FibAction(8); |
487 |
|
assertSame(f, f.fork()); |
488 |
|
f.quietlyJoin(); |
498 |
|
*/ |
499 |
|
public void testForkHelpQuiesce() { |
500 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
501 |
< |
public void realCompute() { |
501 |
> |
protected void realCompute() { |
502 |
|
FibAction f = new FibAction(8); |
503 |
|
assertSame(f, f.fork()); |
504 |
|
helpQuiesce(); |
514 |
|
*/ |
515 |
|
public void testAbnormalInvoke() { |
516 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
517 |
< |
public void realCompute() { |
517 |
> |
protected void realCompute() { |
518 |
|
FailingFibAction f = new FailingFibAction(8); |
519 |
|
try { |
520 |
|
f.invoke(); |
531 |
|
*/ |
532 |
|
public void testAbnormalQuietlyInvoke() { |
533 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
534 |
< |
public void realCompute() { |
534 |
> |
protected void realCompute() { |
535 |
|
FailingFibAction f = new FailingFibAction(8); |
536 |
|
f.quietlyInvoke(); |
537 |
|
assertTrue(f.getException() instanceof FJException); |
545 |
|
*/ |
546 |
|
public void testAbnormalForkJoin() { |
547 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
548 |
< |
public void realCompute() { |
548 |
> |
protected void realCompute() { |
549 |
|
FailingFibAction f = new FailingFibAction(8); |
550 |
|
assertSame(f, f.fork()); |
551 |
|
try { |
563 |
|
*/ |
564 |
|
public void testAbnormalForkGet() { |
565 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
566 |
< |
public void realCompute() throws Exception { |
566 |
> |
protected void realCompute() throws Exception { |
567 |
|
FailingFibAction f = new FailingFibAction(8); |
568 |
|
assertSame(f, f.fork()); |
569 |
|
try { |
583 |
|
*/ |
584 |
|
public void testAbnormalForkTimedGet() { |
585 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
586 |
< |
public void realCompute() throws Exception { |
586 |
> |
protected void realCompute() throws Exception { |
587 |
|
FailingFibAction f = new FailingFibAction(8); |
588 |
|
assertSame(f, f.fork()); |
589 |
|
try { |
603 |
|
*/ |
604 |
|
public void testAbnormalForkQuietlyJoin() { |
605 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
606 |
< |
public void realCompute() { |
606 |
> |
protected void realCompute() { |
607 |
|
FailingFibAction f = new FailingFibAction(8); |
608 |
|
assertSame(f, f.fork()); |
609 |
|
f.quietlyJoin(); |
618 |
|
*/ |
619 |
|
public void testCancelledInvoke() { |
620 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
621 |
< |
public void realCompute() { |
621 |
> |
protected void realCompute() { |
622 |
|
FibAction f = new FibAction(8); |
623 |
|
assertTrue(f.cancel(true)); |
624 |
|
try { |
636 |
|
*/ |
637 |
|
public void testCancelledForkJoin() { |
638 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
639 |
< |
public void realCompute() { |
639 |
> |
protected void realCompute() { |
640 |
|
FibAction f = new FibAction(8); |
641 |
|
assertTrue(f.cancel(true)); |
642 |
|
assertSame(f, f.fork()); |
655 |
|
*/ |
656 |
|
public void testCancelledForkGet() { |
657 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
658 |
< |
public void realCompute() throws Exception { |
658 |
> |
protected void realCompute() throws Exception { |
659 |
|
FibAction f = new FibAction(8); |
660 |
|
assertTrue(f.cancel(true)); |
661 |
|
assertSame(f, f.fork()); |
674 |
|
*/ |
675 |
|
public void testCancelledForkTimedGet() { |
676 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
677 |
< |
public void realCompute() throws Exception { |
677 |
> |
protected void realCompute() throws Exception { |
678 |
|
FibAction f = new FibAction(8); |
679 |
|
assertTrue(f.cancel(true)); |
680 |
|
assertSame(f, f.fork()); |
693 |
|
*/ |
694 |
|
public void testCancelledForkQuietlyJoin() { |
695 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
696 |
< |
public void realCompute() { |
696 |
> |
protected void realCompute() { |
697 |
|
FibAction f = new FibAction(8); |
698 |
|
assertTrue(f.cancel(true)); |
699 |
|
assertSame(f, f.fork()); |
709 |
|
public void testGetPool() { |
710 |
|
final ForkJoinPool mainPool = mainPool(); |
711 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
712 |
< |
public void realCompute() { |
712 |
> |
protected void realCompute() { |
713 |
|
assertSame(mainPool, getPool()); |
714 |
|
}}; |
715 |
|
testInvokeOnPool(mainPool, a); |
720 |
|
*/ |
721 |
|
public void testGetPool2() { |
722 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
723 |
< |
public void realCompute() { |
723 |
> |
protected void realCompute() { |
724 |
|
assertNull(getPool()); |
725 |
|
}}; |
726 |
|
assertNull(a.invoke()); |
731 |
|
*/ |
732 |
|
public void testInForkJoinPool() { |
733 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
734 |
< |
public void realCompute() { |
734 |
> |
protected void realCompute() { |
735 |
|
assertTrue(inForkJoinPool()); |
736 |
|
}}; |
737 |
|
testInvokeOnPool(mainPool(), a); |
742 |
|
*/ |
743 |
|
public void testInForkJoinPool2() { |
744 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
745 |
< |
public void realCompute() { |
745 |
> |
protected void realCompute() { |
746 |
|
assertFalse(inForkJoinPool()); |
747 |
|
}}; |
748 |
|
assertNull(a.invoke()); |
754 |
|
public void testWorkerGetPool() { |
755 |
|
final ForkJoinPool mainPool = mainPool(); |
756 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
757 |
< |
public void realCompute() { |
757 |
> |
protected void realCompute() { |
758 |
|
ForkJoinWorkerThread w = |
759 |
|
(ForkJoinWorkerThread) Thread.currentThread(); |
760 |
|
assertSame(mainPool, w.getPool()); |
768 |
|
public void testWorkerGetPoolIndex() { |
769 |
|
final ForkJoinPool mainPool = mainPool(); |
770 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
771 |
< |
public void realCompute() { |
771 |
> |
protected void realCompute() { |
772 |
|
ForkJoinWorkerThread w = |
773 |
|
(ForkJoinWorkerThread) Thread.currentThread(); |
774 |
|
assertTrue(w.getPoolIndex() >= 0); |
783 |
|
*/ |
784 |
|
public void testSetRawResult() { |
785 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
786 |
< |
public void realCompute() { |
786 |
> |
protected void realCompute() { |
787 |
|
setRawResult(null); |
788 |
|
assertNull(getRawResult()); |
789 |
|
}}; |
795 |
|
*/ |
796 |
|
public void testReinitialize() { |
797 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
798 |
< |
public void realCompute() { |
798 |
> |
protected void realCompute() { |
799 |
|
FibAction f = new FibAction(8); |
800 |
|
checkNotDone(f); |
801 |
|
|
815 |
|
*/ |
816 |
|
public void testReinitializeAbnormal() { |
817 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
818 |
< |
public void realCompute() { |
818 |
> |
protected void realCompute() { |
819 |
|
FailingFibAction f = new FailingFibAction(8); |
820 |
|
checkNotDone(f); |
821 |
|
|
838 |
|
*/ |
839 |
|
public void testCompleteExceptionally() { |
840 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
841 |
< |
public void realCompute() { |
841 |
> |
protected void realCompute() { |
842 |
|
FibAction f = new FibAction(8); |
843 |
|
f.completeExceptionally(new FJException()); |
844 |
|
try { |
856 |
|
*/ |
857 |
|
public void testComplete() { |
858 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
859 |
< |
public void realCompute() { |
859 |
> |
protected void realCompute() { |
860 |
|
FibAction f = new FibAction(8); |
861 |
|
f.complete(null); |
862 |
|
assertNull(f.invoke()); |
871 |
|
*/ |
872 |
|
public void testInvokeAll2() { |
873 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
874 |
< |
public void realCompute() { |
874 |
> |
protected void realCompute() { |
875 |
|
FibAction f = new FibAction(8); |
876 |
|
FibAction g = new FibAction(9); |
877 |
|
invokeAll(f, g); |
888 |
|
*/ |
889 |
|
public void testInvokeAll1() { |
890 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
891 |
< |
public void realCompute() { |
891 |
> |
protected void realCompute() { |
892 |
|
FibAction f = new FibAction(8); |
893 |
|
invokeAll(f); |
894 |
|
checkCompletedNormally(f); |
902 |
|
*/ |
903 |
|
public void testInvokeAll3() { |
904 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
905 |
< |
public void realCompute() { |
905 |
> |
protected void realCompute() { |
906 |
|
FibAction f = new FibAction(8); |
907 |
|
FibAction g = new FibAction(9); |
908 |
|
FibAction h = new FibAction(7); |
925 |
|
*/ |
926 |
|
public void testInvokeAllCollection() { |
927 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
928 |
< |
public void realCompute() { |
928 |
> |
protected void realCompute() { |
929 |
|
FibAction f = new FibAction(8); |
930 |
|
FibAction g = new FibAction(9); |
931 |
|
FibAction h = new FibAction(7); |
952 |
|
*/ |
953 |
|
public void testInvokeAllNPE() { |
954 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
955 |
< |
public void realCompute() { |
955 |
> |
protected void realCompute() { |
956 |
|
FibAction f = new FibAction(8); |
957 |
|
FibAction g = new FibAction(9); |
958 |
|
FibAction h = null; |
969 |
|
*/ |
970 |
|
public void testAbnormalInvokeAll2() { |
971 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
972 |
< |
public void realCompute() { |
972 |
> |
protected void realCompute() { |
973 |
|
FibAction f = new FibAction(8); |
974 |
|
FailingFibAction g = new FailingFibAction(9); |
975 |
|
try { |
987 |
|
*/ |
988 |
|
public void testAbnormalInvokeAll1() { |
989 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
990 |
< |
public void realCompute() { |
990 |
> |
protected void realCompute() { |
991 |
|
FailingFibAction g = new FailingFibAction(9); |
992 |
|
try { |
993 |
|
invokeAll(g); |
1004 |
|
*/ |
1005 |
|
public void testAbnormalInvokeAll3() { |
1006 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1007 |
< |
public void realCompute() { |
1007 |
> |
protected void realCompute() { |
1008 |
|
FibAction f = new FibAction(8); |
1009 |
|
FailingFibAction g = new FailingFibAction(9); |
1010 |
|
FibAction h = new FibAction(7); |
1023 |
|
*/ |
1024 |
|
public void testAbnormalInvokeAllCollection() { |
1025 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1026 |
< |
public void realCompute() { |
1026 |
> |
protected void realCompute() { |
1027 |
|
FailingFibAction f = new FailingFibAction(8); |
1028 |
|
FibAction g = new FibAction(9); |
1029 |
|
FibAction h = new FibAction(7); |
1047 |
|
*/ |
1048 |
|
public void testTryUnfork() { |
1049 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1050 |
< |
public void realCompute() { |
1050 |
> |
protected void realCompute() { |
1051 |
|
FibAction g = new FibAction(9); |
1052 |
|
assertSame(g, g.fork()); |
1053 |
|
FibAction f = new FibAction(8); |
1066 |
|
*/ |
1067 |
|
public void testGetSurplusQueuedTaskCount() { |
1068 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1069 |
< |
public void realCompute() { |
1069 |
> |
protected void realCompute() { |
1070 |
|
FibAction h = new FibAction(7); |
1071 |
|
assertSame(h, h.fork()); |
1072 |
|
FibAction g = new FibAction(9); |
1088 |
|
*/ |
1089 |
|
public void testPeekNextLocalTask() { |
1090 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1091 |
< |
public void realCompute() { |
1091 |
> |
protected void realCompute() { |
1092 |
|
FibAction g = new FibAction(9); |
1093 |
|
assertSame(g, g.fork()); |
1094 |
|
FibAction f = new FibAction(8); |
1109 |
|
*/ |
1110 |
|
public void testPollNextLocalTask() { |
1111 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1112 |
< |
public void realCompute() { |
1112 |
> |
protected void realCompute() { |
1113 |
|
FibAction g = new FibAction(9); |
1114 |
|
assertSame(g, g.fork()); |
1115 |
|
FibAction f = new FibAction(8); |
1127 |
|
*/ |
1128 |
|
public void testPollTask() { |
1129 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1130 |
< |
public void realCompute() { |
1130 |
> |
protected void realCompute() { |
1131 |
|
FibAction g = new FibAction(9); |
1132 |
|
assertSame(g, g.fork()); |
1133 |
|
FibAction f = new FibAction(8); |
1145 |
|
*/ |
1146 |
|
public void testPeekNextLocalTaskAsync() { |
1147 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1148 |
< |
public void realCompute() { |
1148 |
> |
protected void realCompute() { |
1149 |
|
FibAction g = new FibAction(9); |
1150 |
|
assertSame(g, g.fork()); |
1151 |
|
FibAction f = new FibAction(8); |
1165 |
|
*/ |
1166 |
|
public void testPollNextLocalTaskAsync() { |
1167 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1168 |
< |
public void realCompute() { |
1168 |
> |
protected void realCompute() { |
1169 |
|
FibAction g = new FibAction(9); |
1170 |
|
assertSame(g, g.fork()); |
1171 |
|
FibAction f = new FibAction(8); |
1184 |
|
*/ |
1185 |
|
public void testPollTaskAsync() { |
1186 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1187 |
< |
public void realCompute() { |
1187 |
> |
protected void realCompute() { |
1188 |
|
FibAction g = new FibAction(9); |
1189 |
|
assertSame(g, g.fork()); |
1190 |
|
FibAction f = new FibAction(8); |