RadixTrie.TrieNode |
RadixTrie.TrieNode.findClosest(byte[] pref,
int preflen,
boolean virtual) |
Finds closest prefix NOT the longest prefix match.
|
RadixTrie.TrieNode |
RadixTrie.getRoot() |
|
RadixTrie.TrieNode |
RadixTrie.insert(byte[] prefix,
int preflen,
T data) |
Insert prefix-data tuple into radix trie.
|
RadixTrie.TrieNode |
RadixTrie.TrieNode.insert(byte[] pref,
int preflen,
int diffbit,
T prefdata,
byte[] closest) |
Inserts node in trie near this node with prefix that has the first bit difference at diffbit.
|
RadixTrie.TrieNode |
RadixTrie.lookupBest(byte[] prefix,
int preflen) |
Longest prefix match of prefix/preflen.
|
RadixTrie.TrieNode |
RadixTrie.lookupCoveringLessSpecific(byte[] prefix,
int preflen) |
Look up the covering prefix for the argument, but exclude the argument itself, so the result is always less
specific than the lookup key.
|
RadixTrie.TrieNode |
RadixTrie.lookupExact(byte[] prefix,
int preflen) |
Exact prefix match of prefix/preflen.
|
RadixTrie.TrieNode |
RadixTrie.lookupParent(byte[] prefix,
int preflen) |
Given an EID, lookup the longest prefix match, then return its parent node.
|
RadixTrie.TrieNode |
RadixTrie.lookupSibling(byte[] prefix,
int preflen) |
Given an EID, lookup the longest prefix match, then return its sibling node.
|
RadixTrie.TrieNode |
RadixTrie.lookupVirtualParentSibling(byte[] prefix,
int preflen) |
Given an EID, lookup the longest prefix match, then return its direct parent's sibling node, if the parent is a
virtual node.
|
RadixTrie.TrieNode |
RadixTrie.lookupWidestNegative(byte[] prefix,
int preflen) |
Lookup widest negative (i.e., overlapping but not present in trie) prefix for given prefix and prefix length.
|
RadixTrie.TrieNode |
RadixTrie.TrieNode.parentWithBitLessThan(int bitlen) |
Find parent with bit less than given value.
|
RadixTrie.TrieNode |
RadixTrie.TrieNode.sibling() |
Return sibling node.
|