929 |
|
public Spliterator<E> trySplit() { |
930 |
|
Node p; int b; |
931 |
|
final LinkedTransferQueue<E> q = this.queue; |
932 |
< |
if (!exhausted && |
933 |
< |
((b = batch) < MAX_QUEUED || |
932 |
> |
if (!exhausted && |
933 |
> |
((b = batch) < MAX_QUEUED || |
934 |
|
java.util.concurrent.ForkJoinTask.getQueuedTaskCount() < MAX_QUEUED) && |
935 |
|
((p = current) != null || (p = q.firstDataNode()) != null) && |
936 |
|
p.next != null) { |
937 |
< |
int n = batch = (b >= MAX_BATCH)? MAX_BATCH : b + 1; |
937 |
> |
int n = batch = (b >= MAX_BATCH) ? MAX_BATCH : b + 1; |
938 |
|
Object[] a; |
939 |
|
try { |
940 |
|
a = new Object[n]; |