What are some alternatives to std::map and std::set in C++17?

What are some alternatives to std::map and std::set in C++17?

In C++17, you can consider using std::unordered_map and std::unordered_set for better average performance on lookups.

What are the advantages of using unordered_map over map?

std::unordered_map offers average constant time complexity for lookups, while std::map has logarithmic time complexity.

Are there any other data structures I should consider?

Yes, you might also look into std::flat_map and std::flat_set, which can be more efficient for certain use cases.

When should I use flat_map instead of unordered_map?

Use std::flat_map when you have a small number of elements or when you need to maintain order, as it can be more cache-friendly.