C++ Multimaps

C++ Multimaps are like maps, in that they are sorted associative containers, but differ from maps in that they allow duplicate keys.

Constructorsdefault methods to allocate, copy, and deallocate multimaps
Operatorsassign and compare multimaps
beginreturns an iterator to the beginning of the multimap
clearremoves all elements from the multimap
countreturns the number of elements matching a certain key
emptytrue if the multimap has no elements
endreturns an iterator just past the last element of a multimap
equal_rangereturns iterators to the first and just past the last elements matching a specific key
eraseremoves elements from a multimap
findreturns an iterator to specific elements
insertinserts items into a multimap
key_compreturns the function that compares keys
lower_boundreturns an iterator to the first element greater than or equal to a certain value
max_sizereturns the maximum number of elements that the multimap can hold
rbeginreturns a reverse_iterator to the end of the multimap
rendreturns a reverse_iterator to the beginning of the multimap
sizereturns the number of items in the multimap
swapswap the contents of this multimap with another
upper_boundreturns an iterator to the first element greater than a certain value
value_compreturns the function that compares values