deque::swap | public member function |
void swap ( list<T,Allocator>& dqe ); |
Swap content
Exchanges the content of the vector by the content of dqe, which is another deque object containing elements of the same type. Sizes may differ.
After the call to this member function, the elements in this container are those which were in dqe before the call, and the elements of dqe are those which were in this. All iterators, references and pointers remain valid for the swapped objects.
Notice that a global algorithm function exists with this same name, swap, and the same behavior.
Parameters
- dqe
- Another deque container of the same type as this whose content is swapped with that of this container.
Return value
noneExample
// swap deques #include <iostream> #include <deque> using namespace std; main () { unsigned int i; deque<int> first (3,100); // three ints with a value of 100 deque<int> second (5,200); // five ints with a value of 200 first.swap(second); cout << "first contains:"; for (i=0; i<first.size(); i++) cout << " " << first[i]; cout << "\nsecond contains:"; for (i=0; i<second.size(); i++) cout << " " << second[i]; cout << endl; return 0; } |
Output:
first contains: 200 200 200 200 200 |
Complexity
Constant.See also
swap