Uses of Class
org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

Packages that use RadixTrie.TrieNode

Package	Description
org.opendaylight.lispflowmapping.inmemorydb.radixtrie

Uses of RadixTrie.TrieNode in org.opendaylight.lispflowmapping.inmemorydb.radixtrie

Methods in org.opendaylight.lispflowmapping.inmemorydb.radixtrie that return RadixTrie.TrieNode

Modifier and Type	Method	Description
RadixTrie<T>.TrieNode	RadixTrie.TrieNode.findClosest(byte[] pref, int preflen, boolean virtual)	Finds closest prefix NOT the longest prefix match.
RadixTrie<T>.TrieNode	RadixTrie.getRoot()
RadixTrie<T>.TrieNode	RadixTrie.insert(byte[] prefix, int preflen, T data)	Insert prefix-data tuple into radix trie.
RadixTrie<T>.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<T>.TrieNode	RadixTrie.lookupBest(byte[] prefix, int preflen)	Longest prefix match of prefix/preflen.
RadixTrie<T>.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<T>.TrieNode	RadixTrie.lookupExact(byte[] prefix, int preflen)	Exact prefix match of prefix/preflen.
RadixTrie<T>.TrieNode	RadixTrie.lookupParent(byte[] prefix, int preflen)	Given an EID, lookup the longest prefix match, then return its parent node.
RadixTrie<T>.TrieNode	RadixTrie.lookupSibling(byte[] prefix, int preflen)	Given an EID, lookup the longest prefix match, then return its sibling node.
RadixTrie<T>.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<T>.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<T>.TrieNode	RadixTrie.TrieNode.parentWithBitLessThan(int bitlen)	Find parent with bit less than given value.
RadixTrie<T>.TrieNode	RadixTrie.TrieNode.sibling()	Return sibling node.

Methods in org.opendaylight.lispflowmapping.inmemorydb.radixtrie that return types with arguments of type RadixTrie.TrieNode

Modifier and Type	Method	Description
Iterator<RadixTrie<T>.TrieNode>	RadixTrie.TrieNode.iterator()	Retrieve iterator.
Set<RadixTrie<T>.TrieNode>	RadixTrie.lookupSubtree(byte[] prefix, int preflen)	Return the subtree for a prefix, including the prefix itself if present, excluding virtual nodes.