Class AbstractPatriciaTrie.TrieEntry<K,​V>

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