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
set
comparison operators
set::set
set::~set
member functions:
set::begin
set::clear
set::count
set::empty
set::end
set::equal_range
set::erase
set::find
set::get_allocator
set::insert
set::key_comp
set::lower_bound
set::max_size
set::operator=
set::rbegin
set::rend
set::size
set::swap
set::upper_bound
set::value_comp


set::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 set 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
 
// set::get_allocator
#include <iostream>
#include <set>
using namespace std;
int main ()
{
  set<int> myset;
  int * p;
  unsigned int i;
  // allocate an array of 5 elements using myset's allocator:
  p=myset.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;
  myset.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.