<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>libstdc++: merge.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">libstdc++</div>
</td>
</tr>
</tbody>
</table>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('a00944.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">merge.h</div> </div>
</div>
<div class="contents">
<a href="a00944.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// -*- C++ -*-</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment">// Copyright (C) 2007, 2008, 2009 Free Software Foundation, Inc.</span>
<a name="l00004"></a>00004 <span class="comment">//</span>
<a name="l00005"></a>00005 <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span>
<a name="l00006"></a>00006 <span class="comment">// software; you can redistribute it and/or modify it under the terms</span>
<a name="l00007"></a>00007 <span class="comment">// of the GNU General Public License as published by the Free Software</span>
<a name="l00008"></a>00008 <span class="comment">// Foundation; either version 3, or (at your option) any later</span>
<a name="l00009"></a>00009 <span class="comment">// version.</span>
<a name="l00010"></a>00010
<a name="l00011"></a>00011 <span class="comment">// This library is distributed in the hope that it will be useful, but</span>
<a name="l00012"></a>00012 <span class="comment">// WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00013"></a>00013 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00014"></a>00014 <span class="comment">// General Public License for more details.</span>
<a name="l00015"></a>00015
<a name="l00016"></a>00016 <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span>
<a name="l00017"></a>00017 <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span>
<a name="l00018"></a>00018 <span class="comment">// 3.1, as published by the Free Software Foundation.</span>
<a name="l00019"></a>00019
<a name="l00020"></a>00020 <span class="comment">// You should have received a copy of the GNU General Public License and</span>
<a name="l00021"></a>00021 <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span>
<a name="l00022"></a>00022 <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span>
<a name="l00023"></a>00023 <span class="comment">// <http://www.gnu.org/licenses/>.</span>
<a name="l00024"></a>00024 <span class="comment"></span>
<a name="l00025"></a>00025 <span class="comment">/** @file parallel/merge.h</span>
<a name="l00026"></a>00026 <span class="comment"> * @brief Parallel implementation of std::merge().</span>
<a name="l00027"></a>00027 <span class="comment"> * This file is a GNU parallel extension to the Standard C++ Library.</span>
<a name="l00028"></a>00028 <span class="comment"> */</span>
<a name="l00029"></a>00029
<a name="l00030"></a>00030 <span class="comment">// Written by Johannes Singler.</span>
<a name="l00031"></a>00031
<a name="l00032"></a>00032 <span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_MERGE_H</span>
<a name="l00033"></a>00033 <span class="preprocessor"></span><span class="preprocessor">#define _GLIBCXX_PARALLEL_MERGE_H 1</span>
<a name="l00034"></a>00034 <span class="preprocessor"></span>
<a name="l00035"></a>00035 <span class="preprocessor">#include <<a class="code" href="a00769.html" title="Includes the original header files concerned with iterators except for stream iterators. This file is a GNU parallel extension to the Standard C++ Library.">parallel/basic_iterator.h</a>></span>
<a name="l00036"></a>00036 <span class="preprocessor">#include <<a class="code" href="a01045.html">bits/stl_algo.h</a>></span>
<a name="l00037"></a>00037
<a name="l00038"></a>00038 <span class="keyword">namespace </span>__gnu_parallel
<a name="l00039"></a>00039 {<span class="comment"></span>
<a name="l00040"></a>00040 <span class="comment"> /** @brief Merge routine being able to merge only the @c __max_length</span>
<a name="l00041"></a>00041 <span class="comment"> * smallest elements.</span>
<a name="l00042"></a>00042 <span class="comment"> *</span>
<a name="l00043"></a>00043 <span class="comment"> * The @c __begin iterators are advanced accordingly, they might not</span>
<a name="l00044"></a>00044 <span class="comment"> * reach @c __end, in contrast to the usual variant.</span>
<a name="l00045"></a>00045 <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span>
<a name="l00046"></a>00046 <span class="comment"> * @param __end1 End iterator of first sequence.</span>
<a name="l00047"></a>00047 <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span>
<a name="l00048"></a>00048 <span class="comment"> * @param __end2 End iterator of second sequence.</span>
<a name="l00049"></a>00049 <span class="comment"> * @param __target Target begin iterator.</span>
<a name="l00050"></a>00050 <span class="comment"> * @param __max_length Maximum number of elements to merge.</span>
<a name="l00051"></a>00051 <span class="comment"> * @param __comp Comparator.</span>
<a name="l00052"></a>00052 <span class="comment"> * @return Output end iterator. */</span>
<a name="l00053"></a>00053 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00054"></a>00054 <span class="keyword">typename</span> _OutputIterator, <span class="keyword">typename</span> _DifferenceTp,
<a name="l00055"></a>00055 <span class="keyword">typename</span> _Compare>
<a name="l00056"></a>00056 _OutputIterator
<a name="l00057"></a><a class="code" href="a01131.html#a1fc1af41f9ea2fe246e8b19dc8bfbf8c">00057</a> <a class="code" href="a01131.html#a1fc1af41f9ea2fe246e8b19dc8bfbf8c" title="Merge routine being able to merge only the __max_length smallest elements.">__merge_advance_usual</a>(_RAIter1& __begin1, _RAIter1 __end1,
<a name="l00058"></a>00058 _RAIter2& __begin2, _RAIter2 __end2,
<a name="l00059"></a>00059 _OutputIterator __target,
<a name="l00060"></a>00060 _DifferenceTp __max_length, _Compare __comp)
<a name="l00061"></a>00061 {
<a name="l00062"></a>00062 <span class="keyword">typedef</span> _DifferenceTp _DifferenceType;
<a name="l00063"></a>00063 <span class="keywordflow">while</span> (__begin1 != __end1 && __begin2 != __end2 && __max_length > 0)
<a name="l00064"></a>00064 {
<a name="l00065"></a>00065 <span class="comment">// array1[__i1] < array0[i0]</span>
<a name="l00066"></a>00066 <span class="keywordflow">if</span> (__comp(*__begin2, *__begin1))
<a name="l00067"></a>00067 *__target++ = *__begin2++;
<a name="l00068"></a>00068 <span class="keywordflow">else</span>
<a name="l00069"></a>00069 *__target++ = *__begin1++;
<a name="l00070"></a>00070 --__max_length;
<a name="l00071"></a>00071 }
<a name="l00072"></a>00072
<a name="l00073"></a>00073 <span class="keywordflow">if</span> (__begin1 != __end1)
<a name="l00074"></a>00074 {
<a name="l00075"></a>00075 __target = std::copy(__begin1, __begin1 + __max_length, __target);
<a name="l00076"></a>00076 __begin1 += __max_length;
<a name="l00077"></a>00077 }
<a name="l00078"></a>00078 <span class="keywordflow">else</span>
<a name="l00079"></a>00079 {
<a name="l00080"></a>00080 __target = std::copy(__begin2, __begin2 + __max_length, __target);
<a name="l00081"></a>00081 __begin2 += __max_length;
<a name="l00082"></a>00082 }
<a name="l00083"></a>00083 <span class="keywordflow">return</span> __target;
<a name="l00084"></a>00084 }
<a name="l00085"></a>00085 <span class="comment"></span>
<a name="l00086"></a>00086 <span class="comment"> /** @brief Merge routine being able to merge only the @c __max_length</span>
<a name="l00087"></a>00087 <span class="comment"> * smallest elements.</span>
<a name="l00088"></a>00088 <span class="comment"> *</span>
<a name="l00089"></a>00089 <span class="comment"> * The @c __begin iterators are advanced accordingly, they might not</span>
<a name="l00090"></a>00090 <span class="comment"> * reach @c __end, in contrast to the usual variant.</span>
<a name="l00091"></a>00091 <span class="comment"> * Specially designed code should allow the compiler to generate</span>
<a name="l00092"></a>00092 <span class="comment"> * conditional moves instead of branches.</span>
<a name="l00093"></a>00093 <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span>
<a name="l00094"></a>00094 <span class="comment"> * @param __end1 End iterator of first sequence.</span>
<a name="l00095"></a>00095 <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span>
<a name="l00096"></a>00096 <span class="comment"> * @param __end2 End iterator of second sequence.</span>
<a name="l00097"></a>00097 <span class="comment"> * @param __target Target begin iterator.</span>
<a name="l00098"></a>00098 <span class="comment"> * @param __max_length Maximum number of elements to merge.</span>
<a name="l00099"></a>00099 <span class="comment"> * @param __comp Comparator.</span>
<a name="l00100"></a>00100 <span class="comment"> * @return Output end iterator. */</span>
<a name="l00101"></a>00101 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00102"></a>00102 <span class="keyword">typename</span> _OutputIterator, <span class="keyword">typename</span> _DifferenceTp,
<a name="l00103"></a>00103 <span class="keyword">typename</span> _Compare>
<a name="l00104"></a>00104 _OutputIterator
<a name="l00105"></a><a class="code" href="a01131.html#a91b201394a821c5366aef93baa29874d">00105</a> <a class="code" href="a01131.html#a91b201394a821c5366aef93baa29874d" title="Merge routine being able to merge only the __max_length smallest elements.">__merge_advance_movc</a>(_RAIter1& __begin1, _RAIter1 __end1,
<a name="l00106"></a>00106 _RAIter2& __begin2, _RAIter2 __end2,
<a name="l00107"></a>00107 _OutputIterator __target,
<a name="l00108"></a>00108 _DifferenceTp __max_length, _Compare __comp)
<a name="l00109"></a>00109 {
<a name="l00110"></a>00110 <span class="keyword">typedef</span> _DifferenceTp _DifferenceType;
<a name="l00111"></a>00111 <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_RAIter1>::value_type
<a name="l00112"></a>00112 _ValueType1;
<a name="l00113"></a>00113 <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_RAIter2>::value_type
<a name="l00114"></a>00114 _ValueType2;
<a name="l00115"></a>00115
<a name="l00116"></a>00116 <span class="preprocessor">#if _GLIBCXX_ASSERTIONS</span>
<a name="l00117"></a>00117 <span class="preprocessor"></span> _GLIBCXX_PARALLEL_ASSERT(__max_length >= 0);
<a name="l00118"></a>00118 <span class="preprocessor">#endif</span>
<a name="l00119"></a>00119 <span class="preprocessor"></span>
<a name="l00120"></a>00120 <span class="keywordflow">while</span> (__begin1 != __end1 && __begin2 != __end2 && __max_length > 0)
<a name="l00121"></a>00121 {
<a name="l00122"></a>00122 _RAIter1 __next1 = __begin1 + 1;
<a name="l00123"></a>00123 _RAIter2 __next2 = __begin2 + 1;
<a name="l00124"></a>00124 _ValueType1 __element1 = *__begin1;
<a name="l00125"></a>00125 _ValueType2 __element2 = *__begin2;
<a name="l00126"></a>00126
<a name="l00127"></a>00127 <span class="keywordflow">if</span> (__comp(__element2, __element1))
<a name="l00128"></a>00128 {
<a name="l00129"></a>00129 __element1 = __element2;
<a name="l00130"></a>00130 __begin2 = __next2;
<a name="l00131"></a>00131 }
<a name="l00132"></a>00132 <span class="keywordflow">else</span>
<a name="l00133"></a>00133 __begin1 = __next1;
<a name="l00134"></a>00134
<a name="l00135"></a>00135 *__target = __element1;
<a name="l00136"></a>00136
<a name="l00137"></a>00137 ++__target;
<a name="l00138"></a>00138 --__max_length;
<a name="l00139"></a>00139 }
<a name="l00140"></a>00140 <span class="keywordflow">if</span> (__begin1 != __end1)
<a name="l00141"></a>00141 {
<a name="l00142"></a>00142 __target = std::copy(__begin1, __begin1 + __max_length, __target);
<a name="l00143"></a>00143 __begin1 += __max_length;
<a name="l00144"></a>00144 }
<a name="l00145"></a>00145 <span class="keywordflow">else</span>
<a name="l00146"></a>00146 {
<a name="l00147"></a>00147 __target = std::copy(__begin2, __begin2 + __max_length, __target);
<a name="l00148"></a>00148 __begin2 += __max_length;
<a name="l00149"></a>00149 }
<a name="l00150"></a>00150 <span class="keywordflow">return</span> __target;
<a name="l00151"></a>00151 }
<a name="l00152"></a>00152 <span class="comment"></span>
<a name="l00153"></a>00153 <span class="comment"> /** @brief Merge routine being able to merge only the @c __max_length</span>
<a name="l00154"></a>00154 <span class="comment"> * smallest elements.</span>
<a name="l00155"></a>00155 <span class="comment"> *</span>
<a name="l00156"></a>00156 <span class="comment"> * The @c __begin iterators are advanced accordingly, they might not</span>
<a name="l00157"></a>00157 <span class="comment"> * reach @c __end, in contrast to the usual variant.</span>
<a name="l00158"></a>00158 <span class="comment"> * Static switch on whether to use the conditional-move variant.</span>
<a name="l00159"></a>00159 <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span>
<a name="l00160"></a>00160 <span class="comment"> * @param __end1 End iterator of first sequence.</span>
<a name="l00161"></a>00161 <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span>
<a name="l00162"></a>00162 <span class="comment"> * @param __end2 End iterator of second sequence.</span>
<a name="l00163"></a>00163 <span class="comment"> * @param __target Target begin iterator.</span>
<a name="l00164"></a>00164 <span class="comment"> * @param __max_length Maximum number of elements to merge.</span>
<a name="l00165"></a>00165 <span class="comment"> * @param __comp Comparator.</span>
<a name="l00166"></a>00166 <span class="comment"> * @return Output end iterator. */</span>
<a name="l00167"></a>00167 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00168"></a>00168 <span class="keyword">typename</span> _OutputIterator, <span class="keyword">typename</span> _DifferenceTp,
<a name="l00169"></a>00169 <span class="keyword">typename</span> _Compare>
<a name="l00170"></a>00170 <span class="keyword">inline</span> _OutputIterator
<a name="l00171"></a><a class="code" href="a01131.html#a561e519e16da73c92020af2b2ad4af36">00171</a> <a class="code" href="a01131.html#a561e519e16da73c92020af2b2ad4af36" title="Merge routine being able to merge only the __max_length smallest elements.">__merge_advance</a>(_RAIter1& __begin1, _RAIter1 __end1,
<a name="l00172"></a>00172 _RAIter2& __begin2, _RAIter2 __end2,
<a name="l00173"></a>00173 _OutputIterator __target, _DifferenceTp __max_length,
<a name="l00174"></a>00174 _Compare __comp)
<a name="l00175"></a>00175 {
<a name="l00176"></a>00176 <a class="code" href="a00811.html#a77fb93c9cecec331ccee755972695128" title="Macro to produce log message when entering a function.">_GLIBCXX_CALL</a>(__max_length)
<a name="l00177"></a>00177
<a name="l00178"></a>00178 <span class="keywordflow">return</span> <a class="code" href="a01131.html#a91b201394a821c5366aef93baa29874d" title="Merge routine being able to merge only the __max_length smallest elements.">__merge_advance_movc</a>(__begin1, __end1, __begin2, __end2,
<a name="l00179"></a>00179 __target, __max_length, __comp);
<a name="l00180"></a>00180 }
<a name="l00181"></a>00181 <span class="comment"></span>
<a name="l00182"></a>00182 <span class="comment"> /** @brief Merge routine fallback to sequential in case the</span>
<a name="l00183"></a>00183 <span class="comment"> iterators of the two input sequences are of different type.</span>
<a name="l00184"></a>00184 <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span>
<a name="l00185"></a>00185 <span class="comment"> * @param __end1 End iterator of first sequence.</span>
<a name="l00186"></a>00186 <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span>
<a name="l00187"></a>00187 <span class="comment"> * @param __end2 End iterator of second sequence.</span>
<a name="l00188"></a>00188 <span class="comment"> * @param __target Target begin iterator.</span>
<a name="l00189"></a>00189 <span class="comment"> * @param __max_length Maximum number of elements to merge.</span>
<a name="l00190"></a>00190 <span class="comment"> * @param __comp Comparator.</span>
<a name="l00191"></a>00191 <span class="comment"> * @return Output end iterator. */</span>
<a name="l00192"></a>00192 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,
<a name="l00193"></a>00193 <span class="keyword">typename</span> _RAIter3, <span class="keyword">typename</span> _Compare>
<a name="l00194"></a>00194 <span class="keyword">inline</span> _RAIter3
<a name="l00195"></a><a class="code" href="a01131.html#a54331cd5fa8e9737d0e301a932ab2671">00195</a> <a class="code" href="a01131.html#a54331cd5fa8e9737d0e301a932ab2671" title="Merge routine fallback to sequential in case the iterators of the two input sequences are of differen...">__parallel_merge_advance</a>(_RAIter1& __begin1, _RAIter1 __end1,
<a name="l00196"></a>00196 _RAIter2& __begin2,
<a name="l00197"></a>00197 <span class="comment">// different iterators, parallel implementation</span>
<a name="l00198"></a>00198 <span class="comment">// not available</span>
<a name="l00199"></a>00199 _RAIter2 __end2, _RAIter3 __target, <span class="keyword">typename</span>
<a name="l00200"></a>00200 std::iterator_traits<_RAIter1>::
<a name="l00201"></a>00201 difference_type __max_length, _Compare __comp)
<a name="l00202"></a>00202 { <span class="keywordflow">return</span> <a class="code" href="a01131.html#a561e519e16da73c92020af2b2ad4af36" title="Merge routine being able to merge only the __max_length smallest elements.">__merge_advance</a>(__begin1, __end1, __begin2, __end2, __target,
<a name="l00203"></a>00203 __max_length, __comp); }
<a name="l00204"></a>00204 <span class="comment"></span>
<a name="l00205"></a>00205 <span class="comment"> /** @brief Parallel merge routine being able to merge only the @c</span>
<a name="l00206"></a>00206 <span class="comment"> * __max_length smallest elements.</span>
<a name="l00207"></a>00207 <span class="comment"> *</span>
<a name="l00208"></a>00208 <span class="comment"> * The @c __begin iterators are advanced accordingly, they might not</span>
<a name="l00209"></a>00209 <span class="comment"> * reach @c __end, in contrast to the usual variant.</span>
<a name="l00210"></a>00210 <span class="comment"> * The functionality is projected onto parallel_multiway_merge.</span>
<a name="l00211"></a>00211 <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span>
<a name="l00212"></a>00212 <span class="comment"> * @param __end1 End iterator of first sequence.</span>
<a name="l00213"></a>00213 <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span>
<a name="l00214"></a>00214 <span class="comment"> * @param __end2 End iterator of second sequence.</span>
<a name="l00215"></a>00215 <span class="comment"> * @param __target Target begin iterator.</span>
<a name="l00216"></a>00216 <span class="comment"> * @param __max_length Maximum number of elements to merge.</span>
<a name="l00217"></a>00217 <span class="comment"> * @param __comp Comparator.</span>
<a name="l00218"></a>00218 <span class="comment"> * @return Output end iterator.</span>
<a name="l00219"></a>00219 <span class="comment"> */</span>
<a name="l00220"></a>00220 <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter3,
<a name="l00221"></a>00221 <span class="keyword">typename</span> _Compare>
<a name="l00222"></a>00222 <span class="keyword">inline</span> _RAIter3
<a name="l00223"></a><a class="code" href="a01131.html#a091f07cdfa6e2472d7801077c233991a">00223</a> <a class="code" href="a01131.html#a54331cd5fa8e9737d0e301a932ab2671" title="Merge routine fallback to sequential in case the iterators of the two input sequences are of differen...">__parallel_merge_advance</a>(_RAIter1& __begin1, _RAIter1 __end1,
<a name="l00224"></a>00224 _RAIter1& __begin2, _RAIter1 __end2,
<a name="l00225"></a>00225 _RAIter3 __target, <span class="keyword">typename</span>
<a name="l00226"></a>00226 std::iterator_traits<_RAIter1>::
<a name="l00227"></a>00227 difference_type __max_length, _Compare __comp)
<a name="l00228"></a>00228 {
<a name="l00229"></a>00229 <span class="keyword">typedef</span> <span class="keyword">typename</span>
<a name="l00230"></a>00230 std::iterator_traits<_RAIter1>::value_type _ValueType;
<a name="l00231"></a>00231 <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_RAIter1>::
<a name="l00232"></a>00232 difference_type _DifferenceType1 <span class="comment">/* == difference_type2 */</span>;
<a name="l00233"></a>00233 <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_RAIter3>::
<a name="l00234"></a>00234 difference_type _DifferenceType3;
<a name="l00235"></a>00235 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<_RAIter1, _RAIter1></a>
<a name="l00236"></a>00236 <a class="code" href="a00125.html" title="A pair of iterators. The usual iterator operations are applied to both child iterators.">_IteratorPair</a>;
<a name="l00237"></a>00237
<a name="l00238"></a>00238 _IteratorPair __seqs[2] = { <a class="code" href="a01137.html#a9345a6e2e39831b4291cac2e52a15792" title="A convenience wrapper for creating a pair from two objects.">std::make_pair</a>(__begin1, __end1),
<a name="l00239"></a>00239 <a class="code" href="a01137.html#a9345a6e2e39831b4291cac2e52a15792" title="A convenience wrapper for creating a pair from two objects.">std::make_pair</a>(__begin2, __end2) };
<a name="l00240"></a>00240 _RAIter3 __target_end = <a class="code" href="a01131.html#a9b5175c6db6a527546dbc38c162d570a" title="Parallel multi-way merge routine.">parallel_multiway_merge</a>
<a name="l00241"></a>00241 < <span class="comment">/* __stable = */</span> <span class="keyword">true</span>, <span class="comment">/* __sentinels = */</span> <span class="keyword">false</span>>
<a name="l00242"></a>00242 (__seqs, __seqs + 2, __target, <a class="code" href="a01131.html#aa9c136e660a60d90d6f57c8ec38ddb77" title="Exact splitting for parallel multiway-merge routine.">multiway_merge_exact_splitting</a>
<a name="l00243"></a>00243 < <span class="comment">/* __stable = */</span> <span class="keyword">true</span>, _IteratorPair*,
<a name="l00244"></a>00244 _Compare, _DifferenceType1>, __max_length, __comp,
<a name="l00245"></a>00245 omp_get_max_threads());
<a name="l00246"></a>00246
<a name="l00247"></a>00247 <span class="keywordflow">return</span> __target_end;
<a name="l00248"></a>00248 }
<a name="l00249"></a>00249 } <span class="comment">//namespace __gnu_parallel</span>
<a name="l00250"></a>00250
<a name="l00251"></a>00251 <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_MERGE_H */</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a00944.html">merge.h</a> </li>
<li class="footer">Generated by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </li>
</ul>
</div>
</body>
</html>
