Index

A C D E F G H I L O P R S T
All Classes and Interfaces|All Packages

A

asIpPrefix() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

Helper method that converts prefix and prefix length to dotted decimal, string, representation.

C

close() - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

comparePrefix(byte[]) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

Compare node prefix with prefix.

D

data() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

E

erase() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

Erase node.

F

findClosest(byte[], int, boolean) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

Finds closest prefix NOT the longest prefix match.

firstDifferentBit(byte[], int) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

Compares prefix to node's prefix and returns position of first different bit.

G

get(Object) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

getAll(IRowVisitor) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

getBest(Object) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

getBestPair(Object) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

getCoveringLessSpecific(Eid) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

getMaxbits() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

getParentPrefix(Eid) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

getRoot() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

getSiblingPrefix(Eid) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

getSize() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

getSpecific(Object, String) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

getSubtree(Eid) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

getVirtualParentSiblingPrefix(Eid) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

getWidestNegativePrefix(Eid) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

H

HashMapDb - Class in org.opendaylight.lispflowmapping.inmemorydb

HashMapDb() - Constructor for class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

I

insert(byte[], int, int, T, byte[]) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

Inserts node in trie near this node with prefix that has the first bit difference at diffbit.

insert(byte[], int, T) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

Insert prefix-data tuple into radix trie.

isEmpty() - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

iterator() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

Retrieve iterator.

L

LOG - Static variable in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

lookupBest(byte[], int) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

Longest prefix match of prefix/preflen.

lookupCoveringLessSpecific(byte[], int) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

Look up the covering prefix for the argument, but exclude the argument itself, so the result is always less specific than the lookup key.

lookupExact(byte[], int) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

Exact prefix match of prefix/preflen.

lookupParent(byte[], int) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

Given an EID, lookup the longest prefix match, then return its parent node.

lookupSibling(byte[], int) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

Given an EID, lookup the longest prefix match, then return its sibling node.

lookupSubtree(byte[], int) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

Return the subtree for a prefix, including the prefix itself if present, excluding virtual nodes.

lookupVirtualParentSibling(byte[], int) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

Given an EID, lookup the longest prefix match, then return its direct parent's sibling node, if the parent is a virtual node.

lookupWidestNegative(byte[], int) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

Lookup widest negative (i.e., overlapping but not present in trie) prefix for given prefix and prefix length.

O

org.opendaylight.lispflowmapping.inmemorydb - package org.opendaylight.lispflowmapping.inmemorydb

org.opendaylight.lispflowmapping.inmemorydb.radixtrie - package org.opendaylight.lispflowmapping.inmemorydb.radixtrie

P

parentWithBitLessThan(int) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

Find parent with bit less than given value.

prefix() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

prefixLength() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

put(Object, MappingEntry<?>...) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

putNestedTable(Object, String) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

putTable(String) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

R

RadixTrie<T> - Class in org.opendaylight.lispflowmapping.inmemorydb.radixtrie

Radix trie/tree (also known as Patricia tree) implementation.

RadixTrie(int) - Constructor for class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

RadixTrie constructor.

RadixTrie(int, boolean) - Constructor for class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

Radix trie constructors.

RadixTrie.TrieNode - Class in org.opendaylight.lispflowmapping.inmemorydb.radixtrie

Trie node definition.

remove(byte[], int) - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

Remove prefix from radix trie.

remove(Object) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

removeAll() - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

removeAll() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie

Remove all entries in the trie.

removeSpecific(Object, String) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

resetData() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

Clear node data.

S

sibling() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

Return sibling node.

T

toString() - Method in class org.opendaylight.lispflowmapping.inmemorydb.radixtrie.RadixTrie.TrieNode

tryAddToIpTrie(Object) - Method in class org.opendaylight.lispflowmapping.inmemorydb.HashMapDb

A C D E F G H I L O P R S T
All Classes and Interfaces|All Packages