// C++14 example of return type deduction
#include
#include
auto add(int a, int b) {
return a + b; // The return type is deduced to int
}
auto get_vector() {
return std::vector{1, 2, 3}; // The return type is deduced to std::vector
}
int main() {
auto sum = add(5, 3);
std::cout << "Sum: " << sum << std::endl;
auto vec = get_vector();
std::cout << "Vector: ";
for (const auto& val : vec) {
std::cout << val << " ";
}
std::cout << 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?