Difference between revisions of "cpp/named req/Container"
m (→Container data races: .) |
m (~ explicitly define member types) |
||
Line 5: | Line 5: | ||
===Requirements=== | ===Requirements=== | ||
+ | ====Legend==== | ||
* {{tt|T}}, an element type; | * {{tt|T}}, an element type; | ||
* {{tt|C}}, a {{named req/core|Container}} type containing elements of type {{tt|T}}; | * {{tt|C}}, a {{named req/core|Container}} type containing elements of type {{tt|T}}; | ||
Line 11: | Line 12: | ||
* {{c|rv}}, a prvalue expression of type {{tt|C}}. | * {{c|rv}}, a prvalue expression of type {{tt|C}}. | ||
− | ==== | + | ====Member types==== |
{|class=wikitable | {|class=wikitable | ||
!Name||Type||Requirements | !Name||Type||Requirements | ||
|- | |- | ||
− | |{{tt|value_type}}||{{tt|T}}||{{rev inl|until=c++11|{{named req|CopyConstructible}}}}{{rev inl|since=c++11|{{named req|Erasable}}}} | + | |{{tt|C::value_type}}||{{tt|T}}||{{rev inl|until=c++11|{{named req|CopyConstructible}}}}{{rev inl|since=c++11|{{named req|Erasable}}}} |
|- | |- | ||
− | |{{tt|reference}}||{{tt|T&}}|| | + | |{{tt|C::reference}}||{{tt|T&}}|| |
|- | |- | ||
− | |{{tt|const_reference}}||{{c/core|const T&}}|| | + | |{{tt|C::const_reference}}||{{c/core|const T&}}|| |
|- | |- | ||
− | |{{tt|iterator}}||Iterator whose [[cpp/iterator#Types and writability|value type]] is {{tt|T}}||{{named req|ForwardIterator}}<br>convertible to {{tt|const_iterator}} | + | |{{tt|C::iterator}}||Iterator whose [[cpp/iterator#Types and writability|value type]] is {{tt|T}}||{{named req|ForwardIterator}}<br>convertible to {{tt|const_iterator}} |
|- | |- | ||
− | |{{tt|const_iterator}}||Constant iterator whose [[cpp/iterator#Types and writability|value type]] is {{tt|T}}||{{named req|ForwardIterator}} | + | |{{tt|C::const_iterator}}||Constant iterator whose [[cpp/iterator#Types and writability|value type]] is {{tt|T}}||{{named req|ForwardIterator}} |
|- | |- | ||
− | |{{tt|difference_type}}||Signed integer | + | |{{tt|C::difference_type}}||Signed integer |
|Must be the same as {{tt|[[cpp/iterator/iterator_traits|iterator_traits]]::difference_type}} for {{tt|iterator}} and {{tt|const_iterator}} | |Must be the same as {{tt|[[cpp/iterator/iterator_traits|iterator_traits]]::difference_type}} for {{tt|iterator}} and {{tt|const_iterator}} | ||
|- | |- | ||
− | |{{tt|size_type}}||Unsigned integer||Large enough to represent all positive values of {{tt|difference_type}} | + | |{{tt|C::size_type}}||Unsigned integer||Large enough to represent all positive values of {{tt|difference_type}} |
|} | |} | ||
Revision as of 02:26, 31 July 2024
A Container is an object used to store other objects and taking care of the management of the memory used by the objects it contains.
Contents |
Requirements
Legend
-
T
, an element type; -
C
, a Container type containing elements of typeT
; - a and b, objects of type
C
; - i and j, values of (possibly const) type
C::iterator
; - rv, a prvalue expression of type
C
.
Member types
Name | Type | Requirements |
---|---|---|
C::value_type |
T |
CopyConstructible(until C++11)Erasable(since C++11) |
C::reference |
T& |
|
C::const_reference |
const T& | |
C::iterator |
Iterator whose value type is T |
LegacyForwardIterator convertible to const_iterator
|
C::const_iterator |
Constant iterator whose value type is T |
LegacyForwardIterator |
C::difference_type |
Signed integer | Must be the same as iterator_traits::difference_type for iterator and const_iterator
|
C::size_type |
Unsigned integer | Large enough to represent all positive values of difference_type
|
Member functions and operators
Expression | Return type | Semantics | Conditions | Complexity | ||||
---|---|---|---|---|---|---|---|---|
C() | C |
Creates an empty container | Post: C().empty() == true |
Constant | ||||
C(a) | C |
Creates a copy of a | Pre: T must be CopyInsertable Post: a == C(a) |
Linear | ||||
C(rv) (since C++11) |
C |
Moves rv | Post: equal to the value rv had before this construction | Constant[1] | ||||
a = b | C& |
Destroys or copy-assigns all elements of a from elements of b | Post: a == b | Linear | ||||
a = rv (since C++11) |
C& |
Destroys or move-assigns all elements of a from elements of rv | Post: if a and rv do not refer the same object, a is equal to the value rv had before this assignment | Linear | ||||
a.~C() | void | Destroys all elements of a and frees all memory | Linear | |||||
a.begin() | (const_)iterator |
Iterator to the first element of a | Constant | |||||
a.end() | (const_)iterator |
Iterator to one past the last element of a | Constant | |||||
a.cbegin() (since C++11) |
const_iterator |
const_cast<const C&>(a).begin() | Constant | |||||
a.cend() (since C++11) |
const_iterator |
const_cast<const C&>(a).end() | Constant | |||||
i <=> j (since C++20) |
strong_ordering |
Three-way comparison of container iterators | C::iterator meets the random access iterator requirements | Constant | ||||
a == b | Convertible to bool |
|
Pre: T must be EqualityComparable |
Constant[2] if a.size() != b.size(), linear otherwise | ||||
a != b | convertible to bool | !(a == b) | Linear | |||||
a.swap(b) | void | Exchanges the values of a and b | Constant[1][3] | |||||
swap(a, b) | void | a.swap(b) | Constant[1] | |||||
a.size() | size_type |
std::distance(a.begin(), a.end()) | Constant[3] | |||||
a.max_size() | size_type |
b.size() where b is the largest possible container | Constant[3] | |||||
a.empty() | Convertible to bool | a.begin() == a.end() | Constant | |||||
Notes | ||||||||
|
Given
-
i
andj
, objects of a container'siterator
type,
in the expressions i == j, i != j, i < j, i <= j, i >= j, i > j, i - j, either or both may be replaced by an object of the container's const_iterator
type referring to the same element with no change in semantics.
Optional container requirements (since C++20)
The following operations are provided only for some types of containers.
If the iterators passed to std::lexicographical_compare_three_way meet the ConstexprIterator then the operations described below are implemented by constexpr functions.
Category | Description |
---|---|
Expression | a <=> b |
Returns | std::lexicographical_compare_three_way(a.begin(), a.end(), b.begin(), b.end(), /*synth-three-way*/) |
Result | /*synth-three-way-result*/<C::value_type> |
Preconditions | Either T models three_way_comparable , or < is defined for values of (possibly const) type T and < is a total ordering relationship.
|
Complexity | Linear |
Container data races
Other requirements
C
(Container)
T
(Type)
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 179 | C++98 | iterator and const_iterator types might be incomparable
|
required to be comparable |
LWG 276 | C++98 | T was required to be CopyAssignable
|
T is required to beCopyConstructible |
LWG 322 | C++98 | the value types of iterator and const_iterator were not specified
|
specified as T
|
LWG 774 | C++98 | there was no requirement on swap(a, b) | added |
LWG 883 | C++98 | a.swap(b) was defined as swap(a, b), resulted in circular definition |
defined as exchanging the values of a and b |
LWG 1319 | C++98 | iterator and const_iterator might not have multipass guarantee |
they are required to satisfy the requirements of LegacyForwardIterator |
LWG 2263 | C++11 | the resolution of LWG issue 179 was accidentally dropped in C++11 | restored |
LWG 2839 | C++11 | self move assignment of standard containers was not allowed | allowed but the result is unspecified |
See also
C++ documentation for Containers library
|