| Const iterator used to iterate backwards through a multiset. (Reverse_iterator and const_reverse_iterator are the same type.) |
iterator begin() const | Container | Returns an iterator pointing to the beginning of the multiset. |
iterator end() const | Container | Returns an iterator pointing to the end of the multiset. |
reverse_iterator rbegin() const | Reversible Container | Returns a reverse_iterator pointing to the beginning of the reversed multiset. |
reverse_iterator rend() const | Reversible Container | Returns a reverse_iterator pointing to the end of the reversed multiset. |
size_type size() const | Container | Returns the size of the multiset. |
size_type max_size() const | Container | Returns the largest possible size of the multiset. |
bool empty() const | Container | true if the multiset 's size is 0. |
key_compare key_comp() const | Sorted Associative Container | Returns the key_compare object used by the multiset. |
value_compare value_comp() const | Sorted Associative Container | Returns the value_compare object used by the multiset. |
multiset() | Container | Creates an empty multiset. |
multiset(const key_compare& comp) | Sorted Associative Container | Creates an empty multiset, using comp as the key_compare object. |
template <class InputIterator> multiset(InputIterator f, InputIterator l) [1] | Multiple Sorted Associative Container | Creates a multiset with a copy of a range. |
template <class InputIterator> multiset(InputIterator f, InputIterator l, const key_compare& comp) [1] | Multiple Sorted Associative Container | Creates a multiset with a copy of a range, using comp as the key_compare object. |
multiset(const multiset&) | Container | The copy constructor. |
multiset& operator=(const multiset&) | Container | The assignment operator |
void swap(multiset&) | Container | Swaps the contents of two multisets. |
iterator insert(const value_type& x) | Multiple Associative Container | Inserts x into the |
