26 |
|
package java.util; |
27 |
|
import java.util.function.Consumer; |
28 |
|
import java.util.stream.Stream; |
29 |
– |
import java.util.stream.Streams; |
29 |
|
|
30 |
|
/** |
31 |
|
* An unbounded priority {@linkplain Queue queue} based on a priority heap. |
782 |
|
heapify(); |
783 |
|
} |
784 |
|
|
785 |
< |
final Spliterator<E> spliterator() { |
785 |
> |
public Spliterator<E> spliterator() { |
786 |
|
return new PriorityQueueSpliterator<E>(this, 0, -1, 0); |
787 |
|
} |
788 |
|
|
790 |
– |
public Stream<E> stream() { |
791 |
– |
return Streams.stream(spliterator()); |
792 |
– |
} |
793 |
– |
|
794 |
– |
public Stream<E> parallelStream() { |
795 |
– |
return Streams.parallelStream(spliterator()); |
796 |
– |
} |
797 |
– |
|
789 |
|
/** |
790 |
|
* This is very similar to ArrayList Spliterator, except for extra |
791 |
|
* null checks. |
814 |
|
return hi; |
815 |
|
} |
816 |
|
|
817 |
< |
public PriorityQueueSpliterator<E> trySplit() { |
817 |
> |
public Spliterator<E> trySplit() { |
818 |
|
int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; |
819 |
|
return (lo >= mid) ? null : |
820 |
|
new PriorityQueueSpliterator<E>(pq, lo, index = mid, |
822 |
|
} |
823 |
|
|
824 |
|
@SuppressWarnings("unchecked") |
825 |
< |
public void forEach(Consumer<? super E> action) { |
825 |
> |
public void forEachRemaining(Consumer<? super E> action) { |
826 |
|
int i, hi, mc; // hoist accesses and checks from loop |
827 |
|
PriorityQueue<E> q; Object[] a; |
828 |
|
if (action == null) |