Class KVTree.EntryIterator<K,V>

java.lang.Object

org.pcollections.KVTree.EntryIterator<K,V>

All Implemented Interfaces:

Iterator<Map.Entry<K,V>>

Enclosing class:

KVTree<K,V>

private static class KVTree.EntryIterator<K,V>
extends Object
implements Iterator<Map.Entry<K,V>>

An iterator over the mappings of a KVTree.

Since:

3.2.0

Field Summary

Fields

Modifier and Type	Field	Description
private final boolean	isLeftToRight	whether we're iterating from left to right (vs.
private KVTree<K,V>	nextSubtree	node that we need to enter
private final ArrayList<KVTree<K,V>>	stack	nodes that we've recursed into, but not yet returned

Constructor Summary

Constructors

Constructor	Description
EntryIterator(KVTree<K,V> tree, boolean isLeftToRight)

Method Summary

Modifier and Type	Method	Description
private KVTree<K,V>	firstChild(KVTree<K,V> node)
boolean	hasNext()
Map.Entry<K,V>	next()
private KVTree<K,V>	secondChild(KVTree<K,V> node)

Methods inherited from class Object

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

Methods inherited from interface Iterator

forEachRemaining, remove

Field Details

isLeftToRight

private final boolean isLeftToRight

whether we're iterating from left to right (vs. right to left)

nextSubtree

private KVTree<K,V> nextSubtree

node that we need to enter

stack

private final ArrayList<KVTree<K,V>> stack

nodes that we've recursed into, but not yet returned

Constructor Details

EntryIterator

EntryIterator(KVTree<K,V> tree,
 boolean isLeftToRight)

Method Details

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator<K>

next

public Map.Entry<K,V> next()

Specified by:

next in interface Iterator<K>

firstChild

private KVTree<K,V> firstChild(KVTree<K,V> node)

secondChild

private KVTree<K,V> secondChild(KVTree<K,V> node)