Class SmallSortedMap.DescendingEntryIterator

java.lang.Object

com.google.protobuf.SmallSortedMap.DescendingEntryIterator

All Implemented Interfaces:

Iterator<Map.Entry<K,V>>

Enclosing class:

SmallSortedMap<K extends Comparable<K>, V>

private class SmallSortedMap.DescendingEntryIterator
extends Object
implements Iterator<Map.Entry<K,V>>

Reverse Iterator implementation that switches from the entry array to the overflow entries appropriately.

Field Summary

Fields

Modifier and Type	Field	Description
private Iterator<Map.Entry<K,V>>	lazyOverflowIterator
private int	pos

Constructor Summary

Constructors

Modifier	Constructor	Description
private	DescendingEntryIterator()

Method Summary

Modifier and Type	Method	Description
private Iterator<Map.Entry<K,V>>	getOverflowIterator()	It is important to create the overflow iterator only after the array entries have been iterated over because the overflow entry set changes when the client calls remove() on the array entries, which invalidates any existing iterators.
boolean	hasNext()
Map.Entry<K,V>	next()
void	remove()

Methods inherited from class Object

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

Methods inherited from interface Iterator

forEachRemaining

Field Details

pos

private int pos

lazyOverflowIterator

private Iterator<Map.Entry<K extends Comparable<K>, V>> lazyOverflowIterator

Constructor Details

DescendingEntryIterator

private DescendingEntryIterator()

Method Details

hasNext

public boolean hasNext()

Specified by:

hasNext in interface Iterator<Map.Entry<K extends Comparable<K>, V>>

next

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

Specified by:

next in interface Iterator<Map.Entry<K extends Comparable<K>, V>>

remove

public void remove()

Specified by:

remove in interface Iterator<Map.Entry<K extends Comparable<K>, V>>

getOverflowIterator

private Iterator<Map.Entry<K,V>> getOverflowIterator()

It is important to create the overflow iterator only after the array entries have been iterated over because the overflow entry set changes when the client calls remove() on the array entries, which invalidates any existing iterators.