| CARVIEW |
Select Language
HTTP/1.1 301 Moved Permanently
Server: nginx
Date: Thu, 31 Jul 2025 17:09:27 GMT
Content-Type: text/html; charset=UTF-8
Transfer-Encoding: chunked
Connection: keep-alive
Location: /reference/set/multiset/emplace/
HTTP/1.1 200 OK
Server: nginx
Date: Thu, 31 Jul 2025 17:09:27 GMT
Content-Type: text/html; charset=utf-8
Transfer-Encoding: chunked
Connection: keep-alive
ETag: W/"7bb7-ln5SekOfDZ2WthoQCG7DC8OCrLE"
Content-Encoding: gzip
Inserts a new element in the multiset. This new element is constructed in place using args as the arguments for its construction.
This effectively increases the container size by one.
Internally, multiset containers keep all their elements sorted 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.
Member type iterator is a bidirectional iterator type that points to elements.
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>
multiset
- multiset::~multiset
- multiset::multiset
member functions
- multiset::begin
-
multiset::cbeginC++11
-
multiset::cendC++11
- multiset::clear
- multiset::count
-
multiset::crbeginC++11
-
multiset::crendC++11
-
multiset::emplaceC++11
-
multiset::emplace_hintC++11
- multiset::empty
- multiset::end
- multiset::equal_range
- multiset::erase
- multiset::find
- multiset::get_allocator
- multiset::insert
- multiset::key_comp
- multiset::lower_bound
- multiset::max_size
- multiset::operator=
- multiset::rbegin
- multiset::rend
- multiset::size
- multiset::swap
- multiset::upper_bound
- multiset::value_comp
non-member overloads
public member function
<set>
std::multiset::emplace
template <class... Args> iterator emplace (Args&&... args);
Construct and insert element
This effectively increases the container size by one.
Internally, multiset containers keep all their elements sorted 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.
There are no guarantees on the relative order of equivalent elements.
The relative ordering of equivalent elements is preserved, and newly inserted elements follow their equivalents already in the container.
Parameters
- args
- Arguments forwarded to construct the new element.
Return value
An iterator to the newly inserted element.Member type iterator is a bidirectional iterator type that points to elements.
Example
|
|
mymultiset contains: bar foo foo |
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
- multiset::emplace_hint
- Construct and insert element with hint (public member function)
- multiset::insert
- Insert element (public member function)
- multiset::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