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. |
|
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. |
|
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. |
|
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. |
|
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.
|
|
Tries to locate an element in a map.
end() ) iterator.
|
|
Get a copy of the memory allocation object.
|
|
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). |
|
Attempts to insert a std::pair into the map.
Insertion requires logarithmic time. |
|
Returns the key comparison object out of which the map was constructed. |
|
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. |
|
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. References std::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. |
|
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. |