C++ Multimaps
C++ Multimaps are like maps, in that they are sorted associative
containers, but differ from maps in that they allow duplicate keys.
Display all
entries for C++ Multimaps on one page, or view entries
individually:
| Container
constructors & destructors |
default methods to allocate, copy, and
deallocate multimaps |
| Container
operators |
assign and compare multimaps |
| begin |
returns an iterator to the beginning of
the multimap |
| clear |
removes all elements from the
multimap |
| count |
returns the number of elements matching
a certain key |
| empty |
true if the multimap has no
elements |
| end |
returns an iterator just past the last
element of a multimap |
| equal_range |
returns iterators to the first and just
past the last elements matching a specific key |
| erase |
removes elements from a multimap |
| find |
returns an iterator to specific
elements |
| insert |
inserts items into a multimap |
| key_comp |
returns the function that compares
keys |
| lower_bound |
returns an iterator to the first element
greater than or equal to a certain value |
| max_size |
returns the maximum number of elements
that the multimap can hold |
| rbegin |
returns a reverse_iterator
to the end of the multimap |
| rend |
returns a reverse_iterator
to the beginning of the multimap |
| size |
returns the number of items in the
multimap |
| swap |
swap the contents of this multimap with
another |
| upper_bound |
returns an iterator to the first element
greater than a certain value |
| value_comp |
returns the function that compares
values |