inet.ipaddr.format.util

Class AssociativeAddedTree.AssociativeAddedTreeNode<E extends Address,V>

java.lang.Object

inet.ipaddr.format.util.AssociativeAddedTree.AssociativeAddedTreeNode<E,V>

Enclosing class:

AssociativeAddedTree<E extends Address,V>

public static class AssociativeAddedTree.AssociativeAddedTreeNode<E extends Address,V>
extends Object

AssociativeAddedTreeNode represents a node in an AssociativeAddedTree.

Constructor Summary

Constructors

Constructor and Description
AssociativeAddedTreeNode(AssociativeAddressTrie.AssociativeTrieNode<E,inet.ipaddr.format.util.AssociativeAddressTrie.SubNodesMappingAssociative<E,V>> node)

Method Summary

Modifier and Type	Method and Description
E	getKey() getKey returns the key of this node, which is the same as the key of the corresponding node in the originating trie.
AssociativeAddedTree.AssociativeAddedTreeNode<E,V>[]	getSubNodes() Returns the sub-nodes of this node, which are not the same as the 0, 1 or 2 direct sub-nodes of the originating binary trie.
boolean	isAdded() Returns whether the node was an added node in the original trie.
String	toString() Returns a visual representation of this node including the key.
String	toTreeString() toTreeString returns a visual representation of the sub-tree originating from this node, with one node per line.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

AssociativeAddedTreeNode

public AssociativeAddedTreeNode(AssociativeAddressTrie.AssociativeTrieNode<E,inet.ipaddr.format.util.AssociativeAddressTrie.SubNodesMappingAssociative<E,V>> node)

Method Detail

getSubNodes

public AssociativeAddedTree.AssociativeAddedTreeNode<E,V>[] getSubNodes()

Returns the sub-nodes of this node, which are not the same as the 0, 1 or 2 direct sub-nodes of the originating binary trie. Instead, these are all the direct or indirect added sub-nodes of the node in the originating trie. If you can traverse from this node to another node in the originating trie, using a sequence of sub-nodes, without any intervening sub-node being an added node, then that other node will appear as a sub-node here. If there are no sub-nodes, then this method returns null.

getKey

public E getKey()

getKey returns the key of this node, which is the same as the key of the corresponding node in the originating trie.

Returns:

isAdded

public boolean isAdded()

Returns whether the node was an added node in the original trie. This returns true for all nodes except possibly the root, since only added nodes are added to this tree, apart from the root.

toString

public String toString()

Returns a visual representation of this node including the key. If this is the root, it will have an open circle if the root is not an added node. Otherwise, the node will have a closed circle.

Overrides:

toString in class Object

toTreeString

public String toTreeString()

toTreeString returns a visual representation of the sub-tree originating from this node, with one node per line.

Returns: