std::deque::operator=(3)
π std::deque::operator=(3) π
okay bestie, so this one's straight out of the C++ Standard Libary manual (page 3, mwah) β it's the assignment operator for std::deque, and it's literally the glow-up button for your container. It replaces the contents of the container. That's it, that's the whole vibe. π
β¨ SYNOPSIS β¨
deque& operator=( const deque& other ); (1)
deque& operator=( deque&& other ); (2)
(since C++11)
(until C++17)
deque& operator=( deque&& other ) noexcept(/* see below */); (2)
(since C++17)
deque& operator=( std::initializer_list<value_type> ilist ); (3)
(since C++11)
Replaces the contents of the container. no cap, that's the entire job description π«Ά
πΈ DESCRIPTION πΈ
1) the copy assignment operator bestie β it replaces the contents with a copy of the contents of other. π
so here's the tea: if std::allocator_traits<allocator_type>::propagate_on_container_copy_assignment::value is true, then the allocator of *this gets replaced by a copy of other. and if the allocator of *this after assignment would compare unequal to its old value, the old allocator is used to deallocate the memory, and then the new allocator is used to allocate it before copying the elements (that part's (since C++11)). otherwise, the memory owned by *this may be reused when possible. and in any case, the elements originally belonging to *this may be either destroyed or replaced by element-wise copy-assignment. either way they're not sticking around as-is, periodt π
2) the move assignment operator π₯ β it replaces the contents with those of other using move semantics (i.e. the data in other is moved from other into this container). other is left in a valid but unspecified state afterwards. very "we don't know her anymore" of it.
if std::allocator_traits<allocator_type>::propagate_on_container_move_assignment::value is true, the allocator of *this is replaced by a copy of that of other. if it's 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. and in any case, all elements originally belonging to *this are either destroyed or replaced by element-wise move-assignment. π€
3) replaces the contents with those identified by initializer list ilist. little braced-list moment, we love her π
π PARAMETERS π
otherβ another container to use as data source πilistβ initializer list to use as data source β¨
β RETURN VALUE β
*this β and honestly? iconic. returns herself. main character energy π
π¦ COMPLEXITY π¦
- Linear in the size of
*thisandother. - Linear in the size of
*thisunless the allocators do not compare equal and do not propagate, in which case linear in the size of*thisandother. - Linear in the size of
*thisandilist.
π EXCEPTIONS π
1-3) May throw implementation-defined exceptions. (until C++17)
1,3) May throw implementation-defined exceptions.
- (since C++17) β noexcept specification:
noexcept(std::allocator_traits<Allocator>::is_always_equal::value)
bestie please actually read thatnoexceptclause, it depends entirely onis_always_equalβ don't just assume it's a no-throw situation π
π§ 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.reqmts]/67, and a more direct guarantee is under consideration via LWG issue 2321. iykyk π
π EXAMPLE π
the following code uses operator= to assign one std::deque to another:
// Run this code
#include <initializer_list>
#include <iostream>
#include <iterator>
#include <deque>
void print(auto const comment, auto const& container)
{
auto size = std::size(container);
std::cout << comment << "{ ";
for (auto const& element : container)
std::cout << element << (--size ? ", " : " ");
std::cout << "}\n";
}
int main()
{
std::deque<int> x{1, 2, 3}, y, z;
const auto w = {4, 5, 6, 7};
std::cout << "Initially:\n";
print("x = ", x);
print("y = ", y);
print("z = ", z);
std::cout << "Copy assignment copies data from x to y:\n";
y = x;
print("x = ", x);
print("y = ", y);
std::cout << "Move assignment moves data from x to z, modifying both x and z:\n";
z = std::move(x);
print("x = ", x);
print("z = ", z);
std::cout << "Assignment of initializer_list w to z:\n";
z = w;
print("w = ", w);
print("z = ", z);
}
Output
Initially:
x = { 1, 2, 3 }
y = { }
z = { }
Copy assignment copies data from x to y:
x = { 1, 2, 3 }
y = { 1, 2, 3 }
Move assignment moves data from x to z, modifying both x and z:
x = { }
z = { 1, 2, 3 }
Assignment of initializer_list w to z:
w = { 4, 5, 6, 7 }
z = { 4, 5, 6, 7 }
see how x literally gets emptied into z? ate and left no crumbs π
π SEE ALSO π
constructorβ constructs the deque (public member function)assignβ assigns values to the container (public member function)
Category
- conditionally
noexcept
β¦ and that's the whole page, bestie β¦ source/version http://cppreference.com, dated 2024.06.10, filed under std::deque::operator=(3) β go forth and assign responsibly ππ¦β¨
π¦ where this page comes from
- nixpkgs unstable: stdman 2024.07.05
- opensuse-leap 16.0: stdman 2024.07.05-bp160.1.9 Β· MIT
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms