關聯容器set,multimap以及函式物件
阿新 • • 發佈:2019-01-07
//#include<bits/stdc++.h> #include<iostream> #include<cstdlib> #include<utility> #include<set> #include<map> #include<algorithm> #include<string> #include<vector> #include<list> #include<cmath> #include<functional> #include"windows.h" using namespace std; void show(const int n){ cout << n << " "; } bool Lower5(const int &n){return n > 5;}//利用謂詞來做remove_if()判斷 class Upperx { private: int bound; public: Upperx(const int &n) :bound(n){}; bool operator()(const int &value){ return value <= bound; }//過載運算子() }; int main() { string str1[] = { "beijing", "shanghai", "chongqing" }; string str2[] = { "nanjing", "heifei", "beijing" }; set<string>s1(str1, str1 + 3); cout << "Original s1: "; ostream_iterator<string,char>out(cout, " "); copy(s1.begin(), s1.end(), out); cout << endl; string str3 = "shenzhen"; set<string>s2(str2, str2 + 3); cout << "Original s2: "; copy(s2.begin(), s2.end(),out); cout << endl; s2.insert(str3);//集合原本就預設排序,所以不需要指定插入位置 cout << "After s2.insert(str3), s2: "; copy(s2.begin(), s2.end(), out); cout << endl; cout << "s1+s2="; set_union(s1.begin(), s1.end(), s2.begin(), s2.end(), out); cout << endl; cout << "s1^s2="; set_intersection(s1.begin(), s1.end(), s2.begin(), s2.end(), out); cout << endl; cout << "s1-s2="; set_difference(s1.begin(), s1.end(), s2.begin(), s2.end(), out); cout << endl; cout << "great_equal or great anhui: "; copy(s1.lower_bound("anhui"), s1.upper_bound("jiangsu"), ostream_iterator<string, char>(cout, " ")); cout << endl; multimap<int, string>mm; vector<pair<int, string>>v; v.push_back(pair<int, string>(8, "huainan")); v.push_back(pair<int, string>(12, "wuhu")); v.push_back(pair<int, string>(12, "huaibei")); mm.insert(pair<int, string>(12, "hefei")); mm.insert(v.begin(), v.end()); for (auto y : mm) cout << "No." << y.first << ",Name:"<<y.second << endl; cout << "the count of No.12: " << mm.count(12) << endl; pair<multimap<int, string>::iterator, multimap<int, string>::iterator>range = mm.equal_range(12); cout << "No.12: "; for (auto x = range.first; x != range.second; x++) cout << (*x).second<<" "; cout << endl; int num[] = { 3, 5, 6, 2, 7 }; list<int>li(num,num+5); cout << "Original list:"; for_each(li.begin(), li.end(), show); cout << endl; li.remove_if(Lower5); cout << "li.remove_if(Lower5):"; for_each(li.begin(), li.end(), show); cout << endl; li.insert(li.begin(), num, num + 5); Upperx Upper(5); li.remove_if(Upper);//利用類過載的()運算子 cout << "li.remove_if(Upper):"; for_each(li.begin(), li.end(), show); cout << endl; cout << "The first form of transform(one-elem function): "; transform(li.begin(), li.end(), ostream_iterator<double,char>(cout," "), sqrt<int>);//transform呼叫的一元函式 cout << endl; list<int>result; list<int>li2(num + 3, num + 5); cout << "The second form of transform(two-elem function): "; transform(li.begin(), li.end(), li2.begin(), insert_iterator<list<int>>(result, result.begin()), multiplies<int>()); copy(result.begin(), result.end(), ostream_iterator<int, char>(cout, " ")); cout << endl; cout << "The third form of transform(adaptive function->two-elem to one-elem): "; transform(li.begin(), li.end(), ostream_iterator<double, char>(cout, " "), bind1st(multiplies<double>(), 2.5)); cout << "\nDone!\n"; system("pause"); return 0; }
程式執行結果如下