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 |
> |
|
21 |
> |
import junit.framework.Test; |
22 |
> |
import junit.framework.TestSuite; |
23 |
|
|
24 |
|
public class RecursiveActionTest extends JSR166TestCase { |
25 |
|
|
26 |
|
public static void main(String[] args) { |
27 |
< |
junit.textui.TestRunner.run(suite()); |
27 |
> |
main(suite(), args); |
28 |
|
} |
29 |
|
|
30 |
|
public static Test suite() { |
46 |
|
} |
47 |
|
|
48 |
|
private void testInvokeOnPool(ForkJoinPool pool, RecursiveAction a) { |
49 |
< |
try { |
49 |
> |
try (PoolCleaner cleaner = cleaner(pool)) { |
50 |
|
checkNotDone(a); |
51 |
|
|
52 |
|
assertNull(pool.invoke(a)); |
53 |
|
|
54 |
|
checkCompletedNormally(a); |
51 |
– |
} finally { |
52 |
– |
joinPool(pool); |
55 |
|
} |
56 |
|
} |
57 |
|
|
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(); |
505 |
+ |
while (!f.isDone()) // wait out race |
506 |
+ |
; |
507 |
|
assertEquals(21, f.result); |
508 |
|
assertEquals(0, getQueuedTaskCount()); |
509 |
|
checkCompletedNormally(f); |
516 |
|
*/ |
517 |
|
public void testAbnormalInvoke() { |
518 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
519 |
< |
public void realCompute() { |
519 |
> |
protected void realCompute() { |
520 |
|
FailingFibAction f = new FailingFibAction(8); |
521 |
|
try { |
522 |
|
f.invoke(); |
533 |
|
*/ |
534 |
|
public void testAbnormalQuietlyInvoke() { |
535 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
536 |
< |
public void realCompute() { |
536 |
> |
protected void realCompute() { |
537 |
|
FailingFibAction f = new FailingFibAction(8); |
538 |
|
f.quietlyInvoke(); |
539 |
|
assertTrue(f.getException() instanceof FJException); |
547 |
|
*/ |
548 |
|
public void testAbnormalForkJoin() { |
549 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
550 |
< |
public void realCompute() { |
550 |
> |
protected void realCompute() { |
551 |
|
FailingFibAction f = new FailingFibAction(8); |
552 |
|
assertSame(f, f.fork()); |
553 |
|
try { |
565 |
|
*/ |
566 |
|
public void testAbnormalForkGet() { |
567 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
568 |
< |
public void realCompute() throws Exception { |
568 |
> |
protected void realCompute() throws Exception { |
569 |
|
FailingFibAction f = new FailingFibAction(8); |
570 |
|
assertSame(f, f.fork()); |
571 |
|
try { |
585 |
|
*/ |
586 |
|
public void testAbnormalForkTimedGet() { |
587 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
588 |
< |
public void realCompute() throws Exception { |
588 |
> |
protected void realCompute() throws Exception { |
589 |
|
FailingFibAction f = new FailingFibAction(8); |
590 |
|
assertSame(f, f.fork()); |
591 |
|
try { |
592 |
< |
f.get(5L, TimeUnit.SECONDS); |
592 |
> |
f.get(5L, SECONDS); |
593 |
|
shouldThrow(); |
594 |
|
} catch (ExecutionException success) { |
595 |
|
Throwable cause = success.getCause(); |
605 |
|
*/ |
606 |
|
public void testAbnormalForkQuietlyJoin() { |
607 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
608 |
< |
public void realCompute() { |
608 |
> |
protected void realCompute() { |
609 |
|
FailingFibAction f = new FailingFibAction(8); |
610 |
|
assertSame(f, f.fork()); |
611 |
|
f.quietlyJoin(); |
620 |
|
*/ |
621 |
|
public void testCancelledInvoke() { |
622 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
623 |
< |
public void realCompute() { |
623 |
> |
protected void realCompute() { |
624 |
|
FibAction f = new FibAction(8); |
625 |
|
assertTrue(f.cancel(true)); |
626 |
|
try { |
638 |
|
*/ |
639 |
|
public void testCancelledForkJoin() { |
640 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
641 |
< |
public void realCompute() { |
641 |
> |
protected void realCompute() { |
642 |
|
FibAction f = new FibAction(8); |
643 |
|
assertTrue(f.cancel(true)); |
644 |
|
assertSame(f, f.fork()); |
657 |
|
*/ |
658 |
|
public void testCancelledForkGet() { |
659 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
660 |
< |
public void realCompute() throws Exception { |
660 |
> |
protected void realCompute() throws Exception { |
661 |
|
FibAction f = new FibAction(8); |
662 |
|
assertTrue(f.cancel(true)); |
663 |
|
assertSame(f, f.fork()); |
676 |
|
*/ |
677 |
|
public void testCancelledForkTimedGet() { |
678 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
679 |
< |
public void realCompute() throws Exception { |
679 |
> |
protected void realCompute() throws Exception { |
680 |
|
FibAction f = new FibAction(8); |
681 |
|
assertTrue(f.cancel(true)); |
682 |
|
assertSame(f, f.fork()); |
695 |
|
*/ |
696 |
|
public void testCancelledForkQuietlyJoin() { |
697 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
698 |
< |
public void realCompute() { |
698 |
> |
protected void realCompute() { |
699 |
|
FibAction f = new FibAction(8); |
700 |
|
assertTrue(f.cancel(true)); |
701 |
|
assertSame(f, f.fork()); |
711 |
|
public void testGetPool() { |
712 |
|
final ForkJoinPool mainPool = mainPool(); |
713 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
714 |
< |
public void realCompute() { |
714 |
> |
protected void realCompute() { |
715 |
|
assertSame(mainPool, getPool()); |
716 |
|
}}; |
717 |
|
testInvokeOnPool(mainPool, a); |
722 |
|
*/ |
723 |
|
public void testGetPool2() { |
724 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
725 |
< |
public void realCompute() { |
725 |
> |
protected void realCompute() { |
726 |
|
assertNull(getPool()); |
727 |
|
}}; |
728 |
|
assertNull(a.invoke()); |
733 |
|
*/ |
734 |
|
public void testInForkJoinPool() { |
735 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
736 |
< |
public void realCompute() { |
736 |
> |
protected void realCompute() { |
737 |
|
assertTrue(inForkJoinPool()); |
738 |
|
}}; |
739 |
|
testInvokeOnPool(mainPool(), a); |
744 |
|
*/ |
745 |
|
public void testInForkJoinPool2() { |
746 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
747 |
< |
public void realCompute() { |
747 |
> |
protected void realCompute() { |
748 |
|
assertFalse(inForkJoinPool()); |
749 |
|
}}; |
750 |
|
assertNull(a.invoke()); |
756 |
|
public void testWorkerGetPool() { |
757 |
|
final ForkJoinPool mainPool = mainPool(); |
758 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
759 |
< |
public void realCompute() { |
759 |
> |
protected void realCompute() { |
760 |
|
ForkJoinWorkerThread w = |
761 |
|
(ForkJoinWorkerThread) Thread.currentThread(); |
762 |
|
assertSame(mainPool, w.getPool()); |
770 |
|
public void testWorkerGetPoolIndex() { |
771 |
|
final ForkJoinPool mainPool = mainPool(); |
772 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
773 |
< |
public void realCompute() { |
773 |
> |
protected void realCompute() { |
774 |
|
ForkJoinWorkerThread w = |
775 |
|
(ForkJoinWorkerThread) Thread.currentThread(); |
776 |
|
assertTrue(w.getPoolIndex() >= 0); |
785 |
|
*/ |
786 |
|
public void testSetRawResult() { |
787 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
788 |
< |
public void realCompute() { |
788 |
> |
protected void realCompute() { |
789 |
|
setRawResult(null); |
790 |
|
assertNull(getRawResult()); |
791 |
|
}}; |
793 |
|
} |
794 |
|
|
795 |
|
/** |
796 |
< |
* A reinitialized task may be re-invoked |
796 |
> |
* A reinitialized normally completed task may be re-invoked |
797 |
|
*/ |
798 |
|
public void testReinitialize() { |
799 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
800 |
< |
public void realCompute() { |
800 |
> |
protected void realCompute() { |
801 |
|
FibAction f = new FibAction(8); |
802 |
|
checkNotDone(f); |
803 |
|
|
813 |
|
} |
814 |
|
|
815 |
|
/** |
816 |
+ |
* A reinitialized abnormally completed task may be re-invoked |
817 |
+ |
*/ |
818 |
+ |
public void testReinitializeAbnormal() { |
819 |
+ |
RecursiveAction a = new CheckedRecursiveAction() { |
820 |
+ |
protected void realCompute() { |
821 |
+ |
FailingFibAction f = new FailingFibAction(8); |
822 |
+ |
checkNotDone(f); |
823 |
+ |
|
824 |
+ |
for (int i = 0; i < 3; i++) { |
825 |
+ |
try { |
826 |
+ |
f.invoke(); |
827 |
+ |
shouldThrow(); |
828 |
+ |
} catch (FJException success) { |
829 |
+ |
checkCompletedAbnormally(f, success); |
830 |
+ |
} |
831 |
+ |
f.reinitialize(); |
832 |
+ |
checkNotDone(f); |
833 |
+ |
} |
834 |
+ |
}}; |
835 |
+ |
testInvokeOnPool(mainPool(), a); |
836 |
+ |
} |
837 |
+ |
|
838 |
+ |
/** |
839 |
|
* invoke task throws exception after invoking completeExceptionally |
840 |
|
*/ |
841 |
|
public void testCompleteExceptionally() { |
842 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
843 |
< |
public void realCompute() { |
843 |
> |
protected void realCompute() { |
844 |
|
FibAction f = new FibAction(8); |
845 |
|
f.completeExceptionally(new FJException()); |
846 |
|
try { |
858 |
|
*/ |
859 |
|
public void testComplete() { |
860 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
861 |
< |
public void realCompute() { |
861 |
> |
protected void realCompute() { |
862 |
|
FibAction f = new FibAction(8); |
863 |
|
f.complete(null); |
864 |
|
assertNull(f.invoke()); |
873 |
|
*/ |
874 |
|
public void testInvokeAll2() { |
875 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
876 |
< |
public void realCompute() { |
876 |
> |
protected void realCompute() { |
877 |
|
FibAction f = new FibAction(8); |
878 |
|
FibAction g = new FibAction(9); |
879 |
|
invokeAll(f, g); |
890 |
|
*/ |
891 |
|
public void testInvokeAll1() { |
892 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
893 |
< |
public void realCompute() { |
893 |
> |
protected void realCompute() { |
894 |
|
FibAction f = new FibAction(8); |
895 |
|
invokeAll(f); |
896 |
|
checkCompletedNormally(f); |
904 |
|
*/ |
905 |
|
public void testInvokeAll3() { |
906 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
907 |
< |
public void realCompute() { |
907 |
> |
protected void realCompute() { |
908 |
|
FibAction f = new FibAction(8); |
909 |
|
FibAction g = new FibAction(9); |
910 |
|
FibAction h = new FibAction(7); |
927 |
|
*/ |
928 |
|
public void testInvokeAllCollection() { |
929 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
930 |
< |
public void realCompute() { |
930 |
> |
protected void realCompute() { |
931 |
|
FibAction f = new FibAction(8); |
932 |
|
FibAction g = new FibAction(9); |
933 |
|
FibAction h = new FibAction(7); |
954 |
|
*/ |
955 |
|
public void testInvokeAllNPE() { |
956 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
957 |
< |
public void realCompute() { |
957 |
> |
protected void realCompute() { |
958 |
|
FibAction f = new FibAction(8); |
959 |
|
FibAction g = new FibAction(9); |
960 |
|
FibAction h = null; |
971 |
|
*/ |
972 |
|
public void testAbnormalInvokeAll2() { |
973 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
974 |
< |
public void realCompute() { |
974 |
> |
protected void realCompute() { |
975 |
|
FibAction f = new FibAction(8); |
976 |
|
FailingFibAction g = new FailingFibAction(9); |
977 |
|
try { |
989 |
|
*/ |
990 |
|
public void testAbnormalInvokeAll1() { |
991 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
992 |
< |
public void realCompute() { |
992 |
> |
protected void realCompute() { |
993 |
|
FailingFibAction g = new FailingFibAction(9); |
994 |
|
try { |
995 |
|
invokeAll(g); |
1006 |
|
*/ |
1007 |
|
public void testAbnormalInvokeAll3() { |
1008 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1009 |
< |
public void realCompute() { |
1009 |
> |
protected void realCompute() { |
1010 |
|
FibAction f = new FibAction(8); |
1011 |
|
FailingFibAction g = new FailingFibAction(9); |
1012 |
|
FibAction h = new FibAction(7); |
1025 |
|
*/ |
1026 |
|
public void testAbnormalInvokeAllCollection() { |
1027 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1028 |
< |
public void realCompute() { |
1028 |
> |
protected void realCompute() { |
1029 |
|
FailingFibAction f = new FailingFibAction(8); |
1030 |
|
FibAction g = new FibAction(9); |
1031 |
|
FibAction h = new FibAction(7); |
1049 |
|
*/ |
1050 |
|
public void testTryUnfork() { |
1051 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1052 |
< |
public void realCompute() { |
1052 |
> |
protected void realCompute() { |
1053 |
|
FibAction g = new FibAction(9); |
1054 |
|
assertSame(g, g.fork()); |
1055 |
|
FibAction f = new FibAction(8); |
1068 |
|
*/ |
1069 |
|
public void testGetSurplusQueuedTaskCount() { |
1070 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1071 |
< |
public void realCompute() { |
1071 |
> |
protected void realCompute() { |
1072 |
|
FibAction h = new FibAction(7); |
1073 |
|
assertSame(h, h.fork()); |
1074 |
|
FibAction g = new FibAction(9); |
1090 |
|
*/ |
1091 |
|
public void testPeekNextLocalTask() { |
1092 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1093 |
< |
public void realCompute() { |
1093 |
> |
protected void realCompute() { |
1094 |
|
FibAction g = new FibAction(9); |
1095 |
|
assertSame(g, g.fork()); |
1096 |
|
FibAction f = new FibAction(8); |
1111 |
|
*/ |
1112 |
|
public void testPollNextLocalTask() { |
1113 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1114 |
< |
public void realCompute() { |
1114 |
> |
protected void realCompute() { |
1115 |
|
FibAction g = new FibAction(9); |
1116 |
|
assertSame(g, g.fork()); |
1117 |
|
FibAction f = new FibAction(8); |
1129 |
|
*/ |
1130 |
|
public void testPollTask() { |
1131 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1132 |
< |
public void realCompute() { |
1132 |
> |
protected void realCompute() { |
1133 |
|
FibAction g = new FibAction(9); |
1134 |
|
assertSame(g, g.fork()); |
1135 |
|
FibAction f = new FibAction(8); |
1147 |
|
*/ |
1148 |
|
public void testPeekNextLocalTaskAsync() { |
1149 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1150 |
< |
public void realCompute() { |
1150 |
> |
protected void realCompute() { |
1151 |
|
FibAction g = new FibAction(9); |
1152 |
|
assertSame(g, g.fork()); |
1153 |
|
FibAction f = new FibAction(8); |
1167 |
|
*/ |
1168 |
|
public void testPollNextLocalTaskAsync() { |
1169 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1170 |
< |
public void realCompute() { |
1170 |
> |
protected void realCompute() { |
1171 |
|
FibAction g = new FibAction(9); |
1172 |
|
assertSame(g, g.fork()); |
1173 |
|
FibAction f = new FibAction(8); |
1186 |
|
*/ |
1187 |
|
public void testPollTaskAsync() { |
1188 |
|
RecursiveAction a = new CheckedRecursiveAction() { |
1189 |
< |
public void realCompute() { |
1189 |
> |
protected void realCompute() { |
1190 |
|
FibAction g = new FibAction(9); |
1191 |
|
assertSame(g, g.fork()); |
1192 |
|
FibAction f = new FibAction(8); |
1199 |
|
testInvokeOnPool(asyncSingletonPool(), a); |
1200 |
|
} |
1201 |
|
|
1202 |
+ |
/** Demo from RecursiveAction javadoc */ |
1203 |
+ |
static class SortTask extends RecursiveAction { |
1204 |
+ |
final long[] array; final int lo, hi; |
1205 |
+ |
SortTask(long[] array, int lo, int hi) { |
1206 |
+ |
this.array = array; this.lo = lo; this.hi = hi; |
1207 |
+ |
} |
1208 |
+ |
SortTask(long[] array) { this(array, 0, array.length); } |
1209 |
+ |
protected void compute() { |
1210 |
+ |
if (hi - lo < THRESHOLD) |
1211 |
+ |
sortSequentially(lo, hi); |
1212 |
+ |
else { |
1213 |
+ |
int mid = (lo + hi) >>> 1; |
1214 |
+ |
invokeAll(new SortTask(array, lo, mid), |
1215 |
+ |
new SortTask(array, mid, hi)); |
1216 |
+ |
merge(lo, mid, hi); |
1217 |
+ |
} |
1218 |
+ |
} |
1219 |
+ |
// implementation details follow: |
1220 |
+ |
static final int THRESHOLD = 100; |
1221 |
+ |
void sortSequentially(int lo, int hi) { |
1222 |
+ |
Arrays.sort(array, lo, hi); |
1223 |
+ |
} |
1224 |
+ |
void merge(int lo, int mid, int hi) { |
1225 |
+ |
long[] buf = Arrays.copyOfRange(array, lo, mid); |
1226 |
+ |
for (int i = 0, j = lo, k = mid; i < buf.length; j++) |
1227 |
+ |
array[j] = (k == hi || buf[i] < array[k]) ? |
1228 |
+ |
buf[i++] : array[k++]; |
1229 |
+ |
} |
1230 |
+ |
} |
1231 |
+ |
|
1232 |
+ |
/** |
1233 |
+ |
* SortTask demo works as advertised |
1234 |
+ |
*/ |
1235 |
+ |
public void testSortTaskDemo() { |
1236 |
+ |
ThreadLocalRandom rnd = ThreadLocalRandom.current(); |
1237 |
+ |
long[] array = new long[1007]; |
1238 |
+ |
for (int i = 0; i < array.length; i++) |
1239 |
+ |
array[i] = rnd.nextLong(); |
1240 |
+ |
long[] arrayClone = array.clone(); |
1241 |
+ |
testInvokeOnPool(mainPool(), new SortTask(array)); |
1242 |
+ |
Arrays.sort(arrayClone); |
1243 |
+ |
assertTrue(Arrays.equals(array, arrayClone)); |
1244 |
+ |
} |
1245 |
|
} |