783 |
|
heapify(); |
784 |
|
} |
785 |
|
|
786 |
< |
final Spliterator<E> spliterator() { |
786 |
> |
public Spliterator<E> spliterator() { |
787 |
|
return new PriorityQueueSpliterator<E>(this, 0, -1, 0); |
788 |
|
} |
789 |
|
|
790 |
< |
public Stream<E> stream() { |
791 |
< |
return Streams.stream(spliterator()); |
792 |
< |
} |
793 |
< |
|
794 |
< |
public Stream<E> parallelStream() { |
795 |
< |
return Streams.parallelStream(spliterator()); |
796 |
< |
} |
797 |
< |
|
790 |
> |
/** |
791 |
> |
* This is very similar to ArrayList Spliterator, except for extra |
792 |
> |
* null checks. |
793 |
> |
*/ |
794 |
|
static final class PriorityQueueSpliterator<E> implements Spliterator<E> { |
799 |
– |
/* |
800 |
– |
* This is very similar to ArrayList Spliterator, except for |
801 |
– |
* extra null checks. |
802 |
– |
*/ |
795 |
|
private final PriorityQueue<E> pq; |
796 |
|
private int index; // current index, modified on advance/split |
797 |
|
private int fence; // -1 until first use |
815 |
|
return hi; |
816 |
|
} |
817 |
|
|
818 |
< |
public PriorityQueueSpliterator<E> trySplit() { |
818 |
> |
public Spliterator<E> trySplit() { |
819 |
|
int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; |
820 |
|
return (lo >= mid) ? null : |
821 |
|
new PriorityQueueSpliterator<E>(pq, lo, index = mid, |
823 |
|
} |
824 |
|
|
825 |
|
@SuppressWarnings("unchecked") |
826 |
< |
public void forEach(Consumer<? super E> action) { |
826 |
> |
public void forEachRemaining(Consumer<? super E> action) { |
827 |
|
int i, hi, mc; // hoist accesses and checks from loop |
828 |
|
PriorityQueue<E> q; Object[] a; |
829 |
|
if (action == null) |