com.carrotsearch.hppcrt.lists

Class ByteLinkedList.DescendingValueIterator

java.lang.Object

com.carrotsearch.hppcrt.AbstractIterator<ByteCursor>

com.carrotsearch.hppcrt.lists.ByteLinkedList.ValueIterator

com.carrotsearch.hppcrt.lists.ByteLinkedList.DescendingValueIterator

All Implemented Interfaces:

java.util.Iterator<ByteCursor>

Enclosing class:

ByteLinkedList

public final class ByteLinkedList.DescendingValueIterator
extends ByteLinkedList.ValueIterator

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

cursor

Constructor Summary

Constructors

Constructor and Description
DescendingValueIterator()

Method Summary

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

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

See Also:

ByteLinkedList.ValueIterator.hasBefore()

hasBefore

public boolean hasBefore()

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

See Also:

ByteLinkedList.ValueIterator.hasAfter()

gotoHead

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

gotoTail

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

gotoNext

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

gotoPrevious

public ByteLinkedList.DescendingValueIterator gotoPrevious()

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

Overrides:

gotoPrevious in class ByteLinkedList.ValueIterator

getNext

public byte getNext()

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

Overrides:

getNext in class ByteLinkedList.ValueIterator

getPrevious

public byte getPrevious()

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

Overrides:

getPrevious in class ByteLinkedList.ValueIterator

removeNext

public byte removeNext()

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

Overrides:

removeNext in class ByteLinkedList.ValueIterator

removePrevious

public byte removePrevious()

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

Overrides:

removePrevious in class ByteLinkedList.ValueIterator

insertBefore

public void insertBefore(byte e1)

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

Overrides:

insertBefore in class ByteLinkedList.ValueIterator

insertAfter

public void insertAfter(byte e1)

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

Overrides:

insertAfter in class ByteLinkedList.ValueIterator

delete

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

Throws:

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