Package org.apache.commons.collections4.trie

Class AbstractPatriciaTrie.TrieEntry<K,V>

java.lang.Object

org.apache.commons.collections4.trie.AbstractBitwiseTrie.BasicEntry<K,V>

org.apache.commons.collections4.trie.AbstractPatriciaTrie.TrieEntry<K,V>

Type Parameters:

K - the key type.

V - the value type.

All Implemented Interfaces:

Serializable, Map.Entry<K,V>

Enclosing class:

AbstractPatriciaTrie<K,V>

protected static class AbstractPatriciaTrie.TrieEntry<K,V>
extends AbstractBitwiseTrie.BasicEntry<K,V>

A Trie is a set of AbstractPatriciaTrie.TrieEntry nodes.

See Also:

• Serialized Form

Field Summary

Fields

Modifier and Type	Field	Description
protected int	bitIndex	The index this entry is comparing.
protected AbstractPatriciaTrie.TrieEntry<K,V>	left	The left child of this entry.
protected AbstractPatriciaTrie.TrieEntry<K,V>	parent	The parent of this entry.
protected AbstractPatriciaTrie.TrieEntry<K,V>	predecessor	The entry who uplinks to this entry.
protected AbstractPatriciaTrie.TrieEntry<K,V>	right	The right child of this entry.
private static final long	serialVersionUID

Fields inherited from class org.apache.commons.collections4.trie.AbstractBitwiseTrie.BasicEntry

key, value

Constructor Summary

Constructors

Constructor	Description
TrieEntry(K key, V value, int bitIndex)	Constructs a new instance.

Method Summary

Modifier and Type	Method	Description
boolean	isEmpty()	Tests whether the entry is storing a key.
boolean	isExternalNode()	Tests whether the left or right child is a loopback.
boolean	isInternalNode()	Tests that neither the left nor right child is a loopback.
String	toString()

Methods inherited from class org.apache.commons.collections4.trie.AbstractBitwiseTrie.BasicEntry

equals, getKey, getValue, hashCode, setKeyValue, setValue

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Field Details

serialVersionUID

private static final long serialVersionUID

See Also:

• Constant Field Values

bitIndex

protected int bitIndex

The index this entry is comparing.

parent

protected AbstractPatriciaTrie.TrieEntry<K,V> parent

The parent of this entry.

left

protected AbstractPatriciaTrie.TrieEntry<K,V> left

The left child of this entry.

right

protected AbstractPatriciaTrie.TrieEntry<K,V> right

The right child of this entry.

predecessor

protected AbstractPatriciaTrie.TrieEntry<K,V> predecessor

The entry who uplinks to this entry.

Constructor Details

TrieEntry

public TrieEntry(K key,
 V value,
 int bitIndex)

Constructs a new instance.

Parameters:

key - The entry's key.

value - The entry's value.

bitIndex - The entry's bitIndex.

Method Details

isEmpty

public boolean isEmpty()

Tests whether the entry is storing a key. Only the root can potentially be empty, all other nodes must have a key.

Returns:

Whether the entry is storing a key

isExternalNode

public boolean isExternalNode()

Tests whether the left or right child is a loopback.

Returns:

Whether the left or right child is a loopback.

isInternalNode

public boolean isInternalNode()

Tests that neither the left nor right child is a loopback.

Returns:

That neither the left nor right child is a loopback.

toString

public String toString()

Overrides:

toString in class AbstractBitwiseTrie.BasicEntry<K,V>