When dealing with large datasets in C++, especially when using `std::vector`, it is crucial to iterate safely while modifying the collection. One common approach is to use iterators or indices carefully to ensure that the modifications do not invalidate the state of the iteration.
Here’s an example demonstrating how to safely iterate over a `std::vector` while modifying it:
// Example C++ code
#include
#include
void modifyVector(std::vector& vec) {
for (size_t i = 0; i < vec.size(); ) {
if (vec[i] % 2 == 0) { // If the element is even, remove it
vec.erase(vec.begin() + i); // Removes element
} else {
++i; // Move to the next element only if we didn't erase
}
}
}
int main() {
std::vector numbers = {1, 2, 3, 4, 5, 6, 7, 8, 9};
modifyVector(numbers);
for (const auto& num : numbers) {
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?