Uses of Class
inet.ipaddr.format.util.BinaryTreeNode
-
Packages that use BinaryTreeNode Package Description inet.ipaddr.format.util Contains utility classes such as collections, spliterators, and String-writers.inet.ipaddr.ipv4 Classes for IPv4inet.ipaddr.ipv6 Classes for IPv6inet.ipaddr.mac Classes for MAC addresses. -
-
Uses of BinaryTreeNode in inet.ipaddr.format.util
Classes in inet.ipaddr.format.util with type parameters of type BinaryTreeNode Modifier and Type Interface Description static interface
BinaryTreeNode.CachingIterator<N extends BinaryTreeNode<E>,E,C>
Subclasses of BinaryTreeNode in inet.ipaddr.format.util Modifier and Type Class Description static class
AddressTrie.TrieNode<E extends Address>
A node for a compact binary prefix trie whose elements are prefix block subnets or addresses,static class
AssociativeAddressTrie.AssociativeTrieNode<K extends Address,V>
Methods in inet.ipaddr.format.util that return BinaryTreeNode Modifier and Type Method Description BinaryTreeNode<E>
BinaryTreeNode. clone()
Clones the node.BinaryTreeNode<E>
BinaryTreeNode. cloneTree()
Clones the sub-tree starting with this node as root.BinaryTreeNode<E>
BinaryTreeNode. firstAddedNode()
Returns the first (lowest valued) added node in the sub-tree originating from this node, or null if there are no added entries in this tree or sub-treeBinaryTreeNode<E>
BinaryTreeNode. firstNode()
Returns the first (lowest valued) node in the sub-tree originating from this node.BinaryTreeNode<E>
BinaryTreeNode. getLowerSubNode()
Gets the direct child node whose key is smallest in valueBinaryTreeNode<E>
BinaryTreeNode. getParent()
Gets the node from which this node is a direct child node, or null if this is the root.BinaryTreeNode<E>
BinaryTreeNode. getUpperSubNode()
Gets the direct child node whose key is largest in valueBinaryTreeNode<E>
BinaryTreeNode. lastAddedNode()
Returns the last (highest valued) added node in the sub-tree originating from this node, or null if there are no added entries in this tree or sub-treeBinaryTreeNode<E>
BinaryTreeNode. lastNode()
Returns the last (highest valued) node in the sub-tree originating from this node.BinaryTreeNode<E>
BinaryTreeNode. nextAddedNode()
Returns the next node in the tree that is an added node, following the tree order, or null if there is no such node.BinaryTreeNode<E>
BinaryTreeNode. nextNode()
Returns the node that follows this node following the tree orderBinaryTreeNode<E>
BinaryTreeNode. previousAddedNode()
Returns the previous node in the tree that is an added node, following the tree order in reverse, or null if there is no such node.BinaryTreeNode<E>
BinaryTreeNode. previousNode()
Returns the node that precedes this node following the tree order.Methods in inet.ipaddr.format.util that return types with arguments of type BinaryTreeNode Modifier and Type Method Description java.util.Iterator<? extends BinaryTreeNode<E>>
BinaryTreeNode. allNodeIterator(boolean forward)
Iterates through all the nodes of the sub-tree with this node as the root, in forward or reverse tree order.java.util.Iterator<? extends BinaryTreeNode<E>>
TreeOps. allNodeIterator(boolean forward)
Iterates through the nodes (not just the added nodes) in forward or reverse tree order.default java.util.Spliterator<? extends BinaryTreeNode<E>>
TreeOps. allNodeSpliterator(boolean forward)
Creates aSpliterator
over the nodes in forward or reverse natural tree order.java.util.Iterator<? extends BinaryTreeNode<E>>
BinaryTreeNode. containedFirstAllNodeIterator(boolean forwardSubNodeOrder)
java.util.Iterator<? extends BinaryTreeNode<E>>
TreeOps. containedFirstAllNodeIterator(boolean forwardSubNodeOrder)
Returns an iterator that does a post-order binary tree traversal.java.util.Iterator<? extends BinaryTreeNode<E>>
BinaryTreeNode. containedFirstIterator(boolean forwardSubNodeOrder)
java.util.Iterator<? extends BinaryTreeNode<E>>
TreeOps. containedFirstIterator(boolean forwardSubNodeOrder)
Returns an iterator that does a post-order binary tree traversal of the added nodes.<C> BinaryTreeNode.CachingIterator<? extends BinaryTreeNode<E>,E,C>
BinaryTreeNode. containingFirstAllNodeIterator(boolean forwardSubNodeOrder)
<C> BinaryTreeNode.CachingIterator<? extends BinaryTreeNode<E>,E,C>
TreeOps. containingFirstAllNodeIterator(boolean forwardSubNodeOrder)
Returns an iterator that does a pre-order binary tree traversal.<C> BinaryTreeNode.CachingIterator<? extends BinaryTreeNode<E>,E,C>
BinaryTreeNode. containingFirstIterator(boolean forwardSubNodeOrder)
<C> BinaryTreeNode.CachingIterator<? extends BinaryTreeNode<E>,E,C>
TreeOps. containingFirstIterator(boolean forwardSubNodeOrder)
Returns an iterator that does a pre-order binary tree traversal of the added nodes.java.util.Iterator<? extends BinaryTreeNode<E>>
BinaryTreeNode. nodeIterator(boolean forward)
Iterates through the added nodes of the sub-tree with this node as the root, in forward or reverse tree order.java.util.Iterator<? extends BinaryTreeNode<E>>
TreeOps. nodeIterator(boolean forward)
Iterates through the added nodes in forward or reverse natural tree order.default java.util.Spliterator<? extends BinaryTreeNode<E>>
TreeOps. nodeSpliterator(boolean forward)
Creates aSpliterator
over the added nodes in forward or reverse natural tree order.Methods in inet.ipaddr.format.util with parameters of type BinaryTreeNode Modifier and Type Method Description int
AddressTrie.TrieComparator. compare(BinaryTreeNode<E> tree1, BinaryTreeNode<E> tree2)
boolean
BinaryTreeNode. treeEquals(BinaryTreeNode<?> other)
Returns whether the sub-tree represented by this node as the root node matches the given sub-tree -
Uses of BinaryTreeNode in inet.ipaddr.ipv4
Subclasses of BinaryTreeNode in inet.ipaddr.ipv4 Modifier and Type Class Description static class
IPv4AddressAssociativeTrie.IPv4AssociativeTrieNode<V>
static class
IPv4AddressTrie.IPv4TrieNode
-
Uses of BinaryTreeNode in inet.ipaddr.ipv6
Subclasses of BinaryTreeNode in inet.ipaddr.ipv6 Modifier and Type Class Description static class
IPv6AddressAssociativeTrie.IPv6AssociativeTrieNode<V>
static class
IPv6AddressTrie.IPv6TrieNode
-
Uses of BinaryTreeNode in inet.ipaddr.mac
Subclasses of BinaryTreeNode in inet.ipaddr.mac Modifier and Type Class Description static class
MACAddressAssociativeTrie.MACAssociativeTrieNode<V>
static class
MACAddressTrie.MACTrieNode
-