std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::emplace (3) - Linux Manuals

std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::emplace: std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::emplace

Command to display std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::emplace manual in Linux: $ man 3 std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::emplace

NAME

std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::emplace - std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::emplace

Synopsis

template< class... Args > (since C++11)
iterator emplace( Args&&... args );

Inserts a new element into the container constructed in-place with the given args .
Careful use of emplace allows the new element to be constructed while avoiding unnecessary copy or move operations. The constructor of the new element is called with exactly the same arguments as supplied to emplace, forwarded via 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

args - arguments to forward to the constructor of the element

Return value

Returns an iterator to the inserted element.

Exceptions

If an exception is thrown by any operation, this function has no effect.

Complexity

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

Example

This section is incomplete
Reason: no example

Pages related to std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::emplace

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