Class AbstractBitwiseTrie<K,V>
- java.lang.Object
-
- java.util.AbstractMap<K,V>
-
- org.apache.commons.collections4.trie.AbstractBitwiseTrie<K,V>
-
- Type Parameters:
K- the type of the keys in this mapV- the type of the values in this map
- All Implemented Interfaces:
java.io.Serializable,java.util.Map<K,V>,java.util.SortedMap<K,V>,Get<K,V>,IterableGet<K,V>,IterableMap<K,V>,IterableSortedMap<K,V>,OrderedMap<K,V>,Put<K,V>,Trie<K,V>
- Direct Known Subclasses:
PatriciaTrie
public abstract class AbstractBitwiseTrie<K,V> extends java.util.AbstractMap<K,V> implements Trie<K,V>, java.io.Serializable
This class provides some basicTriefunctionality and utility methods for actual bitwiseTrieimplementations.- Since:
- 4.0
- See Also:
- Serialized Form
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description java.lang.StringtoString()-
Methods inherited from class java.util.AbstractMap
clear, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, values
-
Methods inherited from interface org.apache.commons.collections4.Get
containsKey, containsValue, entrySet, get, isEmpty, keySet, remove, size, values
-
Methods inherited from interface java.util.Map
clear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size
-
Methods inherited from interface org.apache.commons.collections4.OrderedMap
firstKey, lastKey, mapIterator, nextKey, previousKey
-
-