Get<K,V>
, IterableGet<K,V>
, IterableMap<K,V>
, IterableSortedMap<K,V>
, java.util.Map<K,V>
, OrderedMap<K,V>
, Put<K,V>
, java.util.SortedMap<K,V>
AbstractBitwiseTrie
, PatriciaTrie
, UnmodifiableTrie
public interface Trie<K,V> extends IterableSortedMap<K,V>
Modifier and Type | Method | Description |
---|---|---|
java.util.SortedMap<K,V> |
prefixMap(K key) |
Returns a view of this
Trie of all elements that are prefixed
by the given key. |
containsKey, containsValue, entrySet, get, isEmpty, keySet, remove, size, values
clear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entry, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, of, of, of, of, of, of, of, of, of, of, of, ofEntries, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size
firstKey, lastKey, mapIterator, nextKey, previousKey
java.util.SortedMap<K,V> prefixMap(K key)
Trie
of all elements that are prefixed
by the given key.
In a Trie
with fixed size keys, this is essentially a
Map.get(Object)
operation.
For example, if the Trie
contains 'Anna', 'Anael',
'Analu', 'Andreas', 'Andrea', 'Andres', and 'Anatole', then
a lookup of 'And' would return 'Andreas', 'Andrea', and 'Andres'.
key
- the key used in the searchSortedMap
view of this Trie
with all elements whose
key is prefixed by the search keyCopyright © 2001-2019 - Apache Software Foundation