Standard library header <unordered_map> (C++11)
From cppreference.net
Cet en-tête fait partie de la bibliothèque de conteneurs .
Inclusions |
||
|
(C++20)
|
Opérateur de comparaison à trois voies support | |
|
(C++11)
|
std::initializer_list modèle de classe | |
Classes |
||
|
(C++11)
|
collection de paires clé-valeur, hachée par clés, clés uniques
(modèle de classe) |
|
|
(C++11)
|
collection de paires clé-valeur, hachée par clés
(modèle de classe) |
|
Fonctions |
||
|
(C++11)
(C++11)
(supprimé en C++20)
|
compare les valeurs dans l'unordered_map
(modèle de fonction) |
|
|
(C++11)
|
spécialise l'algorithme
std::swap
(modèle de fonction) |
|
|
(C++20)
|
efface tous les éléments satisfaisant des critères spécifiques
(modèle de fonction) |
|
|
(C++11)
(C++11)
(removed in C++20)
|
compare les valeurs dans le unordered_multimap
(modèle de fonction) |
|
|
spécialise l'algorithme
std::swap
(modèle de fonction) |
||
|
efface tous les éléments satisfaisant des critères spécifiques
(modèle de fonction) |
||
Accès aux plages |
||
|
(C++11)
(C++14)
|
retourne un itérateur vers le début d'un conteneur ou d'un tableau
(fonction template) |
|
|
(C++11)
(C++14)
|
retourne un itérateur vers la fin d'un conteneur ou d'un tableau
(modèle de fonction) |
|
|
(C++14)
|
retourne un itérateur inverse vers le début d'un conteneur ou d'un tableau
(modèle de fonction) |
|
|
(C++14)
|
retourne un itérateur de fin inverse pour un conteneur ou un tableau
(modèle de fonction) |
|
|
(C++17)
(C++20)
|
renvoie la taille d'un conteneur ou d'un tableau
(modèle de fonction) |
|
|
(C++17)
|
vérifie si le conteneur est vide
(modèle de fonction) |
|
|
(C++17)
|
obtient le pointeur vers le tableau sous-jacent
(fonction template) |
|
Synopsis
#include <compare> #include <initializer_list> namespace std { // modèle de classe unordered_map template<class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, class Alloc = allocator<pair<const Key, T>>> class unordered_map; // modèle de classe unordered_multimap template<class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, class Alloc = allocator<pair<const Key, T>>> class unordered_multimap; template<class Key, class T, class Hash, class Pred, class Alloc> bool operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& a, const unordered_map<Key, T, Hash, Pred, Alloc>& b); template<class Key, class T, class Hash, class Pred, class Alloc> bool operator==(const unordered_multimap<Key, T, Hash, Pred, Alloc>& a, const unordered_multimap<Key, T, Hash, Pred, Alloc>& b); template<class Key, class T, class Hash, class Pred, class Alloc> void swap(unordered_map<Key, T, Hash, Pred, Alloc>& x, unordered_map<Key, T, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); template<class Key, class T, class Hash, class Pred, class Alloc> void swap( unordered_multimap<Key, T, Hash, Pred, Alloc>& x, unordered_multimap<Key, T, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); // effacement pour unordered_map template<class K, class T, class H, class P, class A, class Predicate> typename unordered_map<K, T, H, P, A>::size_type erase_if( unordered_map<K, T, H, P, A>& c, Predicate pred); // effacement pour unordered_multimap template<class K, class T, class H, class P, class A, class Predicate> typename unordered_multimap<K, T, H, P, A>::size_type erase_if( unordered_multimap<K, T, H, P, A>& c, Predicate pred); namespace pmr { template<class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>> using unordered_map = std::unordered_map<Key, T, Hash, Pred, polymorphic_allocator<pair<const Key, T>>>; template<class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>> using unordered_multimap = std:: unordered_multimap<Key, T, Hash, Pred, polymorphic_allocator<pair<const Key, T>>>; } }
Modèle de classe std::unordered_map
namespace std { template<class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, class Allocator = allocator<pair<const Key, T>>> class unordered_map { public: // types using key_type = Key; using mapped_type = T; using value_type = pair<const Key, T>; using hasher = Hash; using key_equal = Pred; using allocator_type = Allocator; using pointer = typename allocator_traits<Allocator>::pointeur; using const_pointer = typename allocator_traits<Allocator>::const_pointer; using reference = value_type&; using const_reference = const value_type&; using size_type = /* défini par l'implémentation */; using difference_type = /* défini par l'implémentation */; using iterator = /* défini par l'implémentation */; using const_iterator = /* défini par l'implémentation */; using local_iterator = /* défini par l'implémentation */; using const_local_iterator = /* défini par l'implémentation */; using node_type = /* non spécifié */; using insert_return_type = /*insert-return-type*/<iterator, node_type>; // construction/copie/destruction unordered_map(); explicit unordered_map(size_type n, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); template<class InputIter> unordered_map(InputIter f, InputIter l, size_type n = /* voir description */, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); template<container-compatible-range<value_type> R> unordered_map(from_range_t, R&& rg, size_type n = /* voir description */, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); unordered_map(const unordered_map&); unordered_map(unordered_map&&); explicit unordered_map(const Allocator&); unordered_map(const unordered_map&, const type_identity_t<Allocator>&); unordered_map(unordered_map&&, const type_identity_t<Allocator>&); unordered_map(initializer_list<value_type> il, size_type n = /* voir description */, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); unordered_map(size_type n, const allocator_type& a) : unordered_map(n, hasher(), key_equal(), a) { } unordered_map(size_type n, const hasher& hf, const allocator_type& a) : unordered_map(n, hf, key_equal(), a) { } template<class InputIter> unordered_map(InputIter f, InputIter l, size_type n, const allocator_type& a) : unordered_map(f, l, n, hasher(), key_equal(), a) { } template<class InputIter> unordered_map(InputIter f, InputIter l, size_type n, const hasher& hf, const allocator_type& a) : unordered_map(f, l, n, hf, key_equal(), a) { } template<container-compatible-range<value_type> R> unordered_map(from_range_t, R&& rg, size_type n, const allocator_type& a) : unordered_map(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } template<container-compatible-range<value_type> R> unordered_map(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a) : unordered_map(from_range, std::forward<R>(rg), n, hf, key_equal(), a) { } unordered_map(initializer_list<value_type> il, size_type n, const allocator_type& a) : unordered_map(il, n, hasher(), key_equal(), a) { } unordered_map(initializer_list<value_type> il, size_type n, const hasher& hf, const allocator_type& a) : unordered_map(il, n, hf, key_equal(), a) { } ~unordered_map(); unordered_map& operator=(const unordered_map&); unordered_map& operator=(unordered_map&&) noexcept( allocator_traits<Allocator>::is_always_equal::value&& is_nothrow_move_assignable_v<Hash>&& is_nothrow_move_assignable_v<Pred>); unordered_map& operator=(initializer_list<value_type>); allocator_type get_allocator() const noexcept; // itérateurs iterator begin() noexcept; const_iterator begin() const noexcept; iterator end() noexcept; const_iterator end() const noexcept; const_iterator cbegin() const noexcept; const_iterator cend() const noexcept; // capacité bool empty() const noexcept; size_type size() const noexcept; size_type max_size() const noexcept; // modificateurs template<class... Args> pair<iterator, bool> emplace(Args&&... args); template<class... Args> iterator emplace_hint(const_iterator position, Args&&... args); pair<iterator, bool> insert(const value_type& obj); pair<iterator, bool> insert(value_type&& obj); template<class P> pair<iterator, bool> insert(P&& obj); iterator insert(const_iterator hint, const value_type& obj); iterator insert(const_iterator hint, value_type&& obj); template<class P> iterator insert(const_iterator hint, P&& obj); template<class InputIter> void insert(InputIter first, InputIter last); template<container-compatible-range<value_type> R> void insert_range(R&& rg); void insert(initializer_list<value_type>); node_type extract(const_iterator position); node_type extract(const key_type& x); template<class K> node_type extract(K&& x); insert_return_type insert(node_type&& nh); iterator insert(const_iterator hint, node_type&& nh); template<class... Args> pair<iterator, bool> try_emplace(const key_type& k, Args&&... args); template<class... Args> pair<iterator, bool> try_emplace(key_type&& k, Args&&... args); template<class K, class... Args> pair<iterator, bool> try_emplace(K&& k, Args&&... args); template<class... Args> iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args); template<class... Args> iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args); template<class K, class... Args> iterator try_emplace(const_iterator hint, K&& k, Args&&... args); template<class M> pair<iterator, bool> insert_or_assign(const key_type& k, M&& obj); template<class M> pair<iterator, bool> insert_or_assign(key_type&& k, M&& obj); template<class K, class M> pair<iterator, bool> insert_or_assign(K&& k, M&& obj); template<class M> iterator insert_or_assign(const_iterator hint, const key_type& k, M&& obj); template<class M> iterator insert_or_assign(const_iterator hint, key_type&& k, M&& obj); template<class K, class M> iterator insert_or_assign(const_iterator hint, K&& k, M&& obj); iterator erase(iterator position); iterator erase(const_iterator position); size_type erase(const key_type& k); template<class K> size_type erase(K&& x); iterator erase(const_iterator first, const_iterator last); void swap(unordered_map&) noexcept( allocator_traits<Allocator>::is_always_equal::value&& is_nothrow_swappable_v<Hash>&& is_nothrow_swappable_v<Pred>); void clear() noexcept; template<class H2, class P2> void merge(unordered_map<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_map<Key, T, H2, P2, Allocator>&& source); template<class H2, class P2> void merge(unordered_multimap<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_multimap<Key, T, H2, P2, Allocator>&& source); // observateurs hasher hash_function() const; key_equal key_eq() const; // opérations de map iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class K> iterator find(const K& k); template<class K> const_iterator find(const K& k) const; size_type count(const key_type& k) const; template<class K> size_type count(const K& k) const; bool contains(const key_type& k) const; template<class K> bool contains(const K& k) const; pair<iterator, iterator> equal_range(const key_type& k); pair<const_iterator, const_iterator> equal_range(const key_type& k) const; template<class K> pair<iterator, iterator> equal_range(const K& k); template<class K> pair<const_iterator, const_iterator> equal_range(const K& k) const; // accès aux éléments mapped_type& operator[](const key_type& k); mapped_type& operator[](key_type&& k); template<class K> mapped_type& operator[](K&& k); mapped_type& at(const key_type& k); const mapped_type& at(const key_type& k) const; template<class K> mapped_type& at(const K& k); template<class K> const mapped_type& at(const K& k) const; // interface de bucket size_type bucket_count() const noexcept; size_type max_bucket_count() const noexcept; size_type bucket_size(size_type n) const; size_type bucket(const key_type& k) const; template<class K> size_type bucket(const K& k) const; local_iterator begin(size_type n); const_local_iterator begin(size_type n) const; local_iterator end(size_type n); const_local_iterator end(size_type n) const; const_local_iterator cbegin(size_type n) const; const_local_iterator cend(size_type n) const; // politique de hachage float load_factor() const noexcept; float max_load_factor() const noexcept; void max_load_factor(float z); void rehash(size_type n); void reserve(size_type n); }; template<class InputIter, class Hash = hash</*iter-key-type*/<InputIter>>, class Pred = equal_to</*iter-key-type*/<InputIter>>, class Allocator = allocator</*iter-to-alloc-type*/<InputIter>>> unordered_map(InputIter, InputIter, typename /* voir description */ ::size_type = /* voir description */, Hash = Hash(), Pred = Pred(), Allocator = Allocator()) -> unordered_map</*iter-key-type*/<InputIter>, /*iter-mapped-type*/<InputIter>, Hash, Pred, Allocator>; template<ranges::input_range R, class Hash = hash</*range-key-type*/<R>>, class Pred = equal_to</*range-key-type*/<R>>, class Allocator = allocator</*range-to-alloc-type*/<R>>> unordered_map(from_range_t, R&&, typename /* voir description */ ::size_type = /* voir description */, Hash = Hash(), Pred = Pred(), Allocator = Allocator()) -> unordered_map</*range-key-type*/<R>, /*type à plage mappée*/<R>, Hash, Pred, Allocator>; template<class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, class Allocator = allocator<pair<const Key, T>>> unordered_map(initializer_list<pair<Key, T>>, typename /* voir description */ ::size_type = /* voir description */, Hash = Hash(), Pred = Pred(), Allocator = Allocator()) -> unordered_map<Key, T, Hash, Pred, Allocator>; template<class InputIter, class Allocator> unordered_map(InputIter, InputIter, typename /* voir description */ ::size_type, Allocator) -> unordered_map</*iter-key-type*/<InputIter>, /*type-mappé-iter*/<InputIter>, hash</*iter-key-type*/<InputIter>>, equal_to</*iter-key-type*/<InputIter>>, Allocator>; template<class InputIter, class Allocator> unordered_map(InputIter, InputIter, Allocator) -> unordered_map</*iter-key-type*/<InputIter>, /*iter-mapped-type*/<InputIter>, hash</*iter-key-type*/<InputIter>>, equal_to</*iter-key-type*/<InputIter>>, Allocator>; template<class InputIter, class Hash, class Allocator> unordered_map(InputIter, InputIter, typename /* voir description */ ::size_type, Hash, Allocator) -> unordered_map</*iter-key-type*/<InputIter>, /*type mappé de l'itérateur*/<InputIter>, Hash, equal_to</*iter-key-type*/<InputIter>>, Allocator>; template<ranges::input_range R, class Allocator> unordered_map(from_range_t, R&&, typename /* voir description */ ::size_type, Allocator) -> unordered_map</*range-key-type*/<R>, /*type à plage mappée*/<R>, hash</*range-key-type*/<R>>, equal_to</*range-key-type*/<R>>, Allocator>; template<ranges::input_range R, class Allocator> unordered_map(from_range_t, R&&, Allocator) -> unordered_map</*range-key-type*/<R>, /*type à plage mappée*/<R>, hash</*range-key-type*/<R>>, equal_to</*range-key-type*/<R>>, Allocator>; template<ranges::input_range R, class Hash, class Allocator> unordered_map(from_range_t, R&&, typename /* voir description */ ::size_type, Hash, Allocator) -> unordered_map</*range-key-type*/<R>, /*range-mapped-type*/<R>, Hash, equal_to</*range-key-type*/<R>>, Allocator>; template<class Key, class T, class Allocator> unordered_map(initializer_list<pair<Key, T>>, typename /* voir description */ ::size_type, Allocator) -> unordered_map<Key, T, hash<Key>, equal_to<Key>, Allocator>; template<class Key, class T, class Allocator> unordered_map(initializer_list<pair<Key, T>>, Allocator) -> unordered_map<Key, T, hash<Key>, equal_to<Key>, Allocator>; template<class Key, class T, class Hash, class Allocator> unordered_map(initializer_list<pair<Key, T>>, typename /* voir description */ ::size_type, Hash, Allocator) -> unordered_map<Key, T, Hash, equal_to<Key>, Allocator>; }
Modèle de classe std::unordered_multimap
namespace std { template<class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, class Allocator = allocator<pair<const Key, T>>> class unordered_multimap { public: // types using key_type = Key; using mapped_type = T; using value_type = pair<const Key, T>; using hasher = Hash; using key_equal = Pred; using allocator_type = Allocator; using pointer = typename allocator_traits<Allocator>::pointeur; using const_pointer = typename allocator_traits<Allocator>::const_pointer; using reference = value_type&; using const_reference = const value_type&; using size_type = /* défini par l'implémentation */; using difference_type = /* défini par l'implémentation */; using iterator = /* défini par l'implémentation */; using const_iterator = /* défini par l'implémentation */; using local_iterator = /* défini par l'implémentation */; using const_local_iterator = /* défini par l'implémentation */; using node_type = /* non spécifié */; // construction/copie/destruction unordered_multimap(); explicit unordered_multimap(size_type n, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); template<class InputIter> unordered_multimap(InputIter f, InputIter l, size_type n = /* voir description */, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); template<container-compatible-range<value_type> R> unordered_multimap(from_range_t, R&& rg, size_type n = /* voir description */, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); unordered_multimap(const unordered_multimap&); unordered_multimap(unordered_multimap&&); explicit unordered_multimap(const Allocator&); unordered_multimap(const unordered_multimap&, const type_identity_t<Allocator>&); unordered_multimap(unordered_multimap&&, const type_identity_t<Allocator>&); unordered_multimap(initializer_list<value_type> il, size_type n = /* voir description */, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); unordered_multimap(size_type n, const allocator_type& a) : unordered_multimap(n, hasher(), key_equal(), a) { } unordered_multimap(size_type n, const hasher& hf, const allocator_type& a) : unordered_multimap(n, hf, key_equal(), a) { } template<class InputIter> unordered_multimap(InputIter f, InputIter l, size_type n, const allocator_type& a) : unordered_multimap(f, l, n, hasher(), key_equal(), a) { } template<class InputIter> unordered_multimap(InputIter f, InputIter l, size_type n, const hasher& hf, const allocator_type& a) : unordered_multimap(f, l, n, hf, key_equal(), a) { } template<container-compatible-range<value_type> R> unordered_multimap(from_range_t, R&& rg, size_type n, const allocator_type& a) : unordered_multimap(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } template<container-compatible-range<value_type> R> unordered_multimap(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a) : unordered_multimap(from_range, std::forward<R>(rg), n, hf, key_equal(), a) { } unordered_multimap(initializer_list<value_type> il, size_type n, const allocator_type& a) : unordered_multimap(il, n, hasher(), key_equal(), a) { } unordered_multimap(initializer_list<value_type> il, size_type n, const hasher& hf, const allocator_type& a) : unordered_multimap(il, n, hf, key_equal(), a) { } ~unordered_multimap(); unordered_multimap& operator=(const unordered_multimap&); unordered_multimap& operator=(unordered_multimap&&) noexcept( allocator_traits<Allocator>::is_always_equal::value&& is_nothrow_move_assignable_v<Hash>&& is_nothrow_move_assignable_v<Pred>); unordered_multimap& operator=(initializer_list<value_type>); allocator_type get_allocator() const noexcept; // itérateurs iterator begin() noexcept; const_iterator begin() const noexcept; iterator end() noexcept; const_iterator end() const noexcept; const_iterator cbegin() const noexcept; const_iterator cend() const noexcept; // capacité bool empty() const noexcept; size_type size() const noexcept; size_type max_size() const noexcept; // modificateurs template<class... Args> iterator emplace(Args&&... args); template<class... Args> iterator emplace_hint(const_iterator position, Args&&... args); iterator insert(const value_type& obj); iterator insert(value_type&& obj); template<class P> iterator insert(P&& obj); iterator insert(const_iterator hint, const value_type& obj); iterator insert(const_iterator hint, value_type&& obj); template<class P> iterator insert(const_iterator hint, P&& obj); template<class InputIter> void insert(InputIter first, InputIter last); template<container-compatible-range<value_type> R> void insert_range(R&& rg); void insert(initializer_list<value_type>); node_type extract(const_iterator position); node_type extract(const key_type& x); template<class K> node_type extract(K&& x); iterator insert(node_type&& nh); iterator insert(const_iterator hint, node_type&& nh); iterator erase(iterator position); iterator erase(const_iterator position); size_type erase(const key_type& k); template<class K> size_type erase(K&& x); iterator erase(const_iterator first, const_iterator last); void swap(unordered_multimap&) noexcept( allocator_traits<Allocator>::is_always_equal::value&& is_nothrow_swappable_v<Hash>&& is_nothrow_swappable_v<Pred>); void clear() noexcept; template<class H2, class P2> void merge(unordered_multimap<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_multimap<Key, T, H2, P2, Allocator>&& source); template<class H2, class P2> void merge(unordered_map<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_map<Key, T, H2, P2, Allocator>&& source); // observateurs hasher hash_function() const; key_equal key_eq() const; // opérations de map iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class K> iterator find(const K& k); template<class K> const_iterator find(const K& k) const; size_type count(const key_type& k) const; template<class K> size_type count(const K& k) const; bool contains(const key_type& k) const; template<class K> bool contains(const K& k) const; pair<iterator, iterator> equal_range(const key_type& k); pair<const_iterator, const_iterator> equal_range(const key_type& k) const; template<class K> pair<iterator, iterator> equal_range(const K& k); template<class K> pair<const_iterator, const_iterator> equal_range(const K& k) const; // interface de bucket size_type bucket_count() const noexcept; size_type max_bucket_count() const noexcept; size_type bucket_size(size_type n) const; size_type bucket(const key_type& k) const; template<class K> size_type bucket(const K& k) const; local_iterator begin(size_type n); const_local_iterator begin(size_type n) const; local_iterator end(size_type n); const_local_iterator end(size_type n) const; const_local_iterator cbegin(size_type n) const; const_local_iterator cend(size_type n) const; // politique de hachage float load_factor() const noexcept; float max_load_factor() const noexcept; void max_load_factor(float z); void rehash(size_type n); void reserve(size_type n); }; template<class InputIter, class Hash = hash</*iter-key-type*/<InputIter>>, class Pred = equal_to</*iter-key-type*/<InputIter>>, class Allocator = allocator</*iter-to-alloc-type*/<InputIter>>> unordered_multimap(InputIter, InputIter, typename /* voir description */ ::size_type = /* voir description */, Hash = Hash(), Pred = Pred(), Allocator = Allocator()) -> unordered_multimap</*iter-key-type*/<InputIter>, /*type-mappé-iter*/<InputIter>, Hash, Pred, Allocator>; template<ranges::input_range R, class Hash = hash</*range-key-type*/<R>>, class Pred = equal_to</*range-key-type*/<R>>, class Allocator = allocator</*range-to-alloc-type*/<R>>> unordered_multimap(from_range_t, R&&, typename /* voir description */ ::size_type = /* voir description */, Hash = Hash(), Pred = Pred(), Allocator = Allocator()) -> unordered_multimap</*range-key-type*/<R>, /*range-mapped-type*/<R>, Hash, Pred, Allocator>; template<class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, class Allocator = allocator<pair<const Key, T>>> unordered_multimap(initializer_list<pair<Key, T>>, typename /* voir description */ ::size_type = /* voir description */, Hash = Hash(), Pred = Pred(), Allocator = Allocator()) -> unordered_multimap<Key, T, Hash, Pred, Allocator>; template<class InputIter, class Allocator> unordered_multimap(InputIter, InputIter, typename /* voir description */ ::size_type, Allocator) -> unordered_multimap</*iter-key-type*/<InputIter>, /*type-mappé-iter*/<InputIter>, hash</*iter-key-type*/<InputIter>>, equal_to</*iter-key-type*/<InputIter>>, Allocator>; template<class InputIter, class Allocator> unordered_multimap(InputIter, InputIter, Allocator) -> unordered_multimap</*iter-key-type*/<InputIter>, /*type-mappé-iter*/<InputIter>, hash</*iter-key-type*/<InputIter>>, equal_to</*iter-key-type*/<InputIter>>, Allocator>; template<class InputIter, class Hash, class Allocator> unordered_multimap(InputIter, InputIter, typename /* voir description */ ::size_type, Hash, Allocator) -> unordered_multimap</*iter-key-type*/<InputIter>, /*type-mappé-iter*/<InputIter>, Hash, equal_to</*iter-key-type*/<InputIter>>, Allocator>; template<ranges::input_range R, class Allocator> unordered_multimap(from_range_t, R&&, typename /* voir description */ ::size_type, Allocator) -> unordered_multimap</*range-key-type*/<R>, /*type mappé par plage*/<R>, hash</*range-key-type*/<R>>, equal_to</*range-key-type*/<R>>, Allocator>; template<ranges::input_range R, class Allocator> unordered_multimap(from_range_t, R&&, Allocator) -> unordered_multimap</*range-key-type*/<R>, /*type à plage mappée*/<R>, hash</*range-key-type*/<R>>, equal_to</*range-key-type*/<R>>, Allocator>; template<ranges::input_range R, class Hash, class Allocator> unordered_multimap(from_range_t, R&&, typename /* voir description */ ::size_type, Hash, Allocator) -> unordered_multimap</*range-key-type*/<R>, /*range-mapped-type*/<R>, Hash, equal_to</*range-key-type*/<R>>, Allocator>; template<class Key, class T, class Allocator> unordered_multimap(initializer_list<pair<Key, T>>, typename /* voir description */ ::size_type, Allocator) -> unordered_multimap<Key, T, hash<Key>, equal_to<Key>, Allocator>; template<class Key, class T, class Allocator> unordered_multimap(initializer_list<pair<Key, T>>, Allocator) -> unordered_multimap<Key, T, hash<Key>, equal_to<Key>, Allocator>; template<class Key, class T, class Hash, class Allocator> unordered_multimap(initializer_list<pair<Key, T>>, typename /* voir description */ ::size_type, Hash, Allocator) -> unordered_multimap<Key, T, Hash, equal_to<Key>, Allocator>; }