std::unordered_multimap<Key,T,Hash,KeyEqual,Allocator>::insert
Min standard notice:
Header: <unordered_map>
Inserts element(s) into the container.
# Declarations
iterator insert( const value_type& value );
(since C++11)
iterator insert( value_type&& value );
(since C++17)
template< class P >
iterator insert( P&& value );
(since C++11)
iterator insert( const_iterator hint, const value_type& value );
(since C++11)
iterator insert( const_iterator hint, value_type&& value );
(since C++17)
template< class P >
iterator insert( const_iterator hint, P&& value );
(since C++11)
template< class InputIt >
void insert( InputIt first, InputIt last );
(since C++11)
void insert( std::initializer_list<value_type> ilist );
(since C++11)
iterator insert( node_type&& nh );
(since C++17)
iterator insert( const_iterator hint, node_type&& nh );
(since C++17)
# Parameters
hint: iterator, used as a suggestion as to where to insert the contentvalue: element value to insertfirst, last: range of elements to insertilist: initializer list to insert the values fromnh: a compatible node handle
# Example
This section is incompleteReason: no example
# Defect reports
| DR | Applied to | Behavior as published | Correct behavior |
|---|---|---|---|
| LWG 2005 | C++11 | overloads (3,6) would only participate in overloadresolution if P is implicitly convertible to value_type | only participates if value_typeis constructible from P&& |