stl merge使用

#include <cstdlib>#include <iostream>#include <list>#include <iterator>#include <vector>#include <algorithm>#include <string>using namespace std;typedef struct _NODE{ int id; string str; _NODE(int id, string str) : id(id), str(str){}; friend ostream& operator <<(ostream &os, const _NODE &nod) { return os << "(" << nod.id << ", " << nod.str << ")"; }}NODE;class cmp{public: bool operator()(const NODE &nod, const NODE &node) { return nod.id < node.id; }};template <typename T>void _printf(const T &begin, const T &end){ ostream_iterator<NODE> os(cout, " "); copy(begin, end, os); cout << endl;}int main(int argc, char *argv[]){ vector<NODE> vec1; vector<NODE> vec2; for(int i=0; i<5; i++) { vec1.push_back(NODE(rand() % 100, "first")); vec2.push_back(NODE(rand() % 100, "second")); } sort(vec1.begin(), vec1.end(), cmp()); sort(vec2.begin(), vec2.end(), cmp()); cout << "vec1 is: " << endl; _printf(vec1.begin(), vec1.end()); cout << "vec2 is: " << endl; _printf(vec2.begin(), vec2.end()); list<NODE> list1(vec1.begin(), vec1.end()); list<NODE> list2(vec2.begin(), vec2.end()); cout << "merge result is: " << endl; list1.merge(list2, cmp()); _printf(list1.begin(), list1.end()); system("PAUSE"); return EXIT_SUCCESS;} 

 

貌似泛型的merge不能指定predication函数， 所以还是用了list自己的merge函数...