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>
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>
See Also:
  • Field Details

  • Constructor Details

    • TrieEntry

      public TrieEntry(K key, V value, int bitIndex)
  • Method Details

    • 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>