19 General utilities library [utilities]

19.12 Memory resources [mem.res]

19.12.3 Class template polymorphic_­allocator [mem.poly.allocator.class]

19.12.3.2 polymorphic_­allocator member functions [mem.poly.allocator.mem]

🔗
[[nodiscard]] Tp* allocate(size_t n);
1
#
Effects: Equivalent to: 
return static_cast<Tp*>(memory_rsrc->allocate(n * sizeof(Tp), alignof(Tp)));
🔗
void deallocate(Tp* p, size_t n);
2
#
Requires: p was allocated from a memory resource x, equal to *memory_­rsrc, using x.allocate(n * sizeof(Tp), alignof(Tp)).
3
#
Effects: Equivalent to memory_­rsrc->deallocate(p, n * sizeof(Tp), alignof(Tp)).
4
#
Throws: Nothing.
🔗
template<class T, class... Args> void construct(T* p, Args&&... args);
5
#
Requires: Uses-allocator construction of T with allocator *this (see [allocator.uses.construction]) and constructor arguments std​::​forward<Args>(args)... is well-formed.
[ Note
:
Uses-allocator construction is always well-formed for types that do not use allocators.
— end note
 ]
6
#
Effects: Construct a T object in the storage whose address is represented by p by uses-allocator construction with allocator *this and constructor arguments std​::​forward<Args>(args)....
7
#
Throws: Nothing unless the constructor for T throws.
8
#
Remarks: This function shall not participate in overload resolution if T is a specialization of pair.
🔗
template<class T1, class T2, class... Args1, class... Args2> void construct(pair<T1, T2>* p, piecewise_construct_t, tuple<Args1...> x, tuple<Args2...> y);
9
#
[ Note
:
This member function and the construct member functions that follow are overloads for piecewise construction of pairs ([pairs.pair]).
— end note
 ]
10
#
Effects: Let xprime be a tuple constructed from x according to the appropriate rule from the following list.
[ Note
:
The following description can be summarized as constructing a pair<T1, T2> object in the storage whose address is represented by p, as if by separate uses-allocator construction with allocator *this ([allocator.uses.construction]) of p->first using the elements of x and p->second using the elements of y.
— end note
 ]
  • (10.1)
    If uses_­allocator_­v<T1,polymorphic_­allocator> is false
    and is_­constructible_­v<T1,Args1...> is true,
    then xprime is x.
  • (10.2)
    Otherwise, if uses_­allocator_­v<T1,polymorphic_­allocator> is true
    and is_­constructible_­v<T1,allocator_­arg_­t,polymorphic_­allocator,Args1...> is true,
    then xprime is tuple_­cat(make_­tuple(allocator_­arg, *this), std​::​move(x)).
  • (10.3)
    Otherwise, if uses_­allocator_­v<T1,polymorphic_­allocator> is true
    and is_­constructible_­v<T1,Args1...,polymorphic_­allocator> is true,
    then xprime is tuple_­cat(std​::​move(x), make_­tuple(*this)).
  • (10.4)
    Otherwise the program is ill formed.
Let yprime be a tuple constructed from y according to the appropriate rule from the following list:
  • (10.5)
    If uses_­allocator_­v<T2,polymorphic_­allocator> is false
    and is_­constructible_­v<T2,Args2...> is true,
    then yprime is y.
  • (10.6)
    Otherwise, if uses_­allocator_­v<T2,polymorphic_­allocator> is true
    and is_­constructible_­v<T2,allocator_­arg_­t,polymorphic_­allocator,Args2...> is true,
    then yprime is tuple_­cat(make_­tuple(allocator_­arg, *this), std​::​move(y)).
  • (10.7)
    Otherwise, if uses_­allocator_­v<T2,polymorphic_­allocator> is true
    and is_­constructible_­v<T2,Args2...,polymorphic_­allocator> is true,
    then yprime is tuple_­cat(std​::​move(y), make_­tuple(*this)).
  • (10.8)
    Otherwise the program is ill formed.
Then, using piecewise_­construct, xprime, and yprime as the constructor arguments, this function constructs a pair<T1, T2> object in the storage whose address is represented by p.
🔗
template<class T1, class T2> void construct(pair<T1, T2>* p);
11
#
Effects: Equivalent to: 
construct(p, piecewise_construct, tuple<>(), tuple<>());
🔗
template<class T1, class T2, class U, class V> void construct(pair<T1, T2>* p, U&& x, V&& y);
12
#
Effects: Equivalent to: 
construct(p, piecewise_construct,
          forward_as_tuple(std::forward<U>(x)),
          forward_as_tuple(std::forward<V>(y)));
🔗
template<class T1, class T2, class U, class V> void construct(pair<T1, T2>* p, const pair<U, V>& pr);
13
#
Effects: Equivalent to: 
construct(p, piecewise_construct,
          forward_as_tuple(pr.first),
          forward_as_tuple(pr.second));
🔗
template<class T1, class T2, class U, class V> void construct(pair<T1, T2>* p, pair<U, V>&& pr);
14
#
Effects: Equivalent to: 
construct(p, piecewise_construct,
          forward_as_tuple(std::forward<U>(pr.first)),
          forward_as_tuple(std::forward<V>(pr.second)));
🔗
template<class T> void destroy(T* p);
15
#
Effects: As if by p->~T().
🔗
polymorphic_allocator select_on_container_copy_construction() const;
16
#
Returns: polymorphic_­allocator().
17
#
[ Note
:
The memory resource is not propagated.
— end note
 ]
🔗
memory_resource* resource() const;
18
#
Returns: memory_­rsrc.