Standard C++ Library Class Reference

void swap ( multiset<Key, Compare, Allocator>&,
multiset<Key, Compare, Allocator>&);
Constructor and Destructor
explicit multiset (const Compare& comp = Compare(),
const Allocator& alloc = Allocator());
Default constructor. Constructs an empty multiset which will use the optional relation comp to
order keys, if it is supplied, and the allocator alloc for all storage management.
template <class InputIterator>
multiset (InputIterator first, InputIterator last,
const Compare& = Compare(),
const Allocator& = Allocator());
Constructs a multiset containing values in the range [first, last).
multiset (const multiset<Key, Compare, Allocator>& x);
Copy constructor. Creates a new multiset by copying all key values from x.
~multiset ();
The destructor. Releases any allocated memory for this multiset.
Assignment Operator
multiset<Key, Compare, Allocator>&
operator= (const multiset<Key, Compare, Allocator>& x);
Replaces the contents of *this with a copy of the contents of x.
Allocator
allocator_type get_allocator () const;
Returns a copy of the allocator used by self for storage management.
Iterators
iterator begin();
Returns an iterator pointing to the first element stored in the multiset. "First" is defined by the
multiset's comparison operator, Compare.
const_iterator begin();
Returns a const_iterator pointing to the first element stored in the multiset.
iterator end();
Returns an iterator pointing to the last element stored in the multiset, i.e., the off-the-end value.
const_iterator end();