Using the STL generic reverse algorithm with a vector : reverse « STL Algorithms Modifying sequence operations « C++

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.  Queue Stack 17.  Set Multiset 18.  STL Algorithms Binary search 19.  STL Algorithms Heap 20.  STL Algorithms Helper 21.  STL Algorithms Iterator 22.  STL Algorithms Merge 23.  STL Algorithms Min Max 24.  STL Algorithms Modifying sequence operations 25.  STL Algorithms Non modifying sequence operations 26.  STL Algorithms Sorting 27.  STL Basics 28.  String 29.  Valarray 30.  Vector Microsoft Office Word 2007 Tutorial Java Java Tutorial Java Source Code / Java Documentation Java Open Source Jar File Download Java Articles Java Products Java by API C# / C Sharp C# / CSharp Tutorial ASP.Net JavaScript DHTML JavaScript Tutorial JavaScript Reference HTML / CSS HTML CSS Reference C / ANSI-C C Tutorial C++ Tutorial PHP Python SQL Server / T-SQL Oracle PL / SQL Oracle PL/SQL Tutorial PostgreSQL SQL / MySQL MySQL Tutorial VB.Net VB.Net Tutorial

C++ » STL Algorithms Modifying sequence operations » reverse Screenshots  Using the STL generic reverse algorithm with a vector     #include <iostream> #include <vector> #include <cassert> #include <algorithm> // For reverse using namespace std; template <typename Container> Container make(const char s[]) {   return Container(&s[0], &s[strlen(s)]); } int main() {   vector<char> vector1 = make< vector<char> >("abc");   reverse(vector1.begin(), vector1.end());   assert (vector1 == make< vector<char> >("cba"));   return 0; }             Related examples in the same category 1.  Use reverse to reverse the order of elements 2.  Use reverse to reverse order from second to last element but one 3.  Reverse the order of the found element with value 3 and all following elements

w_w__w_.___j__a___va__2___s__.__c_o_m__ | Contact Us

Copyright 2003 - 08 Demo Source and Support. All rights reserved.

All other trademarks are property of their respective owners.