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::max_size

public member function
size_type max_size () const;

Return maximum size

Returns the maximum number of elements that the multiset container object can hold.

This is the maximum potential size the container can reach due to system or library implementation limitations.

Parameters

none

Return Value

The maximum number of elements a multiset container can have as its content.

Member type size_type is an unsigned integral type.

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
// multiset::max_size
#include <iostream>
#include <set>
using namespace std;
int main ()
{
  int i;
  multiset<int> mymultiset;
  if (mymultiset.max_size()>1000)
  {
    for (i=0; i<1000; i++) mymultiset.insert(i);
    cout << "The multiset contains 1000 elements.\n";
  }
  else cout << "The multiset could not hold 1000 elements.\n";
  return 0;
}


Here, member max_size is used to check beforehand whether the multiset will allow for 1000 elements to be inserted.

Complexity

Constant.

See also

multiset::size Return container size (public member function)