Namespaces
Variants
Views
Actions

std::inplace_merge

From cppreference.com
< cpp‎ | algorithm
Revision as of 16:10, 6 May 2011 by WikiSysop (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 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.

Template:params

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) 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 RandomAccessIterator can be dereferenced and then implicitly converted to both of them.

Template:returns an output iterator to element past the last element copied.

Template:example cpp

Template:complex

At most Template:cpp comparisons.

Template:see also

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