<!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++: balanced_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('a00872_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">balanced_quicksort.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00872.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/balanced_quicksort.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Implementation of a dynamically load-balanced parallel quicksort.</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> *</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * It works in-place and needs only logarithmic extra memory.</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> * The algorithm is similar to the one proposed in</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> *</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * P. Tsigas and Y. Zhang.</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * A simple, fast parallel implementation of quicksort and</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * its performance evaluation on SUN enterprise 10000.</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * In 11th Euromicro Conference on Parallel, Distributed and</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * Network-Based Processing, page 372, 2003.</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> *</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> * This file is a GNU parallel extension to the Standard C++ Library.</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> */</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> </div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// Written by Johannes Singler.</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="preprocessor">#ifndef _GLIBCXX_PARALLEL_BALANCED_QUICKSORT_H</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_BALANCED_QUICKSORT_H 1</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#include <<a class="code" href="a00875.html">parallel/basic_iterator.h</a>></span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor">#include <<a class="code" href="a00527.html">bits/stl_algo.h</a>></span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#include <<a class="code" href="a00542.html">bits/stl_function.h</a>></span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor">#include <<a class="code" href="a00962.html">parallel/settings.h</a>></span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor">#include <<a class="code" href="a00941.html">parallel/partition.h</a>></span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor">#include <<a class="code" href="a00950.html">parallel/random_number.h</a>></span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#include <<a class="code" href="a00944.html">parallel/queue.h</a>></span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> </div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="preprocessor">#include <<a class="code" href="a00878.html">parallel/checkers.h</a>></span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#ifdef _GLIBCXX_HAVE_UNISTD_H</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#include <unistd.h></span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> </div><div class="line"><a name="l00061"></a><span class="lineno"><a class="line" href="a01575.html"> 61</a></span> <span class="keyword">namespace </span><a class="code" href="a01575.html">__gnu_parallel</a></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> {<span class="comment"></span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> /** @brief Information local to one thread in the parallel quicksort run. */</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter></div><div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="a09283.html"> 65</a></span>  <span class="keyword">struct </span><a class="code" href="a09283.html">_QSBThreadLocal</a></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  {</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</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 Continuous part of the sequence, described by an</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> iterator pair. */</span></div><div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="a09283.html#a4b151f36b1cac07063a9e6ae1ae9fd5a"> 72</a></span>  <span class="keyword">typedef</span> <a class="code" href="a07767.html">std::pair<_RAIter, _RAIter></a> <a class="code" href="a09283.html#a4b151f36b1cac07063a9e6ae1ae9fd5a">_Piece</a>;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"></span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> /** @brief Initial piece to work on. */</span></div><div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="a09283.html#a0018330a1faea8911bb0a8a7ee44f72e"> 75</a></span>  <a class="code" href="a07767.html">_Piece</a> <a class="code" href="a09283.html#a0018330a1faea8911bb0a8a7ee44f72e">_M_initial</a>;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"></span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> /** @brief Work-stealing queue. */</span></div><div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="a09283.html#ab857deaace34709581c5573bc62afd49"> 78</a></span>  <a class="code" href="a09603.html">_RestrictedBoundedConcurrentQueue<_Piece></a> <a class="code" href="a09283.html#ab857deaace34709581c5573bc62afd49">_M_leftover_parts</a>;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"></span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> /** @brief Number of threads involved in this algorithm. */</span></div><div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="a09283.html#a0b63568837becdfbbd1f7accc1c05d1d"> 81</a></span>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> <a class="code" href="a09283.html#a0b63568837becdfbbd1f7accc1c05d1d">_M_num_threads</a>;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"></span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> /** @brief Pointer to a counter of elements left over to sort. */</span></div><div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="a09283.html#a02cf2d3081cda15fa671ec19cb62b551"> 84</a></span>  <span class="keyword">volatile</span> _DifferenceType* <a class="code" href="a09283.html#a02cf2d3081cda15fa671ec19cb62b551">_M_elements_leftover</a>;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"></span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> /** @brief The complete sequence to sort. */</span></div><div class="line"><a name="l00087"></a><span class="lineno"><a class="line" href="a09283.html#aba7a5f9235cc1a847e3754df018eb9b4"> 87</a></span>  <a class="code" href="a07767.html">_Piece</a> <a class="code" href="a09283.html#aba7a5f9235cc1a847e3754df018eb9b4">_M_global</a>;</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"> /** @brief Constructor.</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> * @param __queue_size size of the work-stealing queue. */</span></div><div class="line"><a name="l00091"></a><span class="lineno"><a class="line" href="a09283.html#a47e9a744d2981943c13ac5a0af56f493"> 91</a></span>  <a class="code" href="a09283.html#a47e9a744d2981943c13ac5a0af56f493">_QSBThreadLocal</a>(<span class="keywordtype">int</span> __queue_size) : <a class="code" href="a09283.html#ab857deaace34709581c5573bc62afd49">_M_leftover_parts</a>(__queue_size) { }</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  };</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"></span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> /** @brief Balanced quicksort divide step.</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> * @param __begin Begin iterator of subsequence.</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> * @param __end End iterator of subsequence.</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> * @param __num_threads Number of threads that are allowed to work on</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> * this part.</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> * @pre @c (__end-__begin)>=1 */</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">typename</span> std::iterator_traits<_RAIter>::difference_type</div><div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="a01575.html#afc19882fd22d39e54475d41fd981ac49"> 103</a></span>  <a class="code" href="a01575.html#afc19882fd22d39e54475d41fd981ac49">__qsb_divide</a>(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  _Compare __comp, <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads)</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>  _GLIBCXX_PARALLEL_ASSERT(__num_threads > 0);</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>  <span class="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  _RAIter __pivot_pos =</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <a class="code" href="a01575.html#a74914ea59d68887b517e12c90189dbcd">__median_of_three_iterators</a>(__begin, __begin + (__end - __begin) / 2,</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  __end - 1, __comp);</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="preprocessor">#if defined(_GLIBCXX_PARALLEL_ASSERTIONS)</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// Must be in between somewhere.</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  _DifferenceType __n = __end - __begin;</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>  _GLIBCXX_PARALLEL_ASSERT((!__comp(*__pivot_pos, *__begin)</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  && !__comp(*(__begin + __n / 2),</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  *__pivot_pos))</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  || (!__comp(*__pivot_pos, *__begin)</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  && !__comp(*(__end - 1), *__pivot_pos))</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  || (!__comp(*__pivot_pos, *(__begin + __n / 2))</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  && !__comp(*__begin, *__pivot_pos))</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  || (!__comp(*__pivot_pos, *(__begin + __n / 2))</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  && !__comp(*(__end - 1), *__pivot_pos))</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  || (!__comp(*__pivot_pos, *(__end - 1))</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  && !__comp(*__begin, *__pivot_pos))</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  || (!__comp(*__pivot_pos, *(__end - 1))</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  && !__comp(*(__begin + __n / 2),</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  *__pivot_pos)));</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">// Swap pivot value to end.</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">if</span> (__pivot_pos != (__end - 1))</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  std::iter_swap(__pivot_pos, __end - 1);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  __pivot_pos = __end - 1;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <a class="code" href="a09299.html">__gnu_parallel::__binder2nd<_Compare, _ValueType, _ValueType, bool></a></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  __pred(__comp, *__pivot_pos);</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">// Divide, returning __end - __begin - 1 in the worst case.</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  _DifferenceType __split_pos = <a class="code" href="a01575.html#aa56788b479955dd136d6af173d2cae0b">__parallel_partition</a>(__begin, __end - 1,</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  __pred,</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  __num_threads);</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>  <span class="comment">// Swap back pivot to middle.</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  std::iter_swap(__begin + __split_pos, __pivot_pos);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  __pivot_pos = __begin + __split_pos;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  _RAIter __r;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">for</span> (__r = __begin; __r != __pivot_pos; ++__r)</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  _GLIBCXX_PARALLEL_ASSERT(__comp(*__r, *__pivot_pos));</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">for</span> (; __r != __end; ++__r)</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  _GLIBCXX_PARALLEL_ASSERT(!__comp(*__r, *__pivot_pos));</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> </div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">return</span> __split_pos;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"></span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> /** @brief Quicksort conquer step.</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> * @param __tls Array of thread-local storages.</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"> * @param __begin Begin iterator of subsequence.</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"> * @param __end End iterator of subsequence.</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment"> * @param __iam Number of the thread processing this function.</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"> * @param __num_threads</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"> * Number of threads that are allowed to work on this part. */</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00174"></a><span class="lineno"><a class="line" href="a01575.html#a8d9c5686c4621822c7c3cdd015f7e693"> 174</a></span>  <a class="code" href="a01575.html#a8d9c5686c4621822c7c3cdd015f7e693">__qsb_conquer</a>(<a class="code" href="a09283.html">_QSBThreadLocal<_RAIter></a>** __tls,</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  _RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  _Compare __comp,</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __iam, <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads,</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordtype">bool</span> __parent_wait)</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  {</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  _DifferenceType __n = __end - __begin;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (__num_threads <= 1 || __n <= 1)</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  {</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  __tls[__iam]-><a class="code" href="a09283.html#a0018330a1faea8911bb0a8a7ee44f72e">_M_initial</a>.first = __begin;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  __tls[__iam]-><a class="code" href="a09283.html#a0018330a1faea8911bb0a8a7ee44f72e">_M_initial</a>.second = __end;</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <a class="code" href="a01575.html#a7565d258aacb02328cef6eb2781ab711">__qsb_local_sort_with_helping</a>(__tls, __comp, __iam, __parent_wait);</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> </div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  }</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="comment">// Divide step.</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  _DifferenceType __split_pos =</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <a class="code" href="a01575.html#afc19882fd22d39e54475d41fd981ac49">__qsb_divide</a>(__begin, __end, __comp, __num_threads);</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  _GLIBCXX_PARALLEL_ASSERT(0 <= __split_pos &&</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  __split_pos < (__end - __begin));</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="preprocessor">#endif</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>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  __num_threads_leftside = std::max<_ThreadIndex></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  (1, std::min<_ThreadIndex>(__num_threads - 1, __split_pos</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  * __num_threads / __n));</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="preprocessor"># pragma omp atomic</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  *__tls[__iam]-><a class="code" href="a09283.html#a02cf2d3081cda15fa671ec19cb62b551">_M_elements_leftover</a> -= (_DifferenceType)1;</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="comment">// Conquer step.</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="preprocessor"># pragma omp parallel num_threads(2)</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  {</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordtype">bool</span> __wait;</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">if</span>(omp_get_num_threads() < 2)</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  __wait = <span class="keyword">false</span>;</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  __wait = __parent_wait;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="preprocessor"># pragma omp sections</span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  {</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="preprocessor"># pragma omp section</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  {</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="a01575.html#a8d9c5686c4621822c7c3cdd015f7e693">__qsb_conquer</a>(__tls, __begin, __begin + __split_pos, __comp,</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  __iam, __num_threads_leftside, __wait);</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  __wait = __parent_wait;</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// The pivot_pos is left in place, to ensure termination.</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="preprocessor"># pragma omp section</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  {</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <a class="code" href="a01575.html#a8d9c5686c4621822c7c3cdd015f7e693">__qsb_conquer</a>(__tls, __begin + __split_pos + 1, __end, __comp,</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  __iam + __num_threads_leftside,</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  __num_threads - __num_threads_leftside, __wait);</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  __wait = __parent_wait;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  }</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="comment"></span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="comment"> /**</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="comment"> * @brief Quicksort step doing load-balanced local sort.</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="comment"> * @param __tls Array of thread-local storages.</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment"> * @param __iam Number of the thread processing this function.</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment"> */</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00250"></a><span class="lineno"><a class="line" href="a01575.html#a7565d258aacb02328cef6eb2781ab711"> 250</a></span>  <a class="code" href="a01575.html#a7565d258aacb02328cef6eb2781ab711">__qsb_local_sort_with_helping</a>(<a class="code" href="a09283.html">_QSBThreadLocal<_RAIter></a>** __tls,</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  _Compare& __comp, <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __iam,</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordtype">bool</span> __wait)</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="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keyword">typedef</span> <a class="code" href="a07767.html">std::pair<_RAIter, _RAIter></a> <a class="code" href="a09559.html">_Piece</a>;</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>  <a class="code" href="a09283.html">_QSBThreadLocal<_RAIter></a>& __tl = *__tls[__iam];</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> </div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  _DifferenceType</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  __base_case_n = <a class="code" href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">_Settings::get</a>().<a class="code" href="a09635.html#a3a0bbce1f017d9a3ea2ea176722ed853">sort_qsb_base_case_maximal_n</a>;</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">if</span> (__base_case_n < 2)</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  __base_case_n = 2;</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads = __tl.<a class="code" href="a09283.html#a0b63568837becdfbbd1f7accc1c05d1d">_M_num_threads</a>;</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="comment">// Every thread has its own random number generator.</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <a class="code" href="a09607.html">_RandomNumber</a> __rng(__iam + 1);</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> </div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <a class="code" href="a09559.html">_Piece</a> __current = __tl.<a class="code" href="a09283.html#a0018330a1faea8911bb0a8a7ee44f72e">_M_initial</a>;</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>  _DifferenceType __elements_done = 0;</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  _DifferenceType __total_elements_done = 0;</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span> </div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">for</span> (;;)</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  {</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">// Invariant: __current must be a valid (maybe empty) range.</span></div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  _RAIter __begin = __current.first, __end = __current.second;</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  _DifferenceType __n = __end - __begin;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">if</span> (__n > __base_case_n)</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  {</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">// Divide.</span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  _RAIter __pivot_pos = __begin + __rng(__n);</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="comment">// Swap __pivot_pos value to end.</span></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">if</span> (__pivot_pos != (__end - 1))</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  std::iter_swap(__pivot_pos, __end - 1);</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  __pivot_pos = __end - 1;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> </div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <a class="code" href="a09299.html">__gnu_parallel::__binder2nd</a></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <_Compare, _ValueType, _ValueType, <span class="keywordtype">bool</span>></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  __pred(__comp, *__pivot_pos);</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> </div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// Divide, leave pivot unchanged in last place.</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  _RAIter __split_pos1, __split_pos2;</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  __split_pos1 = __gnu_sequential::partition(__begin, __end - 1,</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  __pred);</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span> </div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">// Left side: < __pivot_pos; __right side: >= __pivot_pos.</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  _GLIBCXX_PARALLEL_ASSERT(__begin <= __split_pos1</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  && __split_pos1 < __end);</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="comment">// Swap pivot back to middle.</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keywordflow">if</span> (__split_pos1 != __pivot_pos)</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  std::iter_swap(__split_pos1, __pivot_pos);</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  __pivot_pos = __split_pos1;</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> </div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// In case all elements are equal, __split_pos1 == 0.</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">if</span> ((__split_pos1 + 1 - __begin) < (__n >> 7)</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  || (__end - __split_pos1) < (__n >> 7))</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  {</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">// Very unequal split, one part smaller than one 128th</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="comment">// elements not strictly larger than the pivot.</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <a class="code" href="a09291.html">__gnu_parallel::__unary_negate</a><<a class="code" href="a09295.html">__gnu_parallel::__binder1st</a></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <_Compare, _ValueType, _ValueType, <span class="keywordtype">bool</span>>, _ValueType></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  __pred(<a class="code" href="a09295.html">__gnu_parallel::__binder1st</a></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <_Compare, _ValueType, _ValueType, <span class="keywordtype">bool</span>></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  (__comp, *__pivot_pos));</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">// Find other end of pivot-equal range.</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  __split_pos2 = __gnu_sequential::partition(__split_pos1 + 1,</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  __end, __pred);</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  }</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="comment">// Only skip the pivot.</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  __split_pos2 = __split_pos1 + 1;</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> </div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// Elements equal to pivot are done.</span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  __elements_done += (__split_pos2 - __split_pos1);</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  __total_elements_done += (__split_pos2 - __split_pos1);</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">// Always push larger part onto stack.</span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">if</span> (((__split_pos1 + 1) - __begin) < (__end - (__split_pos2)))</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">// Right side larger.</span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">if</span> ((__split_pos2) != __end)</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  __tl.<a class="code" href="a09283.html#ab857deaace34709581c5573bc62afd49">_M_leftover_parts</a>.push_front</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  (<a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__split_pos2, __end));</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>  <span class="comment">//__current.first = __begin; //already set anyway</span></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  __current.second = __split_pos1;</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  }</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  {</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// Left side larger.</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">if</span> (__begin != __split_pos1)</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  __tl.<a class="code" href="a09283.html#ab857deaace34709581c5573bc62afd49">_M_leftover_parts</a>.push_front(<a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  (__begin, __split_pos1));</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> </div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  __current.first = __split_pos2;</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="comment">//__current.second = __end; //already set anyway</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  }</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  }</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  {</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  __gnu_sequential::sort(__begin, __end, __comp);</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  __elements_done += __n;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  __total_elements_done += __n;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> </div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="comment">// Prefer own stack, small pieces.</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">if</span> (__tl.<a class="code" href="a09283.html#ab857deaace34709581c5573bc62afd49">_M_leftover_parts</a>.pop_front(__current))</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">continue</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> <span class="preprocessor"># pragma omp atomic</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  *__tl.<a class="code" href="a09283.html#a02cf2d3081cda15fa671ec19cb62b551">_M_elements_leftover</a> -= __elements_done;</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span> </div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  __elements_done = 0;</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> </div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keywordtype">double</span> __search_start = omp_get_wtime();</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> </div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="comment">// Look for new work.</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordtype">bool</span> __successfully_stolen = <span class="keyword">false</span>;</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">while</span> (__wait && *__tl.<a class="code" href="a09283.html#a02cf2d3081cda15fa671ec19cb62b551">_M_elements_leftover</a> > 0</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  && !__successfully_stolen</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> #<span class="keywordflow">if</span> <a class="code" href="a00881.html#a1210f57e55592f3e44cf8a870ede1e26">_GLIBCXX_PARALLEL_ASSERTIONS</a></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="comment">// Possible dead-lock.</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  && (omp_get_wtime() < (__search_start + 1.0))</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> #endif</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  )</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  {</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __victim;</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  __victim = __rng(__num_threads);</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> </div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">// Large pieces.</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  __successfully_stolen = (__victim != __iam)</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  && __tls[__victim]->_M_leftover_parts.pop_back(__current);</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">if</span> (!__successfully_stolen)</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <a class="code" href="a01575.html#aaa76236af73146ae89f726921bc3f2cb">__yield</a>();</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="preprocessor">#if !defined(__ICC) && !defined(__ECC)</span></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> <span class="preprocessor"># pragma omp flush</span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  }</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> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordflow">if</span> (omp_get_wtime() >= (__search_start + 1.0))</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  {</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  sleep(1);</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  _GLIBCXX_PARALLEL_ASSERT(omp_get_wtime()</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  < (__search_start + 1.0));</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  }</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">if</span> (!__successfully_stolen)</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  {</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  _GLIBCXX_PARALLEL_ASSERT(*__tl.<a class="code" href="a09283.html#a02cf2d3081cda15fa671ec19cb62b551">_M_elements_leftover</a> == 0);</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</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>  }</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="comment"></span></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment"> /** @brief Top-level quicksort routine.</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment"> * @param __begin Begin iterator of sequence.</span></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment"> * @param __end End iterator of sequence.</span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment"> * @param __comp Comparator.</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment"> * @param __num_threads Number of threads that are allowed to work on</span></div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment"> * this part.</span></div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment"> */</span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00433"></a><span class="lineno"><a class="line" href="a01575.html#a4093dd098b32542e3d3f43ebd4c6f940"> 433</a></span>  <a class="code" href="a01575.html#a4093dd098b32542e3d3f43ebd4c6f940">__parallel_sort_qsb</a>(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  _Compare __comp, <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads)</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  {</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__end - __begin)</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="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keyword">typedef</span> <a class="code" href="a07767.html">std::pair<_RAIter, _RAIter></a> <a class="code" href="a09559.html">_Piece</a>;</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> </div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keyword">typedef</span> <a class="code" href="a09283.html">_QSBThreadLocal<_RAIter></a> _TLSType;</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> </div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  _DifferenceType __n = __end - __begin;</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> </div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordflow">if</span> (__n <= 1)</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> </div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="comment">// At least one element per processor.</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">if</span> (__num_threads > __n)</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  __num_threads = static_cast<_ThreadIndex>(__n);</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> </div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="comment">// Initialize thread local storage</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  _TLSType** __tls = <span class="keyword">new</span> _TLSType*[__num_threads];</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  _DifferenceType __queue_size = (__num_threads</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  * (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a>)(<a class="code" href="a01575.html#ae8e1f6dc07de01f28bf591339cf8aa9c">__rd_log2</a>(__n) + 1));</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __t = 0; __t < __num_threads; ++__t)</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  __tls[__t] = <span class="keyword">new</span> <a class="code" href="a09283.html">_QSBThreadLocal<_RAIter></a>(__queue_size);</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> </div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="comment">// There can never be more than ceil(__rd_log2(__n)) ranges on the</span></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="comment">// stack, because</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">// 1. Only one processor pushes onto the stack</span></div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">// 2. The largest range has at most length __n</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="comment">// 3. Each range is larger than half of the range remaining</span></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keyword">volatile</span> _DifferenceType __elements_leftover = __n;</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</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="l00468"></a><span class="lineno"> 468</span>  {</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  __tls[__i]-><a class="code" href="a09283.html#a02cf2d3081cda15fa671ec19cb62b551">_M_elements_leftover</a> = &__elements_leftover;</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  __tls[__i]->_M_num_threads = __num_threads;</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  __tls[__i]->_M_global = <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__begin, __end);</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>  <span class="comment">// Just in case nothing is left to assign.</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  __tls[__i]->_M_initial = <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__end, __end);</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  }</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>  <span class="comment">// Main recursion call.</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <a class="code" href="a01575.html#a8d9c5686c4621822c7c3cdd015f7e693">__qsb_conquer</a>(__tls, __begin, __begin + __n, __comp, 0,</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  __num_threads, <span class="keyword">true</span>);</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> </div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="comment">// All stack must be empty.</span></div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <a class="code" href="a09559.html">_Piece</a> __dummy;</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __i = 1; __i < __num_threads; ++__i)</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  _GLIBCXX_PARALLEL_ASSERT(</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  !__tls[__i]->_M_leftover_parts.pop_back(__dummy));</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> </div><div class="line"><a name="l00489"></a><span class="lineno"> 489</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="l00490"></a><span class="lineno"> 490</span>  <span class="keyword">delete</span> __tls[__i];</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keyword">delete</span>[] __tls;</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  }</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> } <span class="comment">// namespace __gnu_parallel</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> </div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_BALANCED_QUICKSORT_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a09291_html"><div class="ttname"><a href="a09291.html">__gnu_parallel::__unary_negate</a></div><div class="ttdoc">Similar to std::unary_negate, but giving the argument types explicitly.</div><div class="ttdef"><b>Definition:</b> <a href="a16491_source.html#l00173">parallel/base.h:173</a></div></div>
<div class="ttc" id="a07767_html"><div class="ttname"><a href="a07767.html">std::pair< _RAIter, _RAIter ></a></div></div>
<div class="ttc" id="a09603_html"><div class="ttname"><a href="a09603.html">__gnu_parallel::_RestrictedBoundedConcurrentQueue</a></div><div class="ttdoc">Double-ended queue of bounded size, allowing lock-free atomic access. push_front() and pop_front() mu...</div><div class="ttdef"><b>Definition:</b> <a href="a00944_source.html#l00052">queue.h:52</a></div></div>
<div class="ttc" id="a01575_html_a4093dd098b32542e3d3f43ebd4c6f940"><div class="ttname"><a href="a01575.html#a4093dd098b32542e3d3f43ebd4c6f940">__gnu_parallel::__parallel_sort_qsb</a></div><div class="ttdeci">void __parallel_sort_qsb(_RAIter __begin, _RAIter __end, _Compare __comp, _ThreadIndex __num_threads)</div><div class="ttdoc">Top-level quicksort routine.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00433">balanced_quicksort.h:433</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="a00944_html"><div class="ttname"><a href="a00944.html">queue.h</a></div><div class="ttdoc">Lock-free double-ended queue. This file is a GNU parallel extension to the Standard C++ Library.</div></div>
<div class="ttc" id="a00542_html"><div class="ttname"><a href="a00542.html">stl_function.h</a></div></div>
<div class="ttc" id="a09283_html_ab857deaace34709581c5573bc62afd49"><div class="ttname"><a href="a09283.html#ab857deaace34709581c5573bc62afd49">__gnu_parallel::_QSBThreadLocal::_M_leftover_parts</a></div><div class="ttdeci">_RestrictedBoundedConcurrentQueue< _Piece > _M_leftover_parts</div><div class="ttdoc">Work-stealing queue.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00078">balanced_quicksort.h:78</a></div></div>
<div class="ttc" id="a09283_html_a4b151f36b1cac07063a9e6ae1ae9fd5a"><div class="ttname"><a href="a09283.html#a4b151f36b1cac07063a9e6ae1ae9fd5a">__gnu_parallel::_QSBThreadLocal::_Piece</a></div><div class="ttdeci">std::pair< _RAIter, _RAIter > _Piece</div><div class="ttdoc">Continuous part of the sequence, described by an iterator pair.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00072">balanced_quicksort.h:72</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="a00962_html"><div class="ttname"><a href="a00962.html">settings.h</a></div><div class="ttdoc">Runtime settings and tuning parameters, heuristics to decide whether to use parallelized algorithms....</div></div>
<div class="ttc" id="a00950_html"><div class="ttname"><a href="a00950.html">random_number.h</a></div><div class="ttdoc">Random number generator based on the Mersenne twister. This file is a GNU parallel extension to the S...</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="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="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_a1210f57e55592f3e44cf8a870ede1e26"><div class="ttname"><a href="a00881.html#a1210f57e55592f3e44cf8a870ede1e26">_GLIBCXX_PARALLEL_ASSERTIONS</a></div><div class="ttdeci">#define _GLIBCXX_PARALLEL_ASSERTIONS</div><div class="ttdoc">Switch on many _GLIBCXX_PARALLEL_ASSERTions in parallel code. Should be switched on only locally.</div><div class="ttdef"><b>Definition:</b> <a href="a00881_source.html#l00061">compiletime_settings.h:61</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="a09295_html"><div class="ttname"><a href="a09295.html">__gnu_parallel::__binder1st</a></div><div class="ttdoc">Similar to std::binder1st, but giving the argument types explicitly.</div><div class="ttdef"><b>Definition:</b> <a href="a16491_source.html#l00192">parallel/base.h:192</a></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="a09283_html"><div class="ttname"><a href="a09283.html">__gnu_parallel::_QSBThreadLocal</a></div><div class="ttdoc">Information local to one thread in the parallel quicksort run.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00065">balanced_quicksort.h:65</a></div></div>
<div class="ttc" id="a01575_html_a74914ea59d68887b517e12c90189dbcd"><div class="ttname"><a href="a01575.html#a74914ea59d68887b517e12c90189dbcd">__gnu_parallel::__median_of_three_iterators</a></div><div class="ttdeci">_RAIter __median_of_three_iterators(_RAIter __a, _RAIter __b, _RAIter __c, _Compare __comp)</div><div class="ttdoc">Compute the median of three referenced elements, according to __comp.</div><div class="ttdef"><b>Definition:</b> <a href="a16491_source.html#l00398">parallel/base.h:398</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="a09283_html_a0018330a1faea8911bb0a8a7ee44f72e"><div class="ttname"><a href="a09283.html#a0018330a1faea8911bb0a8a7ee44f72e">__gnu_parallel::_QSBThreadLocal::_M_initial</a></div><div class="ttdeci">_Piece _M_initial</div><div class="ttdoc">Initial piece to work on.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00075">balanced_quicksort.h:75</a></div></div>
<div class="ttc" id="a01575_html_a8d9c5686c4621822c7c3cdd015f7e693"><div class="ttname"><a href="a01575.html#a8d9c5686c4621822c7c3cdd015f7e693">__gnu_parallel::__qsb_conquer</a></div><div class="ttdeci">void __qsb_conquer(_QSBThreadLocal< _RAIter > **__tls, _RAIter __begin, _RAIter __end, _Compare __comp, _ThreadIndex __iam, _ThreadIndex __num_threads, bool __parent_wait)</div><div class="ttdoc">Quicksort conquer step.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00174">balanced_quicksort.h:174</a></div></div>
<div class="ttc" id="a00878_html"><div class="ttname"><a href="a00878.html">checkers.h</a></div><div class="ttdoc">Routines for checking the correctness of algorithm results. This file is a GNU parallel extension to ...</div></div>
<div class="ttc" id="a09283_html_a02cf2d3081cda15fa671ec19cb62b551"><div class="ttname"><a href="a09283.html#a02cf2d3081cda15fa671ec19cb62b551">__gnu_parallel::_QSBThreadLocal::_M_elements_leftover</a></div><div class="ttdeci">volatile _DifferenceType * _M_elements_leftover</div><div class="ttdoc">Pointer to a counter of elements left over to sort.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00084">balanced_quicksort.h:84</a></div></div>
<div class="ttc" id="a01575_html_a7565d258aacb02328cef6eb2781ab711"><div class="ttname"><a href="a01575.html#a7565d258aacb02328cef6eb2781ab711">__gnu_parallel::__qsb_local_sort_with_helping</a></div><div class="ttdeci">void __qsb_local_sort_with_helping(_QSBThreadLocal< _RAIter > **__tls, _Compare &__comp, _ThreadIndex __iam, bool __wait)</div><div class="ttdoc">Quicksort step doing load-balanced local sort.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00250">balanced_quicksort.h:250</a></div></div>
<div class="ttc" id="a09283_html_aba7a5f9235cc1a847e3754df018eb9b4"><div class="ttname"><a href="a09283.html#aba7a5f9235cc1a847e3754df018eb9b4">__gnu_parallel::_QSBThreadLocal::_M_global</a></div><div class="ttdeci">_Piece _M_global</div><div class="ttdoc">The complete sequence to sort.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00087">balanced_quicksort.h:87</a></div></div>
<div class="ttc" id="a01575_html_aaa76236af73146ae89f726921bc3f2cb"><div class="ttname"><a href="a01575.html#aaa76236af73146ae89f726921bc3f2cb">__gnu_parallel::__yield</a></div><div class="ttdeci">void __yield()</div><div class="ttdoc">Yield control to another thread, without waiting for the end of the time slice.</div><div class="ttdef"><b>Definition:</b> <a href="a16530_source.html#l00121">parallel/compatibility.h:121</a></div></div>
<div class="ttc" id="a09283_html_a47e9a744d2981943c13ac5a0af56f493"><div class="ttname"><a href="a09283.html#a47e9a744d2981943c13ac5a0af56f493">__gnu_parallel::_QSBThreadLocal::_QSBThreadLocal</a></div><div class="ttdeci">_QSBThreadLocal(int __queue_size)</div><div class="ttdoc">Constructor.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00091">balanced_quicksort.h:91</a></div></div>
<div class="ttc" id="a09283_html_a0b63568837becdfbbd1f7accc1c05d1d"><div class="ttname"><a href="a09283.html#a0b63568837becdfbbd1f7accc1c05d1d">__gnu_parallel::_QSBThreadLocal::_M_num_threads</a></div><div class="ttdeci">_ThreadIndex _M_num_threads</div><div class="ttdoc">Number of threads involved in this algorithm.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00081">balanced_quicksort.h:81</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="a09635_html_a3a0bbce1f017d9a3ea2ea176722ed853"><div class="ttname"><a href="a09635.html#a3a0bbce1f017d9a3ea2ea176722ed853">__gnu_parallel::_Settings::sort_qsb_base_case_maximal_n</a></div><div class="ttdeci">_SequenceIndex sort_qsb_base_case_maximal_n</div><div class="ttdoc">Maximal subsequence __length to switch to unbalanced __base case. Applies to std::sort with dynamical...</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00241">settings.h:241</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="a09607_html"><div class="ttname"><a href="a09607.html">__gnu_parallel::_RandomNumber</a></div><div class="ttdoc">Random number generator, based on the Mersenne twister.</div><div class="ttdef"><b>Definition:</b> <a href="a00950_source.html#l00042">random_number.h:42</a></div></div>
<div class="ttc" id="a01575_html_ae8e1f6dc07de01f28bf591339cf8aa9c"><div class="ttname"><a href="a01575.html#ae8e1f6dc07de01f28bf591339cf8aa9c">__gnu_parallel::__rd_log2</a></div><div class="ttdeci">_Size __rd_log2(_Size __n)</div><div class="ttdoc">Calculates the rounded-down logarithm of __n for base 2.</div><div class="ttdef"><b>Definition:</b> <a href="a16491_source.html#l00102">parallel/base.h:102</a></div></div>
<div class="ttc" id="a01575_html_afc19882fd22d39e54475d41fd981ac49"><div class="ttname"><a href="a01575.html#afc19882fd22d39e54475d41fd981ac49">__gnu_parallel::__qsb_divide</a></div><div class="ttdeci">std::iterator_traits< _RAIter >::difference_type __qsb_divide(_RAIter __begin, _RAIter __end, _Compare __comp, _ThreadIndex __num_threads)</div><div class="ttdoc">Balanced quicksort divide step.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00103">balanced_quicksort.h:103</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="a00872.html">balanced_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
>
772
