785 |
|
public Spliterator<E> trySplit() { |
786 |
|
Node<E> p; int b; |
787 |
|
final ConcurrentLinkedQueue<E> q = this.queue; |
788 |
< |
if (!exhausted && |
789 |
< |
((b = batch) < MAX_QUEUED || |
788 |
> |
if (!exhausted && |
789 |
> |
((b = batch) < MAX_QUEUED || |
790 |
|
java.util.concurrent.ForkJoinTask.getQueuedTaskCount() < MAX_QUEUED) && |
791 |
|
((p = current) != null || (p = q.first()) != null) && |
792 |
|
p.next != null) { |
793 |
< |
int n = batch = (b >= MAX_BATCH)? MAX_BATCH : b + 1; |
793 |
> |
int n = batch = (b >= MAX_BATCH) ? MAX_BATCH : b + 1; |
794 |
|
Object[] a; |
795 |
|
try { |
796 |
|
a = new Object[n]; |