mirror of
https://github.com/boostorg/compute.git
synced 2026-01-27 18:52:15 +00:00
69aef15cab
This implements the merge() algorithm which merges two ranges of sorted values into a single sorted range. The current implementation uses a simple serial merge algorithm. A GPU optimized version is coming soon.
56 lines
1.8 KiB
XML
56 lines
1.8 KiB
XML
<?xml version="1.0" encoding="utf-8"?>
|
|
<header name="boost/compute/algorithm/merge.hpp">
|
|
<namespace name="boost">
|
|
<namespace name="compute">
|
|
|
|
<!-- boost::compute::merge(first1,
|
|
last1,
|
|
first2,
|
|
last2,
|
|
result,
|
|
queue) -->
|
|
<function name="merge">
|
|
<template>
|
|
<template-type-parameter name="InputIterator1"/>
|
|
<template-type-parameter name="InputIterator2"/>
|
|
<template-type-parameter name="OutputIterator"/>
|
|
</template>
|
|
|
|
<type>OutputIterator</type>
|
|
|
|
<parameter name="first1">
|
|
<paramtype>InputIterator1</paramtype>
|
|
</parameter>
|
|
<parameter name="last1">
|
|
<paramtype>InputIterator1</paramtype>
|
|
</parameter>
|
|
<parameter name="first2">
|
|
<paramtype>InputIterator2</paramtype>
|
|
</parameter>
|
|
<parameter name="last2">
|
|
<paramtype>InputIterator2</paramtype>
|
|
</parameter>
|
|
<parameter name="result">
|
|
<paramtype>OutputIterator</paramtype>
|
|
</parameter>
|
|
<parameter name="queue">
|
|
<paramtype>command_queue &</paramtype>
|
|
</parameter>
|
|
|
|
<returns>
|
|
An iterator pointing to the end of the result range.
|
|
</returns>
|
|
|
|
<description>
|
|
<para>
|
|
Merges the sorted values in the range [<code>first1</code>,
|
|
<code>last1</code>) with the sorted values in the range
|
|
[<code>first2</code>, <code>last2</code>) and places the output in
|
|
the range beginning at <code>result</code>.
|
|
</para>
|
|
</description>
|
|
</function>
|
|
</namespace>
|
|
</namespace>
|
|
</header>
|