, including all inherited members.
add(const T &element) | BaseKeySortedVector< T, T_key, T_prox > | [inline] |
BaseKeySortedVector(uint16_t maxSize=0, const Comparator< OverlayKey > *comparator=NULL, const AbstractProxComparator *proxComparator=NULL, const AbstractProxKeyComparator *proxKeyComparator=NULL, uint16_t sizeProx=0, uint16_t sizeComb=0) | BaseKeySortedVector< T, T_key, T_prox > | [inline] |
comparator | BaseKeySortedVector< T, T_key, T_prox > | [private] |
const_iterator typedef | BaseKeySortedVector< T, T_key, T_prox > | |
contains(const OverlayKey &key) const | BaseKeySortedVector< T, T_key, T_prox > | [inline] |
downsizeTo(const uint32_t maxElements) | BaseKeySortedVector< T, T_key, T_prox > | [inline] |
find(const OverlayKey &key) const | BaseKeySortedVector< T, T_key, T_prox > | [inline] |
findIterator(const OverlayKey &key) | BaseKeySortedVector< T, T_key, T_prox > | [inline] |
isAddable(const T &element) const | BaseKeySortedVector< T, T_key, T_prox > | [inline] |
isEmpty() const | BaseKeySortedVector< T, T_key, T_prox > | [inline] |
isFull() const | BaseKeySortedVector< T, T_key, T_prox > | [inline] |
iterator typedef | BaseKeySortedVector< T, T_key, T_prox > | |
maxSize | BaseKeySortedVector< T, T_key, T_prox > | [private] |
proxComparator | BaseKeySortedVector< T, T_key, T_prox > | [private] |
proxKeyComparator | BaseKeySortedVector< T, T_key, T_prox > | [private] |
setComparator(const Comparator< OverlayKey > *comparator) | BaseKeySortedVector< T, T_key, T_prox > | [inline] |
sizeComb | BaseKeySortedVector< T, T_key, T_prox > | [private] |
sizeProx | BaseKeySortedVector< T, T_key, T_prox > | [private] |
UNSPECIFIED_ELEMENT | BaseKeySortedVector< T, T_key, T_prox > | [inline, static] |
~BaseKeySortedVector() | BaseKeySortedVector< T, T_key, T_prox > | [inline, virtual] |