846 |
|
elements[i] = s.readObject(); |
847 |
|
} |
848 |
|
|
849 |
< |
Spliterator<E> spliterator() { |
849 |
> |
public Spliterator<E> spliterator() { |
850 |
|
return new DeqSpliterator<E>(this, -1, -1); |
851 |
|
} |
852 |
|
|
853 |
– |
public Stream<E> stream() { |
854 |
– |
return Streams.stream(spliterator()); |
855 |
– |
} |
856 |
– |
|
857 |
– |
public Stream<E> parallelStream() { |
858 |
– |
return Streams.parallelStream(spliterator()); |
859 |
– |
} |
860 |
– |
|
853 |
|
static final class DeqSpliterator<E> implements Spliterator<E> { |
854 |
|
private final ArrayDeque<E> deq; |
855 |
|
private int fence; // -1 until first use |
871 |
|
return t; |
872 |
|
} |
873 |
|
|
874 |
< |
public DeqSpliterator<E> trySplit() { |
874 |
> |
public Spliterator<E> trySplit() { |
875 |
|
int t = getFence(), h = index, n = deq.elements.length; |
876 |
|
if (h != t && ((h + 1) & (n - 1)) != t) { |
877 |
|
if (h > t) |