Uses of Class
inet.ipaddr.format.util.AddressTrie.TrieNode
Packages that use AddressTrie.TrieNode
Package
Description
Contains utility classes such as collections, spliterators, and String-writers.
Classes for IPv4
Classes for IPv6
Classes for MAC addresses.
-
Uses of AddressTrie.TrieNode in inet.ipaddr.format.util
Subclasses of AddressTrie.TrieNode in inet.ipaddr.format.utilModifier and TypeClassDescriptionstatic class
AssociativeAddressTrie.AssociativeTrieNode<K extends Address,
V> Methods in inet.ipaddr.format.util that return AddressTrie.TrieNodeModifier and TypeMethodDescriptionAdds the given single address or prefix block subnet to the trie, if not already there.AddressTrie.addTrie
(AddressTrie.TrieNode<E> trie) AddressTrieOps.AddressTrieAddOps.addTrie
(AddressTrie.TrieNode<E> trie) Adds nodes matching the given sub-root node and all of its sub-nodes to the trie, if not already there.AddressTrie.ceilingAddedNode
(E addr) AddressTrie.TrieNode.ceilingAddedNode
(E addr) AddressTrieOps.ceilingAddedNode
(E addr) Returns the added node whose address is the lowest address greater than or equal to the given address.AddressTrie.TrieNode.clone()
AddressTrie.TrieNode.cloneTree()
AddressTrie.elementsContainedBy
(E addr) AddressTrie.TrieNode.elementsContainedBy
(E addr) AddressTrieOps.elementsContainedBy
(E addr) Checks if a part of this trie is contained by the given prefix block subnet or individual address.AddressTrie.elementsContaining
(E addr) AddressTrie.TrieNode.elementsContaining
(E addr) AddressTrieOps.elementsContaining
(E addr) Finds the added subnets and/or addresses in the trie that contain the given individual address or prefix block subnet.AddressTrie.firstAddedNode()
AddressTrie.TrieNode.firstAddedNode()
AddressTrieOps.firstAddedNode()
Returns the added node with the first (lowest valued) key, or null if there are no added entries in this trie or subtrieAddressTrie.firstNode()
AddressTrie.TrieNode.firstNode()
AddressTrieOps.firstNode()
Returns the node with the first (lowest valued) key, whether the node is added or notAddressTrie.floorAddedNode
(E addr) AddressTrie.TrieNode.floorAddedNode
(E addr) AddressTrieOps.floorAddedNode
(E addr) Returns the added node whose address is the highest address less than or equal to the given address.default AddressTrie.TrieNode
<E> AddressTrieOps.getAddedNode
(E addr) Gets trie nodes representing added elements.AddressTrie.TrieNode.getLowerSubNode()
Returns the sub node whose address is smallest in valueGets the node corresponding to the given address, returns null if not such element exists.AddressTrie.TrieNode.getParent()
Returns the node for the subnet block containing this node.AddressTrie.getRoot()
AddressTrie.TrieNode.getUpperSubNode()
Returns the sub-node whose address is largest in valueAddressTrie.higherAddedNode
(E addr) AddressTrie.TrieNode.higherAddedNode
(E addr) AddressTrieOps.higherAddedNode
(E addr) Returns the added node whose address is the lowest address strictly greater than the given address.AddressTrie.lastAddedNode()
AddressTrie.TrieNode.lastAddedNode()
AddressTrieOps.lastAddedNode()
Returns the added node with the last (highest valued) key, or null if there are no added elements in this trie or subtrieAddressTrie.lastNode()
AddressTrie.TrieNode.lastNode()
AddressTrieOps.lastNode()
Returns the node with the last (highest valued) key, whether the node is added or notAddressTrie.longestPrefixMatchNode
(E addr) AddressTrie.TrieNode.longestPrefixMatchNode
(E addr) AddressTrieOps.longestPrefixMatchNode
(E addr) Finds the containing subnet or address in the trie with the smallest subnet size, which is equivalent to finding the subnet or address with the longest matching prefix.AddressTrie.lowerAddedNode
(E addr) AddressTrie.TrieNode.lowerAddedNode
(E addr) AddressTrieOps.lowerAddedNode
(E addr) Returns the added node whose address is the highest address strictly less than the given address.AddressTrie.TrieNode.nextAddedNode()
AddressTrie.TrieNode.nextNode()
AddressTrie.TrieNode.previousAddedNode()
AddressTrie.TrieNode.previousNode()
AddressTrie.removeElementsContainedBy
(E addr) AddressTrie.TrieNode.removeElementsContainedBy
(E addr) AddressTrieOps.removeElementsContainedBy
(E addr) Removes any single address or prefix block subnet from the trie that is contained in the given individual address or prefix block subnet.Methods in inet.ipaddr.format.util that return types with arguments of type AddressTrie.TrieNodeModifier and TypeMethodDescriptionIterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.allNodeIterator
(boolean forward) Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.TrieNode.allNodeIterator
(boolean forward) Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrieOps.allNodeIterator
(boolean forward) Spliterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.allNodeSpliterator
(boolean forward) Spliterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.TrieNode.allNodeSpliterator
(boolean forward) Spliterator
<? extends AddressTrie.TrieNode<E>> AddressTrieOps.allNodeSpliterator
(boolean forward) Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.blockSizeAllNodeIterator
(boolean lowerSubNodeFirst) Iterates all nodes in the trie, ordered by keys from largest prefix blocks to smallest, and then to individual addresses.Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.TrieNode.blockSizeAllNodeIterator
(boolean lowerSubNodeFirst) Iterates all the nodes, ordered by keys from largest prefix blocks to smallest and then to individual addresses, in the sub-trie with this node as the root.<C> BinaryTreeNode.CachingIterator
<? extends AddressTrie.TrieNode<E>, E, C> AddressTrie.blockSizeCachingAllNodeIterator()
Iterates all nodes, ordered by keys from largest prefix blocks to smallest, and then to individual addresses.<C> BinaryTreeNode.CachingIterator
<? extends AddressTrie.TrieNode<E>, E, C> AddressTrie.TrieNode.blockSizeCachingAllNodeIterator()
Iterates all nodes, ordered by keys from largest prefix blocks to smallest and then to individual addresses, in the sub-trie with this node as the root.Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.blockSizeNodeIterator
(boolean lowerSubNodeFirst) Iterates the added nodes in the trie, ordered by keys from largest prefix blocks to smallest, and then to individual addresses.Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.TrieNode.blockSizeNodeIterator
(boolean lowerSubNodeFirst) Iterates the added nodes, ordered by keys from largest prefix blocks to smallest and then to individual addresses, in the sub-trie with this node as the root.Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.containedFirstAllNodeIterator
(boolean forwardSubNodeOrder) Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.TrieNode.containedFirstAllNodeIterator
(boolean forwardSubNodeOrder) Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrieOps.containedFirstAllNodeIterator
(boolean forwardSubNodeOrder) Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.containedFirstIterator
(boolean forwardSubNodeOrder) Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.TrieNode.containedFirstIterator
(boolean forwardSubNodeOrder) Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrieOps.containedFirstIterator
(boolean forwardSubNodeOrder) <C> BinaryTreeNode.CachingIterator
<? extends AddressTrie.TrieNode<E>, E, C> AddressTrie.containingFirstAllNodeIterator
(boolean forwardSubNodeOrder) <C> BinaryTreeNode.CachingIterator
<? extends AddressTrie.TrieNode<E>, E, C> AddressTrie.TrieNode.containingFirstAllNodeIterator
(boolean forwardSubNodeOrder) <C> BinaryTreeNode.CachingIterator
<? extends AddressTrie.TrieNode<E>, E, C> AddressTrieOps.containingFirstAllNodeIterator
(boolean forwardSubNodeOrder) <C> BinaryTreeNode.CachingIterator
<? extends AddressTrie.TrieNode<E>, E, C> AddressTrie.containingFirstIterator
(boolean forwardSubNodeOrder) <C> BinaryTreeNode.CachingIterator
<? extends AddressTrie.TrieNode<E>, E, C> AddressTrie.TrieNode.containingFirstIterator
(boolean forwardSubNodeOrder) <C> BinaryTreeNode.CachingIterator
<? extends AddressTrie.TrieNode<E>, E, C> AddressTrieOps.containingFirstIterator
(boolean forwardSubNodeOrder) Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.nodeIterator
(boolean forward) Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.TrieNode.nodeIterator
(boolean forward) Iterator
<? extends AddressTrie.TrieNode<E>> AddressTrieOps.nodeIterator
(boolean forward) Spliterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.nodeSpliterator
(boolean forward) Spliterator
<? extends AddressTrie.TrieNode<E>> AddressTrie.TrieNode.nodeSpliterator
(boolean forward) Spliterator
<? extends AddressTrie.TrieNode<E>> AddressTrieOps.nodeSpliterator
(boolean forward) Methods in inet.ipaddr.format.util with parameters of type AddressTrie.TrieNodeModifier and TypeMethodDescriptionAddressTrie.addTrie
(AddressTrie.TrieNode<E> trie) AddressTrieOps.AddressTrieAddOps.addTrie
(AddressTrie.TrieNode<E> trie) Adds nodes matching the given sub-root node and all of its sub-nodes to the trie, if not already there. -
Uses of AddressTrie.TrieNode in inet.ipaddr.ipv4
Subclasses of AddressTrie.TrieNode in inet.ipaddr.ipv4Modifier and TypeClassDescriptionstatic class
static class
Methods in inet.ipaddr.ipv4 with parameters of type AddressTrie.TrieNodeModifier and TypeMethodDescriptionIPv4AddressAssociativeTrie.addTrie
(AddressTrie.TrieNode<IPv4Address> trie) IPv4AddressTrie.addTrie
(AddressTrie.TrieNode<IPv4Address> trie) -
Uses of AddressTrie.TrieNode in inet.ipaddr.ipv6
Subclasses of AddressTrie.TrieNode in inet.ipaddr.ipv6Modifier and TypeClassDescriptionstatic class
static class
Methods in inet.ipaddr.ipv6 with parameters of type AddressTrie.TrieNodeModifier and TypeMethodDescriptionIPv6AddressAssociativeTrie.addTrie
(AddressTrie.TrieNode<IPv6Address> trie) IPv6AddressTrie.addTrie
(AddressTrie.TrieNode<IPv6Address> trie) -
Uses of AddressTrie.TrieNode in inet.ipaddr.mac
Subclasses of AddressTrie.TrieNode in inet.ipaddr.macModifier and TypeClassDescriptionstatic class
static class
Methods in inet.ipaddr.mac with parameters of type AddressTrie.TrieNodeModifier and TypeMethodDescriptionMACAddressAssociativeTrie.addTrie
(AddressTrie.TrieNode<MACAddress> trie) MACAddressTrie.addTrie
(AddressTrie.TrieNode<MACAddress> trie)