Class AbstractPatriciaTrie.PrefixRangeEntrySet.EntryIterator

java.lang.Object

AbstractPatriciaTrie<K,V>.org.apache.commons.collections4.trie.AbstractPatriciaTrie.TrieIterator<Map.Entry<K,V>>

org.apache.commons.collections4.trie.AbstractPatriciaTrie.PrefixRangeEntrySet.EntryIterator

All Implemented Interfaces:

Iterator<Map.Entry<K,V>>

Enclosing class:

AbstractPatriciaTrie.PrefixRangeEntrySet

private final class AbstractPatriciaTrie.PrefixRangeEntrySet.EntryIterator
extends AbstractPatriciaTrie<K,V>.TrieIterator<Map.Entry<K,V>>

An Iterator for iterating over a prefix search.

Since:

4.0

Field Summary

Fields

Modifier and Type	Field	Description
private boolean	lastOne
private final int	lengthInBits
private final int	offset
private final K	prefix
private AbstractPatriciaTrie.TrieEntry<K,V>	subtree

Fields inherited from class AbstractPatriciaTrie.TrieIterator

current, expectedModCount, next

Constructor Summary

Constructors

Constructor	Description
EntryIterator(AbstractPatriciaTrie.TrieEntry<K,V> startScan, K prefix, int offset, int lengthInBits)	Starts iteration at the given entry invalid input: '&' search only within the given subtree.

Method Summary

Modifier and Type	Method	Description
protected AbstractPatriciaTrie.TrieEntry<K,V>	findNext(AbstractPatriciaTrie.TrieEntry<K,V> prior)
Map.Entry<K,V>	next()
void	remove()

Methods inherited from class AbstractPatriciaTrie.TrieIterator

hasNext, nextEntry

Methods inherited from class Object

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

Methods inherited from interface Iterator

forEachRemaining

Field Details

prefix

private final K prefix

offset

private final int offset

lengthInBits

private final int lengthInBits

lastOne

private boolean lastOne

subtree

private AbstractPatriciaTrie.TrieEntry<K,V> subtree

Constructor Details

EntryIterator

EntryIterator(AbstractPatriciaTrie.TrieEntry<K,V> startScan,
 K prefix,
 int offset,
 int lengthInBits)

Starts iteration at the given entry invalid input: '&' search only within the given subtree.

Method Details

next

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

findNext

protected AbstractPatriciaTrie.TrieEntry<K,V> findNext(AbstractPatriciaTrie.TrieEntry<K,V> prior)

Overrides:

findNext in class AbstractPatriciaTrie<K,V>.TrieIterator<Map.Entry<K,V>>

See Also:

• AbstractPatriciaTrie.nextEntry(TrieEntry)

remove

public void remove()

Specified by:

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

Overrides:

remove in class AbstractPatriciaTrie<K,V>.TrieIterator<Map.Entry<K,V>>