com.carrotsearch.hppcrt.lists

Class DoubleLinkedList.DescendingValueIterator

java.lang.Object

com.carrotsearch.hppcrt.AbstractIterator<DoubleCursor>

com.carrotsearch.hppcrt.lists.DoubleLinkedList.ValueIterator

com.carrotsearch.hppcrt.lists.DoubleLinkedList.DescendingValueIterator

All Implemented Interfaces:

java.util.Iterator<DoubleCursor>

Enclosing class:

DoubleLinkedList

public final class DoubleLinkedList.DescendingValueIterator
extends DoubleLinkedList.ValueIterator

A specialized iterator implementation for DoubleLinkedList.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.DoubleLinkedList.ValueIterator

cursor

Constructor Summary

Constructors

Constructor and Description
DescendingValueIterator()

Method Summary

Modifier and Type	Method and Description
DoubleLinkedList.DescendingValueIterator	delete() Delete the current iterator position, and moves to the next valid element after this removal, with respect to the forward iteration.
protected DoubleCursor	fetch() Fetch next element.
double	getNext() Get the next element value with respect to the forward iteration, without moving the iterator.
double	getPrevious() Get the previous element value with respect to the forward iteration,
DoubleLinkedList.ValueIterator	gotoHead() Reset the iterator to the "head", returning itself for chaining.
DoubleLinkedList.DescendingValueIterator	gotoNext() Analog to AbstractIterator.next(), move the iterator to the next element, with respect to the forward iteration, returning itself for chaining.
DoubleLinkedList.DescendingValueIterator	gotoPrevious() Move the iterator to the previous element, with respect to the forward iteration, returning itself for chaining.
DoubleLinkedList.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 DoubleLinkedList.ValueIterator.hasAfter(), i.e. returns true if there is an element before the current position, with respect to the forward iteration.
void	insertAfter(double e1) Insert e1 after the iterator position, without moving the iterator.
void	insertBefore(double e1) Insert e1 before the iterator position, without moving the iterator.
double	removeNext() Removes the next element, without moving the iterator.
double	removePrevious() Removes the previous element, without moving the iterator.

Methods inherited from class com.carrotsearch.hppcrt.lists.DoubleLinkedList.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 DoubleCursor 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 DoubleLinkedList.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 DoubleLinkedList.ValueIterator

See Also:

DoubleLinkedList.ValueIterator.hasBefore()

hasBefore

public boolean hasBefore()

Inverse of DoubleLinkedList.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 DoubleLinkedList.ValueIterator

See Also:

DoubleLinkedList.ValueIterator.hasAfter()

gotoHead

public DoubleLinkedList.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 DoubleLinkedList.ValueIterator

gotoTail

public DoubleLinkedList.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 DoubleLinkedList.ValueIterator

gotoNext

public DoubleLinkedList.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 DoubleLinkedList.ValueIterator

gotoPrevious

public DoubleLinkedList.DescendingValueIterator gotoPrevious()

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

Overrides:

gotoPrevious in class DoubleLinkedList.ValueIterator

getNext

public double getNext()

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

Overrides:

getNext in class DoubleLinkedList.ValueIterator

getPrevious

public double getPrevious()

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

Overrides:

getPrevious in class DoubleLinkedList.ValueIterator

removeNext

public double removeNext()

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

Overrides:

removeNext in class DoubleLinkedList.ValueIterator

removePrevious

public double removePrevious()

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

Overrides:

removePrevious in class DoubleLinkedList.ValueIterator

insertBefore

public void insertBefore(double e1)

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

Overrides:

insertBefore in class DoubleLinkedList.ValueIterator

insertAfter

public void insertAfter(double e1)

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

Overrides:

insertAfter in class DoubleLinkedList.ValueIterator

delete

public DoubleLinkedList.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 DoubleLinkedList.ValueIterator

Throws:

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