private class PatriciaTrie.PrefixEntryIterator extends PatriciaTrie.NodeIterator<Map.Entry<K,V>>
Modifier and Type | Field and Description |
---|---|
protected boolean |
lastOne |
protected int |
length |
protected int |
offset |
protected K |
prefix |
protected PatriciaTrie.TrieEntry<K,V> |
subtree |
current, expectedModCount, next
Constructor and Description |
---|
PrefixEntryIterator(PatriciaTrie.TrieEntry<K,V> startScan,
K prefix,
int offset,
int length) |
Modifier and Type | Method and Description |
---|---|
protected PatriciaTrie.TrieEntry<K,V> |
findNext(PatriciaTrie.TrieEntry<K,V> prior) |
Map.Entry<K,V> |
next() |
void |
remove() |
hasNext, nextEntry
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
forEachRemaining
protected final int offset
protected final int length
protected boolean lastOne
protected PatriciaTrie.TrieEntry<K,V> subtree
PrefixEntryIterator(PatriciaTrie.TrieEntry<K,V> startScan, K prefix, int offset, int length)
protected PatriciaTrie.TrieEntry<K,V> findNext(PatriciaTrie.TrieEntry<K,V> prior)
findNext
in class PatriciaTrie.NodeIterator<Map.Entry<K,V>>