118 |
|
int mid = (l + h) >>> 1; |
119 |
|
f = rt = t.right = |
120 |
|
new CumulateTask<T>(t, fn, a, org, fnc, th, mid, h); |
121 |
< |
t = lt = t.left = |
121 |
> |
t = lt = t.left = |
122 |
|
new CumulateTask<T>(t, fn, a, org, fnc, th, l, mid); |
123 |
|
} |
124 |
|
else { // possibly refork |
222 |
|
} |
223 |
|
} |
224 |
|
} |
225 |
+ |
// OPENJDK @java.io.Serial |
226 |
|
private static final long serialVersionUID = 5293554502939613543L; |
227 |
|
} |
228 |
|
|
271 |
|
int mid = (l + h) >>> 1; |
272 |
|
f = rt = t.right = |
273 |
|
new LongCumulateTask(t, fn, a, org, fnc, th, mid, h); |
274 |
< |
t = lt = t.left = |
274 |
> |
t = lt = t.left = |
275 |
|
new LongCumulateTask(t, fn, a, org, fnc, th, l, mid); |
276 |
|
} |
277 |
|
else { // possibly refork |
373 |
|
} |
374 |
|
} |
375 |
|
} |
376 |
+ |
// OPENJDK @java.io.Serial |
377 |
|
private static final long serialVersionUID = -5074099945909284273L; |
378 |
|
} |
379 |
|
|
386 |
|
|
387 |
|
/** Root task constructor */ |
388 |
|
public DoubleCumulateTask(DoubleCumulateTask parent, |
389 |
< |
DoubleBinaryOperator function, |
390 |
< |
double[] array, int lo, int hi) { |
389 |
> |
DoubleBinaryOperator function, |
390 |
> |
double[] array, int lo, int hi) { |
391 |
|
super(parent); |
392 |
|
this.function = function; this.array = array; |
393 |
|
this.lo = this.origin = lo; this.hi = this.fence = hi; |
399 |
|
|
400 |
|
/** Subtask constructor */ |
401 |
|
DoubleCumulateTask(DoubleCumulateTask parent, DoubleBinaryOperator function, |
402 |
< |
double[] array, int origin, int fence, int threshold, |
403 |
< |
int lo, int hi) { |
402 |
> |
double[] array, int origin, int fence, int threshold, |
403 |
> |
int lo, int hi) { |
404 |
|
super(parent); |
405 |
|
this.function = function; this.array = array; |
406 |
|
this.origin = origin; this.fence = fence; |
422 |
|
int mid = (l + h) >>> 1; |
423 |
|
f = rt = t.right = |
424 |
|
new DoubleCumulateTask(t, fn, a, org, fnc, th, mid, h); |
425 |
< |
t = lt = t.left = |
425 |
> |
t = lt = t.left = |
426 |
|
new DoubleCumulateTask(t, fn, a, org, fnc, th, l, mid); |
427 |
|
} |
428 |
|
else { // possibly refork |
524 |
|
} |
525 |
|
} |
526 |
|
} |
527 |
+ |
// OPENJDK @java.io.Serial |
528 |
|
private static final long serialVersionUID = -586947823794232033L; |
529 |
|
} |
530 |
|
|
537 |
|
|
538 |
|
/** Root task constructor */ |
539 |
|
public IntCumulateTask(IntCumulateTask parent, |
540 |
< |
IntBinaryOperator function, |
541 |
< |
int[] array, int lo, int hi) { |
540 |
> |
IntBinaryOperator function, |
541 |
> |
int[] array, int lo, int hi) { |
542 |
|
super(parent); |
543 |
|
this.function = function; this.array = array; |
544 |
|
this.lo = this.origin = lo; this.hi = this.fence = hi; |
550 |
|
|
551 |
|
/** Subtask constructor */ |
552 |
|
IntCumulateTask(IntCumulateTask parent, IntBinaryOperator function, |
553 |
< |
int[] array, int origin, int fence, int threshold, |
554 |
< |
int lo, int hi) { |
553 |
> |
int[] array, int origin, int fence, int threshold, |
554 |
> |
int lo, int hi) { |
555 |
|
super(parent); |
556 |
|
this.function = function; this.array = array; |
557 |
|
this.origin = origin; this.fence = fence; |
573 |
|
int mid = (l + h) >>> 1; |
574 |
|
f = rt = t.right = |
575 |
|
new IntCumulateTask(t, fn, a, org, fnc, th, mid, h); |
576 |
< |
t = lt = t.left = |
576 |
> |
t = lt = t.left = |
577 |
|
new IntCumulateTask(t, fn, a, org, fnc, th, l, mid); |
578 |
|
} |
579 |
|
else { // possibly refork |
675 |
|
} |
676 |
|
} |
677 |
|
} |
678 |
+ |
// OPENJDK @java.io.Serial |
679 |
|
private static final long serialVersionUID = 3731755594596840961L; |
680 |
|
} |
677 |
– |
|
681 |
|
} |