Remove Elements from Ordered Containers

std::set is an ordered container, and removing elements from it while maintaining the sorted property can be done using the erase() method.

Since std::set automatically maintains order, you don't need to do anything special to keep it sorted after removal.

Here's an example of how to remove elements from a std::set:

1#include <iostream>
2#include <set>
3
4int main() {
5  std::set<int> Numbers{1, 2, 3, 4, 5, 6, 7, 8};
6
7  // Remove elements less than 3 or greater than 6
8  for (auto it = Numbers.begin(); it != Numbers.end();) {
9    if (*it < 3 || *it > 6) {
10      it = Numbers.erase(it); 
11    } else {
12      ++it;
13    }
14  }
15
16  // Display the result
17  std::cout << "Filtered elements in Numbers: ";
18  for (auto Num : Numbers) {
19    std::cout << Num << ", ";
20  }
21}

1Filtered elements in Numbers: 3, 4, 5, 6,

In this example:

• We iterate over the std::set using an iterator.
• The erase() method is used to remove elements that are less than 3 or greater than 6.
• The iterator is properly adjusted after each erase() call to ensure it remains valid.

Since std::set is always sorted, the remaining elements will still be in ascending order after the removal operation.

Removing Elements Based on Multiple Conditions

You can also use multiple conditions to remove elements from a std::set. Here's an example where we remove elements that are either odd or greater than 6:

1#include <iostream>
2#include <set>
3
4int main() {
5  std::set<int> Numbers{1, 2, 3, 4, 5, 6, 7, 8};
6
7  // Remove odd elements or elements greater than 6
8  for (auto it = Numbers.begin(); it != Numbers.end();) {
9    if (*it % 2 != 0 || *it > 6) {
10      it = Numbers.erase(it);  
11    } else {
12      ++it;
13    }
14  }
15
16  // Display the result
17  std::cout << "Filtered elements in Numbers: ";
18  for (auto Num : Numbers) {
19    std::cout << Num << ", ";
20  }
21}

1Filtered elements in Numbers: 2, 4, 6,

By using the erase() method and iterating through the std::set, you can effectively remove elements based on any condition while maintaining the container's inherent sorted property.

This method is efficient and leverages the ordered nature of std::set.