17182
|
1 |
/*
|
|
2 |
* Copyright (c) 2012, 2013, Oracle and/or its affiliates. All rights reserved.
|
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
4 |
*
|
|
5 |
* This code is free software; you can redistribute it and/or modify it
|
|
6 |
* under the terms of the GNU General Public License version 2 only, as
|
|
7 |
* published by the Free Software Foundation. Oracle designates this
|
|
8 |
* particular file as subject to the "Classpath" exception as provided
|
|
9 |
* by Oracle in the LICENSE file that accompanied this code.
|
|
10 |
*
|
|
11 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
12 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
13 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
14 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
15 |
* accompanied this code).
|
|
16 |
*
|
|
17 |
* You should have received a copy of the GNU General Public License version
|
|
18 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
19 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
20 |
*
|
|
21 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
22 |
* or visit www.oracle.com if you need additional information or have any
|
|
23 |
* questions.
|
|
24 |
*/
|
|
25 |
package java.util.stream;
|
|
26 |
|
|
27 |
import java.util.Comparator;
|
|
28 |
import java.util.Spliterator;
|
|
29 |
import java.util.function.BooleanSupplier;
|
|
30 |
import java.util.function.Consumer;
|
|
31 |
import java.util.function.DoubleConsumer;
|
|
32 |
import java.util.function.IntConsumer;
|
|
33 |
import java.util.function.LongConsumer;
|
|
34 |
import java.util.function.Supplier;
|
|
35 |
|
|
36 |
/**
|
|
37 |
* Spliterator implementations for wrapping and delegating spliterators, used
|
|
38 |
* in the implementation of the {@link Stream#spliterator()} method.
|
|
39 |
*
|
|
40 |
* @since 1.8
|
|
41 |
*/
|
|
42 |
class StreamSpliterators {
|
|
43 |
|
|
44 |
/**
|
|
45 |
* Abstract wrapping spliterator that binds to the spliterator of a
|
|
46 |
* pipeline helper on first operation.
|
|
47 |
*
|
|
48 |
* <p>This spliterator is not late-binding and will bind to the source
|
|
49 |
* spliterator when first operated on.
|
|
50 |
*
|
|
51 |
* <p>A wrapping spliterator produced from a sequential stream
|
|
52 |
* cannot be split if there are stateful operations present.
|
|
53 |
*/
|
|
54 |
private static abstract class AbstractWrappingSpliterator<P_IN, P_OUT,
|
|
55 |
T_BUFFER extends AbstractSpinedBuffer>
|
|
56 |
implements Spliterator<P_OUT> {
|
|
57 |
|
|
58 |
// @@@ Detect if stateful operations are present or not
|
|
59 |
// If not then can split otherwise cannot
|
|
60 |
|
|
61 |
/**
|
|
62 |
* True if this spliterator supports splitting
|
|
63 |
*/
|
|
64 |
final boolean isParallel;
|
|
65 |
|
|
66 |
final PipelineHelper<P_OUT> ph;
|
|
67 |
|
|
68 |
/**
|
|
69 |
* Supplier for the source spliterator. Client provides either a
|
|
70 |
* spliterator or a supplier.
|
|
71 |
*/
|
|
72 |
private Supplier<Spliterator<P_IN>> spliteratorSupplier;
|
|
73 |
|
|
74 |
/**
|
|
75 |
* Source spliterator. Either provided from client or obtained from
|
|
76 |
* supplier.
|
|
77 |
*/
|
|
78 |
Spliterator<P_IN> spliterator;
|
|
79 |
|
|
80 |
/**
|
|
81 |
* Sink chain for the downstream stages of the pipeline, ultimately
|
|
82 |
* leading to the buffer. Used during partial traversal.
|
|
83 |
*/
|
|
84 |
Sink<P_IN> bufferSink;
|
|
85 |
|
|
86 |
/**
|
|
87 |
* A function that advances one element of the spliterator, pushing
|
|
88 |
* it to bufferSink. Returns whether any elements were processed.
|
|
89 |
* Used during partial traversal.
|
|
90 |
*/
|
|
91 |
BooleanSupplier pusher;
|
|
92 |
|
|
93 |
/** Next element to consume from the buffer, used during partial traversal */
|
|
94 |
long nextToConsume;
|
|
95 |
|
|
96 |
/** Buffer into which elements are pushed. Used during partial traversal. */
|
|
97 |
T_BUFFER buffer;
|
|
98 |
|
|
99 |
/**
|
|
100 |
* True if full traversal has occurred (with possible cancelation).
|
|
101 |
* If doing a partial traversal, there may be still elements in buffer.
|
|
102 |
*/
|
|
103 |
boolean finished;
|
|
104 |
|
|
105 |
/**
|
|
106 |
* Construct an AbstractWrappingSpliterator from a
|
|
107 |
* {@code Supplier<Spliterator>}.
|
|
108 |
*/
|
|
109 |
AbstractWrappingSpliterator(PipelineHelper<P_OUT> ph,
|
|
110 |
Supplier<Spliterator<P_IN>> spliteratorSupplier,
|
|
111 |
boolean parallel) {
|
|
112 |
this.ph = ph;
|
|
113 |
this.spliteratorSupplier = spliteratorSupplier;
|
|
114 |
this.spliterator = null;
|
|
115 |
this.isParallel = parallel;
|
|
116 |
}
|
|
117 |
|
|
118 |
/**
|
|
119 |
* Construct an AbstractWrappingSpliterator from a
|
|
120 |
* {@code Spliterator}.
|
|
121 |
*/
|
|
122 |
AbstractWrappingSpliterator(PipelineHelper<P_OUT> ph,
|
|
123 |
Spliterator<P_IN> spliterator,
|
|
124 |
boolean parallel) {
|
|
125 |
this.ph = ph;
|
|
126 |
this.spliteratorSupplier = null;
|
|
127 |
this.spliterator = spliterator;
|
|
128 |
this.isParallel = parallel;
|
|
129 |
}
|
|
130 |
|
|
131 |
/**
|
|
132 |
* Called before advancing to set up spliterator, if needed.
|
|
133 |
*/
|
|
134 |
final void init() {
|
|
135 |
if (spliterator == null) {
|
|
136 |
spliterator = spliteratorSupplier.get();
|
|
137 |
spliteratorSupplier = null;
|
|
138 |
}
|
|
139 |
}
|
|
140 |
|
|
141 |
/**
|
|
142 |
* Get an element from the source, pushing it into the sink chain,
|
|
143 |
* setting up the buffer if needed
|
|
144 |
* @return whether there are elements to consume from the buffer
|
|
145 |
*/
|
|
146 |
final boolean doAdvance() {
|
|
147 |
if (buffer == null) {
|
|
148 |
if (finished)
|
|
149 |
return false;
|
|
150 |
|
|
151 |
init();
|
|
152 |
initPartialTraversalState();
|
|
153 |
nextToConsume = 0;
|
|
154 |
bufferSink.begin(spliterator.getExactSizeIfKnown());
|
|
155 |
return fillBuffer();
|
|
156 |
}
|
|
157 |
else {
|
|
158 |
++nextToConsume;
|
|
159 |
boolean hasNext = nextToConsume < buffer.count();
|
|
160 |
if (!hasNext) {
|
|
161 |
nextToConsume = 0;
|
|
162 |
buffer.clear();
|
|
163 |
hasNext = fillBuffer();
|
|
164 |
}
|
|
165 |
return hasNext;
|
|
166 |
}
|
|
167 |
}
|
|
168 |
|
|
169 |
/**
|
|
170 |
* Invokes the shape-specific constructor with the provided arguments
|
|
171 |
* and returns the result.
|
|
172 |
*/
|
|
173 |
abstract AbstractWrappingSpliterator<P_IN, P_OUT, ?> wrap(Spliterator<P_IN> s);
|
|
174 |
|
|
175 |
/**
|
|
176 |
* Initializes buffer, sink chain, and pusher for a shape-specific
|
|
177 |
* implementation.
|
|
178 |
*/
|
|
179 |
abstract void initPartialTraversalState();
|
|
180 |
|
|
181 |
@Override
|
|
182 |
public Spliterator<P_OUT> trySplit() {
|
|
183 |
if (isParallel && !finished) {
|
|
184 |
init();
|
|
185 |
|
|
186 |
Spliterator<P_IN> split = spliterator.trySplit();
|
|
187 |
return (split == null) ? null : wrap(split);
|
|
188 |
}
|
|
189 |
else
|
|
190 |
return null;
|
|
191 |
}
|
|
192 |
|
|
193 |
/**
|
|
194 |
* If the buffer is empty, push elements into the sink chain until
|
|
195 |
* the source is empty or cancellation is requested.
|
|
196 |
* @return whether there are elements to consume from the buffer
|
|
197 |
*/
|
|
198 |
private boolean fillBuffer() {
|
|
199 |
while (buffer.count() == 0) {
|
|
200 |
if (bufferSink.cancellationRequested() || !pusher.getAsBoolean()) {
|
|
201 |
if (finished)
|
|
202 |
return false;
|
|
203 |
else {
|
|
204 |
bufferSink.end(); // might trigger more elements
|
|
205 |
finished = true;
|
|
206 |
}
|
|
207 |
}
|
|
208 |
}
|
|
209 |
return true;
|
|
210 |
}
|
|
211 |
|
|
212 |
@Override
|
|
213 |
public final long estimateSize() {
|
|
214 |
init();
|
|
215 |
return StreamOpFlag.SIZED.isKnown(ph.getStreamAndOpFlags())
|
|
216 |
? spliterator.estimateSize()
|
|
217 |
: Long.MAX_VALUE;
|
|
218 |
}
|
|
219 |
|
|
220 |
@Override
|
|
221 |
public final long getExactSizeIfKnown() {
|
|
222 |
init();
|
|
223 |
return StreamOpFlag.SIZED.isKnown(ph.getStreamAndOpFlags())
|
|
224 |
? spliterator.getExactSizeIfKnown()
|
|
225 |
: -1;
|
|
226 |
}
|
|
227 |
|
|
228 |
@Override
|
|
229 |
public final int characteristics() {
|
|
230 |
init();
|
|
231 |
|
|
232 |
// Get the characteristics from the pipeline
|
|
233 |
int c = StreamOpFlag.toCharacteristics(StreamOpFlag.toStreamFlags(ph.getStreamAndOpFlags()));
|
|
234 |
|
|
235 |
// Mask off the size and uniform characteristics and replace with
|
|
236 |
// those of the spliterator
|
|
237 |
// Note that a non-uniform spliterator can change from something
|
|
238 |
// with an exact size to an estimate for a sub-split, for example
|
|
239 |
// with HashSet where the size is known at the top level spliterator
|
|
240 |
// but for sub-splits only an estimate is known
|
|
241 |
if ((c & Spliterator.SIZED) != 0) {
|
|
242 |
c &= ~(Spliterator.SIZED | Spliterator.SUBSIZED);
|
|
243 |
c |= (spliterator.characteristics() & Spliterator.SIZED & Spliterator.SUBSIZED);
|
|
244 |
}
|
|
245 |
|
|
246 |
return c;
|
|
247 |
}
|
|
248 |
|
|
249 |
@Override
|
|
250 |
public Comparator<? super P_OUT> getComparator() {
|
|
251 |
if (!hasCharacteristics(SORTED))
|
|
252 |
throw new IllegalStateException();
|
|
253 |
return null;
|
|
254 |
}
|
|
255 |
|
|
256 |
@Override
|
|
257 |
public final String toString() {
|
|
258 |
return String.format("%s[%s]", getClass().getName(), spliterator);
|
|
259 |
}
|
|
260 |
}
|
|
261 |
|
|
262 |
static final class WrappingSpliterator<P_IN, P_OUT>
|
|
263 |
extends AbstractWrappingSpliterator<P_IN, P_OUT, SpinedBuffer<P_OUT>> {
|
|
264 |
|
|
265 |
WrappingSpliterator(PipelineHelper<P_OUT> ph,
|
|
266 |
Supplier<Spliterator<P_IN>> supplier,
|
|
267 |
boolean parallel) {
|
|
268 |
super(ph, supplier, parallel);
|
|
269 |
}
|
|
270 |
|
|
271 |
WrappingSpliterator(PipelineHelper<P_OUT> ph,
|
|
272 |
Spliterator<P_IN> spliterator,
|
|
273 |
boolean parallel) {
|
|
274 |
super(ph, spliterator, parallel);
|
|
275 |
}
|
|
276 |
|
|
277 |
@Override
|
|
278 |
WrappingSpliterator<P_IN, P_OUT> wrap(Spliterator<P_IN> s) {
|
|
279 |
return new WrappingSpliterator<>(ph, s, isParallel);
|
|
280 |
}
|
|
281 |
|
|
282 |
@Override
|
|
283 |
void initPartialTraversalState() {
|
|
284 |
SpinedBuffer<P_OUT> b = new SpinedBuffer<>();
|
|
285 |
buffer = b;
|
|
286 |
bufferSink = ph.wrapSink(b::accept);
|
|
287 |
pusher = () -> spliterator.tryAdvance(bufferSink);
|
|
288 |
}
|
|
289 |
|
|
290 |
@Override
|
|
291 |
public boolean tryAdvance(Consumer<? super P_OUT> consumer) {
|
|
292 |
boolean hasNext = doAdvance();
|
|
293 |
if (hasNext)
|
|
294 |
consumer.accept(buffer.get(nextToConsume));
|
|
295 |
return hasNext;
|
|
296 |
}
|
|
297 |
|
|
298 |
@Override
|
|
299 |
public void forEachRemaining(Consumer<? super P_OUT> consumer) {
|
|
300 |
if (buffer == null && !finished) {
|
|
301 |
init();
|
|
302 |
|
|
303 |
ph.wrapAndCopyInto((Sink<P_OUT>) consumer::accept, spliterator);
|
|
304 |
finished = true;
|
|
305 |
}
|
|
306 |
else {
|
|
307 |
while (tryAdvance(consumer)) { }
|
|
308 |
}
|
|
309 |
}
|
|
310 |
}
|
|
311 |
|
|
312 |
static final class IntWrappingSpliterator<P_IN>
|
|
313 |
extends AbstractWrappingSpliterator<P_IN, Integer, SpinedBuffer.OfInt>
|
|
314 |
implements Spliterator.OfInt {
|
|
315 |
|
|
316 |
IntWrappingSpliterator(PipelineHelper<Integer> ph,
|
|
317 |
Supplier<Spliterator<P_IN>> supplier,
|
|
318 |
boolean parallel) {
|
|
319 |
super(ph, supplier, parallel);
|
|
320 |
}
|
|
321 |
|
|
322 |
IntWrappingSpliterator(PipelineHelper<Integer> ph,
|
|
323 |
Spliterator<P_IN> spliterator,
|
|
324 |
boolean parallel) {
|
|
325 |
super(ph, spliterator, parallel);
|
|
326 |
}
|
|
327 |
|
|
328 |
@Override
|
|
329 |
AbstractWrappingSpliterator<P_IN, Integer, ?> wrap(Spliterator<P_IN> s) {
|
|
330 |
return new IntWrappingSpliterator<>(ph, s, isParallel);
|
|
331 |
}
|
|
332 |
|
|
333 |
@Override
|
|
334 |
void initPartialTraversalState() {
|
|
335 |
SpinedBuffer.OfInt b = new SpinedBuffer.OfInt();
|
|
336 |
buffer = b;
|
|
337 |
bufferSink = ph.wrapSink((Sink.OfInt) b::accept);
|
|
338 |
pusher = () -> spliterator.tryAdvance(bufferSink);
|
|
339 |
}
|
|
340 |
|
|
341 |
@Override
|
|
342 |
public Spliterator.OfInt trySplit() {
|
|
343 |
return (Spliterator.OfInt) super.trySplit();
|
|
344 |
}
|
|
345 |
|
|
346 |
@Override
|
|
347 |
public boolean tryAdvance(IntConsumer consumer) {
|
|
348 |
boolean hasNext = doAdvance();
|
|
349 |
if (hasNext)
|
|
350 |
consumer.accept(buffer.get(nextToConsume));
|
|
351 |
return hasNext;
|
|
352 |
}
|
|
353 |
|
|
354 |
@Override
|
|
355 |
public void forEachRemaining(IntConsumer consumer) {
|
|
356 |
if (buffer == null && !finished) {
|
|
357 |
init();
|
|
358 |
|
|
359 |
ph.wrapAndCopyInto((Sink.OfInt) consumer::accept, spliterator);
|
|
360 |
finished = true;
|
|
361 |
}
|
|
362 |
else {
|
|
363 |
while (tryAdvance(consumer)) { }
|
|
364 |
}
|
|
365 |
}
|
|
366 |
}
|
|
367 |
|
|
368 |
static final class LongWrappingSpliterator<P_IN>
|
|
369 |
extends AbstractWrappingSpliterator<P_IN, Long, SpinedBuffer.OfLong>
|
|
370 |
implements Spliterator.OfLong {
|
|
371 |
|
|
372 |
LongWrappingSpliterator(PipelineHelper<Long> ph,
|
|
373 |
Supplier<Spliterator<P_IN>> supplier,
|
|
374 |
boolean parallel) {
|
|
375 |
super(ph, supplier, parallel);
|
|
376 |
}
|
|
377 |
|
|
378 |
LongWrappingSpliterator(PipelineHelper<Long> ph,
|
|
379 |
Spliterator<P_IN> spliterator,
|
|
380 |
boolean parallel) {
|
|
381 |
super(ph, spliterator, parallel);
|
|
382 |
}
|
|
383 |
|
|
384 |
@Override
|
|
385 |
AbstractWrappingSpliterator<P_IN, Long, ?> wrap(Spliterator<P_IN> s) {
|
|
386 |
return new LongWrappingSpliterator<>(ph, s, isParallel);
|
|
387 |
}
|
|
388 |
|
|
389 |
@Override
|
|
390 |
void initPartialTraversalState() {
|
|
391 |
SpinedBuffer.OfLong b = new SpinedBuffer.OfLong();
|
|
392 |
buffer = b;
|
|
393 |
bufferSink = ph.wrapSink((Sink.OfLong) b::accept);
|
|
394 |
pusher = () -> spliterator.tryAdvance(bufferSink);
|
|
395 |
}
|
|
396 |
|
|
397 |
@Override
|
|
398 |
public Spliterator.OfLong trySplit() {
|
|
399 |
return (Spliterator.OfLong) super.trySplit();
|
|
400 |
}
|
|
401 |
|
|
402 |
@Override
|
|
403 |
public boolean tryAdvance(LongConsumer consumer) {
|
|
404 |
boolean hasNext = doAdvance();
|
|
405 |
if (hasNext)
|
|
406 |
consumer.accept(buffer.get(nextToConsume));
|
|
407 |
return hasNext;
|
|
408 |
}
|
|
409 |
|
|
410 |
@Override
|
|
411 |
public void forEachRemaining(LongConsumer consumer) {
|
|
412 |
if (buffer == null && !finished) {
|
|
413 |
init();
|
|
414 |
|
|
415 |
ph.wrapAndCopyInto((Sink.OfLong) consumer::accept, spliterator);
|
|
416 |
finished = true;
|
|
417 |
}
|
|
418 |
else {
|
|
419 |
while (tryAdvance(consumer)) { }
|
|
420 |
}
|
|
421 |
}
|
|
422 |
}
|
|
423 |
|
|
424 |
static final class DoubleWrappingSpliterator<P_IN>
|
|
425 |
extends AbstractWrappingSpliterator<P_IN, Double, SpinedBuffer.OfDouble>
|
|
426 |
implements Spliterator.OfDouble {
|
|
427 |
|
|
428 |
DoubleWrappingSpliterator(PipelineHelper<Double> ph,
|
|
429 |
Supplier<Spliterator<P_IN>> supplier,
|
|
430 |
boolean parallel) {
|
|
431 |
super(ph, supplier, parallel);
|
|
432 |
}
|
|
433 |
|
|
434 |
DoubleWrappingSpliterator(PipelineHelper<Double> ph,
|
|
435 |
Spliterator<P_IN> spliterator,
|
|
436 |
boolean parallel) {
|
|
437 |
super(ph, spliterator, parallel);
|
|
438 |
}
|
|
439 |
|
|
440 |
@Override
|
|
441 |
AbstractWrappingSpliterator<P_IN, Double, ?> wrap(Spliterator<P_IN> s) {
|
|
442 |
return new DoubleWrappingSpliterator<>(ph, s, isParallel);
|
|
443 |
}
|
|
444 |
|
|
445 |
@Override
|
|
446 |
void initPartialTraversalState() {
|
|
447 |
SpinedBuffer.OfDouble b = new SpinedBuffer.OfDouble();
|
|
448 |
buffer = b;
|
|
449 |
bufferSink = ph.wrapSink((Sink.OfDouble) b::accept);
|
|
450 |
pusher = () -> spliterator.tryAdvance(bufferSink);
|
|
451 |
}
|
|
452 |
|
|
453 |
@Override
|
|
454 |
public Spliterator.OfDouble trySplit() {
|
|
455 |
return (Spliterator.OfDouble) super.trySplit();
|
|
456 |
}
|
|
457 |
|
|
458 |
@Override
|
|
459 |
public boolean tryAdvance(DoubleConsumer consumer) {
|
|
460 |
boolean hasNext = doAdvance();
|
|
461 |
if (hasNext)
|
|
462 |
consumer.accept(buffer.get(nextToConsume));
|
|
463 |
return hasNext;
|
|
464 |
}
|
|
465 |
|
|
466 |
@Override
|
|
467 |
public void forEachRemaining(DoubleConsumer consumer) {
|
|
468 |
if (buffer == null && !finished) {
|
|
469 |
init();
|
|
470 |
|
|
471 |
ph.wrapAndCopyInto((Sink.OfDouble) consumer::accept, spliterator);
|
|
472 |
finished = true;
|
|
473 |
}
|
|
474 |
else {
|
|
475 |
while (tryAdvance(consumer)) { }
|
|
476 |
}
|
|
477 |
}
|
|
478 |
}
|
|
479 |
|
|
480 |
/**
|
|
481 |
* Spliterator implementation that delegates to an underlying spliterator,
|
|
482 |
* acquiring the spliterator from a {@code Supplier<Spliterator>} on the
|
|
483 |
* first call to any spliterator method.
|
|
484 |
* @param <T>
|
|
485 |
*/
|
|
486 |
static class DelegatingSpliterator<T> implements Spliterator<T> {
|
|
487 |
private final Supplier<Spliterator<T>> supplier;
|
|
488 |
|
|
489 |
private Spliterator<T> s;
|
|
490 |
|
|
491 |
@SuppressWarnings("unchecked")
|
|
492 |
DelegatingSpliterator(Supplier<? extends Spliterator<T>> supplier) {
|
|
493 |
this.supplier = (Supplier<Spliterator<T>>) supplier;
|
|
494 |
}
|
|
495 |
|
|
496 |
Spliterator<T> get() {
|
|
497 |
if (s == null) {
|
|
498 |
s = supplier.get();
|
|
499 |
}
|
|
500 |
return s;
|
|
501 |
}
|
|
502 |
|
|
503 |
@Override
|
|
504 |
public Spliterator<T> trySplit() {
|
|
505 |
return get().trySplit();
|
|
506 |
}
|
|
507 |
|
|
508 |
@Override
|
|
509 |
public boolean tryAdvance(Consumer<? super T> consumer) {
|
|
510 |
return get().tryAdvance(consumer);
|
|
511 |
}
|
|
512 |
|
|
513 |
@Override
|
|
514 |
public void forEachRemaining(Consumer<? super T> consumer) {
|
|
515 |
get().forEachRemaining(consumer);
|
|
516 |
}
|
|
517 |
|
|
518 |
@Override
|
|
519 |
public long estimateSize() {
|
|
520 |
return get().estimateSize();
|
|
521 |
}
|
|
522 |
|
|
523 |
@Override
|
|
524 |
public int characteristics() {
|
|
525 |
return get().characteristics();
|
|
526 |
}
|
|
527 |
|
|
528 |
@Override
|
|
529 |
public Comparator<? super T> getComparator() {
|
|
530 |
return get().getComparator();
|
|
531 |
}
|
|
532 |
|
|
533 |
@Override
|
|
534 |
public long getExactSizeIfKnown() {
|
|
535 |
return get().getExactSizeIfKnown();
|
|
536 |
}
|
|
537 |
|
|
538 |
@Override
|
|
539 |
public String toString() {
|
|
540 |
return getClass().getName() + "[" + get() + "]";
|
|
541 |
}
|
|
542 |
|
|
543 |
static final class OfInt extends DelegatingSpliterator<Integer> implements Spliterator.OfInt {
|
|
544 |
private Spliterator.OfInt s;
|
|
545 |
|
|
546 |
OfInt(Supplier<Spliterator.OfInt> supplier) {
|
|
547 |
super(supplier);
|
|
548 |
}
|
|
549 |
|
|
550 |
@Override
|
|
551 |
Spliterator.OfInt get() {
|
|
552 |
if (s == null) {
|
|
553 |
s = (Spliterator.OfInt) super.get();
|
|
554 |
}
|
|
555 |
return s;
|
|
556 |
}
|
|
557 |
|
|
558 |
@Override
|
|
559 |
public Spliterator.OfInt trySplit() {
|
|
560 |
return get().trySplit();
|
|
561 |
}
|
|
562 |
|
|
563 |
@Override
|
|
564 |
public boolean tryAdvance(IntConsumer consumer) {
|
|
565 |
return get().tryAdvance(consumer);
|
|
566 |
}
|
|
567 |
|
|
568 |
@Override
|
|
569 |
public void forEachRemaining(IntConsumer consumer) {
|
|
570 |
get().forEachRemaining(consumer);
|
|
571 |
}
|
|
572 |
}
|
|
573 |
|
|
574 |
static final class OfLong extends DelegatingSpliterator<Long> implements Spliterator.OfLong {
|
|
575 |
private Spliterator.OfLong s;
|
|
576 |
|
|
577 |
OfLong(Supplier<Spliterator.OfLong> supplier) {
|
|
578 |
super(supplier);
|
|
579 |
}
|
|
580 |
|
|
581 |
@Override
|
|
582 |
Spliterator.OfLong get() {
|
|
583 |
if (s == null) {
|
|
584 |
s = (Spliterator.OfLong) super.get();
|
|
585 |
}
|
|
586 |
return s;
|
|
587 |
}
|
|
588 |
|
|
589 |
@Override
|
|
590 |
public Spliterator.OfLong trySplit() {
|
|
591 |
return get().trySplit();
|
|
592 |
}
|
|
593 |
|
|
594 |
@Override
|
|
595 |
public boolean tryAdvance(LongConsumer consumer) {
|
|
596 |
return get().tryAdvance(consumer);
|
|
597 |
}
|
|
598 |
|
|
599 |
@Override
|
|
600 |
public void forEachRemaining(LongConsumer consumer) {
|
|
601 |
get().forEachRemaining(consumer);
|
|
602 |
}
|
|
603 |
}
|
|
604 |
|
|
605 |
static final class OfDouble extends DelegatingSpliterator<Double> implements Spliterator.OfDouble {
|
|
606 |
private Spliterator.OfDouble s;
|
|
607 |
|
|
608 |
OfDouble(Supplier<Spliterator.OfDouble> supplier) {
|
|
609 |
super(supplier);
|
|
610 |
}
|
|
611 |
|
|
612 |
@Override
|
|
613 |
Spliterator.OfDouble get() {
|
|
614 |
if (s == null) {
|
|
615 |
s = (Spliterator.OfDouble) super.get();
|
|
616 |
}
|
|
617 |
return s;
|
|
618 |
}
|
|
619 |
|
|
620 |
@Override
|
|
621 |
public Spliterator.OfDouble trySplit() {
|
|
622 |
return get().trySplit();
|
|
623 |
}
|
|
624 |
|
|
625 |
@Override
|
|
626 |
public boolean tryAdvance(DoubleConsumer consumer) {
|
|
627 |
return get().tryAdvance(consumer);
|
|
628 |
}
|
|
629 |
|
|
630 |
@Override
|
|
631 |
public void forEachRemaining(DoubleConsumer consumer) {
|
|
632 |
get().forEachRemaining(consumer);
|
|
633 |
}
|
|
634 |
}
|
|
635 |
}
|
|
636 |
}
|