| Package | Description |
|---|---|
| inet.ipaddr |
Base classes for IP addresses and generic addresses.
|
| inet.ipaddr.format |
Base classes for generic representations of address divisions and groupings of address divisions.
|
| inet.ipaddr.format.large |
Classes for constructing arbitrary divisions of unlimited length and the groupings of those divisions.
|
| inet.ipaddr.format.standard |
Classes for constructing division groupings in which the divisions are under 64 bits of length.
|
| inet.ipaddr.format.string |
Classes for constructing division groupings for producing strings.
|
| inet.ipaddr.format.util |
Contains utility classes such as collections, spliterators, and String-writers.
|
| inet.ipaddr.format.util.sql |
Represents and matches different address string formats with sql.
|
| inet.ipaddr.ipv4 |
Classes for IPv4
|
| inet.ipaddr.ipv6 |
Classes for IPv6
|
| inet.ipaddr.mac |
Classes for MAC addresses.
|
| Class and Description |
|---|
| AddressComponentRangeSpliterator
AddressComponentSpliterator is a
Spliterator for address items. |
| AddressComponentSpliterator
AddressComponentSpliterator is an AddressComponentRangeSpliterator for address components where
the type of the item producing the spliterator matches the type of the item traversed.
|
| IPAddressPartStringCollection |
| Class and Description |
|---|
| AddressComponentRangeSpliterator
AddressComponentSpliterator is a
Spliterator for address items. |
| AddressComponentSpliterator
AddressComponentSpliterator is an AddressComponentRangeSpliterator for address components where
the type of the item producing the spliterator matches the type of the item traversed.
|
| AddressSegmentParams
Each segment params has settings to write exactly one type of IP address part string segment.
|
| Class and Description |
|---|
| AddressSegmentParams
Each segment params has settings to write exactly one type of IP address part string segment.
|
| Class and Description |
|---|
| AddressSegmentParams
Each segment params has settings to write exactly one type of IP address part string segment.
|
| Class and Description |
|---|
| AddressSegmentParams
Each segment params has settings to write exactly one type of IP address part string segment.
|
| Class and Description |
|---|
| AddedTree.AddedTreeNode
AddedTreeNode represents a node in an AddedTree.
|
| AddressComponentRangeSpliterator
AddressComponentSpliterator is a
Spliterator for address items. |
| AddressComponentSpliterator
AddressComponentSpliterator is an AddressComponentRangeSpliterator for address components where
the type of the item producing the spliterator matches the type of the item traversed.
|
| AddressDivisionWriter
An object for writing an address part string in a specific format.
|
| AddressTrie
A compact binary trie (aka compact binary prefix tree, or binary radix trie), for addresses and/or CIDR prefix block subnets.
|
| AddressTrie.TrieNode
A node for a compact binary prefix trie whose elements are prefix block subnets or addresses,
|
| AddressTrieMap
Wraps a
AssociativeAddressTrie to view it as a Java Collections Framework map,
implementing the Map, SortedMap, and NavigableMap interfaces. |
| AddressTrieMap.EntrySet |
| AddressTrieOps
Provides an interface to the trie operations.
|
| AddressTrieOps.AddressTrieAddOps
Provides an interface to the trie add operations.
|
| AddressTrieOps.AssociativeAddressTrieOps
Provides an interface to the associative trie operations.
|
| AddressTrieOps.AssociativeAddressTriePutOps
Provides an interface to the associative trie put operations.
|
| AddressTrieSet
Wraps a
AddressTrie to view it as a Java Collections Framework set,
implementing the Set, SortedSet and NavigableSet interfaces. |
| AddressTrieSet.Range |
| AssociativeAddedTree
AssociativeAddedTree is similar to AddedTree but originates from an AssociativeTrie.
|
| AssociativeAddedTree.AssociativeAddedTreeNode
AssociativeAddedTreeNode represents a node in an AssociativeAddedTree.
|
| AssociativeAddressTrie
An address trie in which each node is associated with a value.
|
| AssociativeAddressTrie.AssociativeTrieNode |
| BaseDualIPv4v6Tries
Contains a pair of IPv4 and IPv6 tries for a data structure that can have fast look-up and containment checks of both IPv4 and IPv6 addresses.
|
| BinaryTreeNode
A binary tree node.
|
| BinaryTreeNode.CachingIterator |
| DualIPv4v6AssociativeTries
Combines an IPv4 with an IPv6 associative trie to map both IPv4 and IPv6 addresses and prefix blocks.
|
| DualIPv4v6Tries
Combines an IPv4 with an IPv6 trie to store both IPv4 and IPv6 addresses and prefix blocks.
|
| IPAddressPartConfiguredString
Pairs a part of an IP address along with an instance of a parameter class to define a specific string.
|
| IPAddressPartStringSubCollection |
| IPAddressStringWriter
An object for writing an IP address part string in a specific format.
|
| Partition
Represents a partition of an element, such as a subnet,
into one or elements of the same type that represent the same set of values.
|
| TreeOps
TreeOps is an interface to the operations supported by both trees and tree nodes: traversals, cloning, and serialization.
|
| Class and Description |
|---|
| IPAddressPartConfiguredString
Pairs a part of an IP address along with an instance of a parameter class to define a specific string.
|
| IPAddressStringWriter
An object for writing an IP address part string in a specific format.
|
| Class and Description |
|---|
| AddedTree
AddedTree is an alternative non-binary tree data structure originating from a binary trie
with the possible exception of the root, which matches the root node of the original.
|
| AddressComponentRangeSpliterator
AddressComponentSpliterator is a
Spliterator for address items. |
| AddressComponentSpliterator
AddressComponentSpliterator is an AddressComponentRangeSpliterator for address components where
the type of the item producing the spliterator matches the type of the item traversed.
|
| AddressTrie
A compact binary trie (aka compact binary prefix tree, or binary radix trie), for addresses and/or CIDR prefix block subnets.
|
| AddressTrie.TrieNode
A node for a compact binary prefix trie whose elements are prefix block subnets or addresses,
|
| AddressTrieOps
Provides an interface to the trie operations.
|
| AddressTrieOps.AddressTrieAddOps
Provides an interface to the trie add operations.
|
| AddressTrieOps.AssociativeAddressTrieOps
Provides an interface to the associative trie operations.
|
| AddressTrieOps.AssociativeAddressTriePutOps
Provides an interface to the associative trie put operations.
|
| AssociativeAddedTree
AssociativeAddedTree is similar to AddedTree but originates from an AssociativeTrie.
|
| AssociativeAddressTrie
An address trie in which each node is associated with a value.
|
| AssociativeAddressTrie.AssociativeTrieNode |
| BinaryTreeNode
A binary tree node.
|
| BinaryTreeNode.CachingIterator |
| IPAddressPartStringCollection |
| TreeOps
TreeOps is an interface to the operations supported by both trees and tree nodes: traversals, cloning, and serialization.
|
| Class and Description |
|---|
| AddedTree
AddedTree is an alternative non-binary tree data structure originating from a binary trie
with the possible exception of the root, which matches the root node of the original.
|
| AddressComponentRangeSpliterator
AddressComponentSpliterator is a
Spliterator for address items. |
| AddressComponentSpliterator
AddressComponentSpliterator is an AddressComponentRangeSpliterator for address components where
the type of the item producing the spliterator matches the type of the item traversed.
|
| AddressTrie
A compact binary trie (aka compact binary prefix tree, or binary radix trie), for addresses and/or CIDR prefix block subnets.
|
| AddressTrie.TrieNode
A node for a compact binary prefix trie whose elements are prefix block subnets or addresses,
|
| AddressTrieOps
Provides an interface to the trie operations.
|
| AddressTrieOps.AddressTrieAddOps
Provides an interface to the trie add operations.
|
| AddressTrieOps.AssociativeAddressTrieOps
Provides an interface to the associative trie operations.
|
| AddressTrieOps.AssociativeAddressTriePutOps
Provides an interface to the associative trie put operations.
|
| AssociativeAddedTree
AssociativeAddedTree is similar to AddedTree but originates from an AssociativeTrie.
|
| AssociativeAddressTrie
An address trie in which each node is associated with a value.
|
| AssociativeAddressTrie.AssociativeTrieNode |
| BinaryTreeNode
A binary tree node.
|
| BinaryTreeNode.CachingIterator |
| IPAddressPartStringCollection |
| TreeOps
TreeOps is an interface to the operations supported by both trees and tree nodes: traversals, cloning, and serialization.
|
| Class and Description |
|---|
| AddedTree
AddedTree is an alternative non-binary tree data structure originating from a binary trie
with the possible exception of the root, which matches the root node of the original.
|
| AddressComponentRangeSpliterator
AddressComponentSpliterator is a
Spliterator for address items. |
| AddressComponentSpliterator
AddressComponentSpliterator is an AddressComponentRangeSpliterator for address components where
the type of the item producing the spliterator matches the type of the item traversed.
|
| AddressTrie
A compact binary trie (aka compact binary prefix tree, or binary radix trie), for addresses and/or CIDR prefix block subnets.
|
| AddressTrie.TrieNode
A node for a compact binary prefix trie whose elements are prefix block subnets or addresses,
|
| AddressTrieOps
Provides an interface to the trie operations.
|
| AddressTrieOps.AddressTrieAddOps
Provides an interface to the trie add operations.
|
| AddressTrieOps.AssociativeAddressTrieOps
Provides an interface to the associative trie operations.
|
| AddressTrieOps.AssociativeAddressTriePutOps
Provides an interface to the associative trie put operations.
|
| AssociativeAddedTree
AssociativeAddedTree is similar to AddedTree but originates from an AssociativeTrie.
|
| AssociativeAddressTrie
An address trie in which each node is associated with a value.
|
| AssociativeAddressTrie.AssociativeTrieNode |
| BinaryTreeNode
A binary tree node.
|
| BinaryTreeNode.CachingIterator |
| TreeOps
TreeOps is an interface to the operations supported by both trees and tree nodes: traversals, cloning, and serialization.
|