std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace_hint (3) - Linux Manuals

std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace_hint: std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace_hint

Command to display std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace_hint manual in Linux: $ man 3 std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace_hint

NAME

std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace_hint - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace_hint

Synopsis

template <class... Args> (since C++11)
iterator emplace_hint( const_iterator hint, Args&&... args );

Inserts a new element to the container, using hint as a suggestion where the element should go. The element is constructed in-place, i.e. no copy or move operations are performed.
The constructor of the element type (value_type, that is, std::pair<const Key, T>) is called with exactly the same arguments as supplied to the function, forwarded with std::forward<Args>(args)....
If rehashing occurs due to the insertion, all iterators are invalidated. Otherwise iterators are not affected. References are not invalidated. Rehashing occurs only if the new number of elements is greater than max_load_factor()*bucket_count().

Parameters

hint - iterator, used as a suggestion as to where to insert the new element
args - arguments to forward to the constructor of the element

Return value

Returns an iterator to the newly inserted element.
If the insertion failed because the element already exists, returns an iterator to the already existing element with the equivalent key.

Exceptions

If an exception is thrown by any operation, this function has no effect (strong exception guarantee).

Complexity

Amortized constant on average, worst case linear in the size of the container.

Pages related to std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace_hint

std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::emplace
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::empty (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::empty
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end(size_type), (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end(size_type),
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end(size_type),std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cend(size_type) (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end(size_type),std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cend(size_type)
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end, (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end,
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end,std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cend (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::end,std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cend
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::equal_range (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::equal_range
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::erase (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::erase
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::extract (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::extract
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::at (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::at
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin(size_type), (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin(size_type),
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin(size_type),std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cbegin(size_type) (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin(size_type),std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cbegin(size_type)
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin, (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin,
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin,std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cbegin (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::begin,std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::cbegin
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket_count (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket_count
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket_size (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::bucket_size
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::clear (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::clear
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::contains (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::contains
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::count (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::count
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::find (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::find
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::get_allocator (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::get_allocator
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::hash_function (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::hash_function
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::insert (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::insert
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::insert_or_assign (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::insert_or_assign
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::key_eq (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::key_eq
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::load_factor (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::load_factor
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_bucket_count (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_bucket_count
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_load_factor (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_load_factor
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_size (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::max_size
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::merge (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::merge
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::operator= (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::operator=
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::operator[] (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::operator[]
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::rehash (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::rehash
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::reserve (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::reserve
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::size (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::size
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::swap (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::swap
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::try_emplace (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::try_emplace
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::unordered_map (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::unordered_map
std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::~unordered_map (3) - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::~unordered_map
std::unordered_map (3) - std::unordered_map