Demonstrate swap() for deque : Deque « Data Structure « C++

Home
C++
1.Bitset
2.Class
3.Console
4.Data Structure
5.Data Type
6.Deque
7.Development
8.File
9.Function
10.Generic
11.Language
12.List
13.Map Multimap
14.Overload
15.Pointer
16.Qt
17.Queue Stack
18.Set Multiset
19.STL Algorithms Binary search
20.STL Algorithms Heap
21.STL Algorithms Helper
22.STL Algorithms Iterator
23.STL Algorithms Merge
24.STL Algorithms Min Max
25.STL Algorithms Modifying sequence operations
26.STL Algorithms Non modifying sequence operations
27.STL Algorithms Sorting
28.STL Basics
29.String
30.Valarray
31.Vector
C++ » Data Structure » DequeScreenshots 
Demonstrate swap() for deque
Demonstrate swap() for deque


#include <iostream>
#include <deque>
using namespace std;

int main()
{
  deque<char> dequeObject1, dequeObject2;
  int i;

  for(i = 0; i <26; i++
     dequeObject1.push_back(i+'A');
  for(i = 0; i <10; i++
     dequeObject2.push_front(i+'0');

  cout << "Size of dequeObject1 and dequeObject2: ";
  cout << dequeObject1.size() << " " << dequeObject2.size() << endl;

  cout << "dequeObject1: ";
  for(i = 0; i <dequeObject1.size(); i++)
    cout << dequeObject1[i];
  cout << endl;

  cout << "dequeObject2: ";
  for(i = 0; i <dequeObject2.size(); i++)
    cout << dequeObject2[i];
  cout << "\n\n";

  // swap deques using member function.
  dequeObject1.swap(dequeObject2);

  cout << "Size of dequeObject1 and dequeObject2 after first swap: ";
  cout << dequeObject1.size() << " " << dequeObject2.size() << endl;

  cout << "dequeObject1 after first swap: ";
  for(i = 0; i <dequeObject1.size(); i++)
    cout << dequeObject1[i];
  cout << endl;

  cout << "dequeObject2 after first swap: ";
  for(i = 0; i <dequeObject2.size(); i++)
    cout << dequeObject2[i];
  cout << "\n\n";

  swap(dequeObject1, dequeObject2);

  cout << "Size of dequeObject1 and dequeObject2 after second swap: ";
  cout << dequeObject1.size() << " " << dequeObject2.size() << endl;

  cout << "dequeObject1 after second swap: ";
  for(i = 0; i <dequeObject1.size(); i++)
    cout << dequeObject1[i];
  cout << endl;

  cout << "dequeObject2 after second swap: ";
  for(i = 0; i <dequeObject2.size(); i++)
    cout << dequeObject2[i];
  cout << endl;

  return 0;
}


           
       
Related examples in the same category
1.One way to reverse-copy a deque.One way to reverse-copy a deque.
2.Use reverse iterators.Use reverse iterators.
3.Reverse iterators and copy.Reverse iterators and copy.
4.Assigning deque objects.Assigning deque objects.
5.Demonstrate resize() for dequeDemonstrate resize() for deque
6.Iterator values may change.Iterator values may change.
7.Demonstrate raw storage iteratorsDemonstrate raw storage iterators
8.Demonstrate a deque.Demonstrate a deque.
9.Deque: push, pop, sort, find, begin, end, insertDeque: push, pop, sort, find, begin, end, insert
java2s.com  | Contact Us | Privacy Policy
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.