Package it.unimi.dsi.fastutil.bytes

Class ByteBigListIterators.AbstractIndexBasedBigIterator

java.lang.Object
it.unimi.dsi.fastutil.bytes.AbstractByteIterator
it.unimi.dsi.fastutil.bytes.ByteBigListIterators.AbstractIndexBasedBigIterator
All Implemented Interfaces:
ByteIterator, Iterator<Byte>, PrimitiveIterator<Byte,ByteConsumer>
Direct Known Subclasses:
ByteBigListIterators.AbstractIndexBasedBigListIterator
Enclosing class:
ByteBigListIterators
public abstract static class ByteBigListIterators.AbstractIndexBasedBigIterator extends AbstractByteIterator
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()

    • nextByte

      public byte nextByte()
      Description copied from interface: ByteIterator
      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(ByteConsumer action)
      Description copied from interface: ByteIterator
      Performs the given action for each remaining element until all elements have been processed or the action throws an exception.
      Parameters:
      action - the action to be performed for each element.
      See Also:

    • skip

      public long skip(long n)

    • skip

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

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