<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: merge.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a00908_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">merge.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00908.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2007-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the terms</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// of the GNU General Public License as published by the Free Software</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Foundation; either version 3, or (at your option) any later</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful, but</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/** @file parallel/merge.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Parallel implementation of std::merge().</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * This file is a GNU parallel extension to the Standard C++ Library.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> */</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// Written by Johannes Singler.</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_MERGE_H</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_MERGE_H 1</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include <<a class="code" href="a00872.html">parallel/basic_iterator.h</a>></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <<a class="code" href="a00527.html">bits/stl_algo.h</a>></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="keyword">namespace </span><a class="code" href="a01572.html">__gnu_parallel</a></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> {<span class="comment"></span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> /** @brief Merge routine being able to merge only the @c __max_length</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * smallest elements.</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> *</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * The @c __begin iterators are advanced accordingly, they might not</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * reach @c __end, in contrast to the usual variant.</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * @param __end1 End iterator of first sequence.</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * @param __end2 End iterator of second sequence.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> * @param __target Target begin iterator.</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> * @param __max_length Maximum number of elements to merge.</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * @return Output end iterator. */</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">typename</span> _OutputIterator, <span class="keyword">typename</span> _DifferenceTp,</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  _OutputIterator</div><div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="a01572.html#a9a83f26ee291502fd0ccf83a566817c7"> 57</a></span>  <a class="code" href="a01572.html#a9a83f26ee291502fd0ccf83a566817c7">__merge_advance_usual</a>(_RAIter1& __begin1, _RAIter1 __end1,</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  _RAIter2& __begin2, _RAIter2 __end2,</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  _OutputIterator __target,</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  _DifferenceTp __max_length, _Compare __comp)</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  {</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">typedef</span> _DifferenceTp _DifferenceType;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">while</span> (__begin1 != __end1 && __begin2 != __end2 && __max_length > 0)</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  {</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// array1[__i1] < array0[i0]</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">if</span> (__comp(*__begin2, *__begin1))</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  *__target++ = *__begin2++;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  *__target++ = *__begin1++;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  --__max_length;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  }</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (__begin1 != __end1)</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  {</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  __target = std::copy(__begin1, __begin1 + __max_length, __target);</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  __begin1 += __max_length;</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  {</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  __target = std::copy(__begin2, __begin2 + __max_length, __target);</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  __begin2 += __max_length;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">return</span> __target;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"></span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> /** @brief Merge routine being able to merge only the @c __max_length</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> * smallest elements.</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> *</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> * The @c __begin iterators are advanced accordingly, they might not</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> * reach @c __end, in contrast to the usual variant.</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * Specially designed code should allow the compiler to generate</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> * conditional moves instead of branches.</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> * @param __end1 End iterator of first sequence.</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> * @param __end2 End iterator of second sequence.</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> * @param __target Target begin iterator.</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> * @param __max_length Maximum number of elements to merge.</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> * @return Output end iterator. */</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">typename</span> _OutputIterator, <span class="keyword">typename</span> _DifferenceTp,</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  _OutputIterator</div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="a01572.html#a8deacd343b40dc77deeb1a8e515e7358"> 105</a></span>  <a class="code" href="a01572.html#a8deacd343b40dc77deeb1a8e515e7358">__merge_advance_movc</a>(_RAIter1& __begin1, _RAIter1 __end1,</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  _RAIter2& __begin2, _RAIter2 __end2,</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  _OutputIterator __target,</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  _DifferenceTp __max_length, _Compare __comp)</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">typedef</span> _DifferenceTp _DifferenceType;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_RAIter1>::value_type</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  _ValueType1;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_RAIter2>::value_type</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  _ValueType2;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  _GLIBCXX_PARALLEL_ASSERT(__max_length >= 0);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">while</span> (__begin1 != __end1 && __begin2 != __end2 && __max_length > 0)</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  {</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  _RAIter1 __next1 = __begin1 + 1;</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  _RAIter2 __next2 = __begin2 + 1;</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  _ValueType1 __element1 = *__begin1;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  _ValueType2 __element2 = *__begin2;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">if</span> (__comp(__element2, __element1))</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  {</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  __element1 = __element2;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  __begin2 = __next2;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  }</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  __begin1 = __next1;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  *__target = __element1;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  ++__target;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  --__max_length;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  }</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">if</span> (__begin1 != __end1)</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  {</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  __target = std::copy(__begin1, __begin1 + __max_length, __target);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  __begin1 += __max_length;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  {</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  __target = std::copy(__begin2, __begin2 + __max_length, __target);</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  __begin2 += __max_length;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">return</span> __target;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  }</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment"></span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment"> /** @brief Merge routine being able to merge only the @c __max_length</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment"> * smallest elements.</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment"> *</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"> * The @c __begin iterators are advanced accordingly, they might not</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"> * reach @c __end, in contrast to the usual variant.</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> * Static switch on whether to use the conditional-move variant.</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> * @param __end1 End iterator of first sequence.</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> * @param __end2 End iterator of second sequence.</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> * @param __target Target begin iterator.</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> * @param __max_length Maximum number of elements to merge.</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"> * @return Output end iterator. */</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keyword">typename</span> _OutputIterator, <span class="keyword">typename</span> _DifferenceTp,</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keyword">inline</span> _OutputIterator</div><div class="line"><a name="l00171"></a><span class="lineno"><a class="line" href="a01572.html#a0059cd13cc6ab70692f8309ad92cb548"> 171</a></span>  <a class="code" href="a01572.html#a0059cd13cc6ab70692f8309ad92cb548">__merge_advance</a>(_RAIter1& __begin1, _RAIter1 __end1,</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  _RAIter2& __begin2, _RAIter2 __end2,</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  _OutputIterator __target, _DifferenceTp __max_length,</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  _Compare __comp)</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  {</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="code" href="a00878.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__max_length)</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> </div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">return</span> <a class="code" href="a01572.html#a8deacd343b40dc77deeb1a8e515e7358">__merge_advance_movc</a>(__begin1, __end1, __begin2, __end2,</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  __target, __max_length, __comp);</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  }</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"></span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> /** @brief Merge routine fallback to sequential in case the</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> iterators of the two input sequences are of different type.</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> * @param __end1 End iterator of first sequence.</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> * @param __end2 End iterator of second sequence.</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"> * @param __target Target begin iterator.</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> * @param __max_length Maximum number of elements to merge.</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> * @return Output end iterator. */</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">typename</span> _RAIter3, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">inline</span> _RAIter3</div><div class="line"><a name="l00195"></a><span class="lineno"><a class="line" href="a01572.html#af1626ed7bbe2eb745a31f18728d73f4e"> 195</a></span>  <a class="code" href="a01572.html#af1626ed7bbe2eb745a31f18728d73f4e">__parallel_merge_advance</a>(_RAIter1& __begin1, _RAIter1 __end1,</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  _RAIter2& __begin2,</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">// different iterators, parallel implementation</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// not available</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  _RAIter2 __end2, _RAIter3 __target, <span class="keyword">typename</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  std::iterator_traits<_RAIter1>::</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  difference_type __max_length, _Compare __comp)</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  { <span class="keywordflow">return</span> <a class="code" href="a01572.html#a0059cd13cc6ab70692f8309ad92cb548">__merge_advance</a>(__begin1, __end1, __begin2, __end2, __target,</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  __max_length, __comp); }</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"></span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment"> /** @brief Parallel merge routine being able to merge only the @c</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment"> * __max_length smallest elements.</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment"> *</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"> * The @c __begin iterators are advanced accordingly, they might not</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"> * reach @c __end, in contrast to the usual variant.</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment"> * The functionality is projected onto parallel_multiway_merge.</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment"> * @param __end1 End iterator of first sequence.</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment"> * @param __end2 End iterator of second sequence.</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment"> * @param __target Target begin iterator.</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="comment"> * @param __max_length Maximum number of elements to merge.</span></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> * @return Output end iterator.</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="comment"> */</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter3,</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keyword">inline</span> _RAIter3</div><div class="line"><a name="l00223"></a><span class="lineno"><a class="line" href="a01572.html#ac4196b48ff7ecf5ca0f8f2cdee8681c5"> 223</a></span>  <a class="code" href="a01572.html#af1626ed7bbe2eb745a31f18728d73f4e">__parallel_merge_advance</a>(_RAIter1& __begin1, _RAIter1 __end1,</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  _RAIter1& __begin2, _RAIter1 __end2,</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  _RAIter3 __target, <span class="keyword">typename</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  std::iterator_traits<_RAIter1>::</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  difference_type __max_length, _Compare __comp)</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  {</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  std::iterator_traits<_RAIter1>::value_type _ValueType;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_RAIter1>::</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  difference_type _DifferenceType1 <span class="comment">/* == difference_type2 */</span>;</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_RAIter3>::</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  difference_type _DifferenceType3;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a07764.html">std::pair<_RAIter1, _RAIter1></a></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="a09432.html">_IteratorPair</a>;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> </div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <a class="code" href="a09432.html">_IteratorPair</a> __seqs[2] = { <a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__begin1, __end1),</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__begin2, __end2) };</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  _RAIter3 __target_end = <a class="code" href="a01572.html#a14c854d00d1321cf1ee7f6d12fb955c4">parallel_multiway_merge</a></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  < <span class="comment">/* __stable = */</span> <span class="keyword">true</span>, <span class="comment">/* __sentinels = */</span> <span class="keyword">false</span>></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  (__seqs, __seqs + 2, __target, <a class="code" href="a01572.html#a567621588e461a8759651e29cd964ab9">multiway_merge_exact_splitting</a></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  < <span class="comment">/* __stable = */</span> <span class="keyword">true</span>, <a class="code" href="a09432.html">_IteratorPair</a>*,</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  _Compare, _DifferenceType1>, __max_length, __comp,</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  omp_get_max_threads());</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> </div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">return</span> __target_end;</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  }</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> } <span class="comment">//namespace __gnu_parallel</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_MERGE_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a01572_html_a567621588e461a8759651e29cd964ab9"><div class="ttname"><a href="a01572.html#a567621588e461a8759651e29cd964ab9">__gnu_parallel::multiway_merge_exact_splitting</a></div><div class="ttdeci">void multiway_merge_exact_splitting(_RAIterIterator __seqs_begin, _RAIterIterator __seqs_end, _DifferenceType __length, _DifferenceType __total_length, _Compare __comp, std::vector< std::pair< _DifferenceType, _DifferenceType > > *__pieces)</div><div class="ttdoc">Exact splitting for parallel multiway-merge routine.</div><div class="ttdef"><b>Definition:</b> <a href="a00914_source.html#l01120">multiway_merge.h:1120</a></div></div>
<div class="ttc" id="a01572_html_af1626ed7bbe2eb745a31f18728d73f4e"><div class="ttname"><a href="a01572.html#af1626ed7bbe2eb745a31f18728d73f4e">__gnu_parallel::__parallel_merge_advance</a></div><div class="ttdeci">_RAIter3 __parallel_merge_advance(_RAIter1 &__begin1, _RAIter1 __end1, _RAIter2 &__begin2, _RAIter2 __end2, _RAIter3 __target, typename std::iterator_traits< _RAIter1 >::difference_type __max_length, _Compare __comp)</div><div class="ttdoc">Merge routine fallback to sequential in case the iterators of the two input sequences are of differen...</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00195">merge.h:195</a></div></div>
<div class="ttc" id="a00527_html"><div class="ttname"><a href="a00527.html">stl_algo.h</a></div></div>
<div class="ttc" id="a01572_html_a8deacd343b40dc77deeb1a8e515e7358"><div class="ttname"><a href="a01572.html#a8deacd343b40dc77deeb1a8e515e7358">__gnu_parallel::__merge_advance_movc</a></div><div class="ttdeci">_OutputIterator __merge_advance_movc(_RAIter1 &__begin1, _RAIter1 __end1, _RAIter2 &__begin2, _RAIter2 __end2, _OutputIterator __target, _DifferenceTp __max_length, _Compare __comp)</div><div class="ttdoc">Merge routine being able to merge only the __max_length smallest elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00105">merge.h:105</a></div></div>
<div class="ttc" id="a01477_html_ga0409e288f07b697cb6885d1002df0bd6"><div class="ttname"><a href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a></div><div class="ttdeci">constexpr pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)</div><div class="ttdoc">A convenience wrapper for creating a pair from two objects.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00524">stl_pair.h:524</a></div></div>
<div class="ttc" id="a01572_html_a9a83f26ee291502fd0ccf83a566817c7"><div class="ttname"><a href="a01572.html#a9a83f26ee291502fd0ccf83a566817c7">__gnu_parallel::__merge_advance_usual</a></div><div class="ttdeci">_OutputIterator __merge_advance_usual(_RAIter1 &__begin1, _RAIter1 __end1, _RAIter2 &__begin2, _RAIter2 __end2, _OutputIterator __target, _DifferenceTp __max_length, _Compare __comp)</div><div class="ttdoc">Merge routine being able to merge only the __max_length smallest elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00057">merge.h:57</a></div></div>
<div class="ttc" id="a01572_html_a0059cd13cc6ab70692f8309ad92cb548"><div class="ttname"><a href="a01572.html#a0059cd13cc6ab70692f8309ad92cb548">__gnu_parallel::__merge_advance</a></div><div class="ttdeci">_OutputIterator __merge_advance(_RAIter1 &__begin1, _RAIter1 __end1, _RAIter2 &__begin2, _RAIter2 __end2, _OutputIterator __target, _DifferenceTp __max_length, _Compare __comp)</div><div class="ttdoc">Merge routine being able to merge only the __max_length smallest elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00908_source.html#l00171">merge.h:171</a></div></div>
<div class="ttc" id="a00878_html_a77fb93c9cecec331ccee755972695128"><div class="ttname"><a href="a00878.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a></div><div class="ttdeci">#define _GLIBCXX_CALL(__n)</div><div class="ttdoc">Macro to produce log message when entering a function.</div><div class="ttdef"><b>Definition:</b> <a href="a00878_source.html#l00044">compiletime_settings.h:44</a></div></div>
<div class="ttc" id="a09432_html"><div class="ttname"><a href="a09432.html">__gnu_parallel::_IteratorPair</a></div><div class="ttdoc">A pair of iterators. The usual iterator operations are applied to both child iterators.</div><div class="ttdef"><b>Definition:</b> <a href="a00899_source.html#l00045">iterator.h:45</a></div></div>
<div class="ttc" id="a01572_html_a14c854d00d1321cf1ee7f6d12fb955c4"><div class="ttname"><a href="a01572.html#a14c854d00d1321cf1ee7f6d12fb955c4">__gnu_parallel::parallel_multiway_merge</a></div><div class="ttdeci">_RAIter3 parallel_multiway_merge(_RAIterIterator __seqs_begin, _RAIterIterator __seqs_end, _RAIter3 __target, _Splitter __splitter, _DifferenceTp __length, _Compare __comp, _ThreadIndex __num_threads)</div><div class="ttdoc">Parallel multi-way merge routine.</div><div class="ttdef"><b>Definition:</b> <a href="a00914_source.html#l01225">multiway_merge.h:1225</a></div></div>
<div class="ttc" id="a00872_html"><div class="ttname"><a href="a00872.html">basic_iterator.h</a></div><div class="ttdoc">Includes the original header files concerned with iterators except for stream iterators....</div></div>
<div class="ttc" id="a01572_html"><div class="ttname"><a href="a01572.html">__gnu_parallel</a></div><div class="ttdoc">GNU parallel code for public use.</div><div class="ttdef"><b>Definition:</b> <a href="a00869_source.html#l00061">balanced_quicksort.h:61</a></div></div>
<div class="ttc" id="a07764_html"><div class="ttname"><a href="a07764.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00208">stl_pair.h:208</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_2f1ac407c3bb97b79c0150323d069a39.html">parallel</a></li><li class="navelem"><a class="el" href="a00908.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.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
0448c66ab6afa2f787658c5e6488e2d9
>
files
>
804
