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


map::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 fourth template parameter used to instantitate this specific map 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
 
// map::get_allocator
#include <iostream>
#include <map>
using namespace std;
int main ()
{
  int psize;
  map<char,int> mymap;
  pair<const char,int>* p;
  // allocate an array of 5 elements using mymap's allocator:
  p=mymap.get_allocator().allocate(5);
  // assign some values to array
  psize = (int) sizeof(map<char,int>::value_type)*5;
  cout << "The allocated array has a size of " << psize << " bytes.\n";
  mymap.get_allocator().deallocate(p,5);
  return 0;
}

The example shows an elaborate way to allocate memory for an array of pairs using the same allocator used by the container.
A possible output is:
The allocated array has a size of 40 bytes.

Complexity

Constant.