| CARVIEW |
Select Language
HTTP/1.1 301 Moved Permanently
Server: nginx
Date: Sat, 19 Jul 2025 10:45:10 GMT
Content-Type: text/html; charset=UTF-8
Transfer-Encoding: chunked
Connection: keep-alive
Location: /reference/unordered_set/unordered_multiset/operator=/
HTTP/1.1 200 OK
Server: nginx
Date: Sat, 19 Jul 2025 10:45:11 GMT
Content-Type: text/html; charset=utf-8
Transfer-Encoding: chunked
Connection: keep-alive
ETag: W/"8cd9-TQeK4fIMg4XBvt7Z740EQCBdm4I"
Content-Encoding: gzip
Assigns ums (or il) as the new content for the container.
The elements contained in the object before the call are destroyed, and replaced by those in unordered_multiset ums or initializer list il, if any.
The first version (1) performs a copy assignment, which copies all the elements of ums into the container object (with ums preserving its contents).
The second version (2) performs a move assignment, which transfer ownership of the contents of ums to the object. No copies occur: the content is lost by ums.
The third version (3) assigns the contents of the initializer list il as the elements of the container object.
Possible output:
For the move assignment (2): Linear in current container size (destructions).*
For the initializer list assignment (3): On average, linear in sizes (destructions, move-assignments) -- worst case: quadratic.
* Additional complexity for assignments if allocators do not propagate.
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>
<unordered_set>
-
unordered_multisetC++11
-
unordered_setC++11
unordered_multiset
-
unordered_multiset::~unordered_multisetC++11
-
unordered_multiset::unordered_multisetC++11
member functions
-
unordered_multiset::beginC++11
-
unordered_multiset::bucketC++11
-
unordered_multiset::bucket_countC++11
-
unordered_multiset::bucket_sizeC++11
-
unordered_multiset::cbeginC++11
-
unordered_multiset::cendC++11
-
unordered_multiset::clearC++11
-
unordered_multiset::countC++11
-
unordered_multiset::emplaceC++11
-
unordered_multiset::emplace_hintC++11
-
unordered_multiset::emptyC++11
-
unordered_multiset::endC++11
-
unordered_multiset::equal_rangeC++11
-
unordered_multiset::eraseC++11
-
unordered_multiset::findC++11
-
unordered_multiset::get_allocatorC++11
-
unordered_multiset::hash_functionC++11
-
unordered_multiset::insertC++11
-
unordered_multiset::key_eqC++11
-
unordered_multiset::load_factorC++11
-
unordered_multiset::max_bucket_countC++11
-
unordered_multiset::max_load_factorC++11
-
unordered_multiset::max_sizeC++11
-
unordered_multiset::operator=C++11
-
unordered_multiset::rehashC++11
-
unordered_multiset::reserveC++11
-
unordered_multiset::sizeC++11
-
unordered_multiset::swapC++11
-
non-member overloads
- Reference
- <unordered_set>
- unordered_multiset
- operator=
public member function
<unordered_set>
std::unordered_multiset::operator=
| copy (1) | unordered_multiset& operator= ( const unordered_multiset& ums ); |
|---|---|
| move (2) | unordered_multiset& operator= ( unordered_multiset&& ums ); |
| initializer list (3) | unordered_multiset& operator= ( intitializer_list<value_type> il ); |
Assign content
The elements contained in the object before the call are destroyed, and replaced by those in unordered_multiset ums or initializer list il, if any.
The first version (1) performs a copy assignment, which copies all the elements of ums into the container object (with ums preserving its contents).
The second version (2) performs a move assignment, which transfer ownership of the contents of ums to the object. No copies occur: the content is lost by ums.
The third version (3) assigns the contents of the initializer list il as the elements of the container object.
Parameters
- ums
- An unordered_multiset object of the same type (i.e., with the same template parameters).
- il
- An initializer_list object. The compiler will automatically construct such objects from initializer list declarators.
Member type value_type is the type of the elements in the container, defined in unordered_multiset as an alias of its first template parameter (Key).
Return value
*thisExample
|
|
Possible output:
first contains: blue blue red red yellow green |
Complexity
For the copy assignment (1): Linear in sizes (destructions, copies).For the move assignment (2): Linear in current container size (destructions).*
For the initializer list assignment (3): On average, linear in sizes (destructions, move-assignments) -- worst case: quadratic.
* Additional complexity for assignments if allocators do not propagate.
Iterator validity
All iterators, references and pointers to elements that were in the container before the call are invalidated.See also
- unordered_multiset::unordered_multiset
- Construct unordered_multiset (public member function)
- unordered_multiset::emplace
- Construct and insert element (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