<!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++: quicksort.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('a00947_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">quicksort.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00947.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/quicksort.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Implementation of a unbalanced parallel quicksort (in-place).</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_QUICKSORT_H</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_QUICKSORT_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="a00935.html">parallel/parallel.h</a>></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <<a class="code" href="a00941.html">parallel/partition.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="a01575.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 Unbalanced quicksort divide step.</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * @param __begin Begin iterator of subsequence.</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * @param __end End iterator of subsequence.</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * @param __pivot_rank Desired __rank of the pivot.</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * @param __num_samples Choose pivot from that many samples.</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * @param __num_threads Number of threads that are allowed to work on</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * this part.</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> */</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">typename</span> std::iterator_traits<_RAIter>::difference_type</div><div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="a01575.html#a55defa3d8e8ca7b4e52330b9afc0b1ce"> 51</a></span>  <a class="code" href="a01575.html#a55defa3d8e8ca7b4e52330b9afc0b1ce">__parallel_sort_qs_divide</a>(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  _Compare __comp, <span class="keyword">typename</span> std::iterator_traits</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <_RAIter>::difference_type __pivot_rank,</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">typename</span> std::iterator_traits</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <_RAIter>::difference_type</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  __num_samples, <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads)</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  {</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</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>  _DifferenceType __n = __end - __begin;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  __num_samples = <a class="code" href="a01485.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__num_samples, __n);</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">// Allocate uninitialized, to avoid default constructor.</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  _ValueType* __samples = static_cast<_ValueType*></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  (::<span class="keyword">operator</span> <span class="keyword">new</span>(__num_samples * <span class="keyword">sizeof</span>(_ValueType)));</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">for</span> (_DifferenceType __s = 0; __s < __num_samples; ++__s)</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> __index = static_cast<unsigned long long></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  (__s) * __n / __num_samples;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  ::new(&(__samples[__s])) _ValueType(__begin[__index]);</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> </div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  __gnu_sequential::sort(__samples, __samples + __num_samples, __comp);</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>  _ValueType& __pivot = __samples[__pivot_rank * __num_samples / __n];</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>  <a class="code" href="a09299.html">__gnu_parallel::__binder2nd<_Compare, _ValueType, _ValueType, bool></a></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  __pred(__comp, __pivot);</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  _DifferenceType __split = <a class="code" href="a01575.html#aa56788b479955dd136d6af173d2cae0b">__parallel_partition</a>(__begin, __end,</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  __pred, __num_threads);</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="keywordflow">for</span> (_DifferenceType __s = 0; __s < __num_samples; ++__s)</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  __samples[__s].~_ValueType();</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  ::operator <span class="keyword">delete</span>(__samples);</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">return</span> __split;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"></span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> /** @brief Unbalanced quicksort conquer step.</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> * @param __begin Begin iterator of subsequence.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> * @param __end End iterator of subsequence.</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> * @param __num_threads Number of threads that are allowed to work on</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> * this part.</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> */</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="a01575.html#a06c506308856b684737d24944a93a42e"> 101</a></span>  <a class="code" href="a01575.html#a06c506308856b684737d24944a93a42e">__parallel_sort_qs_conquer</a>(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  _Compare __comp,</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads)</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  {</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">if</span> (__num_threads <= 1)</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>  __gnu_sequential::sort(__begin, __end, __comp);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> </div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  _DifferenceType __n = __end - __begin, __pivot_rank;</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">if</span> (__n <= 1)</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">return</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>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads_left;</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>  <span class="keywordflow">if</span> ((__num_threads % 2) == 1)</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  __num_threads_left = __num_threads / 2 + 1;</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  __num_threads_left = __num_threads / 2;</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>  __pivot_rank = __n * __num_threads_left / __num_threads;</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>  _DifferenceType __split = <a class="code" href="a01575.html#a55defa3d8e8ca7b4e52330b9afc0b1ce">__parallel_sort_qs_divide</a></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  (__begin, __end, __comp, __pivot_rank,</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <a class="code" href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">_Settings::get</a>().sort_qs_num_samples_preset, __num_threads);</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> </div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor">#pragma omp parallel sections num_threads(2)</span></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> <span class="preprocessor">#pragma omp section</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <a class="code" href="a01575.html#a06c506308856b684737d24944a93a42e">__parallel_sort_qs_conquer</a>(__begin, __begin + __split,</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  __comp, __num_threads_left);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="preprocessor">#pragma omp section</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <a class="code" href="a01575.html#a06c506308856b684737d24944a93a42e">__parallel_sort_qs_conquer</a>(__begin + __split, __end,</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  __comp, __num_threads - __num_threads_left);</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>  }</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment"></span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="comment"> /** @brief Unbalanced quicksort main call.</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment"> * @param __begin Begin iterator of input sequence.</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment"> * @param __end End iterator input sequence, ignored.</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment"> * @param __num_threads Number of threads that are allowed to work on</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment"> * this part.</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment"> */</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00154"></a><span class="lineno"><a class="line" href="a01575.html#ac416a1c7e347b429bbf7a8fb17e847b2"> 154</a></span>  <a class="code" href="a01575.html#ac416a1c7e347b429bbf7a8fb17e847b2">__parallel_sort_qs</a>(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  _Compare __comp,</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads)</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  {</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__n)</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> </div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  _DifferenceType __n = __end - __begin;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// At least one element per processor.</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">if</span> (__num_threads > __n)</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  __num_threads = static_cast<_ThreadIndex>(__n);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <a class="code" href="a01575.html#a06c506308856b684737d24944a93a42e">__parallel_sort_qs_conquer</a>(</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  __begin, __begin + __n, __comp, __num_threads);</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> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> } <span class="comment">//namespace __gnu_parallel</span></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> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_QUICKSORT_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a01575_html_a55defa3d8e8ca7b4e52330b9afc0b1ce"><div class="ttname"><a href="a01575.html#a55defa3d8e8ca7b4e52330b9afc0b1ce">__gnu_parallel::__parallel_sort_qs_divide</a></div><div class="ttdeci">std::iterator_traits< _RAIter >::difference_type __parallel_sort_qs_divide(_RAIter __begin, _RAIter __end, _Compare __comp, typename std::iterator_traits< _RAIter >::difference_type __pivot_rank, typename std::iterator_traits< _RAIter >::difference_type __num_samples, _ThreadIndex __num_threads)</div><div class="ttdoc">Unbalanced quicksort divide step.</div><div class="ttdef"><b>Definition:</b> <a href="a00947_source.html#l00051">quicksort.h:51</a></div></div>
<div class="ttc" id="a01575_html_aa56788b479955dd136d6af173d2cae0b"><div class="ttname"><a href="a01575.html#aa56788b479955dd136d6af173d2cae0b">__gnu_parallel::__parallel_partition</a></div><div class="ttdeci">std::iterator_traits< _RAIter >::difference_type __parallel_partition(_RAIter __begin, _RAIter __end, _Predicate __pred, _ThreadIndex __num_threads)</div><div class="ttdoc">Parallel implementation of std::partition.</div><div class="ttdef"><b>Definition:</b> <a href="a00941_source.html#l00056">partition.h:56</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="a09299_html"><div class="ttname"><a href="a09299.html">__gnu_parallel::__binder2nd</a></div><div class="ttdoc">Similar to std::binder2nd, but giving the argument types explicitly.</div><div class="ttdef"><b>Definition:</b> <a href="a16491_source.html#l00220">parallel/base.h:220</a></div></div>
<div class="ttc" id="a01575_html_ac416a1c7e347b429bbf7a8fb17e847b2"><div class="ttname"><a href="a01575.html#ac416a1c7e347b429bbf7a8fb17e847b2">__gnu_parallel::__parallel_sort_qs</a></div><div class="ttdeci">void __parallel_sort_qs(_RAIter __begin, _RAIter __end, _Compare __comp, _ThreadIndex __num_threads)</div><div class="ttdoc">Unbalanced quicksort main call.</div><div class="ttdef"><b>Definition:</b> <a href="a00947_source.html#l00154">quicksort.h:154</a></div></div>
<div class="ttc" id="a00941_html"><div class="ttname"><a href="a00941.html">partition.h</a></div><div class="ttdoc">Parallel implementation of std::partition(), std::nth_element(), and std::partial_sort()....</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="a01485_html_gad48656de2f272a953455e1fff2532125"><div class="ttname"><a href="a01485.html#gad48656de2f272a953455e1fff2532125">std::min</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR const _Tp & min(const _Tp &, const _Tp &)</div><div class="ttdoc">This does what you think it does.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00195">stl_algobase.h:195</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_a06c506308856b684737d24944a93a42e"><div class="ttname"><a href="a01575.html#a06c506308856b684737d24944a93a42e">__gnu_parallel::__parallel_sort_qs_conquer</a></div><div class="ttdeci">void __parallel_sort_qs_conquer(_RAIter __begin, _RAIter __end, _Compare __comp, _ThreadIndex __num_threads)</div><div class="ttdoc">Unbalanced quicksort conquer step.</div><div class="ttdef"><b>Definition:</b> <a href="a00947_source.html#l00101">quicksort.h:101</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="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><!-- 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="a00947.html">quicksort.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
>
841
