| Methods in edu.wisc.ssec.mcidasv.util.trie with parameters of type Trie.Cursor |
Map.Entry<K,V> |
Trie.select(K key,
Trie.Cursor<? super K,? super V> cursor)
Iterates through the Trie, starting with the entry whose bitwise
value is closest in an XOR metric to the given key. |
Map.Entry<K,V> |
PatriciaTrie.select(K key,
Trie.Cursor<? super K,? super V> cursor)
|
private boolean |
PatriciaTrie.selectR(PatriciaTrie.TrieEntry<K,V> h,
int bitIndex,
K key,
int keyLength,
Trie.Cursor<? super K,? super V> cursor,
PatriciaTrie.TrieEntry[] result)
|
Map.Entry<K,V> |
Trie.traverse(Trie.Cursor<? super K,? super V> cursor)
Traverses the Trie in lexicographical order. |
Map.Entry<K,V> |
PatriciaTrie.traverse(Trie.Cursor<? super K,? super V> cursor)
|