AbstractPatriciaTrie.TrieEntry (org.apache.directory.api_api-all_sources-and-javadoc 2.1.1 API)

java.lang.Object
- org.apache.commons.collections4.trie.AbstractBitwiseTrie.BasicEntry<K,V>
- - org.apache.commons.collections4.trie.AbstractPatriciaTrie.TrieEntry<K,V>

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.

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)

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`boolean`	`isEmpty()`	Whether or not the entry is storing a key.
`boolean`	`isExternalNode()`	Either the left or right child is a loopback.
`boolean`	`isInternalNode()`	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 Detail
  - 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 Detail
  - TrieEntry
```
public TrieEntry(K key,
                 V value,
                 int bitIndex)
```
- Method Detail
  - isEmpty
```
public boolean isEmpty()
```
    Whether or not the entry is storing a key. Only the root can potentially be empty, all other nodes must have a key.
  - isInternalNode
```
public boolean isInternalNode()
```
    Neither the left nor right child is a loopback.
  - isExternalNode
```
public boolean isExternalNode()
```
    Either the left or right child is a loopback.
  - toString
```
public String toString()
```
    Overrides:
    
    toString in class AbstractBitwiseTrie.BasicEntry<K,V>