function template
<deque>

std::swap (deque)

template <class T, class Alloc>
  void swap (deque<T,Alloc>& x, deque<T,Alloc>& y);
Exchanges the contents of two deque containers
The contents of container x are exchanged with those of y. Both container objects must be of the same type (same template parameters), although sizes may differ.

After the call to this member function, the elements in x are those which were in y before the call, and the elements of y are those which were in x. All iterators, references and pointers remain valid for the swapped objects.

This is an overload of the generic algorithm swap that improves its performance by mutually transferring ownership over their assets to the other container (i.e., the containers exchange references to their data, without actually performing any element copy or movement): It behaves as if x.swap(y) was called.

Parameters

x,y
deque containers of the same type (i.e., having both the same template parameters, T and Alloc).

Return value

none

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
 
// swap (deque overload)
#include <iostream>
#include <deque>

main ()
{
  unsigned int i;
  std::deque<int> foo (3,100);   // three ints with a value of 100
  std::deque<int> bar (5,200);   // five ints with a value of 200

  swap(foo,bar);

  std::cout << "foo contains:";
  for (std::deque<int>::iterator it = foo.begin(); it!=foo.end(); ++it)
    std::cout << ' ' << *it;
  std::cout << '\n';

  std::cout << "bar contains:";
  for (std::deque<int>::iterator it = bar.begin(); it!=bar.end(); ++it)
    std::cout << ' ' << *it;
  std::cout << '\n';

  return 0;
}


Output:
foo contains: 200 200 200 200 200 
bar contains: 100 100 100

Complexity

Constant.

Iterator validity

All iterators, pointers and references referring to elements in both containers remain valid, and are now referring to the same elements they referred to before the call, but in the other container, where they now iterate.
Note that the end iterators do not refer to elements and may be invalidated.

Data races

Both containers, x and y, are modified.

Exception safety

If the allocators in both compare compare equal, or if their allocator traits indicate that the allocators shall propagate, the function never throws exceptions (no-throw guarantee).
Otherwise, it causes undefined behavior.

See also

deque::swap
Swap content (public member function )
swap
Exchange values of two objects (function template )
swap_ranges
Exchange values of two ranges (function template )

C++