public abstract static class Spliterators.AbstractDoubleSpliterator extends Object implements Spliterator.OfDouble
trySplitto permit limited parallelism.
To implement a spliterator an extending class need only
tryAdvance}. The extending class should override
Spliterator.OfDouble.forEachRemaining(java.util.function.DoubleConsumer) forEach} if
it can provide a more performant implementation.
Spliterators.spliterator(java.util.PrimitiveIterator.OfDouble, long, int)
|Modifier||Constructor and Description|
Creates a spliterator reporting the given estimated size and characteristics.
|Modifier and Type||Method and Description|
Returns a set of characteristics of this Spliterator and its elements.
Returns an estimate of the number of elements that would be encountered by a
If this spliterator can be partitioned, returns a Spliterator covering elements, that will, upon return from this method, not be covered by this Spliterator.
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
forEachRemaining, forEachRemaining, tryAdvance, tryAdvance
protected AbstractDoubleSpliterator(long est, int additionalCharacteristics)
est- the estimated size of this spliterator if known, otherwise
additionalCharacteristics- properties of this spliterator's source or elements. If
SIZEDis reported then this spliterator will additionally report
public Spliterator.OfDouble trySplit()
If this Spliterator is
Spliterator.ORDERED, the returned Spliterator
must cover a strict prefix of the elements.
Unless this Spliterator covers an infinite number of elements,
repeated calls to
trySplit() must eventually return
Upon non-null return:
estimateSize()before splitting, must, after splitting, be greater than or equal to
estimateSize()for this and the returned Spliterator; and
estimateSize()for this spliterator before splitting must be equal to the sum of
estimateSize()for this and the returned Spliterator after splitting.
This method may return
null for any reason,
including emptiness, inability to split after traversal has
commenced, data structure constraints, and efficiency
This implementation permits limited parallelism.
Spliteratorcovering some portion of the elements, or
nullif this spliterator cannot be split
public long estimateSize()
Spliterator.forEachRemaining(java.util.function.Consumer<? super T>)traversal, or returns
Long.MAX_VALUEif infinite, unknown, or too expensive to compute.
If this Spliterator is
Spliterator.SIZED and has not yet been partially
traversed or split, or this Spliterator is
Spliterator.SUBSIZED and has
not yet been partially traversed, this estimate must be an accurate
count of elements that would be encountered by a complete traversal.
Otherwise, this estimate may be arbitrarily inaccurate, but must decrease
as specified across invocations of
public int characteristics()
Spliterator.SUBSIZED. Repeated calls to
characteristics()on a given spliterator, prior to or in-between calls to
trySplit, should always return the same result.
If a Spliterator reports an inconsistent set of characteristics (either those returned from a single invocation or across multiple invocations), no guarantees can be made about any computation using this Spliterator.