What is std::map in C++11?

Can you explain what std::map is in C++11?

Sure! std::map is an associative container that stores elements in key-value pairs, where each key is unique.

How does std::map differ from std::unordered_map?

The main difference is that std::map is ordered and uses a binary tree for storage, while std::unordered_map is unordered and uses a hash table.

What are some common use cases for std::map?

Common use cases include counting occurrences of items, implementing dictionaries, and storing configuration settings.

Can you show me a simple example of using std::map?

Certainly! Here's a simple example:

#include <iostream>
#include <map>

int main() {
    std::map<std::string, int> ageMap;
    ageMap["Alice"] = 30;
    ageMap["Bob"] = 25;

    for (const auto& pair : ageMap) {
        std::cout << pair.first << " is " << pair.second << " years old.\n";
    }
    return 0;
}