std::unordered_multimap

template< class Key, class T, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator< std::pair<const Key, T> > > class unordered_multimap;

(1)

(since C++11)

namespace pmr { template <class Key, class T, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>> using unordered_multimap = std::unordered_multimap<Key, T, Hash, Pred, std::pmr::polymorphic_allocator<std::pair<const Key,T>>>; }

(2)

(since C++17)

key_type

Key

mapped_type

T

value_type

std::pair<const Key, T>

size_type

Unsigned integer type (usually std::size_t)

difference_type

Signed integer type (usually std::ptrdiff_t)

hasher

Hash

key_equal

KeyEqual

allocator_type

Allocator

reference

value_type&

const_reference

const value_type&

pointer

std::allocator_traits<Allocator>::pointer

const_pointer

std::allocator_traits<Allocator>::const_pointer

iterator

ForwardIterator

const_iterator

Constant forward iterator

local_iterator

An iterator type whose category, value, difference, pointer and reference types are the same as iterator. This iterator can be used to iterate through a single bucket but not across buckets

const_local_iterator

An iterator type whose category, value, difference, pointer and reference types are the same as const_iterator. This iterator can be used to iterate through a single bucket but not across buckets

node_type

a specialization of node handle representing a container node (since C++17)

(destructor)

destructs the unordered_multimap (public member function)

operator=

assigns values to the container (public member function)

get_allocator

returns the associated allocator (public member function)

std::swap(std::unordered_multimap) (C++11)

specializes the std::swap algorithm (function template)