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>
PatriciaTrie
public abstract class AbstractBitwiseTrie<K,V> extends java.util.AbstractMap<K,V> implements Trie<K,V>, java.io.Serializable
Trie
functionality and
utility methods for actual bitwise Trie
implementations.Modifier | Constructor | Description |
---|---|---|
protected |
AbstractBitwiseTrie(KeyAnalyzer<? super K> keyAnalyzer) |
Constructs a new
Trie using the given KeyAnalyzer . |
Modifier and Type | Method | Description |
---|---|---|
protected KeyAnalyzer<? super K> |
getKeyAnalyzer() |
Returns the
KeyAnalyzer that constructed the Trie . |
java.lang.String |
toString() |
clear, clone, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, put, putAll, remove, size, values
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
finalize, getClass, notify, notifyAll, wait, wait, wait
firstKey, lastKey, mapIterator, nextKey, previousKey
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
Copyright © 2001-2019 - Apache Software Foundation