public member function
<deque>

std::deque::operator=

copy (1)
 deque& operator= (const deque& x);
copy (1)
deque& operator= (const deque& x);
move (2)
deque& operator= (deque&& x);
initializer list (3)
deque& operator= (initializer_list<value_type> il);
Assign content
Assigns new contents to the container, replacing its current contents, and modifying its size accordingly.

Copies all the elements from x into the container.

The container preserves its current allocator.
The copy assignment (1) copies all the elements from x into the container (with x preserving its contents).

The move assignment (2) moves the elements of x into the container (x is left in an unspecified but valid state).

The initializer list assignment (3) copies the elements of il into the container.

The container preserves its current allocator, except if the allocator traits indicate x's allocator should propagate. This allocator is used (through its traits) to allocate or deallocate if there are changes in storage requirements, and to construct or destroy elements, if needed.

Any elements held in the container before the call are either assigned to or destroyed.

Parameters

x
A deque object of the same type (i.e., with the same template parameters, T and Alloc).
il
An initializer_list object. The compiler will automatically construct such objects from initializer list declarators.
Member type value_type is the type of the elements in the container, defined in deque as an alias of its first template parameter (T).

Return value

*this

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
// assignment operator with deques
#include <iostream>
#include <deque>

int main ()
{
  std::deque<int> first (3);    // deque with 3 zero-initialized ints
  std::deque<int> second (5);   // deque with 5 zero-initialized ints

  second = first;
  first = std::deque<int>();

  std::cout << "Size of first: " << int (first.size()) << '\n';
  std::cout << "Size of second: " << int (second.size()) << '\n';
  return 0;
}


Output:
Size of first: 0
Size of second: 3

Complexity

Linear in size.

Iterator validity

All iterators, references and pointers related to this container before the call are invalidated.

In the move assignment, iterators, pointers and references referring to elements in x are also invalidated.

Data races

All copied elements are accessed.
The move assignment (2) modifies x.
The container and all its elements are modified.

Exception safety

Basic guarantee: if an exception is thrown, the container is in a valid state.
If allocator_traits::construct is not supported with the appropriate arguments for the element constructions, or if value_type is not copy assignable (or move assignable for (2)), it causes undefined behavior.

See also

  • 997351548 2018-02-20
  • 903691547 2018-02-20
  • 9127171546 2018-02-20
  • 2234751545 2018-02-20
  • 1685381544 2018-02-20
  • 911091543 2018-02-20
  • 9281021542 2018-02-20
  • 632231541 2018-02-20
  • 9751491540 2018-02-20
  • 8333621539 2018-02-20
  • 995001538 2018-02-20
  • 6477441537 2018-02-20
  • 511981536 2018-02-19
  • 2072881535 2018-02-19
  • 6024461534 2018-02-19
  • 7594061533 2018-02-19
  • 9311341532 2018-02-19
  • 4928331531 2018-02-19
  • 38561530 2018-02-19
  • 7776611529 2018-02-19