com.carrotsearch.hppcrt.lists

Class LongLinkedList.DescendingValueIterator

java.lang.Object

com.carrotsearch.hppcrt.AbstractIterator<LongCursor>

com.carrotsearch.hppcrt.lists.LongLinkedList.ValueIterator

com.carrotsearch.hppcrt.lists.LongLinkedList.DescendingValueIterator

All Implemented Interfaces:

java.util.Iterator<LongCursor>

Enclosing class:

LongLinkedList

public final class LongLinkedList.DescendingValueIterator
extends LongLinkedList.ValueIterator

A specialized iterator implementation for LongLinkedList.descendingIterator()s.

 
 Important: NEVER USE java.util.Iterator methods directly, only use the specialized methods instead !
 Iterator.hasNext() and Iterator.next() are only for enhanced-loop support, using them
 directly will lead to unpredictable results !
 

Field Summary

Fields inherited from class com.carrotsearch.hppcrt.lists.LongLinkedList.ValueIterator

cursor

Constructor Summary

Constructors

Constructor and Description
DescendingValueIterator()

Method Summary

Modifier and Type	Method and Description
LongLinkedList.DescendingValueIterator	delete() Delete the current iterator position, and moves to the next valid element after this removal, with respect to the forward iteration.
protected LongCursor	fetch() Fetch next element.
long	getNext() Get the next element value with respect to the forward iteration, without moving the iterator.
long	getPrevious() Get the previous element value with respect to the forward iteration,
LongLinkedList.ValueIterator	gotoHead() Reset the iterator to the "head", returning itself for chaining.
LongLinkedList.DescendingValueIterator	gotoNext() Analog to AbstractIterator.next(), move the iterator to the next element, with respect to the forward iteration, returning itself for chaining.
LongLinkedList.DescendingValueIterator	gotoPrevious() Move the iterator to the previous element, with respect to the forward iteration, returning itself for chaining.
LongLinkedList.DescendingValueIterator	gotoTail() Reset the iterator to the "tail", returning itself for chaining.
boolean	hasAfter() Analog to AbstractIterator.hasNext(), returns true if there is an element after the current position, with respect to the forward iteration.
boolean	hasBefore() Inverse of LongLinkedList.ValueIterator.hasAfter(), i.e. returns true if there is an element before the current position, with respect to the forward iteration.
void	insertAfter(long e1) Insert e1 after the iterator position, without moving the iterator.
void	insertBefore(long e1) Insert e1 before the iterator position, without moving the iterator.
long	removeNext() Removes the next element, without moving the iterator.
long	removePrevious() Removes the previous element, without moving the iterator.

Methods inherited from class com.carrotsearch.hppcrt.lists.LongLinkedList.ValueIterator

set

Methods inherited from class com.carrotsearch.hppcrt.AbstractIterator

done, hasNext, next, release, remove

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.util.Iterator

forEachRemaining

Constructor Detail

DescendingValueIterator

public DescendingValueIterator()

Method Detail

fetch

protected LongCursor fetch()

Description copied from class: AbstractIterator

Fetch next element. The implementation must return AbstractIterator.done() when all elements have been fetched.

Overrides:

fetch in class LongLinkedList.ValueIterator

hasAfter

public boolean hasAfter()

Analog to AbstractIterator.hasNext(), returns true if there is an element after the current position, with respect to the forward iteration. Always false if the list is empty. (i.e no next element)

Overrides:

hasAfter in class LongLinkedList.ValueIterator

See Also:

LongLinkedList.ValueIterator.hasBefore()

hasBefore

public boolean hasBefore()

Inverse of LongLinkedList.ValueIterator.hasAfter(), i.e. returns true if there is an element before the current position, with respect to the forward iteration. Always false if the list is empty. (i.e no previous element)

Overrides:

hasBefore in class LongLinkedList.ValueIterator

See Also:

LongLinkedList.ValueIterator.hasAfter()

gotoHead

public LongLinkedList.ValueIterator gotoHead()

Reset the iterator to the "head", returning itself for chaining. Head is such that gotoHead().gotoNext() points to the first element of the list, with respect to the forward iteration. (if the list is not empty)

Overrides:

gotoHead in class LongLinkedList.ValueIterator

gotoTail

public LongLinkedList.DescendingValueIterator gotoTail()

Reset the iterator to the "tail", returning itself for chaining. Tail is such that gotoTail().gotoPrevious() points to the last element of the list, with respect to the forward iteration. (if the list is not empty)

Overrides:

gotoTail in class LongLinkedList.ValueIterator

gotoNext

public LongLinkedList.DescendingValueIterator gotoNext()

Analog to AbstractIterator.next(), move the iterator to the next element, with respect to the forward iteration, returning itself for chaining.

Overrides:

gotoNext in class LongLinkedList.ValueIterator

gotoPrevious

public LongLinkedList.DescendingValueIterator gotoPrevious()

Move the iterator to the previous element, with respect to the forward iteration, returning itself for chaining.

Overrides:

gotoPrevious in class LongLinkedList.ValueIterator

getNext

public long getNext()

Get the next element value with respect to the forward iteration, without moving the iterator.

Overrides:

getNext in class LongLinkedList.ValueIterator

getPrevious

public long getPrevious()

Get the previous element value with respect to the forward iteration,

Overrides:

getPrevious in class LongLinkedList.ValueIterator

removeNext

public long removeNext()

Removes the next element, without moving the iterator. returns the removed element.

Overrides:

removeNext in class LongLinkedList.ValueIterator

removePrevious

public long removePrevious()

Removes the previous element, without moving the iterator. Returns the removed element.

Overrides:

removePrevious in class LongLinkedList.ValueIterator

insertBefore

public void insertBefore(long e1)

Insert e1 before the iterator position, without moving the iterator.

Overrides:

insertBefore in class LongLinkedList.ValueIterator

insertAfter

public void insertAfter(long e1)

Insert e1 after the iterator position, without moving the iterator.

Overrides:

insertAfter in class LongLinkedList.ValueIterator

delete

public LongLinkedList.DescendingValueIterator delete()

Delete the current iterator position, and moves to the next valid element after this removal, with respect to the forward iteration. Returns the iterator itself for chaining.

Overrides:

delete in class LongLinkedList.ValueIterator

Throws:

java.lang.IndexOutOfBoundsException - if delete is impossible, because we are pointing either at head or tail.