std::multiset<Key,Compare,Allocator>::merge
template< class C2 > void merge( std::set<Key, C2, Allocator>& source ); |
(1) | (since C++17) (constexpr since C++26) |
template< class C2 > void merge( std::set<Key, C2, Allocator>&& source ); |
(2) | (since C++17) (constexpr since C++26) |
template< class C2 > void merge( std::multiset<Key, C2, Allocator>& source ); |
(3) | (since C++17) (constexpr since C++26) |
template< class C2 > void merge( std::multiset<Key, C2, Allocator>&& source ); |
(4) | (since C++17) (constexpr since C++26) |
Attempts to extract (“splice”) each element in source and insert it into *this using the comparison object of *this.
If get_allocator() == source.get_allocator() is false, the behavior is undefined.
No elements are copied or moved, only the internal pointers of the container nodes are repointed. All pointers and references to the transferred elements remain valid, but now refer into *this, not into source.
Contents |
[edit] Parameters
| source | - | compatible container to transfer the nodes from |
Exceptions
Does not throw unless comparison throws.
[edit] Complexity
Given S as size() and N as source.size():
[edit] Example
#include <iostream> #include <set> // print out a container template<class Os, class K> Os& operator<<(Os& os, const std::multiset<K>& v) { os << '[' << v.size() << "] {"; bool o{}; for (const auto& e : v) os << (o ? ", " : (o = 1, " ")) << e; return os << " }\n"; } int main() { std::multiset<char> p{'C', 'B', 'B', 'A'}, q{'E', 'D', 'E', 'C'}; std::cout << "p: " << p << "q: " << q; p.merge(q); std::cout << "p.merge(q);\n" << "p: " << p << "q: " << q; }
Output:
p: [4] { A, B, B, C }
q: [4] { C, D, E, E }
p.merge(q);
p: [8] { A, B, B, C, C, D, E, E }
q: [0] { }[edit] See also
| (C++17) |
extracts nodes from the container (public member function) |
| inserts elements or nodes(since C++17) (public member function) |

Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
