org.millscript.commons.util.map
Class EBinaryTreeMap.NodeXIterator<E>

java.lang.Object
  org.millscript.commons.util.iterator.AbstractMapIterator<java.lang.Integer,V>
      org.millscript.commons.util.iterator.AbstractListIterator<E>
          org.millscript.commons.util.map.EBinaryTreeMap.NodeXIterator<E>

All Implemented Interfaces:

ListIterator<E>, MapIterator<java.lang.Integer,E>

Direct Known Subclasses:

EBinaryTreeMap.NodeKeyIterator, EBinaryTreeMap.NodeMapletIterator, EBinaryTreeMap.NodeValueIterator

Enclosing class:

EBinaryTreeMap<K extends java.lang.Comparable<K>,V>

public abstract static class EBinaryTreeMap.NodeXIterator<E>
extends AbstractListIterator<E>

Field Summary

Fields inherited from class org.millscript.commons.util.iterator.AbstractListIterator

position

Constructor Summary

protected

EBinaryTreeMap.NodeXIterator(EBinaryTreeMap.Node<?,?> node, int num) Constructs a new binary tree map iterator to iterate over the specified node tree.

Method Summary

protected void	advance() Advances this iterator to its next point.
protected E	getValue() Returns the value for the current mapping in the iteration.
boolean	hasNext() Returns true if there are more values available in this iteration and false otherwise.
protected boolean	outOfBounds() Returns true if this iterator is outside its bounds(before the first element or beyond the last) and false otherwise.

Methods inherited from class org.millscript.commons.util.iterator.AbstractListIterator

currentMaplet, getKey, getMaplet, nextMaplet

Methods inherited from class org.millscript.commons.util.iterator.AbstractMapIterator

currentKey, currentValue, nextKey, nextValue

Methods inherited from class java.lang.Object

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

Methods inherited from interface org.millscript.commons.util.MapIterator

currentKey, currentValue, nextKey, nextValue

Constructor Detail

EBinaryTreeMap.NodeXIterator

protected EBinaryTreeMap.NodeXIterator(EBinaryTreeMap.Node<?,?> node,
                                       int num)

Constructs a new binary tree map iterator to iterate over the specified node tree.

Parameters:

node - any node in the leftmost branch of the backing store tree

num - the number of elements in this iteration

Method Detail

advance

protected void advance()

Description copied from class: AbstractMapIterator

Advances this iterator to its next point. This method allows a common implementation of the next* methods, making it a little bit easier to implement the map iterator interface.

Overrides:

advance in class AbstractListIterator<E>

See Also:

AbstractMapIterator.advance()

getValue

protected E getValue()

Description copied from class: AbstractMapIterator

Returns the value for the current mapping in the iteration. This method must be implemented by any concrete implementation and should not need to perform bounds checking.

Specified by:

getValue in class AbstractMapIterator<java.lang.Integer,E>

Returns:

the value for the current mapping

See Also:

AbstractMapIterator.getValue()

hasNext

public boolean hasNext()

Description copied from interface: MapIterator

Returns true if there are more values available in this iteration and false otherwise.

Returns:

true if there are more values in this iteration and false otherwise

See Also:

MapIterator.hasNext()

outOfBounds

protected boolean outOfBounds()

Description copied from class: AbstractMapIterator

Returns true if this iterator is outside its bounds(before the first element or beyond the last) and false otherwise.

Specified by:

outOfBounds in class AbstractMapIterator<java.lang.Integer,E>

Returns:

true if this iterator is outside its bounds and false otherwise

See Also:

AbstractMapIterator.outOfBounds()