std::inplace_merge
Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">
<td><algorithm>
<td></td> <td></td> </tr> <tr class="t-dcl ">
<td >void inplace_merge( BidirectionalIterator first,
BidirectionalIterator middle,
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >void inplace_merge( BidirectionalIterator first,
BidirectionalIterator middle,
BidirectionalIterator last,
<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end
Merges two sorted ranges [first1, last1)
and [first2, last2)
into one sorted range beginning at d_first
. The first version uses Template:cpp to compare the elements, the second version uses the given comparison function comp
.
first1, last1 | - | the first range of elements to merge |
first2, last2 | - | the second range of elements to merge |
d_first | - | the beginning of the destination 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) |
Template:returns an output iterator to element past the last element copied.
This section is incomplete Reason: no example |
At most Template:cpp comparisons.