When dealing with `std::set` in C++, you might encounter situations where you need to iterate over the set while simultaneously modifying it (e.g., adding or removing elements). This can lead to undefined behavior if not handled carefully. Below is an example demonstrating a safe way to iterate through a `std::set` while modifying it.
#include
#include
int main() {
std::set mySet = {1, 2, 3, 4, 5};
for (auto it = mySet.begin(); it != mySet.end(); ) {
if (*it % 2 == 0) {
it = mySet.erase(it); // Safe modification
} else {
++it; // Only increment if not erasing
}
}
for (int num : mySet) {
std::cout << num << " ";
}
return 0;
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?