#include <ustl.h>
Inheritance diagram for ustl::map< K, V >:
Public Types | |
typedef K | key_type |
typedef V | data_type |
typedef const K & | const_key_ref |
typedef const V & | const_data_ref |
typedef vector< pair< K, V > >::value_type | value_type |
typedef vector< pair< K, V > >::size_type | size_type |
typedef vector< pair< K, V > >::pointer | pointer |
typedef vector< pair< K, V > >::const_pointer | const_pointer |
typedef vector< pair< K, V > >::reference | reference |
typedef vector< pair< K, V > >::const_reference | const_reference |
typedef vector< pair< K, V > >::const_iterator | const_iterator |
typedef vector< pair< K, V > >::iterator | iterator |
typedef vector< pair< K, V > >::reverse_iterator | reverse_iterator |
typedef vector< pair< K, V > >::const_reverse_iterator | const_reverse_iterator |
typedef pair< const_iterator, const_iterator > | const_range_t |
typedef pair< iterator, iterator > | range_t |
Public Member Functions | |
map (void) | |
Default constructor. | |
map (size_type n) | |
Constructs the container with space for n elements. | |
map (const map< K, V > &v) | |
Copies contents of v . | |
map (const_iterator i1, const_iterator i2) | |
Inserts elements from range [i1,i2). | |
const map< K, V > & | operator= (const map< K, V > &v) |
Copies contents of v . | |
const_data_ref | operator[] (const_key_ref i) const |
Returns data associated with key k . | |
data_type & | operator[] (const_key_ref i) |
Returns data associated with key k . | |
void | assign (const_iterator i1, const_iterator i2) |
Inserts elements from range [i1,i2). | |
void | push_back (const_reference v) |
Inserts the pair into the container. | |
const_iterator | find (const_key_ref k) const |
Returns the pair<K,V> where K = k . | |
iterator | find (const_key_ref k) |
Returns the pair<K,V> where K = k . | |
const_iterator | find_data (const_data_ref v, const_iterator first=NULL, const_iterator last=NULL) const |
Returns the pair<K,V> where V = v , occuring in range [first,last). | |
iterator | find_data (const_data_ref v, iterator first=NULL, iterator last=NULL) |
Returns the pair<K,V> where V = v , occuring in range [first,last). | |
iterator | insert (const_reference v) |
Inserts the pair into the container. | |
void | insert (const_iterator i1, const_iterator i2) |
Inserts elements from range [i1,i2) into the container. | |
void | erase (const_key_ref k) |
Erases the element with key value k . | |
iterator | erase (iterator ep) |
Erases the element at iterator ep . | |
iterator | erase (iterator ep1, iterator ep2) |
Erases range [ep1,ep2). | |
void | clear (void) |
Resizes the block to 0. | |
size_type | size (void) const |
Returns the size of the block. | |
iterator | begin (void) |
Returns a modifiable pointer to the block. | |
const_iterator | begin (void) const |
Returns a const pointer to the block. | |
iterator | end (void) |
Returns a modifiable pointer to the end of the block. | |
const_iterator | end (void) const |
Returns a const pointer to the end of the block. |