Reference
C Library
IOstream Library
Strings library
STL Containers
STL Algorithms
Miscellaneous
STL Containers
bitset
deque
list
map
multimap
multiset
priority_queue
queue
set
stack
vector
multiset
comparison operators
multiset::multiset
multiset::~multiset
member functions:
multiset::begin
multiset::clear
multiset::count
multiset::empty
multiset::end
multiset::equal_range
multiset::erase
multiset::find
multiset::get_allocator
multiset::insert
multiset::key_comp
multiset::lower_bound
multiset::max_size
multiset::operator=
multiset::rbegin
multiset::rend
multiset::size
multiset::swap
multiset::upper_bound
multiset::value_comp


multiset::empty

public member function
bool empty ( ) const;

Test whether container is empty

Returns whether the multiset container is empty, i.e. whether its size is 0.

This function does not modify the content of the container in any way. To clear its content, use member clear.

Parameters

none

Return Value

true if the container size is 0, false otherwise.

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
// multiset::empty
#include <iostream>
#include <set>
using namespace std;
int main ()
{
  multiset<int> mymultiset;
  mymultiset.insert(10);
  mymultiset.insert(20);
  mymultiset.insert(10);
  cout << "mymultiset contains:";
  while (!mymultiset.empty())
  {
     cout << " " << *mymultiset.begin();
     mymultiset.erase(mymultiset.begin());
  }
  cout << endl;
  return 0;
}


Output:
mymultiset contains: 10 10 20

Complexity

Constant.

See also