std::deque<T,Allocator>::operator=
deque& operator=( const deque& other ); |
(1) | |
(2) | ||
deque& operator=( deque&& other ); |
(since C++11) (until C++17) |
|
deque& operator=( deque&& other ) noexcept(/* see below */); |
(since C++17) | |
deque& operator=( std::initializer_list<T> ilist ); |
(3) | (since C++11) |
Replaces the contents of the container.
other
.
If std::allocator_traits<allocator_type>::propagate_on_container_copy_assignment::value is true, the allocator of *this is replaced by a copy of that of |
(since C++11) |
other
using move semantics (i.e. the data in other
is moved from other
into this container). other
is in a valid but unspecified state afterwards.other
. If it is false and the allocators of *this and other
do not compare equal, *this cannot take ownership of the memory owned by other
and must move-assign each element individually, allocating additional memory using its own allocator as needed. In any case, all elements originally belong to *this are either destroyed or replaced by element-wise move-assignment.ilist
.Parameters
other | - | another container to use as data source |
ilist | - | initializer list to use as data source |
Return value
*this
Complexity
other
.other
.ilist
.Exceptions
May throw implementation-defined exceptions. |
(until C++17) |
1,3) May throw implementation-defined exceptions.
2) noexcept specification:
noexcept(std::allocator_traits<Allocator>::is_always_equal::value) |
(since C++17) |
Notes
After container move assignment (overload (2)), unless element-wise move assignment is forced by incompatible allocators, references, pointers, and iterators (other than the end iterator) to other
remain valid, but refer to elements that are now in *this. The current standard makes this guarantee via the blanket statement in [container.requirements.general]/12, and a more direct guarantee is under consideration via LWG 2321.
Example
The following code uses operator= to assign one std::deque to another:
#include <deque> #include <iostream> void display_sizes(const std::deque<int>& nums1, const std::deque<int>& nums2, const std::deque<int>& nums3) { std::cout << "nums1: " << nums1.size() << " nums2: " << nums2.size() << " nums3: " << nums3.size() << '\n'; } int main() { std::deque<int> nums1 {3, 1, 4, 6, 5, 9}; std::deque<int> nums2; std::deque<int> nums3; std::cout << "Initially:\n"; display_sizes(nums1, nums2, nums3); // copy assignment copies data from nums1 to nums2 nums2 = nums1; std::cout << "After assigment:\n"; display_sizes(nums1, nums2, nums3); // move assignment moves data from nums1 to nums3, // modifying both nums1 and nums3 nums3 = std::move(nums1); std::cout << "After move assigment:\n"; display_sizes(nums1, nums2, nums3); }
Output:
Initially: nums1: 6 nums2: 0 nums3: 0 After assigment: nums1: 6 nums2: 6 nums3: 0 After move assigment: nums1: 0 nums2: 6 nums3: 6
See also
constructs the deque (public member function) | |
assigns values to the container (public member function) |