(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 |
Member functions | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Non-member functions | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Deduction guides(C++17) |
void merge( list& other); | (1) | (constexpr since C++26) |
void merge( list&& other); | (2) | (since C++11) (constexpr since C++26) |
template<class Compare> void merge( list& other, Compare comp); | (3) | (constexpr since C++26) |
template<class Compare> void merge( list&& other, Compare comp); | (4) | (since C++11) (constexpr since C++26) |
Merges two sorted lists into one sorted list.
This operation is stable:
No iterators or references become invalidated. The pointers and references to the elements moved from*this, as well as the iterators referring to these elements, will refer to the same elements of*this, instead ofother.
Contents |
other | - | another container to merge |
comp | - | comparison function object (i.e. an object that satisfies the requirements ofCompare) which returns true if the first argument isless than (i.e. is orderedbefore) the second. The signature of the comparison function should be equivalent to the following: bool cmp(const Type1& a,const Type2& b); While the signature does not need to haveconst&, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) |
Type requirements | ||
-Compare must meet the requirements ofCompare. |
If an exception is thrown for any reason, these functions have no effect (strong exception safety guarantee). Except if the exception comes from a comparison.
Ifother refers to the same object as*this, no comparisons are performed.
Otherwise, given\(\scriptsize N_1\)N1 asstd::distance(begin(), end()) and\(\scriptsize N_2\)N2 asstd::distance(other.begin(), other.end()):
#include <iostream>#include <list> std::ostream& operator<<(std::ostream& ostr,conststd::list<int>& list){for(constint i: list) ostr<<' '<< i;return ostr;} int main(){std::list<int> list1={5,9,1,3,3};std::list<int> list2={8,7,2,3,4,4}; list1.sort(); list2.sort();std::cout<<"list1: "<< list1<<'\n';std::cout<<"list2: "<< list2<<'\n'; list1.merge(list2);std::cout<<"merged:"<< list1<<'\n';}
Output:
list1: 1 3 3 5 9list2: 2 3 4 4 7 8merged: 1 2 3 3 3 4 4 5 7 8 9
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 300 | C++98 | the effect when*this andother refer to the same object was not specified | specified as no-op |
LWG 1207 | C++98 | it was unclear whether iterators and/or references will be invalidated | keep valid |
LWG 1215 | C++98 | O(1) node moving could not be guaranteed if get_allocator()!= other.get_allocator() | the behavior is undefined in this case |
LWG 3088 | C++98 | operator< could misbehave for pointer elements | implementation-defined strict total order used |
transfers elements from anotherlist (public member function)[edit] | |
merges two sorted ranges (function template)[edit] | |
merges two ordered ranges in-place (function template)[edit] | |
(C++20) | merges two sorted ranges (algorithm function object)[edit] |
(C++20) | merges two ordered ranges in-place (algorithm function object)[edit] |