The default allocator object for storage management in Standard Library containers.
#include <memory>
class allocator;
Containers in the Standard Library allow you control of storage management through the use of allocator objects. Each container has an allocator template parameter specifying the type of allocator to be used. Every constructor, except the copy constructor, provides an allocator parameter, allowing you to pass in a specific allocator. A container uses that allocator for all storage management.
The library provides a default allocator, called allocator. This allocator uses the global new and delete operators. By default, all containers use this allocator. You can also design your own allocator, but if you do so it must provide an appropriate interface. The standard interface and an alternate interface are specified below. The alternate interface will work on all supported compilers.
As of this writing, very few compilers support the full range features needed by the standard allocator. If your compiler does not support member templates (both classes and functions) then you must use the alternate allocator interface we provide. This alternate interface requires no special features of a compiler and offers most of the functionality of the standard allocator interface. The only thing missing is the ability to use special pointer and reference types. The alternate allocator fixes these as T* and T&. If your compiler supports partial specialization then even this restriction is removed.
From outside a container, use of the alternate allocator is transparent. Simply pass the allocator as a template or function parameter exactly as you would the standard allocator.
Within a container, the alternate allocator interface is more compilicated to use because it requires two separate classes, rather than one class with another class nested inside. If you plan to write your own containers and need to use the alternate allocator interface, we recommend that you support the default interface as well, since that is the only way to ensure long-term portability. See the User's Guide section on building containers for an explanation of how to support both the standard and the alternate allocator interfaces.
A generic allocator must be able to allocate space for objects of arbitrary type, and it must be able to construct those objects on that space. For this reason the allocator must be type aware; but it must be aware on any arbitrary number of different types, since there is no way to predict the storage needs of any given container.
Consider an ordinary template. Although you may be able to instantiate on any fixed number of types, the resulting object is aware of only those types and any other types that can be built up from them (T*, for instance), as well as any types you specify up front. This won't work for an allocator, because you can't make any assumptions about the types a container will need to construct. It may well need to construct Ts (or it may not), but it may also need to allocate node objects and other data structures necessary to manage the contents of the container. Clearly there is no way to predict what an arbitrary container might need to construct. As with everything else within the Standard Library, it is absolutely essential to be fully generic.
The Standard Allocator interface solves the problem with member templates. The precise type that you are going to construct is not specified when you create an allocator but when you actually go to allocate space or construct an object on existing space. This clever solution is well ahead of nearly all existing compiler implementations.
Rogue Wave's alternative allocator interface uses a different technique. The alternate interface breaks the allocator into two pieces: an interface and an implementation. The implementation is a simple class providing raw un-typed storage. Anything can be constructed on it. The interface is a template class containing a pointer to an implementation. The interface template types the raw memory provided by the implementation based on the template parameter. Only the implementation object is passed into a container. The container constructs interface objects as necessary, using the provided implementation) to manage the storage of data.
Since all interface objects use the one copy of the implementation object to allocate space, that one implementation object manages all storage aquisition for the container. The container makes calls to the allocator_interface objects in the same way it would make calls to a standard allocator object.
For example, if your container needs to allocate T objects and node objects, you need to have two allocator_interface objects in your container:
allocator_interface<Allocator,T> value_allocator; allocator_interface<Allocator,node> node_allocator;
You then use the value_allocator for all allocation, construction, etc. of values (Ts), and use the node_allocator object to allocate and deallocate nodes.
The only significant drawback is the inability to provide special pointer types and alter the behavior of the construct and destroy functions provided by an allocator, since these must reside in the interface class. If your compiler provides partial specialization then this restriction goes away, since you can provide specialized interface's along with your implementation.
class allocator; {
typedef size_t size_type;
typedef ptrdiff_t difference_type;
template <class T> struct types
{
typedef T* pointer;
typedef const T* const_pointer;
typedef T& reference;
typedef const T& const_reference;
typedef T value_type;
};
allocator ();
~allocator ();
template <class T> typename types<T>::pointer
address (typename types<T>::reference) const;
template<class T> typename types<T>::const_pointer
address (typename types<T>::const_reference) const;
template<class T, class U> typename types<T>::pointer
allocate (size_type,typename types<U>::const_pointer = 0);
template<class T> void deallocate( typename types<T>::pointer);
template<class T> size_type max_size () const;
template <class T1, class T2>
void construct (T1*, const T2&);
template <class T>
void destroy (T*)
};
// specialization
class allocator::types <void>
{
typedef void* pointer;
typedef const void* const_pointer;
typedef void value_type;
};
// globals
inline void * operator new (size_t, allocator&)
inline bool operator== (const allocator&, const allocator&)
size_type
Type used to hold the size of an allocated block of storage.
difference_type
Type used to hold values representing distances between storage addresses.
types<T>::pointer
Type of pointer returned by allocator.
types<T>::const_pointer
Const version of pointer.
types<T>::reference
Type of reference to allocated objects.
const_reference
Const version of reference.
value_type
Type of allocated object.
allocator ()
Default constructor.
allocator ()
Destructor.
template <class T> typename types<T>::pointer address (typename types<T>::reference x) const
Return the address of the reference x as a pointer.
template<class T> typename types<T>::const_pointer address (typename types<T>::const_reference x) const;
Return the address of the reference x as a const_pointer.
template<class T, class U> typename types<T>::pointer allocate (size_type n, typename types<U>::const_pointer p = 0)
Allocate storage. Returns a pointer to the first element in a block of storage n*sizeof(T) bytes in size. The block will be aligned appropriately for objects of type T. Throws the exception bad_alloc if the storage is unavailable. This function uses operator new(size_t). The second parameter p can be used by an allocator to localize memory allocation, but the default allocator does not use it.
template<class T> void deallocate( typename types<T>::pointer p)
Deallocate the storage indicated by p. The storage must have been obtained by a call to allocate.
template<class T> size_type max_size () const;
Returns the largest size for which a call to allocate might succeed.
template <class T1, class T2> void construct (T1* p, const T2& val);
Construct an object of type T2 with the inital value of val at the location specified by p. This function calls the placement new operator.
template <class T> void destroy (T* p)
Call the destructor on the object pointed to by p, but do not delete.
class allocator
{
public:
typedef size_t size_type ;
typedef ptrdiff_t difference_type ;
allocator ();
~allocator (); .
void * allocate (size_type, void * = 0);
void deallocate (void*);
};
template <class Allocator,class T>
class allocator_interface .
{
public:
typedef Allocator allocator_type ;
typedef T* pointer ; .
typedef const T* const_pointer ;
typedef T& reference ; .
typedef const T& const_reference ;
typedef T value_type ; .
typedef typename Allocator::size_type size_type ;
typedef typename Allocator::size_type difference_type ;
protected:
allocator_type* alloc_;
public:
allocator_interface ();
allocator_interface (Allocator*);
void alloc (Allocator*);
pointer address (T& x);
size_type max_size () const;
pointer allocate (size_type, pointer = 0);
void deallocate (pointer);
void construct (pointer, const T&);
void destroy (T*);
};
//
// Specialization
//
class allocator_interface <allocator,void>
{
typedef void* pointer ;
typedef const void* const_pointer ;
};
The description for the operations of allocator_interface<T> are the same as for corresponding operations of the standard allocator, except that allocator_interface members allocate and deallocate call respective functions in allocator , which are in turn implemented as are the standard allocator functions.
See the Containers section of the Class Reference for a further description of how to use the alternate allocator within a user-defined container.