Sophie

Sophie

distrib > Mageia > 7 > armv7hl > media > core-updates > by-pkgid > bfb47da7e0322bcb0e23e4b1838d9db9 > files > 858

libstdc++-docs-8.4.0-1.mga7.noarch.rpm

<!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++: sort.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&amp;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&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a00965_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle">
<div class="title">sort.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="a00965.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">// -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;</div><div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<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>&#160;<span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<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>&#160;<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>&#160;<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>&#160;<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>&#160;<span class="comment">// version.</span></div><div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;</div><div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<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>&#160;<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>&#160;<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>&#160;<span class="comment">// General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;</div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<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>&#160;<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>&#160;<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>&#160;</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<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>&#160;<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>&#160;<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>&#160;<span class="comment">// &lt;http://www.gnu.org/licenses/&gt;.</span></div><div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="comment">/** @file parallel/sort.h</span></div><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;<span class="comment"> *  @brief Parallel sorting algorithm switch.</span></div><div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;<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>&#160;<span class="comment"> */</span></div><div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;</div><div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;<span class="comment">// Written by Johannes Singler.</span></div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_SORT_H</span></div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="preprocessor">#define _GLIBCXX_PARALLEL_SORT_H 1</span></div><div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;</div><div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="preprocessor">#include &lt;<a class="code" href="a00875.html">parallel/basic_iterator.h</a>&gt;</span></div><div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="preprocessor">#include &lt;<a class="code" href="a00887.html">parallel/features.h</a>&gt;</span></div><div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;<span class="preprocessor">#include &lt;<a class="code" href="a00935.html">parallel/parallel.h</a>&gt;</span></div><div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;</div><div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;<span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;<span class="preprocessor">#include &lt;<a class="code" href="a00878.html">parallel/checkers.h</a>&gt;</span></div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="preprocessor">#if _GLIBCXX_MERGESORT</span></div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;<span class="preprocessor">#include &lt;<a class="code" href="a00920.html">parallel/multiway_mergesort.h</a>&gt;</span></div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;</div><div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="preprocessor">#if _GLIBCXX_QUICKSORT</span></div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;<span class="preprocessor">#include &lt;<a class="code" href="a00947.html">parallel/quicksort.h</a>&gt;</span></div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;</div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;<span class="preprocessor">#if _GLIBCXX_BAL_QUICKSORT</span></div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="preprocessor">#include &lt;<a class="code" href="a00872.html">parallel/balanced_quicksort.h</a>&gt;</span></div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;<span class="keyword">namespace </span><a class="code" href="a01575.html">__gnu_parallel</a></div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;{</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;  <span class="comment">//prototype</span></div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;  <span class="keyword">template</span>&lt;<span class="keywordtype">bool</span> __stable, <span class="keyword">typename</span> _RAIter,</div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;           <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> <a class="code" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8">_Parallelism</a>&gt;</div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;    <span class="keywordtype">void</span></div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;    __parallel_sort(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;                    _Compare __comp, <a class="code" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8">_Parallelism</a> __parallelism);</div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        <span class="comment"></span></div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;<span class="comment">  /** </span></div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;<span class="comment">   *  @brief Choose multiway mergesort, splitting variant at run-time,</span></div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;<span class="comment">   *  for parallel sorting.</span></div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;<span class="comment">   *  @param __begin Begin iterator of input sequence.</span></div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;<span class="comment">   *  @param __end End iterator of input sequence.</span></div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;<span class="comment">   *  @param __comp Comparator.</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;<span class="comment">   *  @tparam __stable Sort stable.</span></div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;<span class="comment">   *  @callgraph </span></div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;  <span class="keyword">template</span>&lt;<span class="keywordtype">bool</span> __stable, <span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare&gt;</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00075"></a><span class="lineno"><a class="line" href="a01575.html#a1edbc983766e29af55322f9c983277ac">   75</a></span>&#160;    __parallel_sort(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;                    _Compare __comp, <a class="code" href="a09679.html">multiway_mergesort_tag</a> __parallelism)</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;    {</div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;      <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__end - __begin)</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;</div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;      <span class="keywordflow">if</span>(<a class="code" href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">_Settings::get</a>().sort_splitting == EXACT)</div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;        parallel_sort_mwms&lt;__stable, true&gt;</div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;          (__begin, __end, __comp, __parallelism.<a class="code" href="a09643.html#a18b32829b31b902699690b750e190e59">__get_num_threads</a>());</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;      <span class="keywordflow">else</span></div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;        parallel_sort_mwms&lt;__stable, false&gt;</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;          (__begin, __end, __comp, __parallelism.<a class="code" href="a09643.html#a18b32829b31b902699690b750e190e59">__get_num_threads</a>());</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;    }</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;<span class="comment">  /** </span></div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="comment">   *  @brief Choose multiway mergesort with exact splitting,</span></div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;<span class="comment">   *  for parallel sorting.</span></div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;<span class="comment">   *  @param __begin Begin iterator of input sequence.</span></div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;<span class="comment">   *  @param __end End iterator of input sequence.</span></div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;<span class="comment">   *  @param __comp Comparator.</span></div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;<span class="comment">   *  @tparam __stable Sort stable.</span></div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="comment">   *  @callgraph </span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;  <span class="keyword">template</span>&lt;<span class="keywordtype">bool</span> __stable, <span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare&gt;</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="a01575.html#ac609a343c5522586ce1561c1390fab46">   99</a></span>&#160;    __parallel_sort(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;                    _Compare __comp,</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;                    <a class="code" href="a09683.html">multiway_mergesort_exact_tag</a> __parallelism)</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;    {</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;      <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__end - __begin)</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;</div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;      parallel_sort_mwms&lt;__stable, true&gt;</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;        (__begin, __end, __comp, __parallelism.<a class="code" href="a09643.html#a18b32829b31b902699690b750e190e59">__get_num_threads</a>());</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;    }</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;<span class="comment">  /** </span></div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;<span class="comment">   *  @brief Choose multiway mergesort with splitting by sampling,</span></div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;<span class="comment">   *  for parallel sorting.</span></div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;<span class="comment">   *  @param __begin Begin iterator of input sequence.</span></div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;<span class="comment">   *  @param __end End iterator of input sequence.</span></div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;<span class="comment">   *  @param __comp Comparator.</span></div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;<span class="comment">   *  @tparam __stable Sort stable.</span></div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;<span class="comment">   *  @callgraph </span></div><div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;  <span class="keyword">template</span>&lt;<span class="keywordtype">bool</span> __stable, <span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare&gt;</div><div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00120"></a><span class="lineno"><a class="line" href="a01575.html#a81d9cc449b9b4122d5f4471dfdf02a78">  120</a></span>&#160;    __parallel_sort(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;                    _Compare __comp,</div><div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;                    <a class="code" href="a09687.html">multiway_mergesort_sampling_tag</a> __parallelism)</div><div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;    {</div><div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;      <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__end - __begin)</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;      parallel_sort_mwms&lt;__stable, false&gt;</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;      (__begin, __end, __comp, __parallelism.<a class="code" href="a09643.html#a18b32829b31b902699690b750e190e59">__get_num_threads</a>());</div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    }</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;<span class="comment">  /**</span></div><div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;<span class="comment">   *  @brief Choose quicksort for parallel sorting.</span></div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;<span class="comment">   *  @param __begin Begin iterator of input sequence.</span></div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;<span class="comment">   *  @param __end End iterator of input sequence.</span></div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;<span class="comment">   *  @param __comp Comparator.</span></div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;<span class="comment">   *  @tparam __stable Sort stable.</span></div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;<span class="comment">   *  @callgraph </span></div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;  <span class="keyword">template</span>&lt;<span class="keywordtype">bool</span> __stable, <span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare&gt;</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00140"></a><span class="lineno"><a class="line" href="a01575.html#aceaaa622c34d2f28ba6bf79241fcee36">  140</a></span>&#160;    __parallel_sort(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;                    _Compare __comp, <a class="code" href="a09691.html">quicksort_tag</a> __parallelism)</div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;    {</div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;      <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__end - __begin)</div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;</div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;      _GLIBCXX_PARALLEL_ASSERT(__stable == <span class="keyword">false</span>);</div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;</div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;      <a class="code" href="a01575.html#ac416a1c7e347b429bbf7a8fb17e847b2">__parallel_sort_qs</a>(__begin, __end, __comp,</div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;                         __parallelism.<a class="code" href="a09643.html#a18b32829b31b902699690b750e190e59">__get_num_threads</a>());</div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;    }</div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;<span class="comment">  /**</span></div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;<span class="comment">   *  @brief Choose balanced quicksort for parallel sorting.</span></div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;<span class="comment">   *  @param __begin Begin iterator of input sequence.</span></div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;<span class="comment">   *  @param __end End iterator of input sequence.</span></div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;<span class="comment">   *  @param __comp Comparator.</span></div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;<span class="comment">   *  @tparam __stable Sort stable.</span></div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;<span class="comment">   *  @callgraph </span></div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;   <span class="keyword">template</span>&lt;<span class="keywordtype">bool</span> __stable, <span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare&gt;</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;     <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00161"></a><span class="lineno"><a class="line" href="a01575.html#a000f037b08d237d140dd6144a11fb73f">  161</a></span>&#160;     __parallel_sort(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;                     _Compare __comp, <a class="code" href="a09695.html">balanced_quicksort_tag</a> __parallelism)</div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;     {</div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;       <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__end - __begin)</div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;       _GLIBCXX_PARALLEL_ASSERT(__stable == <span class="keyword">false</span>);</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;       <a class="code" href="a01575.html#a4093dd098b32542e3d3f43ebd4c6f940">__parallel_sort_qsb</a>(__begin, __end, __comp,</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;                           __parallelism.<a class="code" href="a09643.html#a18b32829b31b902699690b750e190e59">__get_num_threads</a>());</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;     }</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;<span class="comment">  /** </span></div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;<span class="comment">   *  @brief Choose multiway mergesort with exact splitting,</span></div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;<span class="comment">   *  for parallel sorting.</span></div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;<span class="comment">   *  @param __begin Begin iterator of input sequence.</span></div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;<span class="comment">   *  @param __end End iterator of input sequence.</span></div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;<span class="comment">   *  @param __comp Comparator.</span></div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;<span class="comment">   *  @tparam __stable Sort stable.</span></div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;<span class="comment">   *  @callgraph </span></div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;  <span class="keyword">template</span>&lt;<span class="keywordtype">bool</span> __stable, <span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare&gt;</div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00183"></a><span class="lineno"><a class="line" href="a01575.html#af2c2fb5ed2754de7c1acc336b62b57b0">  183</a></span>&#160;    __parallel_sort(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;                    _Compare __comp, <a class="code" href="a09647.html">default_parallel_tag</a> __parallelism)</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;    {</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;      <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__end - __begin)</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;      __parallel_sort&lt;__stable&gt;</div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;        (__begin, __end, __comp,</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;         <a class="code" href="a09683.html">multiway_mergesort_exact_tag</a>(__parallelism.<a class="code" href="a09643.html#a18b32829b31b902699690b750e190e59">__get_num_threads</a>()));</div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;    }</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;<span class="comment"></span></div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;<span class="comment">  /**</span></div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;<span class="comment">   *  @brief Choose a parallel sorting algorithm.</span></div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;<span class="comment">   *  @param __begin Begin iterator of input sequence.</span></div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;<span class="comment">   *  @param __end End iterator of input sequence.</span></div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;<span class="comment">   *  @param __comp Comparator.</span></div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;<span class="comment">   *  @tparam __stable Sort stable.</span></div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;<span class="comment">   *  @callgraph </span></div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;  <span class="keyword">template</span>&lt;<span class="keywordtype">bool</span> __stable, <span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _Compare&gt;</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;    <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00203"></a><span class="lineno"><a class="line" href="a01575.html#aa47b469dd82347dd63c3996eda2e237b">  203</a></span>&#160;    __parallel_sort(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;                    _Compare __comp, <a class="code" href="a09643.html">parallel_tag</a> __parallelism)</div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;    {</div><div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;      <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__end - __begin)</div><div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;      <span class="keyword">typedef</span> std::iterator_traits&lt;_RAIter&gt; _TraitsType;</div><div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;      <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;      <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;</div><div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;      <span class="keywordflow">if</span> (<span class="keyword">false</span>) ;</div><div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;<span class="preprocessor">#if _GLIBCXX_MERGESORT</span></div><div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;      <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__stable || <a class="code" href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">_Settings::get</a>().sort_algorithm == MWMS)</div><div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;        {</div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;          <span class="keywordflow">if</span>(<a class="code" href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">_Settings::get</a>().sort_splitting == EXACT)</div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;            parallel_sort_mwms&lt;__stable, true&gt;</div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;              (__begin, __end, __comp, __parallelism.<a class="code" href="a09643.html#a18b32829b31b902699690b750e190e59">__get_num_threads</a>());</div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;          <span class="keywordflow">else</span></div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;            parallel_sort_mwms&lt;false, false&gt;</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;              (__begin, __end, __comp, __parallelism.<a class="code" href="a09643.html#a18b32829b31b902699690b750e190e59">__get_num_threads</a>());</div><div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;        }</div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;<span class="preprocessor">#if _GLIBCXX_QUICKSORT</span></div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;      <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">_Settings::get</a>().sort_algorithm == QS)</div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;        <a class="code" href="a01575.html#ac416a1c7e347b429bbf7a8fb17e847b2">__parallel_sort_qs</a>(__begin, __end, __comp,</div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;                           __parallelism.<a class="code" href="a09643.html#a18b32829b31b902699690b750e190e59">__get_num_threads</a>());</div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;<span class="preprocessor">#if _GLIBCXX_BAL_QUICKSORT</span></div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;      <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">_Settings::get</a>().sort_algorithm == QS_BALANCED)</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;        <a class="code" href="a01575.html#a4093dd098b32542e3d3f43ebd4c6f940">__parallel_sort_qsb</a>(__begin, __end, __comp,</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;                            __parallelism.<a class="code" href="a09643.html#a18b32829b31b902699690b750e190e59">__get_num_threads</a>());</div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;<span class="preprocessor">#endif</span></div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;      <span class="keywordflow">else</span></div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;        __gnu_sequential::sort(__begin, __end, __comp);</div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;    }</div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;} <span class="comment">// end namespace __gnu_parallel</span></div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_SORT_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a09691_html"><div class="ttname"><a href="a09691.html">__gnu_parallel::quicksort_tag</a></div><div class="ttdoc">Forces parallel sorting using unbalanced quicksort at compile time.</div><div class="ttdef"><b>Definition:</b> <a href="a00968_source.html#l00155">tags.h:155</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="a09647_html"><div class="ttname"><a href="a09647.html">__gnu_parallel::default_parallel_tag</a></div><div class="ttdoc">Recommends parallel execution using the default parallel algorithm.</div><div class="ttdef"><b>Definition:</b> <a href="a00968_source.html#l00079">tags.h:79</a></div></div>
<div class="ttc" id="a09679_html"><div class="ttname"><a href="a09679.html">__gnu_parallel::multiway_mergesort_tag</a></div><div class="ttdoc">Forces parallel sorting using multiway mergesort at compile time.</div><div class="ttdef"><b>Definition:</b> <a href="a00968_source.html#l00128">tags.h:128</a></div></div>
<div class="ttc" id="a00947_html"><div class="ttname"><a href="a00947.html">quicksort.h</a></div><div class="ttdoc">Implementation of a unbalanced parallel quicksort (in-place). This file is a GNU parallel extension t...</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="a09643_html"><div class="ttname"><a href="a09643.html">__gnu_parallel::parallel_tag</a></div><div class="ttdoc">Recommends parallel execution at compile time, optionally using a user-specified number of threads.</div><div class="ttdef"><b>Definition:</b> <a href="a00968_source.html#l00046">tags.h:46</a></div></div>
<div class="ttc" id="a09643_html_a18b32829b31b902699690b750e190e59"><div class="ttname"><a href="a09643.html#a18b32829b31b902699690b750e190e59">__gnu_parallel::parallel_tag::__get_num_threads</a></div><div class="ttdeci">_ThreadIndex __get_num_threads()</div><div class="ttdoc">Find out desired number of threads.</div><div class="ttdef"><b>Definition:</b> <a href="a00968_source.html#l00063">tags.h:63</a></div></div>
<div class="ttc" id="a09687_html"><div class="ttname"><a href="a09687.html">__gnu_parallel::multiway_mergesort_sampling_tag</a></div><div class="ttdoc">Forces parallel sorting using multiway mergesort with splitting by sampling at compile time.</div><div class="ttdef"><b>Definition:</b> <a href="a00968_source.html#l00146">tags.h:146</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="a00887_html"><div class="ttname"><a href="a00887.html">features.h</a></div><div class="ttdoc">Defines on whether to include algorithm variants.</div></div>
<div class="ttc" id="a00875_html"><div class="ttname"><a href="a00875.html">basic_iterator.h</a></div><div class="ttdoc">Includes the original header files concerned with iterators except for stream iterators....</div></div>
<div class="ttc" id="a00881_html_a77fb93c9cecec331ccee755972695128"><div class="ttname"><a href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a></div><div class="ttdeci">#define _GLIBCXX_CALL(__n)</div><div class="ttdoc">Macro to produce log message when entering a function.</div><div class="ttdef"><b>Definition:</b> <a href="a00881_source.html#l00044">compiletime_settings.h:44</a></div></div>
<div class="ttc" id="a09695_html"><div class="ttname"><a href="a09695.html">__gnu_parallel::balanced_quicksort_tag</a></div><div class="ttdoc">Forces parallel sorting using balanced quicksort at compile time.</div><div class="ttdef"><b>Definition:</b> <a href="a00968_source.html#l00164">tags.h:164</a></div></div>
<div class="ttc" id="a09683_html"><div class="ttname"><a href="a09683.html">__gnu_parallel::multiway_mergesort_exact_tag</a></div><div class="ttdoc">Forces parallel sorting using multiway mergesort with exact splitting at compile time.</div><div class="ttdef"><b>Definition:</b> <a href="a00968_source.html#l00137">tags.h:137</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="a00920_html"><div class="ttname"><a href="a00920.html">multiway_mergesort.h</a></div><div class="ttdoc">Parallel multiway merge sort. This file is a GNU parallel extension to the Standard C++ Library.</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="a00872_html"><div class="ttname"><a href="a00872.html">balanced_quicksort.h</a></div><div class="ttdoc">Implementation of a dynamically load-balanced parallel quicksort.</div></div>
<div class="ttc" id="a01575_html_a76f6cbf29b1b8d57762cce1ed9bd01a8"><div class="ttname"><a href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8">__gnu_parallel::_Parallelism</a></div><div class="ttdeci">_Parallelism</div><div class="ttdoc">Run-time equivalents for the compile-time tags.</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00044">types.h:44</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 &amp; get()</div><div class="ttdoc">Get the global settings.</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="a00965.html">sort.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>