Can you provide advanced examples of C++11 sets?

Can you provide advanced examples of C++11 sets?

Sure! C++11 introduced several features for sets. Would you like to see examples of set operations or custom comparators?

I'd like to see examples of set operations.

Great! Here's an example of how to use union and intersection with sets:

#include <iostream>
#include <set>

int main() {
    std::set<int> setA = {1, 2, 3, 4};
    std::set<int> setB = {3, 4, 5, 6};

    // Union
    std::set<int> unionSet;
    std::set_union(setA.begin(), setA.end(), setB.begin(), setB.end(), std::inserter(unionSet, unionSet.begin()));

    // Intersection
    std::set<int> intersectionSet;
    std::set_intersection(setA.begin(), setA.end(), setB.begin(), setB.end(), std::inserter(intersectionSet, intersectionSet.begin()));

    std::cout << "Union: ";
    for (int num : unionSet) std::cout << num << " ";
    std::cout << "\nIntersection: ";
    for (int num : intersectionSet) std::cout << num << " ";
}

This code demonstrates how to perform union and intersection on two sets.

That's helpful! Can you explain how to use custom comparators with sets?

Absolutely! You can define a custom comparator by creating a struct or a lambda function. Here's an example using a struct:

#include <iostream>
#include <set>

struct CustomComparator {
    bool operator()(const int& a, const int& b) const {
        return a > b; // Sort in descending order
    }
};

int main() {
    std::set<int, CustomComparator> customSet = {1, 2, 3, 4};
    for (int num : customSet) std::cout << num << " "; // Outputs: 4 3 2 1
}

This will store the elements in descending order.