edu.wisc.ssec.mcidasv.util.trie
Class PatriciaTrie.SubMapEntryIterator

java.lang.Object
  edu.wisc.ssec.mcidasv.util.trie.PatriciaTrie.NodeIterator<Map.Entry<K,V>>
      edu.wisc.ssec.mcidasv.util.trie.PatriciaTrie.SubMapEntryIterator

All Implemented Interfaces:

Iterator<Map.Entry<K,V>>

Enclosing class:

PatriciaTrie<K,V>

private class PatriciaTrie.SubMapEntryIterator
extends PatriciaTrie.NodeIterator<Map.Entry<K,V>>

An iterator for submaps.

Field Summary

private K

firstExcludedKey

Fields inherited from class edu.wisc.ssec.mcidasv.util.trie.PatriciaTrie.NodeIterator

current, expectedModCount, next

Constructor Summary

PatriciaTrie.SubMapEntryIterator(PatriciaTrie.TrieEntry<K,V> first, PatriciaTrie.TrieEntry<K,V> firstExcluded)

Method Summary

boolean	hasNext()
Map.Entry<K,V>	next()

Methods inherited from class edu.wisc.ssec.mcidasv.util.trie.PatriciaTrie.NodeIterator

findNext, nextEntry, remove

Methods inherited from class java.lang.Object

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

Field Detail

firstExcludedKey

private final K firstExcludedKey

Constructor Detail

PatriciaTrie.SubMapEntryIterator

PatriciaTrie.SubMapEntryIterator(PatriciaTrie.TrieEntry<K,V> first,
                                 PatriciaTrie.TrieEntry<K,V> firstExcluded)

Method Detail

hasNext

public boolean hasNext()

Specified by:

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

Overrides:

hasNext in class PatriciaTrie.NodeIterator<Map.Entry<K,V>>

next

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