#include <stl_map.h>
| Public Methods | |
| 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 () const | 
| _Tp & | operator[] (const key_type &__k) | 
| Subscript ( [] ) access to map data. More... | |
| pair< iterator, bool > | insert (const value_type &__x) | 
| Attempts to insert a std::pair into the map. More... | |
| iterator | insert (iterator position, const value_type &__x) | 
| Attempts to insert a std::pair into the map. More... | |
| template<class _InputIterator> void | insert (_InputIterator __first, _InputIterator __last) | 
| A template function that attemps to insert elements from another range (possibly another map). More... | |
| void | erase (iterator __position) | 
| Erases an element from a map. More... | |
| size_type | erase (const key_type &__x) | 
| Erases an element according to the provided key. More... | |
| void | erase (iterator __first, iterator __last) | 
| Erases a [first,last) range of elements from a map. More... | |
| void | clear () | 
| iterator | find (const key_type &__x) | 
| Tries to locate an element in a map. More... | |
| const_iterator | find (const key_type &__x) const | 
| Tries to locate an element in a map. More... | |
| size_type | count (const key_type &__x) const | 
| Finds the number of elements with given key. More... | |
| iterator | lower_bound (const key_type &__x) | 
| Finds the beginning of a subsequence matching given key. More... | |
| const_iterator | lower_bound (const key_type &__x) const | 
| Finds the beginning of a subsequence matching given key. More... | |
| iterator | upper_bound (const key_type &__x) | 
| Finds the end of a subsequence matching given key. More... | |
| const_iterator | upper_bound (const key_type &__x) const | 
| Finds the end of a subsequence matching given key. More... | |
| pair< iterator, iterator > | equal_range (const key_type &__x) | 
| Finds a subsequence matching given key. More... | |
| pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const | 
| Finds a subsequence matching given key. More... | |
This is an associative container. Values contained within it can be quickly retrieved through a key element. Example: MyMap["First"] would return the data associated with the key "First".
Definition at line 79 of file stl_map.h.
| 
 | |||||||||
| Returns a read-only (constant) iterator that points to the first pair in the map. Iteration is done in ascending order according to the keys. | 
| 
 | |||||||||
| Returns a read/write iterator that points to the first pair in the map. Iteration is done in ascending order according to the keys. | 
| 
 | |||||||||
| Erases all elements in a map. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty. | 
| 
 | ||||||||||
| Finds the number of elements with given key. 
 
 
 | 
| 
 | |||||||||
| Returns true if the map is empty. (Thus begin() would equal end().) | 
| 
 | |||||||||
| Returns a read-only (constant) iterator that points one past the last pair in the map. Iteration is done in ascending order according to the keys. | 
| 
 | |||||||||
| Returns a read/write iterator that points one past the last pair in the map. Iteration is done in ascending order according to the keys. Definition at line 169 of file stl_map.h. Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::operator[](). | 
| 
 | ||||||||||
| Finds a subsequence matching given key. 
 
 
 This function only makes sense for multimaps. | 
| 
 | ||||||||||
| Finds a subsequence matching given key. 
 
 
 This function only makes sense for multimaps. | 
| 
 | ||||||||||||||||
| Erases a [first,last) range of elements from a map. 
 
 | 
| 
 | ||||||||||
| Erases an element according to the provided key. 
 
 
 | 
| 
 | ||||||||||
| Erases an element from a map. 
 
 | 
| 
 | ||||||||||
| Tries to locate an element in a map. 
 
 | 
| 
 | ||||||||||
| Tries to locate an element in a map. 
 
 
 | 
| 
 | ||||||||||||||||||||
| A template function that attemps to insert elements from another range (possibly another map). 
 
 | 
| 
 | ||||||||||||||||
| Attempts to insert a std::pair into the map. 
 
 | 
| 
 | ||||||||||
| Attempts to insert a std::pair into the map. 
 
 
 Definition at line 244 of file stl_map.h. Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::operator[](). | 
| 
 | ||||||||||
| Finds the beginning of a subsequence matching given key. 
 
 
 | 
| 
 | ||||||||||
| Finds the beginning of a subsequence matching given key. 
 
 
 Definition at line 369 of file stl_map.h. Referenced by std::map< _Key, _Tp, _Compare, _Alloc >::operator[](). | 
| 
 | |||||||||
| Returns the maximum size of the map. | 
| 
 | ||||||||||
| Subscript ( [] ) access to map data. 
 
 Definition at line 221 of file stl_map.h. References std::map< _Key, _Tp, _Compare, _Alloc >::end(), std::map< _Key, _Tp, _Compare, _Alloc >::insert(), and std::map< _Key, _Tp, _Compare, _Alloc >::lower_bound(). | 
| 
 | |||||||||
| Returns a read-only (constant) reverse iterator that points to the last pair in the map. Iteration is done in descending order according to the keys. | 
| 
 | |||||||||
| Returns a read/write reverse iterator that points to the last pair in the map. Iteration is done in descending order according to the keys. | 
| 
 | |||||||||
| Returns a read-only (constant) reverse iterator that points to one before the first pair in the map. Iteration is done in descending order according to the keys. | 
| 
 | |||||||||
| Returns a read/write reverse iterator that points to one before the first pair in the map. Iteration is done in descending order according to the keys. | 
| 
 | |||||||||
| Returns the size of the map. | 
| 
 | ||||||||||
| Finds the end of a subsequence matching given key. 
 
 
 | 
| 
 | ||||||||||
| Finds the end of a subsequence matching given key. 
 
 
 | 
 1.2.15
1.2.15