Class LongSpliterators.AbstractIndexBasedSpliterator

java.lang.Object
it.unimi.dsi.fastutil.longs.AbstractLongSpliterator
it.unimi.dsi.fastutil.longs.LongSpliterators.AbstractIndexBasedSpliterator
All Implemented Interfaces:
LongSpliterator, java.util.Spliterator<java.lang.Long>, java.util.Spliterator.OfLong, java.util.Spliterator.OfPrimitive<java.lang.Long,​java.util.function.LongConsumer,​java.util.Spliterator.OfLong>
Direct Known Subclasses:
LongSpliterators.EarlyBindingSizeIndexBasedSpliterator, LongSpliterators.LateBindingSizeIndexBasedSpliterator
Enclosing class:
LongSpliterators

public abstract static class LongSpliterators.AbstractIndexBasedSpliterator
extends AbstractLongSpliterator
A skeletal implementation for a spliterator backed by an index based data store. High performance concrete implementations (like the main Spliterator of ArrayList) generally should avoid using this and just implement the interface directly, but should be decent for less performance critical implementations.

This class is only appropriate for sequences that are at most Integer.MAX_VALUE long. If your backing data store can be bigger then this, consider the equivalently named class in the type specific BigSpliterators class.

As the abstract methods in this class are used in inner loops, it is generally a good idea to override the class as final as to encourage the JVM to inline them (or alternatively, override the abstract methods as final).

  • Nested Class Summary

    Nested classes/interfaces inherited from interface java.util.Spliterator

    java.util.Spliterator.OfDouble, java.util.Spliterator.OfInt, java.util.Spliterator.OfLong, java.util.Spliterator.OfPrimitive<T extends java.lang.Object,​T_CONS extends java.lang.Object,​T_SPLITR extends java.util.Spliterator.OfPrimitive<T,​T_CONS,​T_SPLITR>>
  • Field Summary

    Fields inherited from interface java.util.Spliterator

    CONCURRENT, DISTINCT, IMMUTABLE, NONNULL, ORDERED, SIZED, SORTED, SUBSIZED
  • Method Summary

    Modifier and Type Method Description
    int characteristics()  
    long estimateSize()  
    void forEachRemaining​(java.util.function.LongConsumer action)  
    long skip​(long n)
    Skips the given number of elements.
    boolean tryAdvance​(java.util.function.LongConsumer action)  
    LongSpliterator trySplit()

    Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLongSpliterator

    forEachRemaining, tryAdvance

    Methods inherited from class java.lang.Object

    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

    Methods inherited from interface it.unimi.dsi.fastutil.longs.LongSpliterator

    forEachRemaining, getComparator, tryAdvance

    Methods inherited from interface java.util.Spliterator

    getExactSizeIfKnown, hasCharacteristics
  • Method Details

    • characteristics

      public int characteristics()
    • estimateSize

      public long estimateSize()
    • tryAdvance

      public boolean tryAdvance​(java.util.function.LongConsumer action)
    • forEachRemaining

      public void forEachRemaining​(java.util.function.LongConsumer action)
    • skip

      public long skip​(long n)
      Description copied from interface: LongSpliterator
      Skips the given number of elements.

      The effect of this call is exactly the same as that of calling LongSpliterator.tryAdvance(java.util.function.Consumer<? super java.lang.Long>) for n times (possibly stopping if LongSpliterator.tryAdvance(java.util.function.Consumer<? super java.lang.Long>) returns false). The action called will do nothing; elements will be discarded.

      Parameters:
      n - the number of elements to skip.
      Returns:
      the number of elements actually skipped.
      See Also:
      Spliterator.tryAdvance(java.util.function.Consumer<? super T>)
    • trySplit

      public LongSpliterator trySplit()
      Throws:
      java.lang.IndexOutOfBoundsException - if the return of computeSplitPoint() was < pos or > {@link #getMaxPos()}.
      Implementation Specification:
      This implementation always returns a prefix of the elements, in order to comply with the Spliterator.ORDERED property. This means this current iterator does not need to to update what getMaxPos() returns in response to this method (but it may do "book-keeping" on it based on binding strategy).

      The split point is computed by computeSplitPoint(); see that method for details.