#include <stl_map.h>
Inheritance diagram for std::map< Key, Type, Compare, Alloc >:
Public Member Functions | |
map () | |
Default constructor creates no elements. | |
map (const Compare &comp, const allocator_type &a=allocator_type()) | |
Default constructor creates no elements. | |
map (const map &x) | |
Map copy constructor. | |
template<typename InputIterator> | map (InputIterator first, InputIterator last) |
Builds a map from a range. | |
template<typename InputIterator> | map (InputIterator first, InputIterator last, const Compare &comp, const allocator_type &a=allocator_type()) |
Builds a map from a range. | |
map & | operator= (const map &x) |
Map assignment operator. | |
allocator_type | get_allocator () const |
Get a copy of the memory allocation object. | |
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 |
mapped_type & | operator[] (const key_type &__k) |
Subscript ( [] ) access to map data. | |
pair< iterator, bool > | insert (const value_type &x) |
Attempts to insert a std::pair into the map. | |
iterator | insert (iterator position, const value_type &x) |
Attempts to insert a std::pair into the map. | |
template<typename InputIterator> void | insert (InputIterator first, InputIterator last) |
A template function that attemps to insert a range of elements. | |
void | erase (iterator position) |
Erases an element from a map. | |
size_type | erase (const key_type &x) |
Erases elements according to the provided key. | |
void | erase (iterator first, iterator last) |
Erases a [first,last) range of elements from a map. | |
void | swap (map &x) |
Swaps data with another map. | |
void | clear () |
key_compare | key_comp () const |
value_compare | value_comp () const |
iterator | find (const key_type &x) |
Tries to locate an element in a map. | |
const_iterator | find (const key_type &x) const |
Tries to locate an element in a map. | |
size_type | count (const key_type &x) const |
Finds the number of elements with given key. | |
iterator | lower_bound (const key_type &x) |
Finds the beginning of a subsequence matching given key. | |
const_iterator | lower_bound (const key_type &x) const |
Finds the beginning of a subsequence matching given key. | |
iterator | upper_bound (const key_type &x) |
Finds the end of a subsequence matching given key. | |
const_iterator | upper_bound (const key_type &x) const |
Finds the end of a subsequence matching given key. | |
pair< iterator, iterator > | equal_range (const key_type &x) |
Finds a subsequence matching given key. | |
pair< const_iterator, const_iterator > | equal_range (const key_type &x) const |
Finds a subsequence matching given key. |
Meets the requirements of a container, a reversible container, and an associative container (using unique keys). For a map<Key,T>
the key_type is Key, the mapped_type is T, and the value_type is std::pair<const Key,T>.
Maps support bidirectional iterators.
Definition at line 91 of file stl_map.h.
|
Default constructor creates no elements. |
|
Default constructor creates no elements. |
|
Map copy constructor.
|
|
Builds a map from a range.
|
|
Builds a map from a range.
|
|
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. Definition at line 243 of file stl_map.h. |
|
Returns a read/write iterator that points to the first pair in the map. Iteration is done in ascending order according to the keys. Definition at line 234 of file stl_map.h. |
|
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. Definition at line 464 of file stl_map.h. |
|
Finds the number of elements with given key.
|
|
Returns true if the map is empty. (Thus begin() would equal end().) Definition at line 304 of file stl_map.h. |
|
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. Definition at line 260 of file stl_map.h. |
|
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 251 of file stl_map.h. |
|
Finds a subsequence matching given key.
std::make_pair(c.lower_bound(val), c.upper_bound(val)) This function probably only makes sense for multimaps. Definition at line 612 of file stl_map.h. |
|
Finds a subsequence matching given key.
std::make_pair(c.lower_bound(val), c.upper_bound(val)) This function probably only makes sense for multimaps. Definition at line 593 of file stl_map.h. |
|
Erases a [first,last) range of elements from a map.
|
|
Erases elements according to the provided key.
|
|
Erases an element from a map.
|
|
Tries to locate an element in a map.
end() ) iterator. Definition at line 512 of file stl_map.h. |
|
Tries to locate an element in a map.
end() ) iterator. Definition at line 497 of file stl_map.h. |
|
Get a copy of the memory allocation object. Definition at line 224 of file stl_map.h. Referenced by std::map< Key, Type, Compare, Allocator >::get_allocator(). |
|
A template function that attemps to insert a range of elements.
|
|
Attempts to insert a std::pair into the map.
See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 for more on "hinting". Insertion requires logarithmic time (if the hint is not taken). Definition at line 383 of file stl_map.h. |
|
Attempts to insert a std::pair into the map.
Insertion requires logarithmic time. Definition at line 359 of file stl_map.h. |
|
Returns the key comparison object out of which the map was constructed. Definition at line 473 of file stl_map.h. |
|
Finds the beginning of a subsequence matching given key.
|
|
Finds the beginning of a subsequence matching given key.
|
|
Returns the maximum size of the map. Definition at line 314 of file stl_map.h. |
|
Map assignment operator.
|
|
Subscript (
[] ) operator. Returns data associated with the key specified in subscript. If the key does not exist, a pair with that key is created using default values, which is then returned.Lookup requires logarithmic time. Definition at line 331 of file stl_map.h. |
|
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. Definition at line 278 of file stl_map.h. |
|
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. Definition at line 269 of file stl_map.h. |
|
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. Definition at line 296 of file stl_map.h. |
|
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. Definition at line 287 of file stl_map.h. |
|
Returns the size of the map. Definition at line 309 of file stl_map.h. |
|
Swaps data with another map.
Compare type (which itself is often stateless and empty), so it should be quite fast.) Note that the global std::swap() function is specialized such that std::swap(m1,m2) will feed to this function. Definition at line 454 of file stl_map.h.
Referenced by std::swap(). |
|
Finds the end of a subsequence matching given key.
|
|
Finds the end of a subsequence matching given key.
|
|
Returns a value comparison object, built from the key comparison object out of which the map was constructed. Definition at line 481 of file stl_map.h. |