C++ Multisets

C++ Multisets are like sets, in that they are associative containers containing a sorted set of objects, but differ in that they allow duplicate objects.

Multiset Constructorsdefault methods to allocate, copy, and deallocate multisets
Multiset Operatorsassign and compare multisets
beginreturns an iterator to the beginning of the multiset
clearremoves all elements from the multiset
countreturns the number of elements matching a certain key
emptytrue if the multiset has no elements
endreturns an iterator just past the last element of a multiset
equal_rangereturns iterators to the first and just past the last elements matching a specific key
eraseremoves elements from a multiset
findreturns an iterator to specific elements
insertinserts items into a multiset
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 multiset can hold
rbeginreturns a reverse_iterator to the end of the multiset
rendreturns a reverse_iterator to the beginning of the multiset
sizereturns the number of items in the multiset
swapswap the contents of this multiset with another
upper_boundreturns an iterator to the first element greater than a certain value
value_compreturns the function that compares values