CARVIEW |
Select Language
HTTP/1.1 301 Moved Permanently
Server: nginx
Date: Sat, 19 Jul 2025 14:31:56 GMT
Content-Type: text/html; charset=UTF-8
Transfer-Encoding: chunked
Connection: keep-alive
Location: /reference/map/multimap/emplace/
HTTP/1.1 200 OK
Server: nginx
Date: Sat, 19 Jul 2025 14:31:56 GMT
Content-Type: text/html; charset=utf-8
Transfer-Encoding: chunked
Connection: keep-alive
ETag: W/"7f6f-TBAvFL2RLHbdrxDaSSwrJrhxyYs"
Content-Encoding: gzip
Inserts a new element in the multimap. This new element is constructed in place using args as the arguments for the construction of a value_type (which is an object of a pair type).
This effectively increases the container size by one.
Internally, multimap containers keep all their elements sorted by key following the criterion specified by its comparison object. The element is always inserted in its respective position following this ordering.
The element is constructed in-place by calling allocator_traits::construct with args forwarded.
A similar member function exists, insert, which either copies or moves existing objects into the container.
The relative ordering of elements with equivalent keys is preserved, and newly inserted elements follow those with equivalent keys already in the container.
Member type iterator is a bidirectional iterator type that points to an element.
Output:
Concurrently accessing existing elements is safe, although iterating ranges in the container is not.
If allocator_traits::construct is not supported with the appropriate arguments, it causes undefined behavior.
Reference
C library:
- <cassert> (assert.h)
- <cctype> (ctype.h)
- <cerrno> (errno.h)
-
<cfenv> (fenv.h)C++11
- <cfloat> (float.h)
-
<cinttypes> (inttypes.h)C++11
- <ciso646> (iso646.h)
- <climits> (limits.h)
- <clocale> (locale.h)
- <cmath> (math.h)
- <csetjmp> (setjmp.h)
- <csignal> (signal.h)
- <cstdarg> (stdarg.h)
-
<cstdbool> (stdbool.h)C++11
- <cstddef> (stddef.h)
-
<cstdint> (stdint.h)C++11
- <cstdio> (stdio.h)
- <cstdlib> (stdlib.h)
- <cstring> (string.h)
-
<ctgmath> (tgmath.h)C++11
- <ctime> (time.h)
-
<cuchar> (uchar.h)C++11
- <cwchar> (wchar.h)
- <cwctype> (wctype.h)
Containers:
-
<array>C++11
- <deque>
-
<forward_list>C++11
- <list>
- <map>
- <queue>
- <set>
- <stack>
-
<unordered_map>C++11
-
<unordered_set>C++11
- <vector>
-
Input/Output:
Multi-threading:
-
<atomic>C++11
-
<condition_variable>C++11
-
<future>C++11
-
<mutex>C++11
-
<thread>C++11
-
Other:
- <algorithm>
- <bitset>
-
<chrono>C++11
-
<codecvt>C++11
- <complex>
- <exception>
- <functional>
-
<initializer_list>C++11
- <iterator>
- <limits>
- <locale>
- <memory>
- <new>
- <numeric>
-
<random>C++11
-
<ratio>C++11
-
<regex>C++11
- <stdexcept>
- <string>
-
<system_error>C++11
-
<tuple>C++11
-
<type_traits>C++11
-
<typeindex>C++11
- <typeinfo>
- <utility>
- <valarray>
multimap
- multimap::~multimap
- multimap::multimap
member functions
- multimap::begin
-
multimap::cbeginC++11
-
multimap::cendC++11
- multimap::clear
- multimap::count
-
multimap::crbeginC++11
-
multimap::crendC++11
-
multimap::emplaceC++11
-
multimap::emplace_hintC++11
- multimap::empty
- multimap::end
- multimap::equal_range
- multimap::erase
- multimap::find
- multimap::get_allocator
- multimap::insert
- multimap::key_comp
- multimap::lower_bound
- multimap::max_size
- multimap::operator=
- multimap::rbegin
- multimap::rend
- multimap::size
- multimap::swap
- multimap::upper_bound
- multimap::value_comp
non-member overloads
public member function
<map>
std::multimap::emplace
template <class... Args> iterator emplace (Args&&... args);
Construct and insert element
This effectively increases the container size by one.
Internally, multimap containers keep all their elements sorted by key following the criterion specified by its comparison object. The element is always inserted in its respective position following this ordering.
The element is constructed in-place by calling allocator_traits::construct with args forwarded.
A similar member function exists, insert, which either copies or moves existing objects into the container.
The relative ordering of elements with equivalent keys is preserved, and newly inserted elements follow those with equivalent keys already in the container.
Parameters
- args
- Arguments used to construct a new object of the mapped type for the inserted element.
Arguments forwarded to construct the new element (of typepair<const key_type, mapped_type>
).
This can be one of:
- Two arguments: one for the key, the other for the mapped value.
- A single argument of apair
type with a value for the key as first member, and a value for the mapped value as second.
- piecewise_construct as first argument, and two additional arguments with tuples to be forwarded as arguments for the key value and for the mapped value respectivelly.
See pair::pair for more info.
Return value
An iterator to the newly inserted element.Member type iterator is a bidirectional iterator type that points to an element.
Example
|
|
mymultimap contains: [apple:1.5] [apple:1.4] [coffee:2.1] |
Complexity
Logarithmic in the container size.Iterator validity
No changes.Data races
The container is modified.Concurrently accessing existing elements is safe, although iterating ranges in the container is not.
Exception safety
Strong guarantee: if an exception is thrown, there are no changes in the container.If allocator_traits::construct is not supported with the appropriate arguments, it causes undefined behavior.
See also
- multimap::emplace_hint
- Construct and insert element with hint (public member function)
- multimap::insert
- Insert element (public member function)
- multimap::erase
- Erase elements (public member function)
Home page | Privacy policy
© cplusplus.com, 2000-2025 - All rights reserved - v3.3.4s
Spotted an error? contact us
© cplusplus.com, 2000-2025 - All rights reserved - v3.3.4s
Spotted an error? contact us