private final class AbstractPatriciaTrie.PrefixRangeEntrySet.EntryIterator extends AbstractPatriciaTrie.TrieIterator<java.util.Map.Entry<K,V>>
Iterator
for iterating over a prefix search.Modifier and Type | Field and Description |
---|---|
private boolean |
lastOne |
private int |
lengthInBits |
private int |
offset |
private K |
prefix |
private AbstractPatriciaTrie.TrieEntry<K,V> |
subtree |
current, expectedModCount, next
Constructor and Description |
---|
EntryIterator(AbstractPatriciaTrie.TrieEntry<K,V> startScan,
K prefix,
int offset,
int lengthInBits)
Starts iteration at the given entry & search only
within the given subtree.
|
Modifier and Type | Method and Description |
---|---|
protected AbstractPatriciaTrie.TrieEntry<K,V> |
findNext(AbstractPatriciaTrie.TrieEntry<K,V> prior) |
java.util.Map.Entry<K,V> |
next() |
void |
remove() |
hasNext, nextEntry
private final K prefix
private final int offset
private final int lengthInBits
private boolean lastOne
private AbstractPatriciaTrie.TrieEntry<K,V> subtree
EntryIterator(AbstractPatriciaTrie.TrieEntry<K,V> startScan, K prefix, int offset, int lengthInBits)
protected AbstractPatriciaTrie.TrieEntry<K,V> findNext(AbstractPatriciaTrie.TrieEntry<K,V> prior)
findNext
in class AbstractPatriciaTrie.TrieIterator<java.util.Map.Entry<K,V>>
AbstractPatriciaTrie.nextEntry(TrieEntry)