Package it.unimi.dsi.fastutil.ints

Class IntBigListIterators.AbstractIndexBasedBigIterator

java.lang.Object
it.unimi.dsi.fastutil.ints.AbstractIntIterator
it.unimi.dsi.fastutil.ints.IntBigListIterators.AbstractIndexBasedBigIterator
All Implemented Interfaces:
IntIterator, Iterator<Integer>, PrimitiveIterator<Integer,IntConsumer>, PrimitiveIterator.OfInt
Direct Known Subclasses:
IntBigListIterators.AbstractIndexBasedBigListIterator
Enclosing class:
IntBigListIterators
public abstract static class IntBigListIterators.AbstractIndexBasedBigIterator extends AbstractIntIterator
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).

  • Method Details

    • hasNext

      public boolean hasNext()

    • nextInt

      public int nextInt()
      Description copied from interface: IntIterator
      Returns the next element as a primitive type.
      Returns:
      the next element in the iteration.
      See Also:

    • remove

      public void remove()

    • forEachRemaining

      public void forEachRemaining(IntConsumer action)

    • skip

      public long skip(long n)

    • skip

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

      The effect of this call is exactly the same as that of calling IntIterator.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: