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 | Method and Description |
---|---|
<C> BinaryTreeNode.CachingIterator<? extends AssociativeAddressTrie.AssociativeTrieNode<K,V>,K,C> |
AssociativeAddressTrie.blockSizeCachingAllNodeIterator() |
<C> BinaryTreeNode.CachingIterator<? extends AssociativeAddressTrie.AssociativeTrieNode<K,V>,K,C> |
AssociativeAddressTrie.AssociativeTrieNode.blockSizeCachingAllNodeIterator() |
<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.
|
<C> BinaryTreeNode.CachingIterator<? extends AddressTrie.TrieNode<E>,E,C> |
AddressTrieOps.containingFirstAllNodeIterator(boolean forwardSubNodeOrder) |
<C> BinaryTreeNode.CachingIterator<? extends BinaryTreeNode<E>,E,C> |
BinaryTreeNode.containingFirstAllNodeIterator(boolean forwardSubNodeOrder) |
<C> BinaryTreeNode.CachingIterator<? extends AssociativeAddressTrie.AssociativeTrieNode<K,V>,K,C> |
AssociativeAddressTrie.containingFirstAllNodeIterator(boolean lowerSubNodeFirst) |
<C> BinaryTreeNode.CachingIterator<? extends AssociativeAddressTrie.AssociativeTrieNode<K,V>,K,C> |
AssociativeAddressTrie.AssociativeTrieNode.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 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.containingFirstIterator(boolean forwardSubNodeOrder) |
<C> BinaryTreeNode.CachingIterator<? extends BinaryTreeNode<E>,E,C> |
BinaryTreeNode.containingFirstIterator(boolean forwardSubNodeOrder) |
<C> BinaryTreeNode.CachingIterator<? extends AssociativeAddressTrie.AssociativeTrieNode<K,V>,K,C> |
AssociativeAddressTrie.containingFirstIterator(boolean lowerSubNodeFirst) |
<C> BinaryTreeNode.CachingIterator<? extends AssociativeAddressTrie.AssociativeTrieNode<K,V>,K,C> |
AssociativeAddressTrie.AssociativeTrieNode.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.
|
<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) |