In C++11, a range-based for loop provides a simple and elegant way to iterate over elements in a container like arrays, vectors, or any collection that supports iteration. This construct helps to avoid the complexities of traditional for loops and makes your code cleaner and easier to read.
Here is an example of using a range-based for loop:
#include
#include
int main() {
std::vector numbers = {1, 2, 3, 4, 5};
// Range-based for loop
for (int number : numbers) {
std::cout << number << " ";
}
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?