<!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++: multiway_mergesort.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('a00920_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">multiway_mergesort.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00920.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/multiway_mergesort.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Parallel multiway merge sort.</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_MULTIWAY_MERGESORT_H</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_MULTIWAY_MERGESORT_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="a00182.html">vector</a>></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <<a class="code" href="a00875.html">parallel/basic_iterator.h</a>></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include <<a class="code" href="a00527.html">bits/stl_algo.h</a>></span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include <<a class="code" href="a00935.html">parallel/parallel.h</a>></span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include <<a class="code" href="a00917.html">parallel/multiway_merge.h</a>></span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">namespace </span><a class="code" href="a01575.html">__gnu_parallel</a></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> {<span class="comment"></span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> /** @brief Subsequence description. */</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _DifferenceTp></div><div class="line"><a name="l00046"></a><span class="lineno"><a class="line" href="a09559.html"> 46</a></span>  <span class="keyword">struct </span><a class="code" href="a09559.html">_Piece</a></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  {</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">typedef</span> _DifferenceTp _DifferenceType;</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"></span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> /** @brief Begin of subsequence. */</span></div><div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="a09559.html#a6f846c8afc04193f46d5a1a490bd3ee2"> 51</a></span>  _DifferenceType <a class="code" href="a09559.html#a6f846c8afc04193f46d5a1a490bd3ee2">_M_begin</a>;</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"></span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> /** @brief End of subsequence. */</span></div><div class="line"><a name="l00054"></a><span class="lineno"><a class="line" href="a09559.html#ab0315ceba623516eccee17cd7650d705"> 54</a></span>  _DifferenceType <a class="code" href="a09559.html#ab0315ceba623516eccee17cd7650d705">_M_end</a>;</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  };</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"></span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> /** @brief Data accessed by all threads.</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> *</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> * PMWMS = parallel multiway mergesort */</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter></div><div class="line"><a name="l00061"></a><span class="lineno"><a class="line" href="a09563.html"> 61</a></span>  <span class="keyword">struct </span><a class="code" href="a09563.html">_PMWMSSortingData</a></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  {</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"></span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> /** @brief Number of threads involved. */</span></div><div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927"> 68</a></span>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> <a class="code" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">_M_num_threads</a>;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"></span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> /** @brief Input __begin. */</span></div><div class="line"><a name="l00071"></a><span class="lineno"><a class="line" href="a09563.html#a3a63332260c5462d462764091a404a49"> 71</a></span>  _RAIter <a class="code" href="a09563.html#a3a63332260c5462d462764091a404a49">_M_source</a>;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"></span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> /** @brief Start indices, per thread. */</span></div><div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="a09563.html#a630e321737804622cfe40105b321d745"> 74</a></span>  _DifferenceType* <a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"></span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> /** @brief Storage in which to sort. */</span></div><div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="a09563.html#abee24a2790b37147ee79b73dc22d6054"> 77</a></span>  _ValueType** <a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"></span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> /** @brief Samples. */</span></div><div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="a09563.html#a2ce4dc3b1896ffd807b1e78cad4fb6ad"> 80</a></span>  _ValueType* <a class="code" href="a09563.html#a2ce4dc3b1896ffd807b1e78cad4fb6ad">_M_samples</a>;</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"></span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> /** @brief Offsets to add to the found positions. */</span></div><div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="a09563.html#a16303d6bb873db661b0ea3605d5d0151"> 83</a></span>  _DifferenceType* <a class="code" href="a09563.html#a16303d6bb873db661b0ea3605d5d0151">_M_offsets</a>;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"></span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> /** @brief Pieces of data to merge @c [thread][__sequence] */</span></div><div class="line"><a name="l00086"></a><span class="lineno"><a class="line" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4"> 86</a></span>  <a class="code" href="a07923.html">std::vector<_Piece<_DifferenceType></a> >* <a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a>;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</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"> /**</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> * @brief Select _M_samples from a sequence.</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * @param __sd Pointer to algorithm data. _Result will be placed in</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> * @c __sd->_M_samples.</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> * @param __num_samples Number of _M_samples to select.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> */</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _DifferenceTp></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="a01575.html#a56184d12b3d8f441fc14150b15a091c7"> 97</a></span>  <a class="code" href="a01575.html#a56184d12b3d8f441fc14150b15a091c7">__determine_samples</a>(<a class="code" href="a09563.html">_PMWMSSortingData<_RAIter></a>* __sd,</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  _DifferenceTp __num_samples)</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">typedef</span> _DifferenceTp _DifferenceType;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __iam = omp_get_thread_num();</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  _DifferenceType* __es = <span class="keyword">new</span> _DifferenceType[__num_samples + 2];</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="a01575.html#ac799255921e70b0378d145924d673f9c">__equally_split</a>(__sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__iam + 1] - __sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__iam], </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  __num_samples + 1, __es);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">for</span> (_DifferenceType __i = 0; __i < __num_samples; ++__i)</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  ::<span class="keyword">new</span>(&(__sd-><a class="code" href="a09563.html#a2ce4dc3b1896ffd807b1e78cad4fb6ad">_M_samples</a>[__iam * __num_samples + __i]))</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  _ValueType(__sd-><a class="code" href="a09563.html#a3a63332260c5462d462764091a404a49">_M_source</a>[__sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__iam]</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  + __es[__i + 1]]);</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="keyword">delete</span>[] __es;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"></span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> /** @brief Split consistently. */</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> __exact, <span class="keyword">typename</span> _RAIter,</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _SortingPlacesIterator></div><div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="a09567.html"> 122</a></span>  <span class="keyword">struct </span><a class="code" href="a09567.html">_SplitConsistently</a></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  { };</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"></span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"> /** @brief Split by exact splitting. */</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare,</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">typename</span> _SortingPlacesIterator></div><div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="a09571.html"> 128</a></span>  <span class="keyword">struct </span><a class="code" href="a09567.html">_SplitConsistently</a><true, _RAIter, _Compare, _SortingPlacesIterator></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  {</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  operator()(<span class="keyword">const</span> <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __iam,</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <a class="code" href="a09563.html">_PMWMSSortingData<_RAIter></a>* __sd,</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  _Compare& __comp,</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">const</span> <span class="keyword">typename</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  std::iterator_traits<_RAIter>::difference_type</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  __num_samples)<span class="keyword"> const</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="preprocessor"># pragma omp barrier</span></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>  <a class="code" href="a07923.html">std::vector</a><<a class="code" href="a07767.html">std::pair</a><_SortingPlacesIterator,</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  _SortingPlacesIterator> ></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  __seqs(__sd-><a class="code" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">_M_num_threads</a>);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __s = 0; __s < __sd-><a class="code" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">_M_num_threads</a>; __s++)</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  __seqs[__s] = <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__sd-><a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>[__s],</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  __sd-><a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>[__s]</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  + (__sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__s + 1]</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  - __sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__s]));</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> </div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <a class="code" href="a07923.html">std::vector<_SortingPlacesIterator></a> __offsets(__sd-><a class="code" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">_M_num_threads</a>);</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">// if not last thread</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">if</span> (__iam < __sd->_M_num_threads - 1)</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <a class="code" href="a01575.html#ade1f4c5da0794c4f1a09465d4aee6c1d">multiseq_partition</a>(__seqs.begin(), __seqs.end(),</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  __sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__iam + 1], __offsets.<a class="code" href="a07923.html#ac219a7abc1e291dfe0a57189895d04d1">begin</a>(),</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  __comp);</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __seq = 0; __seq < __sd-><a class="code" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">_M_num_threads</a>; __seq++)</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  {</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">// for each sequence</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">if</span> (__iam < (__sd-><a class="code" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">_M_num_threads</a> - 1))</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  __sd-><a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a>[__iam][__seq]._M_end</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  = __offsets[__seq] - __seqs[__seq].first;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="comment">// very end of this sequence</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  __sd-><a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a>[__iam][__seq]._M_end =</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  __sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__seq + 1] - __sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__seq];</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  }</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="preprocessor"># pragma omp barrier</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> </div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __seq = 0; __seq < __sd-><a class="code" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">_M_num_threads</a>; __seq++)</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  {</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// For each sequence.</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">if</span> (__iam > 0)</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  __sd-><a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a>[__iam][__seq]._M_begin =</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  __sd-><a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a>[__iam - 1][__seq]._M_end;</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="comment">// Absolute beginning.</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  __sd-><a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a>[__iam][__seq]._M_begin = 0;</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>  }</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  };</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"></span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"> /** @brief Split by sampling. */</span> </div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare,</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keyword">typename</span> _SortingPlacesIterator></div><div class="line"><a name="l00187"></a><span class="lineno"><a class="line" href="a09575.html"> 187</a></span>  <span class="keyword">struct </span><a class="code" href="a09567.html">_SplitConsistently</a><false, _RAIter, _Compare, _SortingPlacesIterator></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  {</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  operator()(<span class="keyword">const</span> <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __iam,</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <a class="code" href="a09563.html">_PMWMSSortingData<_RAIter></a>* __sd,</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  _Compare& __comp,</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">const</span> <span class="keyword">typename</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  std::iterator_traits<_RAIter>::difference_type</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  __num_samples)<span class="keyword"> const</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <a class="code" href="a01575.html#a56184d12b3d8f441fc14150b15a091c7">__determine_samples</a>(__sd, __num_samples);</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="preprocessor"># pragma omp barrier</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> </div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="preprocessor"># pragma omp single</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  __gnu_sequential::sort(__sd-><a class="code" href="a09563.html#a2ce4dc3b1896ffd807b1e78cad4fb6ad">_M_samples</a>,</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  __sd-><a class="code" href="a09563.html#a2ce4dc3b1896ffd807b1e78cad4fb6ad">_M_samples</a></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  + (__num_samples * __sd-><a class="code" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">_M_num_threads</a>),</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  __comp);</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> </div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="preprocessor"># pragma omp barrier</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> </div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __s = 0; __s < __sd-><a class="code" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">_M_num_threads</a>; ++__s)</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  {</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="comment">// For each sequence.</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">if</span> (__num_samples * __iam > 0)</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  __sd-><a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a>[__iam][__s]._M_begin =</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  std::lower_bound(__sd-><a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>[__s],</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  __sd-><a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>[__s]</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  + (__sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__s + 1]</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  - __sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__s]),</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  __sd-><a class="code" href="a09563.html#a2ce4dc3b1896ffd807b1e78cad4fb6ad">_M_samples</a>[__num_samples * __iam],</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  __comp)</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  - __sd-><a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>[__s];</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">// Absolute beginning.</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  __sd-><a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a>[__iam][__s]._M_begin = 0;</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="keywordflow">if</span> ((__num_samples * (__iam + 1)) <</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  (__num_samples * __sd-><a class="code" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">_M_num_threads</a>))</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  __sd-><a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a>[__iam][__s]._M_end =</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  std::lower_bound(__sd-><a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>[__s],</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  __sd-><a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>[__s]</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  + (__sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__s + 1]</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  - __sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__s]),</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  __sd-><a class="code" href="a09563.html#a2ce4dc3b1896ffd807b1e78cad4fb6ad">_M_samples</a>[__num_samples * (__iam + 1)],</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  __comp)</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  - __sd-><a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>[__s];</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// Absolute end.</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  __sd-><a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a>[__iam][__s]._M_end = (__sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__s + 1]</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  - __sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__s]);</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  }</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  }</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  };</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="keyword">template</span><<span class="keywordtype">bool</span> __stable, <span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">struct </span>__possibly_stable_sort</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</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="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">struct </span>__possibly_stable_sort<true, _RAIter, _Compare></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  {</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordtype">void</span> operator()(<span class="keyword">const</span> _RAIter& __begin,</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keyword">const</span> _RAIter& __end, _Compare& __comp)<span class="keyword"> const</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="keyword"> </span>{ __gnu_sequential::stable_sort(__begin, __end, __comp); }</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  };</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> </div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keyword">struct </span>__possibly_stable_sort<false, _RAIter, _Compare></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  {</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordtype">void</span> operator()(<span class="keyword">const</span> _RAIter __begin,</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keyword">const</span> _RAIter __end, _Compare& __comp)<span class="keyword"> const</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="keyword"> </span>{ __gnu_sequential::sort(__begin, __end, __comp); }</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  };</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> __stable, <span class="keyword">typename</span> Seq_RAIter,</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare,</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">typename</span> DiffType></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keyword">struct </span>__possibly_stable_multiway_merge</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  { };</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Seq_RAIter, <span class="keyword">typename</span> _RAIter,</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _DiffType></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keyword">struct </span>__possibly_stable_multiway_merge<true, Seq_RAIter,</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  _RAIter, _Compare, _DiffType></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  {</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordtype">void</span> operator()(<span class="keyword">const</span> Seq_RAIter& __seqs_begin,</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keyword">const</span> Seq_RAIter& __seqs_end,</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keyword">const</span> _RAIter& __target,</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  _Compare& __comp,</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  _DiffType __length_am)<span class="keyword"> const</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="keyword"> </span>{ stable_multiway_merge(__seqs_begin, __seqs_end, __target,</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  __length_am, __comp, sequential_tag()); }</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  };</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> </div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Seq_RAIter, <span class="keyword">typename</span> _RAIter,</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _DiffType></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keyword">struct </span>__possibly_stable_multiway_merge<false, Seq_RAIter,</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  _RAIter, _Compare, _DiffType></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  {</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordtype">void</span> operator()(<span class="keyword">const</span> Seq_RAIter& __seqs_begin,</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keyword">const</span> Seq_RAIter& __seqs_end,</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keyword">const</span> _RAIter& __target,</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  _Compare& __comp,</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  _DiffType __length_am)<span class="keyword"> const</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="keyword"> </span>{ <a class="code" href="a01575.html#a25294b0a47406aefa9ebc5e0c151d0ce">multiway_merge</a>(__seqs_begin, __seqs_end, __target, __length_am,</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  __comp, sequential_tag()); }</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  };</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="comment"></span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> <span class="comment"> /** @brief PMWMS code executed by each thread.</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> <span class="comment"> * @param __sd Pointer to algorithm data.</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="comment"> */</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> __stable, <span class="keywordtype">bool</span> __exact, <span class="keyword">typename</span> _RAIter,</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00308"></a><span class="lineno"><a class="line" href="a01575.html#aaf84903cd78722fcd19b20ccb69c47e4"> 308</a></span>  <a class="code" href="a01575.html#aaf84903cd78722fcd19b20ccb69c47e4">parallel_sort_mwms_pu</a>(<a class="code" href="a09563.html">_PMWMSSortingData<_RAIter></a>* __sd,</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  _Compare& __comp)</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  {</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> </div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __iam = omp_get_thread_num();</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> </div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="comment">// Length of this thread's chunk, before merging.</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  _DifferenceType __length_local =</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  __sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__iam + 1] - __sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__iam];</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> </div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// Sort in temporary storage, leave space for sentinel.</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> </div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keyword">typedef</span> _ValueType* _SortingPlacesIterator;</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> </div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  __sd-><a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>[__iam] =</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  static_cast<_ValueType*>(::<span class="keyword">operator</span> <span class="keyword">new</span>(<span class="keyword">sizeof</span>(_ValueType)</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  * (__length_local + 1)));</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> </div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="comment">// Copy there.</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <a class="code" href="a01541.html#a9166c966d7525f4bda824700e5122c44">std::uninitialized_copy</a>(__sd-><a class="code" href="a09563.html#a3a63332260c5462d462764091a404a49">_M_source</a> + __sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__iam],</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  __sd-><a class="code" href="a09563.html#a3a63332260c5462d462764091a404a49">_M_source</a> + __sd-><a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a>[__iam]</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  + __length_local,</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  __sd-><a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>[__iam]);</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> </div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  __possibly_stable_sort<__stable, _SortingPlacesIterator, _Compare>()</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  (__sd-><a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>[__iam],</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  __sd-><a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>[__iam] + __length_local,</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  __comp);</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span> </div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// Invariant: locally sorted subsequence in sd->_M_temporary[__iam],</span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">// __sd->_M_temporary[__iam] + __length_local.</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">// No barrier here: Synchronization is done by the splitting routine.</span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  _DifferenceType __num_samples =</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <a class="code" href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">_Settings::get</a>().<a class="code" href="a09635.html#a0f435bbb73735fb8fdec296eed3c5996">sort_mwms_oversampling</a> * __sd-><a class="code" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">_M_num_threads</a> - 1;</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <a class="code" href="a09567.html">_SplitConsistently<__exact, _RAIter, _Compare, _SortingPlacesIterator></a>()</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  (__iam, __sd, __comp, __num_samples);</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span> </div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// Offset from __target __begin, __length after merging.</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  _DifferenceType __offset = 0, __length_am = 0;</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __s = 0; __s < __sd->_M_num_threads; __s++)</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  {</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  __length_am += (__sd->_M_pieces[__iam][__s]._M_end</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  - __sd->_M_pieces[__iam][__s]._M_begin);</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  __offset += __sd->_M_pieces[__iam][__s]._M_begin;</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  }</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> </div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">typedef</span> <a class="code" href="a07923.html">std::vector</a><</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <a class="code" href="a07767.html">std::pair<_SortingPlacesIterator, _SortingPlacesIterator></a> ></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  _SeqVector;</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  _SeqVector __seqs(__sd->_M_num_threads);</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span> </div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __s = 0; __s < __sd->_M_num_threads; ++__s)</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  {</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  __seqs[__s] =</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__sd->_M_temporary[__s]</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  + __sd->_M_pieces[__iam][__s]._M_begin,</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  __sd->_M_temporary[__s]</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  + __sd->_M_pieces[__iam][__s]._M_end);</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> </div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  __possibly_stable_multiway_merge<</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  __stable, <span class="keyword">typename</span> _SeqVector::iterator,</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  _RAIter, _Compare, _DifferenceType>()(__seqs.begin(), __seqs.end(),</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  __sd->_M_source + __offset, __comp,</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  __length_am);</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> </div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="preprocessor"># pragma omp barrier</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> </div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">for</span> (_DifferenceType __i = 0; __i < __length_local; ++__i)</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  __sd->_M_temporary[__iam][__i].~_ValueType();</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  ::operator <span class="keyword">delete</span>(__sd->_M_temporary[__iam]);</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  }</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="comment"></span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="comment"> /** @brief PMWMS main call.</span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="comment"> * @param __begin Begin iterator of sequence.</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="comment"> * @param __end End iterator of sequence.</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> <span class="comment"> * @param __num_threads Number of threads to use.</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment"> */</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> __stable, <span class="keywordtype">bool</span> __exact, <span class="keyword">typename</span> _RAIter,</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00395"></a><span class="lineno"><a class="line" href="a01575.html#ae193ac43730550b537828a117dd2797f"> 395</a></span>  <a class="code" href="a01575.html#ae193ac43730550b537828a117dd2797f">parallel_sort_mwms</a>(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  _Compare __comp,</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads)</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  {</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__end - __begin)</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> </div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> </div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  _DifferenceType __n = __end - __begin;</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> </div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">if</span> (__n <= 1)</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> </div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="comment">// at least one element per thread</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">if</span> (__num_threads > __n)</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  __num_threads = static_cast<_ThreadIndex>(__n);</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="comment">// shared variables</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <a class="code" href="a09563.html">_PMWMSSortingData<_RAIter></a> __sd;</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  _DifferenceType* __starts;</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  _DifferenceType __size;</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> </div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="preprocessor"># pragma omp parallel num_threads(__num_threads)</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  {</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  __num_threads = omp_get_num_threads(); <span class="comment">//no more threads than requested</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="preprocessor"># pragma omp single</span></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  {</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  __sd.<a class="code" href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">_M_num_threads</a> = __num_threads;</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  __sd.<a class="code" href="a09563.html#a3a63332260c5462d462764091a404a49">_M_source</a> = __begin;</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  </div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  __sd.<a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a> = <span class="keyword">new</span> _ValueType*[__num_threads];</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> </div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">if</span> (!__exact)</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  {</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  __size =</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  (<a class="code" href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">_Settings::get</a>().<a class="code" href="a09635.html#a0f435bbb73735fb8fdec296eed3c5996">sort_mwms_oversampling</a> * __num_threads - 1)</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  * __num_threads;</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  __sd.<a class="code" href="a09563.html#a2ce4dc3b1896ffd807b1e78cad4fb6ad">_M_samples</a> = static_cast<_ValueType*></div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  (::<span class="keyword">operator</span> <span class="keyword">new</span>(__size * <span class="keyword">sizeof</span>(_ValueType)));</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  }</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  __sd.<a class="code" href="a09563.html#a2ce4dc3b1896ffd807b1e78cad4fb6ad">_M_samples</a> = 0;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> </div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  __sd.<a class="code" href="a09563.html#a16303d6bb873db661b0ea3605d5d0151">_M_offsets</a> = <span class="keyword">new</span> _DifferenceType[__num_threads - 1];</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  __sd.<a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  = <span class="keyword">new</span> <a class="code" href="a07923.html">std::vector<_Piece<_DifferenceType></a> >[__num_threads];</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __s = 0; __s < __num_threads; ++__s)</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  __sd.<a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a>[__s].resize(__num_threads);</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  __starts = __sd.<a class="code" href="a09563.html#a630e321737804622cfe40105b321d745">_M_starts</a> = <span class="keyword">new</span> _DifferenceType[__num_threads + 1];</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> </div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  _DifferenceType __chunk_length = __n / __num_threads;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  _DifferenceType __split = __n % __num_threads;</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  _DifferenceType __pos = 0;</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __i = 0; __i < __num_threads; ++__i)</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  {</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  __starts[__i] = __pos;</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  __pos += ((__i < __split)</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  ? (__chunk_length + 1) : __chunk_length);</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  }</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  __starts[__num_threads] = __pos;</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  } <span class="comment">//single</span></div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span> </div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="comment">// Now sort in parallel.</span></div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  parallel_sort_mwms_pu<__stable, __exact>(&__sd, __comp);</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  } <span class="comment">//parallel</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> </div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keyword">delete</span>[] __starts;</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keyword">delete</span>[] __sd.<a class="code" href="a09563.html#abee24a2790b37147ee79b73dc22d6054">_M_temporary</a>;</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> </div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">if</span> (!__exact)</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  {</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">for</span> (_DifferenceType __i = 0; __i < __size; ++__i)</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  __sd.<a class="code" href="a09563.html#a2ce4dc3b1896ffd807b1e78cad4fb6ad">_M_samples</a>[__i].~_ValueType();</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  ::operator <span class="keyword">delete</span>(__sd.<a class="code" href="a09563.html#a2ce4dc3b1896ffd807b1e78cad4fb6ad">_M_samples</a>);</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  }</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> </div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  <span class="keyword">delete</span>[] __sd.<a class="code" href="a09563.html#a16303d6bb873db661b0ea3605d5d0151">_M_offsets</a>;</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keyword">delete</span>[] __sd.<a class="code" href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">_M_pieces</a>;</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  }</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> </div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span> } <span class="comment">//namespace __gnu_parallel</span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> </div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_MULTIWAY_MERGESORT_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a07923_html"><div class="ttname"><a href="a07923.html">std::vector</a></div><div class="ttdoc">A standard container which offers fixed time access to individual elements in any order.</div><div class="ttdef"><b>Definition:</b> <a href="a00599_source.html#l00339">stl_vector.h:339</a></div></div>
<div class="ttc" id="a07767_html"><div class="ttname"><a href="a07767.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 class="ttc" id="a09559_html"><div class="ttname"><a href="a09559.html">__gnu_parallel::_Piece</a></div><div class="ttdoc">Subsequence description.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00046">multiway_mergesort.h:46</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="a09563_html_a16303d6bb873db661b0ea3605d5d0151"><div class="ttname"><a href="a09563.html#a16303d6bb873db661b0ea3605d5d0151">__gnu_parallel::_PMWMSSortingData::_M_offsets</a></div><div class="ttdeci">_DifferenceType * _M_offsets</div><div class="ttdoc">Offsets to add to the found positions.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00083">multiway_mergesort.h:83</a></div></div>
<div class="ttc" id="a01575_html_a56184d12b3d8f441fc14150b15a091c7"><div class="ttname"><a href="a01575.html#a56184d12b3d8f441fc14150b15a091c7">__gnu_parallel::__determine_samples</a></div><div class="ttdeci">void __determine_samples(_PMWMSSortingData< _RAIter > *__sd, _DifferenceTp __num_samples)</div><div class="ttdoc">Select _M_samples from a sequence.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00097">multiway_mergesort.h:97</a></div></div>
<div class="ttc" id="a09559_html_ab0315ceba623516eccee17cd7650d705"><div class="ttname"><a href="a09559.html#ab0315ceba623516eccee17cd7650d705">__gnu_parallel::_Piece::_M_end</a></div><div class="ttdeci">_DifferenceType _M_end</div><div class="ttdoc">End of subsequence.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00054">multiway_mergesort.h:54</a></div></div>
<div class="ttc" id="a09635_html_a0f435bbb73735fb8fdec296eed3c5996"><div class="ttname"><a href="a09635.html#a0f435bbb73735fb8fdec296eed3c5996">__gnu_parallel::_Settings::sort_mwms_oversampling</a></div><div class="ttdeci">unsigned int sort_mwms_oversampling</div><div class="ttdoc">Oversampling factor for parallel std::sort (MWMS).</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00234">settings.h:234</a></div></div>
<div class="ttc" id="a09567_html"><div class="ttname"><a href="a09567.html">__gnu_parallel::_SplitConsistently</a></div><div class="ttdoc">Split consistently.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00122">multiway_mergesort.h:122</a></div></div>
<div class="ttc" id="a00935_html"><div class="ttname"><a href="a00935.html">parallel.h</a></div><div class="ttdoc">End-user include file. Provides advanced settings and tuning options. This file is a GNU parallel ext...</div></div>
<div class="ttc" id="a09563_html_a6d425f3ac66ac84994cb4f353ffb16f4"><div class="ttname"><a href="a09563.html#a6d425f3ac66ac84994cb4f353ffb16f4">__gnu_parallel::_PMWMSSortingData::_M_pieces</a></div><div class="ttdeci">std::vector< _Piece< _DifferenceType > > * _M_pieces</div><div class="ttdoc">Pieces of data to merge [thread][__sequence].</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00086">multiway_mergesort.h:86</a></div></div>
<div class="ttc" id="a09559_html_a6f846c8afc04193f46d5a1a490bd3ee2"><div class="ttname"><a href="a09559.html#a6f846c8afc04193f46d5a1a490bd3ee2">__gnu_parallel::_Piece::_M_begin</a></div><div class="ttdeci">_DifferenceType _M_begin</div><div class="ttdoc">Begin of subsequence.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00051">multiway_mergesort.h:51</a></div></div>
<div class="ttc" id="a01575_html_ade1f4c5da0794c4f1a09465d4aee6c1d"><div class="ttname"><a href="a01575.html#ade1f4c5da0794c4f1a09465d4aee6c1d">__gnu_parallel::multiseq_partition</a></div><div class="ttdeci">void multiseq_partition(_RanSeqs __begin_seqs, _RanSeqs __end_seqs, _RankType __rank, _RankIterator __begin_offsets, _Compare __comp=std::less< typename std::iterator_traits< typename std::iterator_traits< _RanSeqs >::value_type::first_type >::value_type >())</div><div class="ttdoc">Splits several sorted sequences at a certain global __rank, resulting in a splitting point for each s...</div><div class="ttdef"><b>Definition:</b> <a href="a00914_source.html#l00122">multiseq_selection.h:122</a></div></div>
<div class="ttc" id="a01575_html_ae193ac43730550b537828a117dd2797f"><div class="ttname"><a href="a01575.html#ae193ac43730550b537828a117dd2797f">__gnu_parallel::parallel_sort_mwms</a></div><div class="ttdeci">void parallel_sort_mwms(_RAIter __begin, _RAIter __end, _Compare __comp, _ThreadIndex __num_threads)</div><div class="ttdoc">PMWMS main call.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00395">multiway_mergesort.h:395</a></div></div>
<div class="ttc" id="a01541_html_a9166c966d7525f4bda824700e5122c44"><div class="ttname"><a href="a01541.html#a9166c966d7525f4bda824700e5122c44">std::uninitialized_copy</a></div><div class="ttdeci">_ForwardIterator uninitialized_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result)</div><div class="ttdoc">Copies the range [first,last) into result.</div><div class="ttdef"><b>Definition:</b> <a href="a00596_source.html#l00115">stl_uninitialized.h:115</a></div></div>
<div class="ttc" id="a01480_html_ga0409e288f07b697cb6885d1002df0bd6"><div class="ttname"><a href="a01480.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="a09563_html_abee24a2790b37147ee79b73dc22d6054"><div class="ttname"><a href="a09563.html#abee24a2790b37147ee79b73dc22d6054">__gnu_parallel::_PMWMSSortingData::_M_temporary</a></div><div class="ttdeci">_ValueType ** _M_temporary</div><div class="ttdoc">Storage in which to sort.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00077">multiway_mergesort.h:77</a></div></div>
<div class="ttc" id="a09563_html_a2ce4dc3b1896ffd807b1e78cad4fb6ad"><div class="ttname"><a href="a09563.html#a2ce4dc3b1896ffd807b1e78cad4fb6ad">__gnu_parallel::_PMWMSSortingData::_M_samples</a></div><div class="ttdeci">_ValueType * _M_samples</div><div class="ttdoc">Samples.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00080">multiway_mergesort.h:80</a></div></div>
<div class="ttc" id="a00182_html"><div class="ttname"><a href="a00182.html">vector</a></div></div>
<div class="ttc" id="a09563_html"><div class="ttname"><a href="a09563.html">__gnu_parallel::_PMWMSSortingData</a></div><div class="ttdoc">Data accessed by all threads.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00061">multiway_mergesort.h:61</a></div></div>
<div class="ttc" id="a01575_html_ac799255921e70b0378d145924d673f9c"><div class="ttname"><a href="a01575.html#ac799255921e70b0378d145924d673f9c">__gnu_parallel::__equally_split</a></div><div class="ttdeci">_OutputIterator __equally_split(_DifferenceType __n, _ThreadIndex __num_threads, _OutputIterator __s)</div><div class="ttdoc">function to split a sequence into parts of almost equal size.</div><div class="ttdef"><b>Definition:</b> <a href="a00884_source.html#l00048">equally_split.h:48</a></div></div>
<div class="ttc" id="a00875_html"><div class="ttname"><a href="a00875.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="a00881_html_a77fb93c9cecec331ccee755972695128"><div class="ttname"><a href="a00881.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="a00881_source.html#l00044">compiletime_settings.h:44</a></div></div>
<div class="ttc" id="a01575_html"><div class="ttname"><a href="a01575.html">__gnu_parallel</a></div><div class="ttdoc">GNU parallel code for public use.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00061">balanced_quicksort.h:61</a></div></div>
<div class="ttc" id="a01575_html_a25294b0a47406aefa9ebc5e0c151d0ce"><div class="ttname"><a href="a01575.html#a25294b0a47406aefa9ebc5e0c151d0ce">__gnu_parallel::multiway_merge</a></div><div class="ttdeci">_RAIterOut multiway_merge(_RAIterPairIterator __seqs_begin, _RAIterPairIterator __seqs_end, _RAIterOut __target, _DifferenceTp __length, _Compare __comp, __gnu_parallel::sequential_tag)</div><div class="ttdoc">Multiway Merge Frontend.</div><div class="ttdef"><b>Definition:</b> <a href="a00917_source.html#l01418">multiway_merge.h:1418</a></div></div>
<div class="ttc" id="a00917_html"><div class="ttname"><a href="a00917.html">multiway_merge.h</a></div><div class="ttdoc">Implementation of sequential and parallel multiway merge.</div></div>
<div class="ttc" id="a07923_html_ac219a7abc1e291dfe0a57189895d04d1"><div class="ttname"><a href="a07923.html#ac219a7abc1e291dfe0a57189895d04d1">std::vector::begin</a></div><div class="ttdeci">iterator begin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00599_source.html#l00698">stl_vector.h:698</a></div></div>
<div class="ttc" id="a09563_html_a3a63332260c5462d462764091a404a49"><div class="ttname"><a href="a09563.html#a3a63332260c5462d462764091a404a49">__gnu_parallel::_PMWMSSortingData::_M_source</a></div><div class="ttdeci">_RAIter _M_source</div><div class="ttdoc">Input __begin.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00071">multiway_mergesort.h:71</a></div></div>
<div class="ttc" id="a09635_html_abc4965eacae0b49945ebc887cb11adc1"><div class="ttname"><a href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">__gnu_parallel::_Settings::get</a></div><div class="ttdeci">static const _Settings & get()</div><div class="ttdoc">Get the global settings.</div></div>
<div class="ttc" id="a09563_html_a630e321737804622cfe40105b321d745"><div class="ttname"><a href="a09563.html#a630e321737804622cfe40105b321d745">__gnu_parallel::_PMWMSSortingData::_M_starts</a></div><div class="ttdeci">_DifferenceType * _M_starts</div><div class="ttdoc">Start indices, per thread.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00074">multiway_mergesort.h:74</a></div></div>
<div class="ttc" id="a09563_html_a96502c73cd4bc2be361ec19eb3ff4927"><div class="ttname"><a href="a09563.html#a96502c73cd4bc2be361ec19eb3ff4927">__gnu_parallel::_PMWMSSortingData::_M_num_threads</a></div><div class="ttdeci">_ThreadIndex _M_num_threads</div><div class="ttdoc">Number of threads involved.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00068">multiway_mergesort.h:68</a></div></div>
<div class="ttc" id="a01575_html_a05e502e51bfc3233671730f74a44dc6a"><div class="ttname"><a href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">__gnu_parallel::_ThreadIndex</a></div><div class="ttdeci">uint16_t _ThreadIndex</div><div class="ttdoc">Unsigned integer to index a thread number. The maximum thread number (for each processor) must fit in...</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00123">types.h:123</a></div></div>
<div class="ttc" id="a01575_html_aaf84903cd78722fcd19b20ccb69c47e4"><div class="ttname"><a href="a01575.html#aaf84903cd78722fcd19b20ccb69c47e4">__gnu_parallel::parallel_sort_mwms_pu</a></div><div class="ttdeci">void parallel_sort_mwms_pu(_PMWMSSortingData< _RAIter > *__sd, _Compare &__comp)</div><div class="ttdoc">PMWMS code executed by each thread.</div><div class="ttdef"><b>Definition:</b> <a href="a00920_source.html#l00308">multiway_mergesort.h:308</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_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_8c50ddefd65cfbc3979f354ad979e527.html">parallel</a></li><li class="navelem"><a class="el" href="a00920.html">multiway_mergesort.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
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
815
