Difference between revisions of "cpp/container/unordered set/swap"
m (1 revision: import content) |
m (langlinks) |
||
(3 intermediate revisions by one user not shown) | |||
Line 1: | Line 1: | ||
− | {{cpp/container/swap|unordered_set}} | + | {{include page|cpp/container/swap|unordered_set}} |
+ | |||
+ | {{langlinks|de|es|fr|it|ja|pt|ru|zh}} |
Latest revision as of 15:54, 30 July 2020
void swap( unordered_set& other ); |
(since C++11) (until C++17) |
|
void swap( unordered_set& other ) noexcept(/* see below */); |
(since C++17) | |
Exchanges the contents of the container with those of other. Does not invoke any move, copy, or swap operations on individual elements.
All iterators and references remain valid. The end()
iterator is invalidated.
The Hash
and KeyEqual
objects must be Swappable, and they are exchanged using unqualified calls to non-member swap
.
If std::allocator_traits<allocator_type>::propagate_on_container_swap::value is true, then the allocators are exchanged using an unqualified call to non-member |
(since C++11) |
Contents |
[edit] Parameters
other | - | container to exchange the contents with |
[edit] Return value
(none)
[edit] Exceptions
Any exception thrown by the swap of the |
(until C++17) |
noexcept specification:
noexcept(std::allocator_traits<Allocator>::is_always_equal::value && std::is_nothrow_swappable<Hash>::value |
(since C++17) |
[edit] Complexity
Constant.
[edit] Example
#include <iostream> #include <unordered_set> template<class Os, class Co> Os& operator<<(Os& os, const Co& co) { os << '{'; for (auto const& i : co) os << ' ' << i; return os << " } "; } int main() { std::unordered_set<int> a1{3, 1, 3, 2}, a2{5, 4, 5}; auto it1 = std::next(a1.begin()); auto it2 = std::next(a2.begin()); const int& ref1 = *(a1.begin()); const int& ref2 = *(a2.begin()); std::cout << a1 << a2 << *it1 << ' ' << *it2 << ' ' << ref1 << ' ' << ref2 << '\n'; a1.swap(a2); std::cout << a1 << a2 << *it1 << ' ' << *it2 << ' ' << ref1 << ' ' << ref2 << '\n'; // Note that every iterator referring to an element in one container before the swap // refers to the same element in the other container after the swap. Same is true // for references. }
Possible output:
{ 2 1 3 } { 4 5 } 1 5 2 4 { 4 5 } { 2 1 3 } 1 5 2 4
[edit] See also
specializes the std::swap algorithm (function template) |