The 24 days

The C++ Stanndard Library/STL容器/CPP/set1.cpp

@@ -0,0 +1,55 @@
+#include <iostream>
+#include <set>
+#include <algorithm>
+#include <iterator>
+using namespace std;
+
+int main()
+{
+    // type of the collection:
+    // - no duplicates
+    // - elements are integral values
+    // - descending order
+    set<int,greater<int>> coll1;
+
+    // insert elements in random order using different member functions
+    coll1.insert({4,3,5,1,6,2});
+    coll1.insert(5);
+
+    // print all elements
+    for (int elem : coll1) {
+        cout << elem << ' ';
+    }
+    cout << endl;
+
+    // insert 4 again and process return value
+    auto status = coll1.insert(4);
+    if (status.second) {
+        cout << "4 inserted as element "
+             << distance(coll1.begin(),status.first) + 1 << endl;
+    }
+    else {
+        cout << "4 already exists" << endl;
+    }
+
+    // assign elements to another set with ascending order
+    set<int> coll2(coll1.cbegin(),coll1.cend());
+
+    // print all elements of the copy using stream iterators
+    copy (coll2.cbegin(), coll2.cend(),
+          ostream_iterator<int>(cout," "));
+    cout << endl;
+
+    // remove all elements up to element with value 3
+    coll2.erase (coll2.begin(), coll2.find(3));
+
+    // remove all elements with value 5
+    int num;
+    num = coll2.erase (5);
+    cout << num << " element(s) removed" << endl;
+
+    // print all elements
+    copy (coll2.cbegin(), coll2.cend(),
+          ostream_iterator<int>(cout," "));
+    cout << endl;
+}

The C++ Stanndard Library/STL容器/CPP/unordmultiset1.cpp

@@ -0,0 +1,14 @@
+#include <unordered_set>
+#include <iostream>
+#include "buckets.hpp"
+
+int main()
+{
+    // create and initialize an unordered set
+    std::unordered_set<int> intset = { 1,2,3,5,7,11,13,17,19 };
+    printHashTableState(intset);
+
+    // insert some additional values (might cause rehashing)
+    intset.insert({-7,17,33,4});
+    printHashTableState(intset);
+}