| add(const T &element) | BaseKeySortedVector< T, T_key, T_prox, T_address > | 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, T_address > | inline |
| comparator | BaseKeySortedVector< T, T_key, T_prox, T_address > | private |
| const_iterator typedef | BaseKeySortedVector< T, T_key, T_prox, T_address > | |
| contains(const OverlayKey &key) const | BaseKeySortedVector< T, T_key, T_prox, T_address > | inline |
| downsizeTo(const uint32_t maxElements) | BaseKeySortedVector< T, T_key, T_prox, T_address > | inline |
| find(const OverlayKey &key) const | BaseKeySortedVector< T, T_key, T_prox, T_address > | inline |
| findIterator(const OverlayKey &key) | BaseKeySortedVector< T, T_key, T_prox, T_address > | inline |
| isAddable(const T &element) const | BaseKeySortedVector< T, T_key, T_prox, T_address > | inline |
| isEmpty() const | BaseKeySortedVector< T, T_key, T_prox, T_address > | inline |
| isFull() const | BaseKeySortedVector< T, T_key, T_prox, T_address > | inline |
| iterator typedef | BaseKeySortedVector< T, T_key, T_prox, T_address > | |
| maxSize | BaseKeySortedVector< T, T_key, T_prox, T_address > | private |
| proxComparator | BaseKeySortedVector< T, T_key, T_prox, T_address > | private |
| proxKeyComparator | BaseKeySortedVector< T, T_key, T_prox, T_address > | private |
| setComparator(const Comparator< OverlayKey > *comparator) | BaseKeySortedVector< T, T_key, T_prox, T_address > | inline |
| sizeComb | BaseKeySortedVector< T, T_key, T_prox, T_address > | private |
| sizeProx | BaseKeySortedVector< T, T_key, T_prox, T_address > | private |
| UNSPECIFIED_ELEMENT | BaseKeySortedVector< T, T_key, T_prox, T_address > | static |
| ~BaseKeySortedVector() | BaseKeySortedVector< T, T_key, T_prox, T_address > | inlinevirtual |