public abstract class AbstractBitwiseTrie<K,V> extends AbstractMap<K ,V> implements Trie <K ,V>, Serializable
Trie functionality and utility methods for actual bitwise
Trie implementations.
AbstractMap.SimpleEntry <K,V>, AbstractMap.SimpleImmutableEntry <K,V> | Modifier | Constructor and Description |
|---|---|
protected |
AbstractBitwiseTrie(KeyAnalyzer
Constructs a new
Trie using the given
KeyAnalyzer.
|
| Modifier and Type | Method and Description |
|---|---|
protected KeyAnalyzer |
getKeyAnalyzer()
Returns the
KeyAnalyzer that constructed the
Trie.
|
String |
toString()
|
clear, clone, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, valuesfinalize, getClass, notify, notifyAll, wait, wait, waitcomparator, entrySet, firstKey, headMap, keySet, lastKey, subMap, tailMap, valuesfirstKey, lastKey, mapIterator, nextKey, previousKeyclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, sizecontainsKey, containsValue, entrySet, get, isEmpty, keySet, remove, size, valuesprotected AbstractBitwiseTrie(KeyAnalyzer<? super K> keyAnalyzer)
Trie using the given
KeyAnalyzer.
keyAnalyzer - the
KeyAnalyzer to use
protected KeyAnalyzer<? super K> getKeyAnalyzer()
KeyAnalyzer that constructed the
Trie.
KeyAnalyzer used by this
Trie
public StringtoString()