1377 |
|
public Spliterator<E> trySplit() { |
1378 |
|
Node<E> p; int b; |
1379 |
|
final ConcurrentLinkedDeque<E> q = this.queue; |
1380 |
< |
if (!exhausted && |
1380 |
> |
if (!exhausted && |
1381 |
|
((p = current) != null || (p = q.first()) != null)) { |
1382 |
|
if (p.item == null && p == (p = p.next)) |
1383 |
|
current = p = q.first(); |
1384 |
|
if (p != null && p.next != null && |
1385 |
< |
((b = batch) < MAX_QUEUED || |
1385 |
> |
((b = batch) < MAX_QUEUED || |
1386 |
|
java.util.concurrent.ForkJoinTask.getQueuedTaskCount() < MAX_QUEUED)) { |
1387 |
< |
int n = batch = (b >= MAX_BATCH)? MAX_BATCH : b + 1; |
1387 |
> |
int n = batch = (b >= MAX_BATCH) ? MAX_BATCH : b + 1; |
1388 |
|
Object[] a; |
1389 |
|
try { |
1390 |
|
a = new Object[n]; |