cplusplus.com cplusplus.com
cplusplus.com   C++ : Reference : STL Containers : list : get_allocator
- -
C++
Information
Documentation
Reference
Articles
Sourcecode
Forum
Reference
C Library
IOstream Library
Strings library
STL Containers
STL Algorithms
STL Containers
bitset
deque
list
map
multimap
multiset
priority_queue
queue
set
stack
vector
list
comparison operators
list::list
list::~list
member functions:
· list::assign
· list::back
· list::begin
· list::clear
· list::empty
· list::end
· list::erase
· list::front
· list::get_allocator
· list::insert
· list::max_size
· list::merge
· list::operator=
· list::pop_back
· list::pop_front
· list::push_back
· list::push_front
· list::rbegin
· list::remove
· list::remove_if
· list::rend
· list::resize
· list::reverse
· list::size
· list::sort
· list::splice
· list::swap
· list::unique

-

list::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 second template parameter used to instantitate this specific list class (its Allocator type).

Example

// list::get_allocator
#include <iostream>
#include <list>

using namespace std;

int main ()
{
  list<int> mylist;
  int * p;
  unsigned int i;

  // allocate an array of 5 elements using mylist's allocator:
  p=mylist.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;

  mylist.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: 0 1 2 3 4

Complexity

Constant.

© The C++ Resources Network, 2000-2007 - All rights reserved
Spotted an error? - contact us