Illustrating the generic swap_ranges algorithm : swap_ranges « STL Algorithms Modifying sequence operations « C++ Tutorial

Home
C++ Tutorial
1.Language Basics
2.Data Types
3.Operators statements
4.Array
5.Development
6.Exceptions
7.Function
8.Structure
9.Class
10.Operator Overloading
11.Pointer
12.File Stream
13.template
14.STL Introduction
15.string
16.vector
17.list
18.bitset
19.set multiset
20.valarray
21.queue stack
22.deque
23.map multimap
24.STL Algorithms Modifying sequence operations
25.STL Algorithms Non modifying sequence operations
26.STL Algorithms Binary search
27.STL Algorithms Sorting
28.STL Algorithms Merge
29.STL Algorithms Min Max
30.STL Algorithms Iterator
31.STL Algorithms Heap
32.STL Algorithms Helper
C / ANSI-C
C Tutorial
C++
Visual C++ .NET
C++ Tutorial » STL Algorithms Modifying sequence operations » swap_ranges 
24.22.1.Illustrating the generic swap_ranges algorithm
#include <iostream>
#include <cassert>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;


int main()
{
  string s("HELLO");
  string s2("THERE");

  vector<char> vector1(s.begin(), s.end());
  vector<char> vector2(s2.begin(), s2.end());

  // Swap the contents of vector1 and vector2:
  swap_ranges(vector1.begin(), vector1.end(), vector2.begin());



  for(int i=0;i<vector1.size();i++){
     cout << vector1[i;
  }
  cout << "\n\n\n\n\n";

  for(int i=0;i<vector2.size();i++){
     cout << vector2[i;
  }
  return 0;
}
THERE




HELLO
24.22.swap_ranges
24.22.1.Illustrating the generic swap_ranges algorithm
24.22.2.Swap elements in first five elements of an array with elements in last five elements
24.22.3.Use swap_ranges to swap elements in one container with corresponding elements in another container
24.22.4.Use swap_ranges to mirror first three with last three elements
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.