Package | Description |
---|---|
inet.ipaddr.format.util |
Contains utility classes such as collections, spliterators, and String-writers.
|
inet.ipaddr.ipv4 |
Classes for IPv4
|
inet.ipaddr.ipv6 |
Classes for IPv6
|
inet.ipaddr.mac |
Classes for MAC addresses.
|
Modifier and Type | Class and Description |
---|---|
static class |
AssociativeAddressTrie.AssociativeTrieNode<K extends Address,V> |
Modifier and Type | Method and Description |
---|---|
AddressTrie.TrieNode<E> |
AddressTrieOps.AddressTrieAddOps.addNode(E addr)
Adds the given single address or prefix block subnet to the trie, if not already there.
|
AddressTrie.TrieNode<E> |
AddressTrie.addNode(E addr) |
AddressTrie.TrieNode<? extends IPAddress> |
BaseDualIPv4v6Tries.addNode(IPAddress addr) |
AddressTrie.TrieNode<? extends IPAddress> |
BaseDualIPv4v6Tries.addTrie(AddressTrie.TrieNode<? extends IPAddress> trie) |
AddressTrie.TrieNode<E> |
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.TrieNode<E> |
AddressTrie.addTrie(AddressTrie.TrieNode<E> trie) |
AddressTrie.TrieNode<E> |
AddressTrieOps.ceilingAddedNode(E addr)
Returns the added node whose address is the lowest address greater than or equal to the given address.
|
AddressTrie.TrieNode<E> |
AddressTrie.ceilingAddedNode(E addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.ceilingAddedNode(E addr) |
AddressTrie.TrieNode<? extends IPAddress> |
BaseDualIPv4v6Tries.ceilingAddedNode(IPAddress addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.clone() |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.cloneTree() |
AddressTrie.TrieNode<E> |
AddressTrieOps.elementsContainedBy(E addr)
Checks if a part of this trie is contained by the given prefix block subnet or individual address.
|
AddressTrie.TrieNode<E> |
AddressTrie.elementsContainedBy(E addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.elementsContainedBy(E addr) |
AddressTrie.TrieNode<? extends IPAddress> |
BaseDualIPv4v6Tries.elementsContainedBy(IPAddress addr) |
AddressTrie.TrieNode<E> |
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.TrieNode<E> |
AddressTrie.elementsContaining(E addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.elementsContaining(E addr) |
AddressTrie.TrieNode<? extends IPAddress> |
BaseDualIPv4v6Tries.elementsContaining(IPAddress addr) |
AddressTrie.TrieNode<E> |
AddressTrieOps.firstAddedNode()
Returns the added node with the first (lowest valued) key,
or null if there are no added entries in this trie or subtrie
|
AddressTrie.TrieNode<E> |
AddressTrie.firstAddedNode() |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.firstAddedNode() |
AddressTrie.TrieNode<E> |
AddressTrieOps.firstNode()
Returns the node with the first (lowest valued) key, whether the node is added or not
|
AddressTrie.TrieNode<E> |
AddressTrie.firstNode() |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.firstNode() |
AddressTrie.TrieNode<E> |
AddressTrieOps.floorAddedNode(E addr)
Returns the added node whose address is the highest address less than or equal to the given address.
|
AddressTrie.TrieNode<E> |
AddressTrie.floorAddedNode(E addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.floorAddedNode(E addr) |
AddressTrie.TrieNode<? extends IPAddress> |
BaseDualIPv4v6Tries.floorAddedNode(IPAddress addr) |
default AddressTrie.TrieNode<E> |
AddressTrieOps.getAddedNode(E addr)
Gets trie nodes representing added elements.
|
AddressTrie.TrieNode<? extends IPAddress> |
BaseDualIPv4v6Tries.getAddedNode(IPAddress addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.getLowerSubNode()
Returns the sub node whose address is smallest in value
|
AddressTrie.TrieNode<E> |
AddressTrieOps.getNode(E addr)
Gets the node corresponding to the given address, returns null if not such element exists.
|
AddressTrie.TrieNode<E> |
AddressTrie.getNode(E addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.getNode(E addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.getParent()
Returns the node for the subnet block containing this node.
|
AddressTrie.TrieNode<E> |
AddressTrie.getRoot() |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.getUpperSubNode()
Returns the sub-node whose address is largest in value
|
AddressTrie.TrieNode<E> |
AddressTrieOps.higherAddedNode(E addr)
Returns the added node whose address is the lowest address strictly greater than the given address.
|
AddressTrie.TrieNode<E> |
AddressTrie.higherAddedNode(E addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.higherAddedNode(E addr) |
AddressTrie.TrieNode<? extends IPAddress> |
BaseDualIPv4v6Tries.higherAddedNode(IPAddress addr) |
AddressTrie.TrieNode<E> |
AddressTrieOps.lastAddedNode()
Returns the added node with the last (highest valued) key,
or null if there are no added elements in this trie or subtrie
|
AddressTrie.TrieNode<E> |
AddressTrie.lastAddedNode() |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.lastAddedNode() |
AddressTrie.TrieNode<E> |
AddressTrieOps.lastNode()
Returns the node with the last (highest valued) key, whether the node is added or not
|
AddressTrie.TrieNode<E> |
AddressTrie.lastNode() |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.lastNode() |
AddressTrie.TrieNode<E> |
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.TrieNode<E> |
AddressTrie.longestPrefixMatchNode(E addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.longestPrefixMatchNode(E addr) |
AddressTrie.TrieNode<? extends IPAddress> |
BaseDualIPv4v6Tries.longestPrefixMatchNode(IPAddress addr) |
AddressTrie.TrieNode<E> |
AddressTrieOps.lowerAddedNode(E addr)
Returns the added node whose address is the highest address strictly less than the given address.
|
AddressTrie.TrieNode<E> |
AddressTrie.lowerAddedNode(E addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.lowerAddedNode(E addr) |
AddressTrie.TrieNode<? extends IPAddress> |
BaseDualIPv4v6Tries.lowerAddedNode(IPAddress addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.nextAddedNode() |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.nextNode() |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.previousAddedNode() |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.previousNode() |
AddressTrie.TrieNode<E> |
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.
|
AddressTrie.TrieNode<E> |
AddressTrie.removeElementsContainedBy(E addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.removeElementsContainedBy(E addr) |
AddressTrie.TrieNode<? extends IPAddress> |
BaseDualIPv4v6Tries.removeElementsContainedBy(IPAddress addr) |
AddressTrie.TrieNode<E> |
AddressTrieOps.shortestPrefixMatchNode(E addr)
Finds the containing subnet or address in the trie with the largest subnet size,
which is equivalent to finding the subnet or address with the shortest matching prefix.
|
AddressTrie.TrieNode<E> |
AddressTrie.shortestPrefixMatchNode(E addr) |
AddressTrie.TrieNode<E> |
AddressTrie.TrieNode.shortestPrefixMatchNode(E addr) |
Modifier and Type | Method and Description |
---|---|
Iterator<? extends AddressTrie.TrieNode<E>> |
AddressTrieOps.allNodeIterator(boolean forward) |
Iterator<? extends AddressTrie.TrieNode<E>> |
AddressTrie.allNodeIterator(boolean forward) |
Iterator<? extends AddressTrie.TrieNode<E>> |
AddressTrie.TrieNode.allNodeIterator(boolean forward) |
Spliterator<? extends AddressTrie.TrieNode<E>> |
AddressTrieOps.allNodeSpliterator(boolean forward) |
Spliterator<? extends AddressTrie.TrieNode<E>> |
AddressTrie.allNodeSpliterator(boolean forward) |
Spliterator<? extends AddressTrie.TrieNode<E>> |
AddressTrie.TrieNode.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.
|
abstract Iterator<? extends AddressTrie.TrieNode<? extends IPAddress>> |
BaseDualIPv4v6Tries.blockSizeNodeIterator(boolean lowerSubNodeFirst) |
Iterator<AddressTrie.TrieNode<? extends IPAddress>> |
DualIPv4v6Tries.blockSizeNodeIterator(boolean lowerSubNodeFirst) |
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>> |
AddressTrieOps.containedFirstAllNodeIterator(boolean forwardSubNodeOrder) |
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.containedFirstIterator(boolean forwardSubNodeOrder) |
abstract Iterator<? extends AddressTrie.TrieNode<? extends IPAddress>> |
BaseDualIPv4v6Tries.containedFirstIterator(boolean forwardSubNodeOrder) |
Iterator<AddressTrie.TrieNode<? extends IPAddress>> |
DualIPv4v6Tries.containedFirstIterator(boolean forwardSubNodeOrder) |
Iterator<? extends AddressTrie.TrieNode<E>> |
AddressTrie.containedFirstIterator(boolean forwardSubNodeOrder) |
Iterator<? extends AddressTrie.TrieNode<E>> |
AddressTrie.TrieNode.containedFirstIterator(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.containingFirstAllNodeIterator(boolean forwardSubNodeOrder) |
<C> BinaryTreeNode.CachingIterator<? extends AddressTrie.TrieNode<E>,E,C> |
AddressTrie.TrieNode.containingFirstAllNodeIterator(boolean forwardSubNodeOrder) |
abstract Iterator<? extends AddressTrie.TrieNode<? extends IPAddress>> |
BaseDualIPv4v6Tries.containingFirstIterator(boolean forwardSubNodeOrder) |
Iterator<AddressTrie.TrieNode<? extends IPAddress>> |
DualIPv4v6Tries.containingFirstIterator(boolean forwardSubNodeOrder) |
<C> BinaryTreeNode.CachingIterator<? extends AddressTrie.TrieNode<E>,E,C> |
AddressTrieOps.containingFirstIterator(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) |
Iterator<? extends AddressTrie.TrieNode<E>> |
AddressTrieOps.nodeIterator(boolean forward) |
abstract Iterator<? extends AddressTrie.TrieNode<? extends IPAddress>> |
BaseDualIPv4v6Tries.nodeIterator(boolean forward) |
Iterator<AddressTrie.TrieNode<? extends IPAddress>> |
DualIPv4v6Tries.nodeIterator(boolean forward) |
Iterator<? extends AddressTrie.TrieNode<E>> |
AddressTrie.nodeIterator(boolean forward) |
Iterator<? extends AddressTrie.TrieNode<E>> |
AddressTrie.TrieNode.nodeIterator(boolean forward) |
Spliterator<? extends AddressTrie.TrieNode<E>> |
AddressTrieOps.nodeSpliterator(boolean forward) |
abstract Spliterator<? extends AddressTrie.TrieNode<? extends IPAddress>> |
BaseDualIPv4v6Tries.nodeSpliterator(boolean forward) |
Spliterator<AddressTrie.TrieNode<? extends IPAddress>> |
DualIPv4v6Tries.nodeSpliterator(boolean forward) |
Spliterator<? extends AddressTrie.TrieNode<E>> |
AddressTrie.nodeSpliterator(boolean forward) |
Spliterator<? extends AddressTrie.TrieNode<E>> |
AddressTrie.TrieNode.nodeSpliterator(boolean forward) |
Modifier and Type | Method and Description |
---|---|
AddressTrie.TrieNode<? extends IPAddress> |
BaseDualIPv4v6Tries.addTrie(AddressTrie.TrieNode<? extends IPAddress> trie) |
AssociativeAddressTrie.AssociativeTrieNode<? extends IPAddress,V> |
DualIPv4v6AssociativeTries.addTrie(AddressTrie.TrieNode<? extends IPAddress> trie) |
AddressTrie.TrieNode<E> |
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.TrieNode<E> |
AddressTrie.addTrie(AddressTrie.TrieNode<E> trie) |
Modifier and Type | Class and Description |
---|---|
static class |
IPv4AddressAssociativeTrie.IPv4AssociativeTrieNode<V> |
static class |
IPv4AddressTrie.IPv4TrieNode |
Modifier and Type | Method and Description |
---|---|
IPv4AddressTrie.IPv4TrieNode |
IPv4AddressTrie.addTrie(AddressTrie.TrieNode<IPv4Address> trie) |
IPv4AddressAssociativeTrie.IPv4AssociativeTrieNode<V> |
IPv4AddressAssociativeTrie.addTrie(AddressTrie.TrieNode<IPv4Address> trie) |
Modifier and Type | Class and Description |
---|---|
static class |
IPv6AddressAssociativeTrie.IPv6AssociativeTrieNode<V> |
static class |
IPv6AddressTrie.IPv6TrieNode |
Modifier and Type | Method and Description |
---|---|
IPv6AddressAssociativeTrie.IPv6AssociativeTrieNode<V> |
IPv6AddressAssociativeTrie.addTrie(AddressTrie.TrieNode<IPv6Address> trie) |
IPv6AddressTrie.IPv6TrieNode |
IPv6AddressTrie.addTrie(AddressTrie.TrieNode<IPv6Address> trie) |
Modifier and Type | Class and Description |
---|---|
static class |
MACAddressAssociativeTrie.MACAssociativeTrieNode<V> |
static class |
MACAddressTrie.MACTrieNode |
Modifier and Type | Method and Description |
---|---|
MACAddressAssociativeTrie.MACAssociativeTrieNode<V> |
MACAddressAssociativeTrie.addTrie(AddressTrie.TrieNode<MACAddress> trie) |
MACAddressTrie.MACTrieNode |
MACAddressTrie.addTrie(AddressTrie.TrieNode<MACAddress> trie) |