Package it.unimi.dsi.fastutil.ints

Class IntBigListIterators.AbstractIndexBasedBigListIterator

java.lang.Object

it.unimi.dsi.fastutil.ints.AbstractIntIterator

it.unimi.dsi.fastutil.ints.IntBigListIterators.AbstractIndexBasedBigIterator

it.unimi.dsi.fastutil.ints.IntBigListIterators.AbstractIndexBasedBigListIterator

All Implemented Interfaces:

BidirectionalIterator<Integer>, BigListIterator<Integer>, IntBidirectionalIterator, IntBigListIterator, IntIterator, ObjectBidirectionalIterator<Integer>, ObjectIterator<Integer>, Iterator<Integer>, PrimitiveIterator<Integer,IntConsumer>, PrimitiveIterator.OfInt

Enclosing class:

IntBigListIterators

public abstract static class IntBigListIterators.AbstractIndexBasedBigListIterator
extends IntBigListIterators.AbstractIndexBasedBigIterator
implements IntBigListIterator

A skeletal implementation for a list-iterator backed by an index based data store. High performance concrete implementations (like the main ListIterator of ArrayList) 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

PrimitiveIterator.OfDouble, PrimitiveIterator.OfInt, PrimitiveIterator.OfLong

Method Summary

Modifier and Type	Method	Description
void	add(int k)	Inserts the specified element into the list (optional operation).
long	back(long n)	Moves back for the given number of elements.
boolean	hasPrevious()	Returns whether there is a previous element.
long	nextIndex()	Returns the index of the element that would be returned by a subsequent call to next.
long	previousIndex()	Returns the index of the element that would be returned by a subsequent call to previous.
int	previousInt()	Returns the previous element as a primitive type.
void	set(int k)	Replaces the last element returned by next() or previous() with the specified element (optional operation).

Methods inherited from class it.unimi.dsi.fastutil.ints.IntBigListIterators.AbstractIndexBasedBigIterator

forEachRemaining, hasNext, nextInt, remove, skip, skip

Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractIntIterator

forEachRemaining

Methods inherited from class java.lang.Object

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

Methods inherited from interface it.unimi.dsi.fastutil.ints.IntBidirectionalIterator

back, previous

Methods inherited from interface it.unimi.dsi.fastutil.ints.IntBigListIterator

add, set, skip, skip

Methods inherited from interface it.unimi.dsi.fastutil.ints.IntIterator

forEachRemaining, forEachRemaining, next, nextInt

Methods inherited from interface java.util.Iterator

hasNext, remove

Methods inherited from interface java.util.PrimitiveIterator.OfInt

forEachRemaining

Method Details

hasPrevious

public boolean hasPrevious()

Description copied from interface: BidirectionalIterator

Returns whether there is a previous element.

Specified by:

hasPrevious in interface BidirectionalIterator<Integer>

Returns:

whether there is a previous element.

See Also:

• ListIterator.hasPrevious()

previousInt

public int previousInt()

Description copied from interface: IntBidirectionalIterator

Returns the previous element as a primitive type.

Specified by:

previousInt in interface IntBidirectionalIterator

Returns:

the previous element in the iteration.

See Also:

• ListIterator.previous()

nextIndex

public long nextIndex()

Description copied from interface: BigListIterator

Returns the index of the element that would be returned by a subsequent call to next. (Returns list size if the list iterator is at the end of the list.)

Specified by:

nextIndex in interface BigListIterator<Integer>

Returns:

the index of the element that would be returned by a subsequent call to next, or list size if list iterator is at end of list.

See Also:

• ListIterator.nextIndex()

previousIndex

public long previousIndex()

Description copied from interface: BigListIterator

Returns the index of the element that would be returned by a subsequent call to previous. (Returns -1 if the list iterator is at the beginning of the list.)

Specified by:

previousIndex in interface BigListIterator<Integer>

Returns:

the index of the element that would be returned by a subsequent call to previous, or -1 if list iterator is at beginning of list.

See Also:

• ListIterator.previousIndex()

add

public void add(int k)

Description copied from interface: IntBigListIterator

Inserts the specified element into the list (optional operation).

Specified by:

add in interface IntBigListIterator

See Also:

• ListIterator.add(Object)

set

public void set(int k)

Description copied from interface: IntBigListIterator

Replaces the last element returned by next() or previous() with the specified element (optional operation).

Specified by:

set in interface IntBigListIterator

See Also:

• ListIterator.set(Object)

back

public long back(long n)

Description copied from interface: IntBigListIterator

Moves back for the given number of elements.

The effect of this call is exactly the same as that of calling previous() for n times (possibly stopping if BidirectionalIterator.hasPrevious() becomes false).

Specified by:

back in interface IntBigListIterator

Parameters:

n - the number of elements to skip back.

Returns:

the number of elements actually skipped.

See Also:

• BidirectionalIterator.previous()