4 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
< |
import junit.framework.*; |
7 |
> |
import static java.util.concurrent.TimeUnit.SECONDS; |
8 |
> |
|
9 |
> |
import java.util.Arrays; |
10 |
> |
import java.util.HashSet; |
11 |
|
import java.util.concurrent.CancellationException; |
9 |
– |
import java.util.concurrent.SynchronousQueue; |
12 |
|
import java.util.concurrent.ExecutionException; |
13 |
|
import java.util.concurrent.ForkJoinPool; |
14 |
|
import java.util.concurrent.ForkJoinTask; |
15 |
|
import java.util.concurrent.ForkJoinWorkerThread; |
16 |
|
import java.util.concurrent.RecursiveAction; |
17 |
< |
import java.util.concurrent.TimeUnit; |
17 |
> |
import java.util.concurrent.SynchronousQueue; |
18 |
> |
import java.util.concurrent.ThreadLocalRandom; |
19 |
|
import java.util.concurrent.TimeoutException; |
20 |
< |
import static java.util.concurrent.TimeUnit.SECONDS; |
21 |
< |
import java.util.HashSet; |
20 |
> |
import java.util.concurrent.TimeUnit; |
21 |
> |
|
22 |
> |
import junit.framework.Test; |
23 |
> |
import junit.framework.TestSuite; |
24 |
|
|
25 |
|
public class RecursiveActionTest extends JSR166TestCase { |
26 |
|
|
176 |
|
final int number; |
177 |
|
int result; |
178 |
|
FibAction(int n) { number = n; } |
179 |
< |
public void realCompute() { |
179 |
> |
protected void realCompute() { |
180 |
|
int n = number; |
181 |
|
if (n <= 1) |
182 |
|
result = n; |
214 |
|
*/ |
215 |
|
public void testInvoke() { |
216 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
217 |
< |
public void realCompute() { |
217 |
> |
protected void realCompute() { |
218 |
|
FibAction f = new FibAction(8); |
219 |
|
assertNull(f.invoke()); |
220 |
|
assertEquals(21, f.result); |
230 |
|
*/ |
231 |
|
public void testQuietlyInvoke() { |
232 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
233 |
< |
public void realCompute() { |
233 |
> |
protected void realCompute() { |
234 |
|
FibAction f = new FibAction(8); |
235 |
|
f.quietlyInvoke(); |
236 |
|
assertEquals(21, f.result); |
244 |
|
*/ |
245 |
|
public void testForkJoin() { |
246 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
247 |
< |
public void realCompute() { |
247 |
> |
protected void realCompute() { |
248 |
|
FibAction f = new FibAction(8); |
249 |
|
assertSame(f, f.fork()); |
250 |
|
assertNull(f.join()); |
259 |
|
*/ |
260 |
|
public void testJoinIgnoresInterrupts() { |
261 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
262 |
< |
public void realCompute() { |
262 |
> |
protected void realCompute() { |
263 |
|
FibAction f = new FibAction(8); |
264 |
|
final Thread myself = Thread.currentThread(); |
265 |
|
|
272 |
|
assertEquals(21, f.result); |
273 |
|
checkCompletedNormally(f); |
274 |
|
|
275 |
< |
f.reinitialize(); |
275 |
> |
f = new FibAction(8); |
276 |
|
f.cancel(true); |
277 |
|
assertSame(f, f.fork()); |
278 |
|
myself.interrupt(); |
285 |
|
checkCancelled(f); |
286 |
|
} |
287 |
|
|
288 |
< |
f.reinitialize(); |
288 |
> |
f = new FibAction(8); |
289 |
|
f.completeExceptionally(new FJException()); |
290 |
|
assertSame(f, f.fork()); |
291 |
|
myself.interrupt(); |
299 |
|
} |
300 |
|
|
301 |
|
// test quietlyJoin() |
302 |
< |
f.reinitialize(); |
302 |
> |
f = new FibAction(8); |
303 |
|
assertSame(f, f.fork()); |
304 |
|
myself.interrupt(); |
305 |
|
assertTrue(myself.isInterrupted()); |
308 |
|
assertEquals(21, f.result); |
309 |
|
checkCompletedNormally(f); |
310 |
|
|
311 |
< |
f.reinitialize(); |
311 |
> |
f = new FibAction(8); |
312 |
|
f.cancel(true); |
313 |
|
assertSame(f, f.fork()); |
314 |
|
myself.interrupt(); |
317 |
|
Thread.interrupted(); |
318 |
|
checkCancelled(f); |
319 |
|
|
320 |
< |
f.reinitialize(); |
320 |
> |
f = new FibAction(8); |
321 |
|
f.completeExceptionally(new FJException()); |
322 |
|
assertSame(f, f.fork()); |
323 |
|
myself.interrupt(); |
339 |
|
final SynchronousQueue<FibAction[]> sq = |
340 |
|
new SynchronousQueue<FibAction[]>(); |
341 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
342 |
< |
public void realCompute() throws InterruptedException { |
342 |
> |
protected void realCompute() throws InterruptedException { |
343 |
|
FibAction[] fibActions = new FibAction[6]; |
344 |
|
for (int i = 0; i < fibActions.length; i++) |
345 |
|
fibActions[i] = new FibAction(8); |
439 |
|
*/ |
440 |
|
public void testForkGet() { |
441 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
442 |
< |
public void realCompute() throws Exception { |
442 |
> |
protected void realCompute() throws Exception { |
443 |
|
FibAction f = new FibAction(8); |
444 |
|
assertSame(f, f.fork()); |
445 |
|
assertNull(f.get()); |
454 |
|
*/ |
455 |
|
public void testForkTimedGet() { |
456 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
457 |
< |
public void realCompute() throws Exception { |
457 |
> |
protected void realCompute() throws Exception { |
458 |
|
FibAction f = new FibAction(8); |
459 |
|
assertSame(f, f.fork()); |
460 |
|
assertNull(f.get(5L, SECONDS)); |
469 |
|
*/ |
470 |
|
public void testForkTimedGetNPE() { |
471 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
472 |
< |
public void realCompute() throws Exception { |
472 |
> |
protected void realCompute() throws Exception { |
473 |
|
FibAction f = new FibAction(8); |
474 |
|
assertSame(f, f.fork()); |
475 |
|
try { |
485 |
|
*/ |
486 |
|
public void testForkQuietlyJoin() { |
487 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
488 |
< |
public void realCompute() { |
488 |
> |
protected void realCompute() { |
489 |
|
FibAction f = new FibAction(8); |
490 |
|
assertSame(f, f.fork()); |
491 |
|
f.quietlyJoin(); |
501 |
|
*/ |
502 |
|
public void testForkHelpQuiesce() { |
503 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
504 |
< |
public void realCompute() { |
504 |
> |
protected void realCompute() { |
505 |
|
FibAction f = new FibAction(8); |
506 |
|
assertSame(f, f.fork()); |
507 |
|
helpQuiesce(); |
517 |
|
*/ |
518 |
|
public void testAbnormalInvoke() { |
519 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
520 |
< |
public void realCompute() { |
520 |
> |
protected void realCompute() { |
521 |
|
FailingFibAction f = new FailingFibAction(8); |
522 |
|
try { |
523 |
|
f.invoke(); |
534 |
|
*/ |
535 |
|
public void testAbnormalQuietlyInvoke() { |
536 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
537 |
< |
public void realCompute() { |
537 |
> |
protected void realCompute() { |
538 |
|
FailingFibAction f = new FailingFibAction(8); |
539 |
|
f.quietlyInvoke(); |
540 |
|
assertTrue(f.getException() instanceof FJException); |
548 |
|
*/ |
549 |
|
public void testAbnormalForkJoin() { |
550 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
551 |
< |
public void realCompute() { |
551 |
> |
protected void realCompute() { |
552 |
|
FailingFibAction f = new FailingFibAction(8); |
553 |
|
assertSame(f, f.fork()); |
554 |
|
try { |
566 |
|
*/ |
567 |
|
public void testAbnormalForkGet() { |
568 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
569 |
< |
public void realCompute() throws Exception { |
569 |
> |
protected void realCompute() throws Exception { |
570 |
|
FailingFibAction f = new FailingFibAction(8); |
571 |
|
assertSame(f, f.fork()); |
572 |
|
try { |
586 |
|
*/ |
587 |
|
public void testAbnormalForkTimedGet() { |
588 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
589 |
< |
public void realCompute() throws Exception { |
589 |
> |
protected void realCompute() throws Exception { |
590 |
|
FailingFibAction f = new FailingFibAction(8); |
591 |
|
assertSame(f, f.fork()); |
592 |
|
try { |
606 |
|
*/ |
607 |
|
public void testAbnormalForkQuietlyJoin() { |
608 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
609 |
< |
public void realCompute() { |
609 |
> |
protected void realCompute() { |
610 |
|
FailingFibAction f = new FailingFibAction(8); |
611 |
|
assertSame(f, f.fork()); |
612 |
|
f.quietlyJoin(); |
621 |
|
*/ |
622 |
|
public void testCancelledInvoke() { |
623 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
624 |
< |
public void realCompute() { |
624 |
> |
protected void realCompute() { |
625 |
|
FibAction f = new FibAction(8); |
626 |
|
assertTrue(f.cancel(true)); |
627 |
|
try { |
639 |
|
*/ |
640 |
|
public void testCancelledForkJoin() { |
641 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
642 |
< |
public void realCompute() { |
642 |
> |
protected void realCompute() { |
643 |
|
FibAction f = new FibAction(8); |
644 |
|
assertTrue(f.cancel(true)); |
645 |
|
assertSame(f, f.fork()); |
658 |
|
*/ |
659 |
|
public void testCancelledForkGet() { |
660 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
661 |
< |
public void realCompute() throws Exception { |
661 |
> |
protected void realCompute() throws Exception { |
662 |
|
FibAction f = new FibAction(8); |
663 |
|
assertTrue(f.cancel(true)); |
664 |
|
assertSame(f, f.fork()); |
677 |
|
*/ |
678 |
|
public void testCancelledForkTimedGet() { |
679 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
680 |
< |
public void realCompute() throws Exception { |
680 |
> |
protected void realCompute() throws Exception { |
681 |
|
FibAction f = new FibAction(8); |
682 |
|
assertTrue(f.cancel(true)); |
683 |
|
assertSame(f, f.fork()); |
696 |
|
*/ |
697 |
|
public void testCancelledForkQuietlyJoin() { |
698 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
699 |
< |
public void realCompute() { |
699 |
> |
protected void realCompute() { |
700 |
|
FibAction f = new FibAction(8); |
701 |
|
assertTrue(f.cancel(true)); |
702 |
|
assertSame(f, f.fork()); |
712 |
|
public void testGetPool() { |
713 |
|
final ForkJoinPool mainPool = mainPool(); |
714 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
715 |
< |
public void realCompute() { |
715 |
> |
protected void realCompute() { |
716 |
|
assertSame(mainPool, getPool()); |
717 |
|
}}; |
718 |
|
testInvokeOnPool(mainPool, a); |
723 |
|
*/ |
724 |
|
public void testGetPool2() { |
725 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
726 |
< |
public void realCompute() { |
726 |
> |
protected void realCompute() { |
727 |
|
assertNull(getPool()); |
728 |
|
}}; |
729 |
|
assertNull(a.invoke()); |
734 |
|
*/ |
735 |
|
public void testInForkJoinPool() { |
736 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
737 |
< |
public void realCompute() { |
737 |
> |
protected void realCompute() { |
738 |
|
assertTrue(inForkJoinPool()); |
739 |
|
}}; |
740 |
|
testInvokeOnPool(mainPool(), a); |
745 |
|
*/ |
746 |
|
public void testInForkJoinPool2() { |
747 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
748 |
< |
public void realCompute() { |
748 |
> |
protected void realCompute() { |
749 |
|
assertFalse(inForkJoinPool()); |
750 |
|
}}; |
751 |
|
assertNull(a.invoke()); |
757 |
|
public void testWorkerGetPool() { |
758 |
|
final ForkJoinPool mainPool = mainPool(); |
759 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
760 |
< |
public void realCompute() { |
760 |
> |
protected void realCompute() { |
761 |
|
ForkJoinWorkerThread w = |
762 |
|
(ForkJoinWorkerThread) Thread.currentThread(); |
763 |
|
assertSame(mainPool, w.getPool()); |
771 |
|
public void testWorkerGetPoolIndex() { |
772 |
|
final ForkJoinPool mainPool = mainPool(); |
773 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
774 |
< |
public void realCompute() { |
774 |
> |
protected void realCompute() { |
775 |
|
ForkJoinWorkerThread w = |
776 |
|
(ForkJoinWorkerThread) Thread.currentThread(); |
777 |
|
assertTrue(w.getPoolIndex() >= 0); |
786 |
|
*/ |
787 |
|
public void testSetRawResult() { |
788 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
789 |
< |
public void realCompute() { |
789 |
> |
protected void realCompute() { |
790 |
|
setRawResult(null); |
791 |
|
assertNull(getRawResult()); |
792 |
|
}}; |
794 |
|
} |
795 |
|
|
796 |
|
/** |
797 |
< |
* A reinitialized task may be re-invoked |
797 |
> |
* A reinitialized normally completed task may be re-invoked |
798 |
|
*/ |
799 |
|
public void testReinitialize() { |
800 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
801 |
< |
public void realCompute() { |
801 |
> |
protected void realCompute() { |
802 |
|
FibAction f = new FibAction(8); |
803 |
|
checkNotDone(f); |
804 |
|
|
814 |
|
} |
815 |
|
|
816 |
|
/** |
817 |
+ |
* A reinitialized abnormally completed task may be re-invoked |
818 |
+ |
*/ |
819 |
+ |
public void testReinitializeAbnormal() { |
820 |
+ |
RecursiveAction a = new CheckedRecursiveAction() { |
821 |
+ |
protected void realCompute() { |
822 |
+ |
FailingFibAction f = new FailingFibAction(8); |
823 |
+ |
checkNotDone(f); |
824 |
+ |
|
825 |
+ |
for (int i = 0; i < 3; i++) { |
826 |
+ |
try { |
827 |
+ |
f.invoke(); |
828 |
+ |
shouldThrow(); |
829 |
+ |
} catch (FJException success) { |
830 |
+ |
checkCompletedAbnormally(f, success); |
831 |
+ |
} |
832 |
+ |
f.reinitialize(); |
833 |
+ |
checkNotDone(f); |
834 |
+ |
} |
835 |
+ |
}}; |
836 |
+ |
testInvokeOnPool(mainPool(), a); |
837 |
+ |
} |
838 |
+ |
|
839 |
+ |
/** |
840 |
|
* invoke task throws exception after invoking completeExceptionally |
841 |
|
*/ |
842 |
|
public void testCompleteExceptionally() { |
843 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
844 |
< |
public void realCompute() { |
844 |
> |
protected void realCompute() { |
845 |
|
FibAction f = new FibAction(8); |
846 |
|
f.completeExceptionally(new FJException()); |
847 |
|
try { |
859 |
|
*/ |
860 |
|
public void testComplete() { |
861 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
862 |
< |
public void realCompute() { |
862 |
> |
protected void realCompute() { |
863 |
|
FibAction f = new FibAction(8); |
864 |
|
f.complete(null); |
865 |
|
assertNull(f.invoke()); |
874 |
|
*/ |
875 |
|
public void testInvokeAll2() { |
876 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
877 |
< |
public void realCompute() { |
877 |
> |
protected void realCompute() { |
878 |
|
FibAction f = new FibAction(8); |
879 |
|
FibAction g = new FibAction(9); |
880 |
|
invokeAll(f, g); |
891 |
|
*/ |
892 |
|
public void testInvokeAll1() { |
893 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
894 |
< |
public void realCompute() { |
894 |
> |
protected void realCompute() { |
895 |
|
FibAction f = new FibAction(8); |
896 |
|
invokeAll(f); |
897 |
|
checkCompletedNormally(f); |
905 |
|
*/ |
906 |
|
public void testInvokeAll3() { |
907 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
908 |
< |
public void realCompute() { |
908 |
> |
protected void realCompute() { |
909 |
|
FibAction f = new FibAction(8); |
910 |
|
FibAction g = new FibAction(9); |
911 |
|
FibAction h = new FibAction(7); |
928 |
|
*/ |
929 |
|
public void testInvokeAllCollection() { |
930 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
931 |
< |
public void realCompute() { |
931 |
> |
protected void realCompute() { |
932 |
|
FibAction f = new FibAction(8); |
933 |
|
FibAction g = new FibAction(9); |
934 |
|
FibAction h = new FibAction(7); |
955 |
|
*/ |
956 |
|
public void testInvokeAllNPE() { |
957 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
958 |
< |
public void realCompute() { |
958 |
> |
protected void realCompute() { |
959 |
|
FibAction f = new FibAction(8); |
960 |
|
FibAction g = new FibAction(9); |
961 |
|
FibAction h = null; |
972 |
|
*/ |
973 |
|
public void testAbnormalInvokeAll2() { |
974 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
975 |
< |
public void realCompute() { |
975 |
> |
protected void realCompute() { |
976 |
|
FibAction f = new FibAction(8); |
977 |
|
FailingFibAction g = new FailingFibAction(9); |
978 |
|
try { |
990 |
|
*/ |
991 |
|
public void testAbnormalInvokeAll1() { |
992 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
993 |
< |
public void realCompute() { |
993 |
> |
protected void realCompute() { |
994 |
|
FailingFibAction g = new FailingFibAction(9); |
995 |
|
try { |
996 |
|
invokeAll(g); |
1007 |
|
*/ |
1008 |
|
public void testAbnormalInvokeAll3() { |
1009 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1010 |
< |
public void realCompute() { |
1010 |
> |
protected void realCompute() { |
1011 |
|
FibAction f = new FibAction(8); |
1012 |
|
FailingFibAction g = new FailingFibAction(9); |
1013 |
|
FibAction h = new FibAction(7); |
1026 |
|
*/ |
1027 |
|
public void testAbnormalInvokeAllCollection() { |
1028 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1029 |
< |
public void realCompute() { |
1029 |
> |
protected void realCompute() { |
1030 |
|
FailingFibAction f = new FailingFibAction(8); |
1031 |
|
FibAction g = new FibAction(9); |
1032 |
|
FibAction h = new FibAction(7); |
1050 |
|
*/ |
1051 |
|
public void testTryUnfork() { |
1052 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1053 |
< |
public void realCompute() { |
1053 |
> |
protected void realCompute() { |
1054 |
|
FibAction g = new FibAction(9); |
1055 |
|
assertSame(g, g.fork()); |
1056 |
|
FibAction f = new FibAction(8); |
1069 |
|
*/ |
1070 |
|
public void testGetSurplusQueuedTaskCount() { |
1071 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1072 |
< |
public void realCompute() { |
1072 |
> |
protected void realCompute() { |
1073 |
|
FibAction h = new FibAction(7); |
1074 |
|
assertSame(h, h.fork()); |
1075 |
|
FibAction g = new FibAction(9); |
1091 |
|
*/ |
1092 |
|
public void testPeekNextLocalTask() { |
1093 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1094 |
< |
public void realCompute() { |
1094 |
> |
protected void realCompute() { |
1095 |
|
FibAction g = new FibAction(9); |
1096 |
|
assertSame(g, g.fork()); |
1097 |
|
FibAction f = new FibAction(8); |
1112 |
|
*/ |
1113 |
|
public void testPollNextLocalTask() { |
1114 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1115 |
< |
public void realCompute() { |
1115 |
> |
protected void realCompute() { |
1116 |
|
FibAction g = new FibAction(9); |
1117 |
|
assertSame(g, g.fork()); |
1118 |
|
FibAction f = new FibAction(8); |
1130 |
|
*/ |
1131 |
|
public void testPollTask() { |
1132 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1133 |
< |
public void realCompute() { |
1133 |
> |
protected void realCompute() { |
1134 |
|
FibAction g = new FibAction(9); |
1135 |
|
assertSame(g, g.fork()); |
1136 |
|
FibAction f = new FibAction(8); |
1148 |
|
*/ |
1149 |
|
public void testPeekNextLocalTaskAsync() { |
1150 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1151 |
< |
public void realCompute() { |
1151 |
> |
protected void realCompute() { |
1152 |
|
FibAction g = new FibAction(9); |
1153 |
|
assertSame(g, g.fork()); |
1154 |
|
FibAction f = new FibAction(8); |
1168 |
|
*/ |
1169 |
|
public void testPollNextLocalTaskAsync() { |
1170 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1171 |
< |
public void realCompute() { |
1171 |
> |
protected void realCompute() { |
1172 |
|
FibAction g = new FibAction(9); |
1173 |
|
assertSame(g, g.fork()); |
1174 |
|
FibAction f = new FibAction(8); |
1187 |
|
*/ |
1188 |
|
public void testPollTaskAsync() { |
1189 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1190 |
< |
public void realCompute() { |
1190 |
> |
protected void realCompute() { |
1191 |
|
FibAction g = new FibAction(9); |
1192 |
|
assertSame(g, g.fork()); |
1193 |
|
FibAction f = new FibAction(8); |
1200 |
|
testInvokeOnPool(asyncSingletonPool(), a); |
1201 |
|
} |
1202 |
|
|
1203 |
+ |
/** Demo from RecursiveAction javadoc */ |
1204 |
+ |
static class SortTask extends RecursiveAction { |
1205 |
+ |
final long[] array; final int lo, hi; |
1206 |
+ |
SortTask(long[] array, int lo, int hi) { |
1207 |
+ |
this.array = array; this.lo = lo; this.hi = hi; |
1208 |
+ |
} |
1209 |
+ |
SortTask(long[] array) { this(array, 0, array.length); } |
1210 |
+ |
protected void compute() { |
1211 |
+ |
if (hi - lo < THRESHOLD) |
1212 |
+ |
sortSequentially(lo, hi); |
1213 |
+ |
else { |
1214 |
+ |
int mid = (lo + hi) >>> 1; |
1215 |
+ |
invokeAll(new SortTask(array, lo, mid), |
1216 |
+ |
new SortTask(array, mid, hi)); |
1217 |
+ |
merge(lo, mid, hi); |
1218 |
+ |
} |
1219 |
+ |
} |
1220 |
+ |
// implementation details follow: |
1221 |
+ |
static final int THRESHOLD = 100; |
1222 |
+ |
void sortSequentially(int lo, int hi) { |
1223 |
+ |
Arrays.sort(array, lo, hi); |
1224 |
+ |
} |
1225 |
+ |
void merge(int lo, int mid, int hi) { |
1226 |
+ |
long[] buf = Arrays.copyOfRange(array, lo, mid); |
1227 |
+ |
for (int i = 0, j = lo, k = mid; i < buf.length; j++) |
1228 |
+ |
array[j] = (k == hi || buf[i] < array[k]) ? |
1229 |
+ |
buf[i++] : array[k++]; |
1230 |
+ |
} |
1231 |
+ |
} |
1232 |
+ |
|
1233 |
+ |
/** |
1234 |
+ |
* SortTask demo works as advertised |
1235 |
+ |
*/ |
1236 |
+ |
public void testSortTaskDemo() { |
1237 |
+ |
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
1238 |
+ |
long[] array = new long[1007]; |
1239 |
+ |
for (int i = 0; i < array.length; i++) |
1240 |
+ |
array[i] = rnd.nextLong(); |
1241 |
+ |
long[] arrayClone = array.clone(); |
1242 |
+ |
testInvokeOnPool(mainPool(), new SortTask(array)); |
1243 |
+ |
Arrays.sort(arrayClone); |
1244 |
+ |
assertTrue(Arrays.equals(array, arrayClone)); |
1245 |
+ |
} |
1246 |
|
} |