std::swap(std::flat_map)
From cppreference.com
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::flat_map
swap(std::flat_map)
Defined in header
<flat_map>
void swap( std::flat_map & lhs, std::flat_map & rhs ) noexcept;
(since C++23) (constexpr since C++26)
Specializes the std::swap algorithm for std::flat_map. Swaps the contents of lhs and rhs. Calls lhs.swap(rhs).
Contents
[edit] Parameters
lhs, rhs
-
containers whose contents to swap
[edit] Complexity
Same as swapping the underlying containers.
[edit] Example
Run this code
#include <algorithm> #include <iostream> #include <flat_map> int main() { std::flat_map <int, char> alice{{1, 'a'}, {2, 'b'}, {3, 'c'}}; std::flat_map <int, char> bob{{7, 'Z'}, {8, 'Y'}, {9, 'X'}, {10, 'W'}}; auto print = [](std::pair <const 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'; }
Output:
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