std:: swap (std::flat_multimap)
From fr.cppreference.net
<
cpp
|
container
|
flat multimap
C++
Containers library
|
(C++17)
|
||||
| Sequence | ||||
|
(C++11)
|
||||
|
(C++26)
|
||||
|
(C++26)
|
||||
|
(C++11)
|
||||
| Associative | ||||
| Unordered associative | ||||
|
(C++11)
|
||||
|
(C++11)
|
||||
|
(C++11)
|
||||
|
(C++11)
|
||||
| Adaptors | ||||
|
(C++23)
|
||||
|
(C++23)
|
||||
|
(C++23)
|
||||
|
(C++23)
|
||||
| Views | ||||
|
(C++20)
|
||||
|
(C++23)
|
||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::flat_multimap
| Member types | ||||||||||||
| Member functions | ||||||||||||
| Non-member functions | ||||||||||||
|
||||||||||||
| Helper classes | ||||||||||||
| Tags | ||||||||||||
| Deduction guides | ||||||||||||
|
Défini dans l'en-tête
<flat_map>
|
||
|
void
swap
(
std::
flat_multimap
&
lhs,
std::
flat_multimap
&
rhs
)
noexcept
;
|
(depuis C++23)
(constexpr depuis C++26) |
|
Spécialise l'algorithme std::swap pour std::flat_multimap . Échange le contenu de lhs et rhs . Appelle lhs. swap ( rhs ) .
SommaireParamètres
ComplexitéIdentique à l'échange des conteneurs sous-jacents. ExempleExécuter ce code #include <algorithm>
#include <iostream>
#include <flat_map>
int main()
{
std::flat_multimap<int, char> alice{{1, 'a'}, {2, 'b'}, {3, 'c'}};
std::flat_multimap<int, char> bob{{7, 'Z'}, {8, 'Y'}, {9, 'X'}, {10, 'W'}};
auto print = [](const std::pair<int, char>& n)
{
std::cout << ' ' << n.first << ':' << n.second;
};
// Print state before swap
std::cout << "Alice:";
std::for_each(alice.begin(), alice.end(), print);
std::cout << "\nBobby:";
std::for_each(bob.begin(), bob.end(), print);
std::cout << '\n';
std::cout << "-- SWAP\n";
std::swap(alice, bob);
// Print state after swap
std::cout << "Alice:";
std::for_each(alice.begin(), alice.end(), print);
std::cout << "\nBobby:";
std::for_each(bob.begin(), bob.end(), print);
std::cout << '\n';
}
Sortie: Alice: 1:a 2:b 3:c
Bobby: 7:Z 8:Y 9:X 10:W
-- SWAP
Alice: 7:Z 8:Y 9:X 10:W
Bobby: 1:a 2:b 3:c
Voir aussi
|