std::map<Key,T,Compare,Allocator>::merge (3) - Linux Manuals
std::map<Key,T,Compare,Allocator>::merge: std::map<Key,T,Compare,Allocator>::merge
Command to display std::map<Key,T,Compare,Allocator>::merge
manual in Linux: $ man 3 std::map<Key,T,Compare,Allocator>::merge
NAME
std::map<Key,T,Compare,Allocator>::merge - std::map<Key,T,Compare,Allocator>::merge
Synopsis
template<class C2> (1) (since C++17)
void merge(std::map<Key, T, C2, Allocator>& source);
template<class C2> (2) (since C++17)
void merge(std::map<Key, T, C2, Allocator>&& source);
template<class C2> (3) (since C++17)
void merge(std::multimap<Key, T, C2, Allocator>& source);
template<class C2> (4) (since C++17)
void merge(std::multimap<Key, T, C2, Allocator>&& source);
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. 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.
The behavior is undefined if get_allocator() != source.get_allocator().
Parameters
source - compatible container to transfer the nodes from
Return value
(none)
Exceptions
Does not throw unless comparison throws.
Complexity
N*log(size()+N)), where N is source.size()
Example
This section is incomplete
Reason: no example
See also
extract extracts nodes from the container
(public member function)
(C++17)
inserts elements
or nodes
insert (since C++17)
(public member function)
Pages related to std::map<Key,T,Compare,Allocator>::merge
- std::map<Key,T,Compare,Allocator>::map (3) - std::map<Key,T,Compare,Allocator>::map
- std::map<Key,T,Compare,Allocator>::max_size (3) - std::map<Key,T,Compare,Allocator>::max_size
- std::map<Key,T,Compare,Allocator>::at (3) - std::map<Key,T,Compare,Allocator>::at
- std::map<Key,T,Compare,Allocator>::begin,std::map<Key,T,Compare,Allocator>::cbegin (3) - std::map<Key,T,Compare,Allocator>::begin,std::map<Key,T,Compare,Allocator>::cbegin
- std::map<Key,T,Compare,Allocator>::clear (3) - std::map<Key,T,Compare,Allocator>::clear
- std::map<Key,T,Compare,Allocator>::contains (3) - std::map<Key,T,Compare,Allocator>::contains
- std::map<Key,T,Compare,Allocator>::count (3) - std::map<Key,T,Compare,Allocator>::count
- std::map<Key,T,Compare,Allocator>::emplace (3) - std::map<Key,T,Compare,Allocator>::emplace
- std::map<Key,T,Compare,Allocator>::emplace_hint (3) - std::map<Key,T,Compare,Allocator>::emplace_hint
- std::map<Key,T,Compare,Allocator>::empty (3) - std::map<Key,T,Compare,Allocator>::empty
- std::map<Key,T,Compare,Allocator>::end,std::map<Key,T,Compare,Allocator>::cend (3) - std::map<Key,T,Compare,Allocator>::end,std::map<Key,T,Compare,Allocator>::cend
- std::map<Key,T,Compare,Allocator>::equal_range (3) - std::map<Key,T,Compare,Allocator>::equal_range
- std::map<Key,T,Compare,Allocator>::erase (3) - std::map<Key,T,Compare,Allocator>::erase
- std::map<Key,T,Compare,Allocator>::extract (3) - std::map<Key,T,Compare,Allocator>::extract
- std::map<Key,T,Compare,Allocator>::find (3) - std::map<Key,T,Compare,Allocator>::find
- std::map<Key,T,Compare,Allocator>::get_allocator (3) - std::map<Key,T,Compare,Allocator>::get_allocator
- std::map<Key,T,Compare,Allocator>::insert (3) - std::map<Key,T,Compare,Allocator>::insert
- std::map<Key,T,Compare,Allocator>::insert_or_assign (3) - std::map<Key,T,Compare,Allocator>::insert_or_assign
- std::map<Key,T,Compare,Allocator>::key_comp (3) - std::map<Key,T,Compare,Allocator>::key_comp
- std::map<Key,T,Compare,Allocator>::lower_bound (3) - std::map<Key,T,Compare,Allocator>::lower_bound
- std::map<Key,T,Compare,Allocator>::operator= (3) - std::map<Key,T,Compare,Allocator>::operator=
- std::map<Key,T,Compare,Allocator>::operator[] (3) - std::map<Key,T,Compare,Allocator>::operator[]
- std::map<Key,T,Compare,Allocator>::rbegin,std::map<Key,T,Compare,Allocator>::crbegin (3) - std::map<Key,T,Compare,Allocator>::rbegin,std::map<Key,T,Compare,Allocator>::crbegin
- std::map<Key,T,Compare,Allocator>::rend,std::map<Key,T,Compare,Allocator>::crend (3) - std::map<Key,T,Compare,Allocator>::rend,std::map<Key,T,Compare,Allocator>::crend
- std::map<Key,T,Compare,Allocator>::size (3) - std::map<Key,T,Compare,Allocator>::size
- std::map<Key,T,Compare,Allocator>::swap (3) - std::map<Key,T,Compare,Allocator>::swap
- std::map<Key,T,Compare,Allocator>::try_emplace (3) - std::map<Key,T,Compare,Allocator>::try_emplace
- std::map<Key,T,Compare,Allocator>::upper_bound (3) - std::map<Key,T,Compare,Allocator>::upper_bound
- std::map<Key,T,Compare,Allocator>::value_comp (3) - std::map<Key,T,Compare,Allocator>::value_comp
- std::map<Key,T,Compare,Allocator>::value_compare (3) - std::map<Key,T,Compare,Allocator>::value_compare
- std::map<Key,T,Compare,Allocator>::~map (3) - std::map<Key,T,Compare,Allocator>::~map
- std::map (3) - std::map