-
- Type Parameters:
T- the type of elements returned by this Spliterator
- All Known Subinterfaces:
Spliterator.OfDouble,Spliterator.OfInt,Spliterator.OfLong,Spliterator.OfPrimitive<T,T_CONS,T_SPLITR>
- All Known Implementing Classes:
Spliterators.AbstractDoubleSpliterator,Spliterators.AbstractIntSpliterator,Spliterators.AbstractLongSpliterator,Spliterators.AbstractSpliterator
public interface Spliterator<T>An object for traversing and partitioning elements of a source. The source of elements covered by a Spliterator could be, for example, an array, aCollection, an IO channel, or a generator function.A Spliterator may traverse elements individually (
tryAdvance()) or sequentially in bulk (forEachRemaining()).A Spliterator may also partition off some of its elements (using
trySplit()) as another Spliterator, to be used in possibly-parallel operations. Operations using a Spliterator that cannot split, or does so in a highly imbalanced or inefficient manner, are unlikely to benefit from parallelism. Traversal and splitting exhaust elements; each Spliterator is useful for only a single bulk computation.A Spliterator also reports a set of
characteristics()of its structure, source, and elements from amongORDERED,DISTINCT,SORTED,SIZED,NONNULL,IMMUTABLE,CONCURRENT, andSUBSIZED. These may be employed by Spliterator clients to control, specialize or simplify computation. For example, a Spliterator for aCollectionwould reportSIZED, a Spliterator for aSetwould reportDISTINCT, and a Spliterator for aSortedSetwould also reportSORTED. Characteristics are reported as a simple unioned bit set. Some characteristics additionally constrain method behavior; for example ifORDERED, traversal methods must conform to their documented ordering. New characteristics may be defined in the future, so implementors should not assign meanings to unlisted values.A Spliterator that does not report
IMMUTABLEorCONCURRENTis expected to have a documented policy concerning: when the spliterator binds to the element source; and detection of structural interference of the element source detected after binding. A late-binding Spliterator binds to the source of elements at the point of first traversal, first split, or first query for estimated size, rather than at the time the Spliterator is created. A Spliterator that is not late-binding binds to the source of elements at the point of construction or first invocation of any method. Modifications made to the source prior to binding are reflected when the Spliterator is traversed. After binding a Spliterator should, on a best-effort basis, throwConcurrentModificationExceptionif structural interference is detected. Spliterators that do this are called fail-fast. The bulk traversal method (forEachRemaining()) of a Spliterator may optimize traversal and check for structural interference after all elements have been traversed, rather than checking per-element and failing immediately.Spliterators can provide an estimate of the number of remaining elements via the
estimateSize()method. Ideally, as reflected in characteristicSIZED, this value corresponds exactly to the number of elements that would be encountered in a successful traversal. However, even when not exactly known, an estimated value may still be useful to operations being performed on the source, such as helping to determine whether it is preferable to split further or traverse the remaining elements sequentially.Despite their obvious utility in parallel algorithms, spliterators are not expected to be thread-safe; instead, implementations of parallel algorithms using spliterators should ensure that the spliterator is only used by one thread at a time. This is generally easy to attain via serial thread-confinement, which often is a natural consequence of typical parallel algorithms that work by recursive decomposition. A thread calling
trySplit()may hand over the returned Spliterator to another thread, which in turn may traverse or further split that Spliterator. The behaviour of splitting and traversal is undefined if two or more threads operate concurrently on the same spliterator. If the original thread hands a spliterator off to another thread for processing, it is best if that handoff occurs before any elements are consumed withtryAdvance(), as certain guarantees (such as the accuracy ofestimateSize()forSIZEDspliterators) are only valid before traversal has begun.Primitive subtype specializations of
Spliteratorare provided forint,long, anddoublevalues. The subtype default implementations oftryAdvance(java.util.function.Consumer)andforEachRemaining(java.util.function.Consumer)box primitive values to instances of their corresponding wrapper class. Such boxing may undermine any performance advantages gained by using the primitive specializations. To avoid boxing, the corresponding primitive-based methods should be used. For example,Spliterator.OfInt.tryAdvance(java.util.function.IntConsumer)andSpliterator.OfInt.forEachRemaining(java.util.function.IntConsumer)should be used in preference toSpliterator.OfInt.tryAdvance(java.util.function.Consumer)andSpliterator.OfInt.forEachRemaining(java.util.function.Consumer). Traversal of primitive values using boxing-based methodstryAdvance()andforEachRemaining()does not affect the order in which the values, transformed to boxed values, are encountered.- Since:
- 1.8
- See Also:
Collection
-
-
Nested Class Summary
Nested Classes Modifier and Type Interface Description static interfaceSpliterator.OfDoubleA Spliterator specialized fordoublevalues.static interfaceSpliterator.OfIntA Spliterator specialized forintvalues.static interfaceSpliterator.OfLongA Spliterator specialized forlongvalues.static interfaceSpliterator.OfPrimitive<T,T_CONS,T_SPLITR extends Spliterator.OfPrimitive<T,T_CONS,T_SPLITR>>A Spliterator specialized for primitive values.
-
Field Summary
Fields Modifier and Type Field Description static intCONCURRENTCharacteristic value signifying that the element source may be safely concurrently modified (allowing additions, replacements, and/or removals) by multiple threads without external synchronization.static intDISTINCTCharacteristic value signifying that, for each pair of encountered elementsx, y,!x.equals(y).static intIMMUTABLECharacteristic value signifying that the element source cannot be structurally modified; that is, elements cannot be added, replaced, or removed, so such changes cannot occur during traversal.static intNONNULLCharacteristic value signifying that the source guarantees that encountered elements will not benull.static intORDEREDCharacteristic value signifying that an encounter order is defined for elements.static intSIZEDCharacteristic value signifying that the value returned fromestimateSize()prior to traversal or splitting represents a finite size that, in the absence of structural source modification, represents an exact count of the number of elements that would be encountered by a complete traversal.static intSORTEDCharacteristic value signifying that encounter order follows a defined sort order.static intSUBSIZED
-
Method Summary
All Methods Instance Methods Abstract Methods Default Methods Modifier and Type Method Description intcharacteristics()Returns a set of characteristics of this Spliterator and its elements.longestimateSize()Returns an estimate of the number of elements that would be encountered by aforEachRemaining(java.util.function.Consumer<? super T>)traversal, or returnsLong.MAX_VALUEif infinite, unknown, or too expensive to compute.default voidforEachRemaining(Consumer<? super T> action)Performs the given action for each remaining element, sequentially in the current thread, until all elements have been processed or the action throws an exception.default Comparator<? super T>getComparator()default longgetExactSizeIfKnown()default booleanhasCharacteristics(int characteristics)Returnstrueif this Spliterator'scharacteristics()contain all of the given characteristics.booleantryAdvance(Consumer<? super T> action)If a remaining element exists, performs the given action on it, returningtrue; else returnsfalse.Spliterator<T>trySplit()If this spliterator can be partitioned, returns a Spliterator covering elements, that will, upon return from this method, not be covered by this Spliterator.
-
-
-
Field Detail
-
ORDERED
static final int ORDERED
Characteristic value signifying that an encounter order is defined for elements. If so, this Spliterator guarantees that methodtrySplit()splits a strict prefix of elements, that methodtryAdvance(java.util.function.Consumer<? super T>)steps by one element in prefix order, and thatforEachRemaining(java.util.function.Consumer<? super T>)performs actions in encounter order.A
Collectionhas an encounter order if the correspondingCollection.iterator()documents an order. If so, the encounter order is the same as the documented order. Otherwise, a collection does not have an encounter order.- See Also:
- Constant Field Values
-
DISTINCT
static final int DISTINCT
Characteristic value signifying that, for each pair of encountered elementsx, y,!x.equals(y). This applies for example, to a Spliterator based on aSet.- See Also:
- Constant Field Values
-
SORTED
static final int SORTED
Characteristic value signifying that encounter order follows a defined sort order. If so, methodgetComparator()returns the associated Comparator, ornullif all elements areComparableand are sorted by their natural ordering.A Spliterator that reports
SORTEDmust also reportORDERED.- See Also:
- Constant Field Values
-
SIZED
static final int SIZED
Characteristic value signifying that the value returned fromestimateSize()prior to traversal or splitting represents a finite size that, in the absence of structural source modification, represents an exact count of the number of elements that would be encountered by a complete traversal.- See Also:
- Constant Field Values
-
NONNULL
static final int NONNULL
Characteristic value signifying that the source guarantees that encountered elements will not benull. (This applies, for example, to most concurrent collections, queues, and maps.)- See Also:
- Constant Field Values
-
IMMUTABLE
static final int IMMUTABLE
Characteristic value signifying that the element source cannot be structurally modified; that is, elements cannot be added, replaced, or removed, so such changes cannot occur during traversal. A Spliterator that does not reportIMMUTABLEorCONCURRENTis expected to have a documented policy (for example throwingConcurrentModificationException) concerning structural interference detected during traversal.- See Also:
- Constant Field Values
-
CONCURRENT
static final int CONCURRENT
Characteristic value signifying that the element source may be safely concurrently modified (allowing additions, replacements, and/or removals) by multiple threads without external synchronization. If so, the Spliterator is expected to have a documented policy concerning the impact of modifications during traversal.A top-level Spliterator should not report both
CONCURRENTandSIZED, since the finite size, if known, may change if the source is concurrently modified during traversal. Such a Spliterator is inconsistent and no guarantees can be made about any computation using that Spliterator. Sub-spliterators may reportSIZEDif the sub-split size is known and additions or removals to the source are not reflected when traversing.A top-level Spliterator should not report both
CONCURRENTandIMMUTABLE, since they are mutually exclusive. Such a Spliterator is inconsistent and no guarantees can be made about any computation using that Spliterator. Sub-spliterators may reportIMMUTABLEif additions or removals to the source are not reflected when traversing.- See Also:
- Constant Field Values
-
SUBSIZED
static final int SUBSIZED
Characteristic value signifying that all Spliterators resulting fromtrySplit()will be bothSIZEDandSUBSIZED. (This means that all child Spliterators, whether direct or indirect, will beSIZED.)A Spliterator that does not report
SIZEDas required bySUBSIZEDis inconsistent and no guarantees can be made about any computation using that Spliterator.- See Also:
- Constant Field Values
-
-
Method Detail
-
tryAdvance
boolean tryAdvance(Consumer<? super T> action)
If a remaining element exists, performs the given action on it, returningtrue; else returnsfalse. If this Spliterator isORDEREDthe action is performed on the next element in encounter order. Exceptions thrown by the action are relayed to the caller.- Parameters:
action- The action- Returns:
falseif no remaining elements existed upon entry to this method, elsetrue.- Throws:
NullPointerException- if the specified action is null
-
forEachRemaining
default void forEachRemaining(Consumer<? super T> action)
Performs the given action for each remaining element, sequentially in the current thread, until all elements have been processed or the action throws an exception. If this Spliterator isORDERED, actions are performed in encounter order. Exceptions thrown by the action are relayed to the caller.- Parameters:
action- The action- Throws:
NullPointerException- if the specified action is null
-
trySplit
Spliterator<T> trySplit()
If this spliterator can be partitioned, returns a Spliterator covering elements, that will, upon return from this method, not be covered by this Spliterator.If this Spliterator is
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 returnnull. Upon non-null return:- the value reported for
estimateSize()before splitting, must, after splitting, be greater than or equal toestimateSize()for this and the returned Spliterator; and - if this Spliterator is
SUBSIZED, thenestimateSize()for this spliterator before splitting must be equal to the sum ofestimateSize()for this and the returned Spliterator after splitting.
This method may return
nullfor any reason, including emptiness, inability to split after traversal has commenced, data structure constraints, and efficiency considerations.- Returns:
- a
Spliteratorcovering some portion of the elements, ornullif this spliterator cannot be split
- the value reported for
-
estimateSize
long estimateSize()
Returns an estimate of the number of elements that would be encountered by aforEachRemaining(java.util.function.Consumer<? super T>)traversal, or returnsLong.MAX_VALUEif infinite, unknown, or too expensive to compute.If this Spliterator is
SIZEDand has not yet been partially traversed or split, or this Spliterator isSUBSIZEDand 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 oftrySplit().- Returns:
- the estimated size, or
Long.MAX_VALUEif infinite, unknown, or too expensive to compute.
-
getExactSizeIfKnown
default long getExactSizeIfKnown()
- Returns:
- the exact size, if known, else
-1.
-
characteristics
int characteristics()
Returns a set of characteristics of this Spliterator and its elements. The result is represented as ORed values fromORDERED,DISTINCT,SORTED,SIZED,NONNULL,IMMUTABLE,CONCURRENT,SUBSIZED. Repeated calls tocharacteristics()on a given spliterator, prior to or in-between calls totrySplit, 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.
- Returns:
- a representation of characteristics
-
hasCharacteristics
default boolean hasCharacteristics(int characteristics)
Returnstrueif this Spliterator'scharacteristics()contain all of the given characteristics.- Parameters:
characteristics- the characteristics to check for- Returns:
trueif all the specified characteristics are present, elsefalse
-
getComparator
default Comparator<? super T> getComparator()
If this Spliterator's source isSORTEDby aComparator, returns thatComparator. If the source isSORTEDin natural order, returnsnull. Otherwise, if the source is notSORTED, throwsIllegalStateException.- Returns:
- a Comparator, or
nullif the elements are sorted in the natural order. - Throws:
IllegalStateException- if the spliterator does not report a characteristic ofSORTED.
-
-