<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 AssociativeAddressTrie.AssociativeTrieNode<K,V>,K,C> |
AssociativeAddressTrie.AssociativeTrieNode.blockSizeCachingAllNodeIterator() |
|
<C> BinaryTreeNode.CachingIterator<? extends AssociativeAddressTrie.AssociativeTrieNode<K,V>,K,C> |
AssociativeAddressTrie.blockSizeCachingAllNodeIterator() |
|
<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 AssociativeAddressTrie.AssociativeTrieNode<K,V>,K,C> |
AssociativeAddressTrie.AssociativeTrieNode.containingFirstAllNodeIterator(boolean forwardSubNodeOrder) |
|
<C> BinaryTreeNode.CachingIterator<? extends AssociativeAddressTrie.AssociativeTrieNode<K,V>,K,C> |
AssociativeAddressTrie.containingFirstAllNodeIterator(boolean lowerSubNodeFirst) |
|
<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.
|