Map, hash_map - mmm-yj/C-Learning GitHub Wiki

Maps are associative containers that store elements formed by a combination of a key value and a mapped value, following a specific order.

Unordered maps are associative containers that store elements formed by the combination of a key value and a mapped value, and which allows for fast retrieval of individual elements based on their keys.

• Associative： Elements in associative containers are referenced by their key and not by their absolute position in the container.
• Unordered： Unordered containers organize their elements using hash tables that allow for fast access to elements by their key.
• Map： Each element associates a key to a mapped value: Keys are meant to identify the elements whose main content is the mapped value.
• Unique keys： No two elements in the container can have equivalent keys.
• Allocator-aware： The container uses an allocator object to dynamically handle its storage needs.