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

public member function
allocator_type get_allocator() const;

Get allocator

Returns the allocator object used to constuct the container.

Parameters

none

Return Value

The allocator.

Member type allocator_type is defined to the same as the third template parameter used to instantitate this specific multiset class (its Allocator type).

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
 
// multiset::get_allocator
#include <iostream>
#include <set>
using namespace std;
int main ()
{
  multiset<int> mymultiset;
  int * p;
  unsigned int i;
  // allocate an array of 5 elements using myset's allocator:
  p=mymultiset.get_allocator().allocate(5);
  // assign some values to array
  for (i=0; i<5; i++) p[i]=(i+1)*10;
  cout << "The allocated array contains:";
  for (i=0; i<5; i++) cout << " " << p[i];
  cout << endl;
  mymultiset.get_allocator().deallocate(p,5);
  return 0;
}

The example shows an elaborate way to allocate memory for an array of ints using the same allocator used by the container.
Output:
The allocated array contains: 10 20 30 40 50

Complexity

Constant.