C++ Maps are associative containers that contain key/value pairs.
| begin() |
returns an iterator to the beginning of the map |
| clear() |
removes all elements |
| count() |
returns the number of times an element occurs |
| empty() |
true if the map is empty |
| end() |
returns an iterator to the end of the map |
| equal_range() |
returns iterators to specific items |
| erase() |
removes an element |
| find() |
finds an element |
| get_allocator() |
returns the map's allocator |
| insert() |
inserts elements |
| key_comp() |
returns the function that compares elements |
| lower_bound() |
returns the first element greater than a certian value |
| max_size() |
returns the maximum number of elements |
| rbegin() |
returns a reverse iterator to the end of the map |
| rend() |
returns a reverse iterator to the beginning of the map |
| size() |
returns the number of elements in the map |
| swap() |
swap two maps |
| upper_bound() |
returns the first element greater than a certian value |
| value_comp() |
returns the function that compares elements |