Interface Trie<K,V> 
- Type Parameters:
- K- the type of the keys in this map
- V- the type of the values in this map
- All Superinterfaces:
- Get<K,,- V> - IterableGet<K,,- V> - IterableMap<K,,- V> - IterableSortedMap<K,,- V> - Map<K,,- V> - OrderedMap<K,,- V> - Put<K,,- V> - SortedMap<K,- V> 
- All Known Implementing Classes:
- AbstractBitwiseTrie,- AbstractPatriciaTrie,- PatriciaTrie,- UnmodifiableTrie
Defines the interface for a prefix tree, an ordered tree data structure. For more information, see Tries.
- Since:
- 4.0
- 
Nested Class Summary
- 
Method SummaryMethods inherited from interface org.apache.commons.collections4.GetcontainsKey, containsValue, entrySet, get, isEmpty, keySet, remove, size, valuesMethods inherited from interface java.util.Mapclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, sizeMethods inherited from interface org.apache.commons.collections4.OrderedMapfirstKey, lastKey, mapIterator, nextKey, previousKey
- 
Method Details- 
prefixMapReturns a view of thisTrieof all elements that are prefixed by the given key.In a Triewith fixed size keys, this is essentially aMap.get(Object)operation.For example, if the Triecontains 'Anna', 'Anael', 'Analu', 'Andreas', 'Andrea', 'Andres', and 'Anatole', then a lookup of 'And' would return 'Andreas', 'Andrea', and 'Andres'.
 
-