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
deque
comparison operators
deque::deque
deque::~deque
member functions:
deque::assign
deque::at
deque::back
deque::begin
deque::clear
deque::empty
deque::end
deque::erase
deque::front
deque::get_allocator
deque::insert
deque::max_size
deque::operator=
deque::operator[]
deque::pop_back
deque::pop_front
deque::push_back
deque::push_front
deque::rbegin
deque::rend
deque::resize
deque::size
deque::swap


deque::get_allocator

public member function
allocator_type get_allocator() const;

Get allocator

Returns the allocator object used to constuct the deque object.

Parameters

none

Return Value

The allocator.

Member type allocator_type is defined to the same as the second template parameter used to instantitate this specific deque 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
 
// deque::get_allocator
#include <iostream>
#include <deque>
using namespace std;
int main ()
{
  deque<int> mydeque;
  int * p;
  unsigned int i;
  // allocate an array of 5 elements using deque's allocator:
  p=mydeque.get_allocator().allocate(5);
  // assign some values to array
  for (i=0; i<5; i++) p[i]=i;
  cout << "The allocated array contains:";
  for (i=0; i<5; i++) cout << " " << p[i];
  cout << endl;
  mydeque.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 deque object. Output:
The allocated array contains: 0 1 2 3 4

Complexity

Constant.