Class LongBigListIterators.AbstractIndexBasedBigIterator

  • All Implemented Interfaces:
    LongIterator, java.util.Iterator<java.lang.Long>, java.util.PrimitiveIterator<java.lang.Long,​java.util.function.LongConsumer>, java.util.PrimitiveIterator.OfLong
    Direct Known Subclasses:
    LongBigListIterators.AbstractIndexBasedBigListIterator
    Enclosing class:
    LongBigListIterators

    public abstract static class LongBigListIterators.AbstractIndexBasedBigIterator
    extends AbstractLongIterator
    A skeletal implementation for an iterator backed by an index based data store. High performance concrete implementations (like the main Iterator of BigArrayBigList) generally should avoid using this and just implement the interface directly, but should be decent for less performance critical implementations.

    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.PrimitiveIterator

        java.util.PrimitiveIterator.OfDouble, java.util.PrimitiveIterator.OfInt, java.util.PrimitiveIterator.OfLong
    • Method Detail

      • hasNext

        public boolean hasNext()
      • nextLong

        public long nextLong()
        Description copied from interface: LongIterator
        Returns the next element as a primitive type.
        Returns:
        the next element in the iteration.
        See Also:
        Iterator.next()
      • remove

        public void remove()
      • forEachRemaining

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

        public long skip​(long n)
      • skip

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

        The effect of this call is exactly the same as that of calling LongIterator.next() for n times (possibly stopping if Iterator.hasNext() becomes false).

        Parameters:
        n - the number of elements to skip.
        Returns:
        the number of elements actually skipped.
        See Also:
        Iterator.next()