mirror of
https://github.com/boostorg/compute.git
synced 2026-01-31 08:02:16 +00:00
fab7be5f43
This adds a simple inplace_merge() algorithm which merges two contiguous sorted ranges in-place. For now, the implementation simply copies the ranges to two temporary vectors and calls merge().
38 lines
1.1 KiB
XML
38 lines
1.1 KiB
XML
<?xml version="1.0" encoding="utf-8"?>
|
|
<header name="boost/compute/algorithm/inplace_merge.hpp">
|
|
<namespace name="boost">
|
|
<namespace name="compute">
|
|
|
|
<!-- boost::compute::inplace_merge(first, middle, last, queue) -->
|
|
<function name="inplace_merge">
|
|
<template>
|
|
<template-type-parameter name="Iterator"/>
|
|
</template>
|
|
|
|
<type>void</type>
|
|
|
|
<parameter name="first">
|
|
<paramtype>Iterator</paramtype>
|
|
</parameter>
|
|
<parameter name="middle">
|
|
<paramtype>Iterator</paramtype>
|
|
</parameter>
|
|
<parameter name="last">
|
|
<paramtype>Iterator</paramtype>
|
|
</parameter>
|
|
<parameter name="queue">
|
|
<paramtype>command_queue &</paramtype>
|
|
</parameter>
|
|
|
|
<description>
|
|
<para>
|
|
Merges the sorted values in the range [<code>first</code>,
|
|
<code>middle</code>) with the sorted values in the range
|
|
[<code>middle</code>, <code>last</code>) in-place.
|
|
</para>
|
|
</description>
|
|
</function>
|
|
</namespace>
|
|
</namespace>
|
|
</header>
|