Create const_iterator out of vector of pairs : vector sort « Vector « 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++ » Vector » vector sortScreenshots 
Create const_iterator out of vector of pairs
  
#include <algorithm>
#include <iostream>
#include <iterator>
#include <string>
#include <vector>
#include <utility>

using namespace std;

typedef pair<int,string> Pair;

inline bool less_than_secondconst Pair& b1, const Pair& b2 ){
   return b1.second < b2.second;
}

int main( )
{
   const char* names[] "A","B""C""D","E" };
   const int values[] 1820263041 };
   const int num_pairs = sizeofnames / sizeofnames[0] );

   vector<Pair> pairnum_pairs );
   transformvalues, values+num_pairs, names,pair.begin(), make_pair<int,string> );

   sortpair.begin(), pair.end() );

   sortpair.begin(), pair.end(), less_than_second );

   vector<Pair>::const_iterator pair_end = pair.end();
   forvector<Pair>::const_iterator i = pair.begin();
      i != pair_end; ++i )
   cout << i->second << " - $" << i->first << " values\n";
}
  
    
  
Related examples in the same category
1.Loop through a vector in a reversed order
2.Create const_reverse_iterator out of vector of pairs
3.sort a vector with duplicates
4.Sort elements in a vector with sort(scores.begin(), scores.end());
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.