|
| AssocVector (const key_compare &comp=key_compare(), const A &alloc=A()) |
|
template<class InputIterator > |
| AssocVector (InputIterator first, InputIterator last, const key_compare &comp=key_compare(), const A &alloc=A()) |
|
AssocVector & | operator= (const AssocVector &rhs) |
|
iterator | begin () |
|
const_iterator | begin () const |
|
iterator | end () |
|
const_iterator | end () const |
|
reverse_iterator | rbegin () |
|
const_reverse_iterator | rbegin () const |
|
reverse_iterator | rend () |
|
const_reverse_iterator | rend () const |
|
bool | empty () const |
|
size_type | size () const |
|
size_type | max_size () |
|
mapped_type & | operator[] (const key_type &key) |
|
std::pair< iterator, bool > | insert (const value_type &val) |
|
iterator | insert (iterator pos, const value_type &val) |
|
template<class InputIterator > |
void | insert (InputIterator first, InputIterator last) |
|
void | erase (iterator pos) |
|
size_type | erase (const key_type &k) |
|
void | erase (iterator first, iterator last) |
|
void | swap (AssocVector &other) |
|
void | clear () |
|
key_compare | key_comp () const |
|
value_compare | value_comp () const |
|
iterator | find (const key_type &k) |
|
const_iterator | find (const key_type &k) const |
|
size_type | count (const key_type &k) const |
|
iterator | lower_bound (const key_type &k) |
|
const_iterator | lower_bound (const key_type &k) const |
|
iterator | upper_bound (const key_type &k) |
|
const_iterator | upper_bound (const key_type &k) const |
|
std::pair< iterator, iterator > | equal_range (const key_type &k) |
|
std::pair< const_iterator,
const_iterator > | equal_range (const key_type &k) const |
|
bool | operator< (const AssocVector &rhs) const |
|
template<class K, class V, class C = std::less<K>, class A = std::allocator< std::pair<K, V> >>
class Loki::AssocVector< K, V, C, A >
Definition at line 82 of file loki.h.