#include <iostream>
#include <vector>
#include <thread>
void fill_vector(std::vector<int>& vec, int size) {
vec.reserve(size); // Reserve memory ahead of time
for (int i = 0; i < size; ++i) {
vec.push_back(i);
}
}
int main() {
const int size = 1000000;
std::vector<int> vec;
// Launch multiple threads to fill the vector
std::thread t1(fill_vector, std::ref(vec), size);
std::thread t2(fill_vector, std::ref(vec), size);
t1.join();
t2.join();
std::cout << "Vector size: " << vec.size() << std::endl;
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?