#include <iostream>
#include <vector>
#include <thread>
#include <mutex>
std::vector<int> vec = {1, 2, 3, 4, 5};
std::mutex mtx;
void removeEvenNumbers() {
std::lock_guard<std::mutex> lock(mtx);
vec.erase(std::remove_if(vec.begin(), vec.end(), [](int n) { return n % 2 == 0; }), vec.end());
}
int main() {
std::thread t1(removeEvenNumbers);
t1.join();
for (int n : vec) {
std::cout << n << " ";
}
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?