A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://en.cppreference.com/w/cpp/algorithm/../../cpp/../cpp/language/../container/map/merge.html below:

std::map<Key,T,Compare,Allocator>::merge - cppreference.com

template< class C2 >
void merge( std::map<Key, T, C2, Allocator>& source );
(1) (since C++17)
(constexpr since C++26) template< class C2 >
void merge( std::map<Key, T, C2, Allocator>&& source );
(2) (since C++17)
(constexpr since C++26) template< class C2 >
void merge( std::multimap<Key, T, C2, Allocator>& source );
(3) (since C++17)
(constexpr since C++26) template< class C2 >
void merge( std::multimap<Key, T, 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 there is an element in *this with key equivalent to the key of an element from source, then that element is not extracted from source. 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.

[edit] Parameters source - compatible container to transfer the nodes from Exceptions

Does not throw unless comparison throws.

[edit] Complexity

Given \(\scriptsize S\)S as size() and \(\scriptsize N\)N as source.size():

1-4) \(\scriptsize S \cdot \log(S + N)\)S·log(S+N)

[edit] Example
#include <iostream>
#include <map>
#include <string>
 
int main()
{
    std::map<int, std::string> ma{{1, "apple"}, {5, "pear"}, {10, "banana"}};
    std::map<int, std::string> mb{{2, "zorro"}, {4, "batman"}, {5, "X"}, {8, "alpaca"}};
    std::map<int, std::string> u;
    u.merge(ma);
    std::cout << "ma.size(): " << ma.size() << '\n';
    u.merge(mb);
    std::cout << "mb.size(): " << mb.size() << '\n';
    std::cout << "mb.at(5): " << mb.at(5) << '\n';
    for (const auto& kv : u)
        std::cout << kv.first << ", " << kv.second << '\n';
}

Output:

ma.size(): 0
mb.size(): 1
mb.at(5): X
1, apple
2, zorro
4, batman
5, pear
8, alpaca
10, banana
[edit] See also extracts nodes from the container
(public member function) [edit] inserts elements or nodes(since C++17)
(public member function) [edit]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4