p/container/dsc_set&action=edit)  
---|---  
[ map  ](/w/cpp/container/map "cpp/container/map") |  collection of key-value pairs, sorted by keys, keys are unique   
(class template)  [ [edit]
](https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/dsc_map&action=edit)  
[ multiset  ](/w/cpp/container/multiset "cpp/container/multiset") |  collection of keys, sorted by keys   
(class template)  [ [edit]
](https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/dsc_multiset&action=edit)  
[ multimap  ](/w/cpp/container/multimap "cpp/container/multimap") |  collection of key-value pairs, sorted by keys   
(class template)  [ [edit]
](https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/dsc_multimap&action=edit)  
  
###  [ [ edit ](/mwiki/index.php?title=cpp/container&action=edit&section=3
"Edit section: Unordered associative containers \(since C++11\)") ]  Unordered
associative containers  (since C++11)

Unordered associative containers implement unsorted (hashed) data structures
that can be quickly searched (  O(1)  average,  O(n)  worst-case complexity).

[ unordered_set  ](/w/cpp/container/unordered_set "cpp/container/unordered set") (C++11)  |  collection of unique keys, hashed by keys   
(class template)  [ [edit]
](https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/dsc_unordered_set&action=edit)  
---|---  
[ unordered_map  ](/w/cpp/container/unordered_map "cpp/container/unordered map") (C++11)  |  collection of key-value pairs, hashed by keys, keys are unique   
(class template)  [ [edit]
](https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/dsc_unordered_map&action=edit)  
[ unordered_multiset  ](/w/cpp/container/unordered_multiset "cpp/container/unordered multiset") (C++11)  |  collection of keys, hashed by keys   
(class template)  [ [edit]
](https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/dsc_unordered_multiset&action=edit)  
[ unordered_multimap  ](/w/cpp/container/unordered_multimap "cpp/container/unordered multimap") (C++11)  |  collection of key-value pairs, hashed by keys   
(class template)  [ [edit]
](https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/dsc_unordered_multimap&action=edit)  
  
###  [ [ edit ](/mwiki/index.php?title=cpp/container&action=edit&section=4
"Edit section: Container adaptors") ]  Container adaptors

Container adaptors provide a different interface for sequential containers.

[ stack  ](/w/cpp/container/stack "cpp/container/stack") |  adapts a container to provide stack (LIFO data structure)   
(class template)  [ [edit]
](https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/dsc_stack&action=edit)  
---|---  
[ queue  ](/w/cpp/container/queue "cpp/container/queue") |  adapts a container to provide queue (FIFO data structure)   
(class template)  [ [edit]
](https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/dsc_queue&action=edit)  
[ priority_queue  ](/w/cpp/container/priority_queue "cpp/container/priority queue") |  adapts a container to provide priority queue   
(class template)  [ [edit]
](https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/dsc_priority_queue&action=edit)  
[ flat_set  ](/w/cpp/container/flat_set "cpp/container/flat set") (C++23)  |  adapts a container to provide a collection of unique keys, sorted by keys   
(class template)  [ [edit]
](https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/dsc_flat_set&action=edit)  
[ flat_map  ](/w/cpp/container/flat_map "cpp/container/flat map") (C++23)  |  adapts two containers to provide a collection of key-value pairs, sorted by unique keys   
(class template)  [ [edit]
](https://en.cppreference.com/mwiki/index.php?title=Template:cpp/container/dsc_flat_map&action=edit)  
[ flat_multiset  ](/w/cpp/container/flat_multiset "cpp/container/flat multiset") (C++23)  |  adapts a container to provide a collection of