std::inplace_merge

Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>

Defined in header <algorithm>

</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<td >

template< class BidirectionalIterator >

void inplace_merge( BidirectionalIterator first,
                    BidirectionalIterator middle,

                    BidirectionalIterator last );

</td>

<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">

<td >

template< class BidirectionalIterator, class Compare>

void inplace_merge( BidirectionalIterator first,
                    BidirectionalIterator middle,
                    BidirectionalIterator last,

                    Compare comp );

</td>

<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

Merges two consecutive sorted ranges [first, middle) and [middle, last) into one sorted range [first, last). The order of equal elements is guaranteed to be preserved. The first version uses Template:cpp to compare the elements, the second version uses the given comparison function comp.

Parameters

first	-	the beginning of the first sorted range
middle	-	the end of the first sorted range and the beginning of the second
last	-	the end of the second sorted range
comp	-	comparison function object (i.e. an object that satisfies the requirements of Compare) which returns true if the first argument is less than 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 have const&, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) Type1 and Type2 regardless of value category (thus, Type1& is not allowed, nor is Type1 unless for Type1 a move is equivalent to a copy(since C++11)). The types Type1 and Type2 must be such that an object of type BidirectionalIterator can be dereferenced and then implicitly converted to both of them.

Return value

(none)

Complexity

Exctly N-1 comparisons if enough additional memory is available, otherwise N·log(N) where Template:cpp.

See also

Template:cpp/algorithm/dcl list mergeTemplate:cpp/algorithm/dcl list sortTemplate:cpp/algorithm/dcl list stable sort