Difference between revisions of "cpp/named req/AllocatorAwareContainer"
(typo) |
m (→Standard library: P0843) |
||
(29 intermediate revisions by 13 users not shown) | |||
Line 1: | Line 1: | ||
− | {{cpp/ | + | {{cpp/named req/title|AllocatorAwareContainer|notes={{mark since c++11}}}} |
− | {{cpp/ | + | {{cpp/named req/navbar}} |
− | + | An {{named req|AllocatorAwareContainer}} is a {{named req|Container}} that holds an instance of an {{named req|Allocator}} and uses that instance in all its member functions to allocate and deallocate memory and to construct and destroy objects in that memory (such objects may be container elements, nodes, or, for unordered containers, bucket arrays){{rev inl|since=c++23|, except that {{lc|std::basic_string}} specializations do not use the allocators for construction/destruction of their elements}}. | |
+ | |||
+ | The following rules apply to container construction: | ||
+ | * Copy constructors of {{named req/core|AllocatorAwareContainer}}s obtain their instances of the allocator by calling {{c|std::allocator_traits<allocator_type>::select_on_container_copy_construction}} on the allocator of the container being copied. | ||
+ | * Move constructors obtain their instances of allocators by move-constructing from the allocator belonging to the old container. | ||
+ | * All other constructors take a {{c/core|const allocator_type&}} parameter. | ||
+ | |||
+ | {{anchor|Replacing allocator}} | ||
+ | The only way to replace an allocator is copy-assignment, move-assignment, and swap: | ||
+ | * Copy-assignment will replace the allocator only if {{c|std::allocator_traits<allocator_type>::propagate_on_container_copy_assignment::value}} is {{c|true}}. | ||
+ | * Move-assignment will replace the allocator only if {{c|std::allocator_traits<allocator_type>::propagate_on_container_move_assignment::value}} is {{c|true}}. | ||
+ | * Swap will replace the allocator only if {{c|std::allocator_traits<allocator_type>::propagate_on_container_swap::value}} is {{c|true}}. Specifically, it will exchange the allocator instances through an unqualified call to the non-member function swap, see {{named req|Swappable}}. | ||
+ | |||
+ | Note: The behavior of swapping two containers with unequal allocators if {{tt|propagate_on_container_swap}} is {{c|false}} is undefined. | ||
+ | |||
+ | * The accessor {{tt|get_allocator()}} obtains a copy of the allocator that was used to construct the container or installed by the most recent allocator replacement operation. | ||
===Requirements=== | ===Requirements=== | ||
− | {{ | + | A type satisfies {{named req/core|AllocatorAwareContainer}} if it satisfies {{named req|Container}} and, given the following types and values, the semantic and complexity requirements in the tables below are satisfied: |
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc hitem|Type|Definition}} |
− | {{ | + | {{dsc|{{tt|X}}|an {{named req/core|AllocatorAwareContainer}} type}} |
− | {{ | + | {{dsc|{{tt|T}}|the {{tt|value_type}} of {{tt|X}}}} |
− | {{ | + | {{dsc|{{tt|A}}|the allocator type used by {{tt|X}}}} |
− | {{ | + | {{dsc hitem|Value|Definition}} |
− | {{ | + | {{dsc|{{c|a}}, {{c|b}}|non-const lvalues of type {{tt|X}}}} |
− | {{ | + | {{dsc|{{c|c}}|an lvalue of type {{c/core|const X}}}} |
− | {{ | + | {{dsc|{{c|t}}|an lvalue or a const rvalue of type {{tt|X}}}} |
− | {{ | + | {{dsc|{{c|rv}}|a non-const rvalue of type {{tt|X}}}} |
+ | {{dsc|{{c|m}}|a value of type {{tt|A}}}} | ||
+ | {{dsc end}} | ||
+ | ====Types==== | ||
+ | {|class=wikitable | ||
+ | !Name | ||
+ | !{{nbsp}}Type{{nbsp}} | ||
+ | !Requirement | ||
+ | |- | ||
+ | |{{c/core|typename X::allocator_type}}{{nbsp}} | ||
+ | |{{tt|A}} | ||
+ | |{{tt|X::allocator_type::value_type}} and {{tt|X::value_type}} are the same. | ||
+ | |} | ||
+ | ====Statements==== | ||
{|class=wikitable | {|class=wikitable | ||
− | ! | + | !Statement |
+ | !colspan=2|Semantics | ||
+ | !Complexity | ||
|- | |- | ||
− | |{{c| | + | |rowspan=2|{{c|X u;}}<br>{{c|1=X u = X();}} |
+ | |Precondition | ||
+ | |{{tt|A}} is {{named req|DefaultConstructible}}. | ||
+ | |rowspan=2|Constant | ||
|- | |- | ||
− | |{{c| | + | |Postcondition{{nbsp}} |
+ | |{{c|u.empty()}} and {{c|1=u.get_allocator() == A()}} are both {{c|true}}. | ||
|- | |- | ||
− | |{{c|X u;}} | | + | |{{c|X u(m);}} |
+ | |Postcondition | ||
+ | |{{c|u.empty()}} and {{c|1=u.get_allocator() == m}} are both {{c|true}}. | ||
+ | |Constant | ||
|- | |- | ||
− | |{{c|X u(m);}} | | + | |rowspan=2|{{c|X u(t, m);}} |
+ | |Precondition | ||
+ | |{{tt|T}} is {{named req|CopyInsertable}} into {{tt|X}}. | ||
+ | |rowspan=2|Linear | ||
|- | |- | ||
− | |{{c| | + | |Postcondition |
+ | |{{c|1=u == t}} and {{c|1=u.get_allocator() == m}} are both {{c|true}}. | ||
|- | |- | ||
− | |{{c|X u(rv);}} || | + | |{{c|X u(rv);}} |
− | | | + | |Postcondition |
− | + | | | |
+ | * {{c|u}} has the same elements as {{c|rv}} had before this construction. | ||
+ | * The value of {{c|u.get_allocator()}} is the same as the value of {{c|rv.get_allocator()}} before this construction. | ||
+ | |Constant | ||
|- | |- | ||
− | |{{c|X u(rv,m);}}|| | + | |rowspan=2|{{c|X u(rv, m);}} |
− | | | + | |Precondition |
+ | |{{tt|T}} is {{named req|MoveInsertable}} into {{tt|X}}. | ||
+ | |rowspan=2| | ||
+ | * Constant if {{c|1=m == rv.get_allocator()}} is {{c|true}}. | ||
+ | * Otherwise linear. | ||
|- | |- | ||
− | |{{c| | + | |Postcondition |
+ | | | ||
+ | * {{c|u}} has the same elements, or copies of the elements, that {{c|rv}} had before this construction. | ||
+ | * {{c|1=u.get_allocator() == m}} is {{c|true}}. | ||
+ | |} | ||
+ | |||
+ | ====Expressions==== | ||
+ | {|class=wikitable | ||
+ | !Expression | ||
+ | !{{nbsp}}Type{{nbsp}} | ||
+ | !colspan=2|Semantics | ||
+ | !{{nbsp}}Complexity{{nbsp}} | ||
|- | |- | ||
− | |{{c| | + | |{{c|c.get_allocator()}} |
+ | |{{tt|A}} | ||
+ | |colspan=2|No direct semantic requirement. | ||
+ | |Constant | ||
|- | |- | ||
− | |{{c|a | + | |rowspan=2|{{c|1=a = t}} |
+ | |rowspan=2|{{tt|X&}} | ||
+ | |Precondition | ||
+ | |{{tt|T}} is {{named req|CopyInsertable}} into {{tt|X}} and {{named req|CopyAssignable}}. | ||
+ | |rowspan=2|Linear | ||
|- | |- | ||
+ | |Postcondition{{nbsp}} | ||
+ | |{{c|1=a == t}} is {{c|true}}. | ||
+ | |- | ||
+ | |rowspan=3|{{c|1=a = rv}} | ||
+ | |rowspan=3|{{tt|X&}} | ||
+ | |Precondition | ||
+ | |If the allocator will '''not''' be replaced by move-assignment (see [[#Replacing allocator|above]]), then {{tt|T}} is {{named req|MoveInsertable}} into {{tt|X}} and {{named req|MoveAssignable}}. | ||
+ | |rowspan=3|Linear | ||
+ | |- | ||
+ | |Effect | ||
+ | |All existing elements of {{c|a}} are either move assigned to or destroyed. | ||
+ | |- | ||
+ | |Postcondition | ||
+ | |If {{c|a}} and {{c|rv}} do not refer the same object, {{c|a}} is equal to the value that {{c|rv}} had before the assignment. | ||
+ | |- | ||
+ | |{{c|a.swap(b)}} | ||
+ | |{{c/core|void}} | ||
+ | |Effect | ||
+ | |Exchanges the contents of {{c|a}} and {{c|b}}. | ||
+ | |Constant | ||
|} | |} | ||
− | === | + | ===Notes=== |
− | + | Allocator-aware containers always call {{c|std::allocator_traits<A>::construct(m, p, args)}} to construct an object of type {{tt|T}} at {{c|p}} using {{c|args}}, with {{c|1=m == get_allocator()}}. {{rev inl|until=c++20|The default {{tt|construct}} in {{lc|std::allocator}} calls {{c|::new((void*)p) T(args)}}}}{{rev inl|since=c++20|{{lc|std::allocator}} has no {{tt|construct}} member and {{c|std::construct_at(p, args)}} is called when constructing elements}}, but specialized allocators may choose a different definition. | |
− | * {{ | + | |
− | + | ===Standard library=== | |
− | * {{ | + | All standard library string types and containers (except {{lc|std::array}} and {{lc|std::inplace_vector}}) are {{named req/core|AllocatorAwareContainer}}s: |
− | + | * {{lc|std::basic_string}} | |
− | * {{ | + | * {{lc|std::deque}} |
+ | * {{lc|std::forward_list}} | ||
+ | * {{lc|std::list}} | ||
+ | * {{lc|std::vector}} | ||
+ | * {{lc|std::map}} | ||
+ | * {{lc|std::multimap}} | ||
+ | * {{lc|std::set}} | ||
+ | * {{lc|std::multiset}} | ||
+ | * {{lc|std::unordered_map}} | ||
+ | * {{lc|std::unordered_multimap}} | ||
+ | * {{lc|std::unordered_set}} | ||
+ | * {{lc|std::unordered_multiset}} | ||
+ | |||
+ | ===Defect reports=== | ||
+ | {{dr list begin}} | ||
+ | {{dr list item|wg=lwg|dr=2839|std=C++11|before=self move assignment of standard containers was not allowed|after=allowed but the result is unspecified}} | ||
+ | {{dr list end}} | ||
+ | |||
+ | {{langlinks|de|es|ja|ru|zh}} |
Latest revision as of 22:18, 3 August 2024
An AllocatorAwareContainer is a Container that holds an instance of an Allocator and uses that instance in all its member functions to allocate and deallocate memory and to construct and destroy objects in that memory (such objects may be container elements, nodes, or, for unordered containers, bucket arrays), except that std::basic_string specializations do not use the allocators for construction/destruction of their elements(since C++23).
The following rules apply to container construction:
- Copy constructors of AllocatorAwareContainers obtain their instances of the allocator by calling std::allocator_traits<allocator_type>::select_on_container_copy_construction on the allocator of the container being copied.
- Move constructors obtain their instances of allocators by move-constructing from the allocator belonging to the old container.
- All other constructors take a const allocator_type& parameter.
The only way to replace an allocator is copy-assignment, move-assignment, and swap:
- Copy-assignment will replace the allocator only if std::allocator_traits<allocator_type>::propagate_on_container_copy_assignment::value is true.
- Move-assignment will replace the allocator only if std::allocator_traits<allocator_type>::propagate_on_container_move_assignment::value is true.
- Swap will replace the allocator only if std::allocator_traits<allocator_type>::propagate_on_container_swap::value is true. Specifically, it will exchange the allocator instances through an unqualified call to the non-member function swap, see Swappable.
Note: The behavior of swapping two containers with unequal allocators if propagate_on_container_swap
is false is undefined.
- The accessor
get_allocator()
obtains a copy of the allocator that was used to construct the container or installed by the most recent allocator replacement operation.
Contents |
[edit] Requirements
A type satisfies AllocatorAwareContainer if it satisfies Container and, given the following types and values, the semantic and complexity requirements in the tables below are satisfied:
Type | Definition |
X
|
an AllocatorAwareContainer type |
T
|
the value_type of X
|
A
|
the allocator type used by X
|
Value | Definition |
a, b | non-const lvalues of type X
|
c | an lvalue of type const X |
t | an lvalue or a const rvalue of type X
|
rv | a non-const rvalue of type X
|
m | a value of type A
|
[edit] Types
Name | Type | Requirement |
---|---|---|
typename X::allocator_type | A
|
X::allocator_type::value_type and X::value_type are the same.
|
[edit] Statements
Statement | Semantics | Complexity | |
---|---|---|---|
X u; X u = X(); |
Precondition | A is DefaultConstructible.
|
Constant |
Postcondition | u.empty() and u.get_allocator() == A() are both true. | ||
X u(m); | Postcondition | u.empty() and u.get_allocator() == m are both true. | Constant |
X u(t, m); | Precondition | T is CopyInsertable into X .
|
Linear |
Postcondition | u == t and u.get_allocator() == m are both true. | ||
X u(rv); | Postcondition |
|
Constant |
X u(rv, m); | Precondition | T is MoveInsertable into X .
|
|
Postcondition |
|
[edit] Expressions
Expression | Type | Semantics | Complexity | |
---|---|---|---|---|
c.get_allocator() | A
|
No direct semantic requirement. | Constant | |
a = t | X&
|
Precondition | T is CopyInsertable into X and CopyAssignable.
|
Linear |
Postcondition | a == t is true. | |||
a = rv | X&
|
Precondition | If the allocator will not be replaced by move-assignment (see above), then T is MoveInsertable into X and MoveAssignable.
|
Linear |
Effect | All existing elements of a are either move assigned to or destroyed. | |||
Postcondition | If a and rv do not refer the same object, a is equal to the value that rv had before the assignment. | |||
a.swap(b) | void | Effect | Exchanges the contents of a and b. | Constant |
[edit] Notes
Allocator-aware containers always call std::allocator_traits<A>::construct(m, p, args) to construct an object of type T
at p using args, with m == get_allocator(). The default construct
in std::allocator calls ::new((void*)p) T(args)(until C++20)std::allocator has no construct
member and std::construct_at(p, args) is called when constructing elements(since C++20), but specialized allocators may choose a different definition.
[edit] Standard library
All standard library string types and containers (except std::array and std::inplace_vector) are AllocatorAwareContainers:
- std::basic_string
- std::deque
- std::forward_list
- std::list
- std::vector
- std::map
- std::multimap
- std::set
- std::multiset
- std::unordered_map
- std::unordered_multimap
- std::unordered_set
- std::unordered_multiset
[edit] Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 2839 | C++11 | self move assignment of standard containers was not allowed | allowed but the result is unspecified |