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<? super K> keyAnalyzer)
Constructs a new
Trie using the given KeyAnalyzer . |
Modifier and Type | Method and Description |
---|---|
protected KeyAnalyzer<? super K> |
getKeyAnalyzer()
Returns the
KeyAnalyzer that constructed the Trie . |
String |
toString() |
clear, clone, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, values
finalize, getClass, notify, notifyAll, wait, wait, wait
comparator, entrySet, firstKey, headMap, keySet, lastKey, subMap, tailMap, values
firstKey, lastKey, mapIterator, nextKey, previousKey
clear, containsKey, containsValue, equals, get, hashCode, isEmpty, put, putAll, remove, size
containsKey, containsValue, entrySet, get, isEmpty, keySet, remove, size, values
protected AbstractBitwiseTrie(KeyAnalyzer<? super K> keyAnalyzer)
Trie
using the given KeyAnalyzer
.keyAnalyzer
- the KeyAnalyzer
to useprotected KeyAnalyzer<? super K> getKeyAnalyzer()
KeyAnalyzer
that constructed the Trie
.KeyAnalyzer
used by this Trie
public String toString()
toString
in class AbstractMap<K,V>
Copyright © 2001–2013 The Apache Software Foundation. All rights reserved.