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






#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