Class AbstractPatriciaTrie.TrieEntry<K,V>
java.lang.Object
org.apache.commons.collections4.trie.AbstractPatriciaTrie.TrieEntry<K,V>
- All Implemented Interfaces:
Serializable,Map.Entry<K,V>
- Enclosing class:
- AbstractPatriciaTrie<K,
V>
A
Trie is a set of AbstractPatriciaTrie.TrieEntry nodes.- See Also:
-
Field Summary
FieldsModifier and TypeFieldDescriptionprotected intThe index this entry is comparing.protected Kprotected AbstractPatriciaTrie.TrieEntry<K,V> The left child of this entry.protected AbstractPatriciaTrie.TrieEntry<K,V> The parent of this entry.protected AbstractPatriciaTrie.TrieEntry<K,V> The entry who uplinks to this entry.protected AbstractPatriciaTrie.TrieEntry<K,V> The right child of this entry.protected V -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionbooleangetKey()getValue()inthashCode()booleanisEmpty()Whether or not the entry is storing a key.booleanEither the left or right child is a loopback.booleanNeither the left nor right child is a loopback.setKeyValue(K key, V value) Replaces the current key and value with the provided key & value.toString()
-
Field Details
-
bitIndex
The index this entry is comparing. -
parent
The parent of this entry. -
left
The left child of this entry. -
right
The right child of this entry. -
predecessor
The entry who uplinks to this entry. -
key
-
value
-
-
Constructor Details
-
TrieEntry
-
-
Method Details
-
isEmpty
Whether or not the entry is storing a key. Only the root can potentially be empty, all other nodes must have a key. -
isExternalNode
Either the left or right child is a loopback. -
isInternalNode
Neither the left nor right child is a loopback. -
toString
-
equals
-
getKey
-
getValue
-
hashCode
public int hashCode() -
setKeyValue
Replaces the current key and value with the provided key & value. -
setValue
-