| add(const V &item) | tccollection::BtreeList< K, V > | inline |
| BtreeList(bsize_t size=DEFAULT_LIST_SIZE, GrowByMode howToGrow=DEFAULT_GROW_MODE) | tccollection::BtreeList< K, V > | inlineexplicit |
| BtreeList(ioaTreeInternal::KeyAccessor customAccessor, bsize_t size=DEFAULT_LIST_SIZE, GrowByMode howToGrow=DEFAULT_GROW_MODE) | tccollection::BtreeList< K, V > | inlineexplicit |
| capacity() const | tccollection::BtreeList< K, V > | inline |
| clear() | tccollection::BtreeList< K, V > | inline |
| copyInternal(void *dest, const void *src) (defined in tccollection::BtreeList< K, V >) | tccollection::BtreeList< K, V > | inlinestatic |
| count() const | tccollection::BtreeList< K, V > | inline |
| end() const | tccollection::BtreeList< K, V > | inline |
| getByKey(K key) const | tccollection::BtreeList< K, V > | inline |
| itemAtIndex(bsize_t idx) const | tccollection::BtreeList< K, V > | inline |
| items() const | tccollection::BtreeList< K, V > | inline |
| keyAccessor(const void *itm) (defined in tccollection::BtreeList< K, V >) | tccollection::BtreeList< K, V > | inlinestatic |
| nearestLocation(const K &key) const | tccollection::BtreeList< K, V > | inline |
| removeByKey(K key) | tccollection::BtreeList< K, V > | inline |
| removeIndex(bsize_t index) | tccollection::BtreeList< K, V > | inline |