#include <elm/data/TreeBag.h>
|
typedef T | t |
|
static int | compare (const T &v1, const T &v2) |
|
◆ TreeBag() [1/2]
◆ TreeBag() [2/2]
◆ ~TreeBag()
◆ add()
◆ addAll()
void addAll |
( |
const CC & |
c | ) |
|
|
inline |
◆ allocator()
◆ begin()
◆ clear()
◆ comparator() [1/2]
◆ comparator() [2/2]
const C& comparator |
( |
| ) |
const |
|
inline |
◆ contains()
bool contains |
( |
const T & |
x | ) |
const |
|
inline |
◆ containsAll()
bool containsAll |
( |
const CC & |
c | ) |
const |
|
inline |
◆ copy()
◆ count()
◆ end()
◆ equals()
◆ find()
const T* find |
( |
const T & |
x | ) |
const |
|
inline |
Referenced by TreeMap< K, T, C, E, A >::contains(), TreeBag< value_t, AssocComparator< K, T, Comparator< K > > >::contains(), and TreeMap< K, T, C, E, A >::get().
◆ isEmpty()
Referenced by TreeBag< value_t, AssocComparator< K, T, Comparator< K > > >::clear(), TreeMap< K, T, C, E, A >::isEmpty(), and TreeBag< value_t, AssocComparator< K, T, Comparator< K > > >::operator bool().
◆ operator bool()
◆ operator!=()
◆ operator==()
◆ remove() [1/2]
◆ remove() [2/2]
void remove |
( |
const T & |
x | ) |
|
|
inline |
◆ removeAll()
void removeAll |
( |
const CC & |
c | ) |
|
|
inline |
The documentation for this class was generated from the following file: