ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/jsr166y/RecursiveAction.java

Comparing jsr166/src/jsr166y/RecursiveAction.java (file contents):
Revision 1.6 by jsr166, Wed Jul 22 01:36:51 2009 UTC vs.
Revision 1.8 by dl, Wed Jul 29 12:05:55 2009 UTC

#	Line 34 | Line 34 | package jsr166y;
34		*   }
35		* }}</pre>
36		*
37	<	* You could then sort anArray by creating {@code new SortTask(anArray, 0,
38	<	* anArray.length-1) } and invoking it in a ForkJoinPool.
39	<	* As a more concrete simple example, the following task increments
40	<	* each element of an array:
37	>	* You could then sort {@code anArray} by creating {@code new
38	>	* SortTask(anArray, 0, anArray.length-1) } and invoking it in a
39	>	* ForkJoinPool.  As a more concrete simple example, the following
40	>	* task increments each element of an array:
41		*  <pre> {@code
42		* class IncrementTask extends RecursiveAction {
43		*   final long[] array; final int lo; final int hi;
#	Line 98 | Line 98 | package jsr166y;
98		*     int l = lo;
99		*     int h = hi;
100		*     Applyer right = null;
101	<	*     while (h - l > 1 &&
102	<	*        ForkJoinWorkerThread.getEstimatedSurplusTaskCount() <= 3) {
101	>	*     while (h - l > 1 && getSurplusQueuedTaskCount() <= 3) {
102		*        int mid = (l + h) >>> 1;
103		*        right = new Applyer(array, mid, h, seqSize, right);
104		*        right.fork();

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines