<!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++: settings.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('a00962_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">settings.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00962.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/settings.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Runtime settings and tuning parameters, heuristics to decide</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * whether to use parallelized algorithms.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * This file is a GNU parallel extension to the Standard C++ Library.</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> *</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * @section parallelization_decision </span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * The decision whether to run an algorithm in parallel.</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> *</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * There are several ways the user can switch on and __off the parallel</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * execution of an algorithm, both at compile- and run-time.</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> *</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * Only sequential execution can be forced at compile-time. This</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> * reduces code size and protects code parts that have</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> * non-thread-safe side effects.</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> *</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> * Ultimately, forcing parallel execution at compile-time makes</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * sense. Often, the sequential algorithm implementation is used as</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * a subroutine, so no reduction in code size can be achieved. Also,</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * the machine the program is run on might have only one processor</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * core, so to avoid overhead, the algorithm is executed</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * sequentially.</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> *</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * To force sequential execution of an algorithm ultimately at</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * compile-time, the user must add the tag</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">* gnu_parallel::sequential_tag() to the end of the parameter list,</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> * e. g.</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> *</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * \code</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * std::sort(__v.begin(), __v.end(), __gnu_parallel::sequential_tag());</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> * \endcode</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> *</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> * This is compatible with all overloaded algorithm variants. No</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> * additional code will be instantiated, at all. The same holds for</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> * most algorithm calls with iterators not providing random access.</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> *</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> * If the algorithm call is not forced to be executed sequentially</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> * at compile-time, the decision is made at run-time.</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> * The global variable __gnu_parallel::_Settings::algorithm_strategy</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> * is checked. _It is a tristate variable corresponding to:</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> *</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> * a. force_sequential, meaning the sequential algorithm is executed.</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment">* b. force_parallel, meaning the parallel algorithm is executed.</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment">* c. heuristic</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> *</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"> * For heuristic, the parallel algorithm implementation is called</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> * only if the input size is sufficiently large. For most</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> * algorithms, the input size is the (combined) length of the input</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment">* sequence(__s). The threshold can be set by the user, individually</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> * for each algorithm. The according variables are called</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment">* gnu_parallel::_Settings::[algorithm]_minimal_n .</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> *</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * For some of the algorithms, there are even more tuning options,</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * e. g. the ability to choose from multiple algorithm variants. See</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> * below for details.</span></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> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// Written by Johannes Singler and Felix Putze.</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_SETTINGS_H</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_SETTINGS_H 1</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="preprocessor">#include <<a class="code" href="a00971.html">parallel/types.h</a>></span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"></span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment">/** </span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> * @brief Determine at compile(?)-time if the parallel variant of an</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> * algorithm should be called.</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * @param __c A condition that is convertible to bool that is overruled by</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> * __gnu_parallel::_Settings::algorithm_strategy. Usually a decision</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> * based on the input size.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> */</span></div><div class="line"><a name="l00095"></a><span class="lineno"><a class="line" href="a00962.html#ad816e8f52b933c9300598977cada7d18"> 95</a></span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_CONDITION(__c) \</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="preprocessor"> (__gnu_parallel::_Settings::get().algorithm_strategy \</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="preprocessor"> != __gnu_parallel::force_sequential \</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="preprocessor"> && ((__gnu_parallel::__get_max_threads() > 1 && (__c)) \</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="preprocessor"> || __gnu_parallel::_Settings::get().algorithm_strategy \</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="preprocessor"> == __gnu_parallel::force_parallel))</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment">/*</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment">inline bool</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment">parallel_condition(bool __c)</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment">{</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> bool ret = false;</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"> const _Settings& __s = _Settings::get();</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> if (__s.algorithm_strategy != force_seqential)</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> {</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> if (__s.algorithm_strategy == force_parallel)</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> ret = true;</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> else</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> ret = __get_max_threads() > 1 && __c;</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> }</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> return ret;</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment">}</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment">*/</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="keyword">namespace </span><a class="code" href="a01575.html">__gnu_parallel</a></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> {<span class="comment"></span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"> /// class _Settings</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> /// Run-time settings for the parallel mode including all tunable parameters.</span></div><div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="a09635.html"> 123</a></span> <span class="comment"></span> <span class="keyword">struct </span><a class="code" href="a09635.html">_Settings</a></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  {</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <a class="code" href="a01575.html#abfff682f83a1eacf1b43ad2b33a1954f">_AlgorithmStrategy</a> algorithm_strategy;</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <a class="code" href="a01575.html#a35bfabad218af713f172257aecd8414e">_SortAlgorithm</a> sort_algorithm;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <a class="code" href="a01575.html#a6a4a811c81e2fb4a7722ee69762c7380">_PartialSumAlgorithm</a> partial_sum_algorithm;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <a class="code" href="a01575.html#abf16f5ba3af149689c7ed95309b7e91d">_MultiwayMergeAlgorithm</a> multiway_merge_algorithm;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <a class="code" href="a01575.html#a1a75203febda4d2e4fab646bf6a94252">_FindAlgorithm</a> find_algorithm;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <a class="code" href="a01575.html#ace24b9f316fde5ea598815403cfd02bb">_SplittingAlgorithm</a> sort_splitting;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <a class="code" href="a01575.html#ace24b9f316fde5ea598815403cfd02bb">_SplittingAlgorithm</a> merge_splitting;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <a class="code" href="a01575.html#ace24b9f316fde5ea598815403cfd02bb">_SplittingAlgorithm</a> multiway_merge_splitting;</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">// Per-algorithm settings.</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"></span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> /// Minimal input size for accumulate.</span></div><div class="line"><a name="l00139"></a><span class="lineno"><a class="line" href="a09635.html#aca7032b6e6e0e84d00e83ea57e6f89d4"> 139</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#aca7032b6e6e0e84d00e83ea57e6f89d4">accumulate_minimal_n</a>;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"></span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"> /// Minimal input size for adjacent_difference.</span></div><div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="a09635.html#a54ef7c9960d233b219343ac7894c7fc4"> 142</a></span> <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="a09635.html#a54ef7c9960d233b219343ac7894c7fc4">adjacent_difference_minimal_n</a>;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"></span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment"> /// Minimal input size for count and count_if.</span></div><div class="line"><a name="l00145"></a><span class="lineno"><a class="line" href="a09635.html#ad8cdfe2324ea2ea32021f2625b2299f1"> 145</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#ad8cdfe2324ea2ea32021f2625b2299f1">count_minimal_n</a>;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment"></span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment"> /// Minimal input size for fill.</span></div><div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="a09635.html#ae12932b6ecb49293c8c68a0d5dbf8919"> 148</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#ae12932b6ecb49293c8c68a0d5dbf8919">fill_minimal_n</a>;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment"></span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment"> /// Block size increase factor for find.</span></div><div class="line"><a name="l00151"></a><span class="lineno"><a class="line" href="a09635.html#a9450672486f402afac0c0741fe1d76a8"> 151</a></span> <span class="comment"></span> <span class="keywordtype">double</span> <a class="code" href="a09635.html#a9450672486f402afac0c0741fe1d76a8">find_increasing_factor</a>;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment"></span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment"> /// Initial block size for find.</span></div><div class="line"><a name="l00154"></a><span class="lineno"><a class="line" href="a09635.html#a52caf5becdee8026dc2bf029f46e15d1"> 154</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a52caf5becdee8026dc2bf029f46e15d1">find_initial_block_size</a>;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment"></span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"> /// Maximal block size for find.</span></div><div class="line"><a name="l00157"></a><span class="lineno"><a class="line" href="a09635.html#a6e85e9dffe870aad7d2155188b3dea99"> 157</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a6e85e9dffe870aad7d2155188b3dea99">find_maximum_block_size</a>;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"></span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> /// Start with looking for this many elements sequentially, for find.</span></div><div class="line"><a name="l00160"></a><span class="lineno"><a class="line" href="a09635.html#a755b0ae67b24dfe7d6f436e097a49620"> 160</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a755b0ae67b24dfe7d6f436e097a49620">find_sequential_search_size</a>;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"></span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> /// Minimal input size for for_each.</span></div><div class="line"><a name="l00163"></a><span class="lineno"><a class="line" href="a09635.html#a334f583634130237ff56881c3e3e9570"> 163</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a334f583634130237ff56881c3e3e9570">for_each_minimal_n</a>;</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"></span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> /// Minimal input size for generate.</span></div><div class="line"><a name="l00166"></a><span class="lineno"><a class="line" href="a09635.html#a7f594850297e77470588b017b3afe81e"> 166</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a7f594850297e77470588b017b3afe81e">generate_minimal_n</a>;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"></span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment"> /// Minimal input size for max_element.</span></div><div class="line"><a name="l00169"></a><span class="lineno"><a class="line" href="a09635.html#ad032e9ab491119f763bfb79cbfcc24d8"> 169</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#ad032e9ab491119f763bfb79cbfcc24d8">max_element_minimal_n</a>;</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"></span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"> /// Minimal input size for merge.</span></div><div class="line"><a name="l00172"></a><span class="lineno"><a class="line" href="a09635.html#a6daa1846a1a935cd6ec684087e063ac4"> 172</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a6daa1846a1a935cd6ec684087e063ac4">merge_minimal_n</a>;</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment"></span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="comment"> /// Oversampling factor for merge.</span></div><div class="line"><a name="l00175"></a><span class="lineno"><a class="line" href="a09635.html#a14ded8ea54764e899f1d24ef1fe12b19"> 175</a></span> <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="a09635.html#a14ded8ea54764e899f1d24ef1fe12b19">merge_oversampling</a>;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment"></span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment"> /// Minimal input size for min_element.</span></div><div class="line"><a name="l00178"></a><span class="lineno"><a class="line" href="a09635.html#aa85f76a1f1bfd6c87efed32062222a05"> 178</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#aa85f76a1f1bfd6c87efed32062222a05">min_element_minimal_n</a>;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"></span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> /// Minimal input size for multiway_merge.</span></div><div class="line"><a name="l00181"></a><span class="lineno"><a class="line" href="a09635.html#a15bef2dad4920451b8eb798ccdbf68f8"> 181</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a15bef2dad4920451b8eb798ccdbf68f8">multiway_merge_minimal_n</a>;</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"></span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> /// Oversampling factor for multiway_merge.</span></div><div class="line"><a name="l00184"></a><span class="lineno"><a class="line" href="a09635.html#a4859415fa2642fbdf9324007b75b020e"> 184</a></span> <span class="comment"></span> <span class="keywordtype">int</span> <a class="code" href="a09635.html#a4859415fa2642fbdf9324007b75b020e">multiway_merge_minimal_k</a>;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"></span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"> /// Oversampling factor for multiway_merge.</span></div><div class="line"><a name="l00187"></a><span class="lineno"><a class="line" href="a09635.html#aa514e4bd6da6380bf7526c5306d6b173"> 187</a></span> <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="a09635.html#aa514e4bd6da6380bf7526c5306d6b173">multiway_merge_oversampling</a>;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"></span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> /// Minimal input size for nth_element.</span></div><div class="line"><a name="l00190"></a><span class="lineno"><a class="line" href="a09635.html#a34bef940cd171e22210e1c349152aab9"> 190</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a34bef940cd171e22210e1c349152aab9">nth_element_minimal_n</a>;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"></span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> /// Chunk size for partition.</span></div><div class="line"><a name="l00193"></a><span class="lineno"><a class="line" href="a09635.html#ad796aab8446ea9eaadfbc0b7b0787c71"> 193</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#ad796aab8446ea9eaadfbc0b7b0787c71">partition_chunk_size</a>;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"></span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"> /// Chunk size for partition, relative to input size. If > 0.0,</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> /// this value overrides partition_chunk_size.</span></div><div class="line"><a name="l00197"></a><span class="lineno"><a class="line" href="a09635.html#aaac9b17f2715c8b9101a2905562a43d1"> 197</a></span> <span class="comment"></span> <span class="keywordtype">double</span> <a class="code" href="a09635.html#aaac9b17f2715c8b9101a2905562a43d1">partition_chunk_share</a>;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"></span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> /// Minimal input size for partition.</span></div><div class="line"><a name="l00200"></a><span class="lineno"><a class="line" href="a09635.html#ae56b6a01dc27becaa478828011527b4b"> 200</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#ae56b6a01dc27becaa478828011527b4b">partition_minimal_n</a>;</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment"></span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment"> /// Minimal input size for partial_sort.</span></div><div class="line"><a name="l00203"></a><span class="lineno"><a class="line" href="a09635.html#a79a53af11312c55af15998bf7a3f46d3"> 203</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a79a53af11312c55af15998bf7a3f46d3">partial_sort_minimal_n</a>;</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"></span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment"> /// Ratio for partial_sum. Assume "sum and write result" to be</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment"> /// this factor slower than just "sum".</span></div><div class="line"><a name="l00207"></a><span class="lineno"><a class="line" href="a09635.html#a781c6a0034d1669b90e37407e1c6d09e"> 207</a></span> <span class="comment"></span> <span class="keywordtype">float</span> <a class="code" href="a09635.html#a781c6a0034d1669b90e37407e1c6d09e">partial_sum_dilation</a>;</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"></span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"> /// Minimal input size for partial_sum.</span></div><div class="line"><a name="l00210"></a><span class="lineno"><a class="line" href="a09635.html#a768fbc7a7e588eabb25fd3824c4322fb"> 210</a></span> <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="a09635.html#a768fbc7a7e588eabb25fd3824c4322fb">partial_sum_minimal_n</a>;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"></span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment"> /// Minimal input size for random_shuffle.</span></div><div class="line"><a name="l00213"></a><span class="lineno"><a class="line" href="a09635.html#a5726332beba72b016508f1c641978265"> 213</a></span> <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="a09635.html#a5726332beba72b016508f1c641978265">random_shuffle_minimal_n</a>;</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment"></span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment"> /// Minimal input size for replace and replace_if.</span></div><div class="line"><a name="l00216"></a><span class="lineno"><a class="line" href="a09635.html#a524589fca5b42e749dd5d5c2561fdacd"> 216</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a524589fca5b42e749dd5d5c2561fdacd">replace_minimal_n</a>;</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"></span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> /// Minimal input size for set_difference.</span></div><div class="line"><a name="l00219"></a><span class="lineno"><a class="line" href="a09635.html#a5b63306dcd3a70e85dd42790b91aa0af"> 219</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a5b63306dcd3a70e85dd42790b91aa0af">set_difference_minimal_n</a>;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="comment"></span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="comment"> /// Minimal input size for set_intersection.</span></div><div class="line"><a name="l00222"></a><span class="lineno"><a class="line" href="a09635.html#a397d3c431a2dc32de6e2eef4e7134b50"> 222</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a397d3c431a2dc32de6e2eef4e7134b50">set_intersection_minimal_n</a>;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment"></span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment"> /// Minimal input size for set_symmetric_difference.</span></div><div class="line"><a name="l00225"></a><span class="lineno"><a class="line" href="a09635.html#abf47bf2bbef9261d3d10b59558ddbdf2"> 225</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#abf47bf2bbef9261d3d10b59558ddbdf2">set_symmetric_difference_minimal_n</a>;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"></span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"> /// Minimal input size for set_union.</span></div><div class="line"><a name="l00228"></a><span class="lineno"><a class="line" href="a09635.html#ab42faf337cfe7b64edfb7e61c6dadd08"> 228</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#ab42faf337cfe7b64edfb7e61c6dadd08">set_union_minimal_n</a>;</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment"></span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="comment"> /// Minimal input size for parallel sorting.</span></div><div class="line"><a name="l00231"></a><span class="lineno"><a class="line" href="a09635.html#a16e8a6461d487c29d0657c8f48575616"> 231</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a16e8a6461d487c29d0657c8f48575616">sort_minimal_n</a>;</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="comment"></span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="comment"> /// Oversampling factor for parallel std::sort (MWMS).</span></div><div class="line"><a name="l00234"></a><span class="lineno"><a class="line" href="a09635.html#a0f435bbb73735fb8fdec296eed3c5996"> 234</a></span> <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="a09635.html#a0f435bbb73735fb8fdec296eed3c5996">sort_mwms_oversampling</a>;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="comment"></span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="comment"> /// Such many samples to take to find a good pivot (quicksort).</span></div><div class="line"><a name="l00237"></a><span class="lineno"><a class="line" href="a09635.html#a5d52b268aa07e731f6b01ff2fdd49904"> 237</a></span> <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="a09635.html#a5d52b268aa07e731f6b01ff2fdd49904">sort_qs_num_samples_preset</a>;</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment"></span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment"> /// Maximal subsequence __length to switch to unbalanced __base case.</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="comment"> /// Applies to std::sort with dynamically load-balanced quicksort.</span></div><div class="line"><a name="l00241"></a><span class="lineno"><a class="line" href="a09635.html#a3a0bbce1f017d9a3ea2ea176722ed853"> 241</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a3a0bbce1f017d9a3ea2ea176722ed853">sort_qsb_base_case_maximal_n</a>;</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"> /// Minimal input size for parallel std::transform.</span></div><div class="line"><a name="l00244"></a><span class="lineno"><a class="line" href="a09635.html#aebdcc2cdd7ed5932001f979f6cd1167c"> 244</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#aebdcc2cdd7ed5932001f979f6cd1167c">transform_minimal_n</a>;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment"></span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment"> /// Minimal input size for unique_copy. </span></div><div class="line"><a name="l00247"></a><span class="lineno"><a class="line" href="a09635.html#afc0b0f931fe74be4ec20cb3a34168898"> 247</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#afc0b0f931fe74be4ec20cb3a34168898">unique_copy_minimal_n</a>;</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> </div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> workstealing_chunk_size;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">// Hardware dependent tuning parameters.</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment"></span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment"> /// size of the L1 cache in bytes (underestimation).</span></div><div class="line"><a name="l00254"></a><span class="lineno"><a class="line" href="a09635.html#a46efaab4e04cdca5b5ab2fe7fc8d24f4"> 254</a></span> <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> <a class="code" href="a09635.html#a46efaab4e04cdca5b5ab2fe7fc8d24f4">L1_cache_size</a>;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment"></span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment"> /// size of the L2 cache in bytes (underestimation).</span></div><div class="line"><a name="l00257"></a><span class="lineno"><a class="line" href="a09635.html#a5a8b6a19fe32819d625800fdcdb97c25"> 257</a></span> <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> <a class="code" href="a09635.html#a5a8b6a19fe32819d625800fdcdb97c25">L2_cache_size</a>;</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment"></span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment"> /// size of the Translation Lookaside Buffer (underestimation).</span></div><div class="line"><a name="l00260"></a><span class="lineno"><a class="line" href="a09635.html#a5685189f3c14bde3fc8857e5217a359d"> 260</a></span> <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="a09635.html#a5685189f3c14bde3fc8857e5217a359d">TLB_size</a>;</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"></span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> /// Overestimation of cache line size. Used to avoid false</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"> /// sharing, i.e. elements of different threads are at least this</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment"> /// amount apart.</span></div><div class="line"><a name="l00265"></a><span class="lineno"><a class="line" href="a09635.html#a2918b2f3f97a4fbbcfe990e73ace805b"> 265</a></span> <span class="comment"></span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="a09635.html#a2918b2f3f97a4fbbcfe990e73ace805b">cache_line_size</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">// Statistics.</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment"></span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment"> /// The number of stolen ranges in load-balanced quicksort.</span></div><div class="line"><a name="l00270"></a><span class="lineno"><a class="line" href="a09635.html#ad2087c371858b65ed5af5070e82fc80b"> 270</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#ad2087c371858b65ed5af5070e82fc80b">qsb_steals</a>;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment"></span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment"> /// Minimal input size for search and search_n.</span></div><div class="line"><a name="l00273"></a><span class="lineno"><a class="line" href="a09635.html#a0a323f305cb24d5c555e35031553ef02"> 273</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> <a class="code" href="a09635.html#a0a323f305cb24d5c555e35031553ef02">search_minimal_n</a>;</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment"></span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="comment"> /// Block size scale-down factor with respect to current position.</span></div><div class="line"><a name="l00276"></a><span class="lineno"><a class="line" href="a09635.html#ad1123e5b2d57ff40c415d893cfbf5a11"> 276</a></span> <span class="comment"></span> <span class="keywordtype">float</span> <a class="code" href="a09635.html#ad1123e5b2d57ff40c415d893cfbf5a11">find_scale_factor</a>;</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="comment"></span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> <span class="comment"> /// Get the global settings.</span></div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> <span class="comment"></span> _GLIBCXX_CONST <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="a09635.html">_Settings</a>&</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <a class="code" href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">get</a>() throw();</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="comment"></span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> <span class="comment"> /// Set the global settings.</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="comment"></span> static <span class="keywordtype">void</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <a class="code" href="a09635.html#ab8315853244a863923059790ac776299">set</a>(<a class="code" href="a09635.html">_Settings</a>&) throw();</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  explicit </div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <a class="code" href="a09635.html">_Settings</a>() :</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  algorithm_strategy(heuristic),</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  sort_algorithm(MWMS),</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  partial_sum_algorithm(LINEAR),</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  multiway_merge_algorithm(LOSER_TREE),</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  find_algorithm(CONSTANT_SIZE_BLOCKS),</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  sort_splitting(EXACT),</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  merge_splitting(EXACT),</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  multiway_merge_splitting(EXACT),</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <a class="code" href="a09635.html#aca7032b6e6e0e84d00e83ea57e6f89d4">accumulate_minimal_n</a>(1000),</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <a class="code" href="a09635.html#a54ef7c9960d233b219343ac7894c7fc4">adjacent_difference_minimal_n</a>(1000),</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <a class="code" href="a09635.html#ad8cdfe2324ea2ea32021f2625b2299f1">count_minimal_n</a>(1000),</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <a class="code" href="a09635.html#ae12932b6ecb49293c8c68a0d5dbf8919">fill_minimal_n</a>(1000),</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <a class="code" href="a09635.html#a9450672486f402afac0c0741fe1d76a8">find_increasing_factor</a>(2.0),</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <a class="code" href="a09635.html#a52caf5becdee8026dc2bf029f46e15d1">find_initial_block_size</a>(256),</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <a class="code" href="a09635.html#a6e85e9dffe870aad7d2155188b3dea99">find_maximum_block_size</a>(8192),</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <a class="code" href="a09635.html#a755b0ae67b24dfe7d6f436e097a49620">find_sequential_search_size</a>(256),</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <a class="code" href="a09635.html#a334f583634130237ff56881c3e3e9570">for_each_minimal_n</a>(1000),</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <a class="code" href="a09635.html#a7f594850297e77470588b017b3afe81e">generate_minimal_n</a>(1000),</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <a class="code" href="a09635.html#ad032e9ab491119f763bfb79cbfcc24d8">max_element_minimal_n</a>(1000),</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <a class="code" href="a09635.html#a6daa1846a1a935cd6ec684087e063ac4">merge_minimal_n</a>(1000),</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <a class="code" href="a09635.html#a14ded8ea54764e899f1d24ef1fe12b19">merge_oversampling</a>(10),</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <a class="code" href="a09635.html#aa85f76a1f1bfd6c87efed32062222a05">min_element_minimal_n</a>(1000),</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <a class="code" href="a09635.html#a15bef2dad4920451b8eb798ccdbf68f8">multiway_merge_minimal_n</a>(1000),</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <a class="code" href="a09635.html#a4859415fa2642fbdf9324007b75b020e">multiway_merge_minimal_k</a>(2), <a class="code" href="a09635.html#aa514e4bd6da6380bf7526c5306d6b173">multiway_merge_oversampling</a>(10),</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <a class="code" href="a09635.html#a34bef940cd171e22210e1c349152aab9">nth_element_minimal_n</a>(1000),</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <a class="code" href="a09635.html#ad796aab8446ea9eaadfbc0b7b0787c71">partition_chunk_size</a>(1000),</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <a class="code" href="a09635.html#aaac9b17f2715c8b9101a2905562a43d1">partition_chunk_share</a>(0.0),</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <a class="code" href="a09635.html#ae56b6a01dc27becaa478828011527b4b">partition_minimal_n</a>(1000),</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <a class="code" href="a09635.html#a79a53af11312c55af15998bf7a3f46d3">partial_sort_minimal_n</a>(1000),</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <a class="code" href="a09635.html#a781c6a0034d1669b90e37407e1c6d09e">partial_sum_dilation</a>(1.0f),</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <a class="code" href="a09635.html#a768fbc7a7e588eabb25fd3824c4322fb">partial_sum_minimal_n</a>(1000),</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <a class="code" href="a09635.html#a5726332beba72b016508f1c641978265">random_shuffle_minimal_n</a>(1000),</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <a class="code" href="a09635.html#a524589fca5b42e749dd5d5c2561fdacd">replace_minimal_n</a>(1000),</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <a class="code" href="a09635.html#a5b63306dcd3a70e85dd42790b91aa0af">set_difference_minimal_n</a>(1000),</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <a class="code" href="a09635.html#a397d3c431a2dc32de6e2eef4e7134b50">set_intersection_minimal_n</a>(1000),</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <a class="code" href="a09635.html#abf47bf2bbef9261d3d10b59558ddbdf2">set_symmetric_difference_minimal_n</a>(1000),</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <a class="code" href="a09635.html#ab42faf337cfe7b64edfb7e61c6dadd08">set_union_minimal_n</a>(1000),</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <a class="code" href="a09635.html#a16e8a6461d487c29d0657c8f48575616">sort_minimal_n</a>(1000),</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <a class="code" href="a09635.html#a0f435bbb73735fb8fdec296eed3c5996">sort_mwms_oversampling</a>(10),</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <a class="code" href="a09635.html#a5d52b268aa07e731f6b01ff2fdd49904">sort_qs_num_samples_preset</a>(100),</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <a class="code" href="a09635.html#a3a0bbce1f017d9a3ea2ea176722ed853">sort_qsb_base_case_maximal_n</a>(100),</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <a class="code" href="a09635.html#aebdcc2cdd7ed5932001f979f6cd1167c">transform_minimal_n</a>(1000),</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <a class="code" href="a09635.html#afc0b0f931fe74be4ec20cb3a34168898">unique_copy_minimal_n</a>(10000),</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  workstealing_chunk_size(100),</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <a class="code" href="a09635.html#a46efaab4e04cdca5b5ab2fe7fc8d24f4">L1_cache_size</a>(16 << 10),</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <a class="code" href="a09635.html#a5a8b6a19fe32819d625800fdcdb97c25">L2_cache_size</a>(256 << 10),</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <a class="code" href="a09635.html#a5685189f3c14bde3fc8857e5217a359d">TLB_size</a>(128),</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <a class="code" href="a09635.html#a2918b2f3f97a4fbbcfe990e73ace805b">cache_line_size</a>(64),</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <a class="code" href="a09635.html#ad2087c371858b65ed5af5070e82fc80b">qsb_steals</a>(0),</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <a class="code" href="a09635.html#a0a323f305cb24d5c555e35031553ef02">search_minimal_n</a>(1000),</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <a class="code" href="a09635.html#ad1123e5b2d57ff40c415d893cfbf5a11">find_scale_factor</a>(0.01f)</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>  };</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> }</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_SETTINGS_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a00971_html"><div class="ttname"><a href="a00971.html">types.h</a></div><div class="ttdoc">Basic types and typedefs. This file is a GNU parallel extension to the Standard C++ Library.</div></div>
<div class="ttc" id="a09635_html_a7f594850297e77470588b017b3afe81e"><div class="ttname"><a href="a09635.html#a7f594850297e77470588b017b3afe81e">__gnu_parallel::_Settings::generate_minimal_n</a></div><div class="ttdeci">_SequenceIndex generate_minimal_n</div><div class="ttdoc">Minimal input size for generate.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00166">settings.h:166</a></div></div>
<div class="ttc" id="a09635_html_a5d52b268aa07e731f6b01ff2fdd49904"><div class="ttname"><a href="a09635.html#a5d52b268aa07e731f6b01ff2fdd49904">__gnu_parallel::_Settings::sort_qs_num_samples_preset</a></div><div class="ttdeci">unsigned int sort_qs_num_samples_preset</div><div class="ttdoc">Such many samples to take to find a good pivot (quicksort).</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00237">settings.h:237</a></div></div>
<div class="ttc" id="a09635_html_a34bef940cd171e22210e1c349152aab9"><div class="ttname"><a href="a09635.html#a34bef940cd171e22210e1c349152aab9">__gnu_parallel::_Settings::nth_element_minimal_n</a></div><div class="ttdeci">_SequenceIndex nth_element_minimal_n</div><div class="ttdoc">Minimal input size for nth_element.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00190">settings.h:190</a></div></div>
<div class="ttc" id="a09635_html_a6daa1846a1a935cd6ec684087e063ac4"><div class="ttname"><a href="a09635.html#a6daa1846a1a935cd6ec684087e063ac4">__gnu_parallel::_Settings::merge_minimal_n</a></div><div class="ttdeci">_SequenceIndex merge_minimal_n</div><div class="ttdoc">Minimal input size for merge.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00172">settings.h:172</a></div></div>
<div class="ttc" id="a01575_html_a35bfabad218af713f172257aecd8414e"><div class="ttname"><a href="a01575.html#a35bfabad218af713f172257aecd8414e">__gnu_parallel::_SortAlgorithm</a></div><div class="ttdeci">_SortAlgorithm</div><div class="ttdoc">Sorting algorithms:</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00076">types.h:76</a></div></div>
<div class="ttc" id="a09635_html_abf47bf2bbef9261d3d10b59558ddbdf2"><div class="ttname"><a href="a09635.html#abf47bf2bbef9261d3d10b59558ddbdf2">__gnu_parallel::_Settings::set_symmetric_difference_minimal_n</a></div><div class="ttdeci">_SequenceIndex set_symmetric_difference_minimal_n</div><div class="ttdoc">Minimal input size for set_symmetric_difference.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00225">settings.h:225</a></div></div>
<div class="ttc" id="a09635_html_a15bef2dad4920451b8eb798ccdbf68f8"><div class="ttname"><a href="a09635.html#a15bef2dad4920451b8eb798ccdbf68f8">__gnu_parallel::_Settings::multiway_merge_minimal_n</a></div><div class="ttdeci">_SequenceIndex multiway_merge_minimal_n</div><div class="ttdoc">Minimal input size for multiway_merge.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00181">settings.h:181</a></div></div>
<div class="ttc" id="a09635_html"><div class="ttname"><a href="a09635.html">__gnu_parallel::_Settings</a></div><div class="ttdoc">class _Settings Run-time settings for the parallel mode including all tunable parameters.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00123">settings.h:123</a></div></div>
<div class="ttc" id="a09635_html_a6e85e9dffe870aad7d2155188b3dea99"><div class="ttname"><a href="a09635.html#a6e85e9dffe870aad7d2155188b3dea99">__gnu_parallel::_Settings::find_maximum_block_size</a></div><div class="ttdeci">_SequenceIndex find_maximum_block_size</div><div class="ttdoc">Maximal block size for find.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00157">settings.h:157</a></div></div>
<div class="ttc" id="a09635_html_aa85f76a1f1bfd6c87efed32062222a05"><div class="ttname"><a href="a09635.html#aa85f76a1f1bfd6c87efed32062222a05">__gnu_parallel::_Settings::min_element_minimal_n</a></div><div class="ttdeci">_SequenceIndex min_element_minimal_n</div><div class="ttdoc">Minimal input size for min_element.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00178">settings.h:178</a></div></div>
<div class="ttc" id="a09635_html_a0f435bbb73735fb8fdec296eed3c5996"><div class="ttname"><a href="a09635.html#a0f435bbb73735fb8fdec296eed3c5996">__gnu_parallel::_Settings::sort_mwms_oversampling</a></div><div class="ttdeci">unsigned int sort_mwms_oversampling</div><div class="ttdoc">Oversampling factor for parallel std::sort (MWMS).</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00234">settings.h:234</a></div></div>
<div class="ttc" id="a09635_html_a46efaab4e04cdca5b5ab2fe7fc8d24f4"><div class="ttname"><a href="a09635.html#a46efaab4e04cdca5b5ab2fe7fc8d24f4">__gnu_parallel::_Settings::L1_cache_size</a></div><div class="ttdeci">unsigned long long L1_cache_size</div><div class="ttdoc">size of the L1 cache in bytes (underestimation).</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00254">settings.h:254</a></div></div>
<div class="ttc" id="a09635_html_a781c6a0034d1669b90e37407e1c6d09e"><div class="ttname"><a href="a09635.html#a781c6a0034d1669b90e37407e1c6d09e">__gnu_parallel::_Settings::partial_sum_dilation</a></div><div class="ttdeci">float partial_sum_dilation</div><div class="ttdoc">Ratio for partial_sum. Assume "sum and write result" to be this factor slower than just "sum".</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00207">settings.h:207</a></div></div>
<div class="ttc" id="a09635_html_a768fbc7a7e588eabb25fd3824c4322fb"><div class="ttname"><a href="a09635.html#a768fbc7a7e588eabb25fd3824c4322fb">__gnu_parallel::_Settings::partial_sum_minimal_n</a></div><div class="ttdeci">unsigned int partial_sum_minimal_n</div><div class="ttdoc">Minimal input size for partial_sum.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00210">settings.h:210</a></div></div>
<div class="ttc" id="a09635_html_ae56b6a01dc27becaa478828011527b4b"><div class="ttname"><a href="a09635.html#ae56b6a01dc27becaa478828011527b4b">__gnu_parallel::_Settings::partition_minimal_n</a></div><div class="ttdeci">_SequenceIndex partition_minimal_n</div><div class="ttdoc">Minimal input size for partition.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00200">settings.h:200</a></div></div>
<div class="ttc" id="a09635_html_a16e8a6461d487c29d0657c8f48575616"><div class="ttname"><a href="a09635.html#a16e8a6461d487c29d0657c8f48575616">__gnu_parallel::_Settings::sort_minimal_n</a></div><div class="ttdeci">_SequenceIndex sort_minimal_n</div><div class="ttdoc">Minimal input size for parallel sorting.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00231">settings.h:231</a></div></div>
<div class="ttc" id="a09635_html_aa514e4bd6da6380bf7526c5306d6b173"><div class="ttname"><a href="a09635.html#aa514e4bd6da6380bf7526c5306d6b173">__gnu_parallel::_Settings::multiway_merge_oversampling</a></div><div class="ttdeci">unsigned int multiway_merge_oversampling</div><div class="ttdoc">Oversampling factor for multiway_merge.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00187">settings.h:187</a></div></div>
<div class="ttc" id="a09635_html_a397d3c431a2dc32de6e2eef4e7134b50"><div class="ttname"><a href="a09635.html#a397d3c431a2dc32de6e2eef4e7134b50">__gnu_parallel::_Settings::set_intersection_minimal_n</a></div><div class="ttdeci">_SequenceIndex set_intersection_minimal_n</div><div class="ttdoc">Minimal input size for set_intersection.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00222">settings.h:222</a></div></div>
<div class="ttc" id="a09635_html_a79a53af11312c55af15998bf7a3f46d3"><div class="ttname"><a href="a09635.html#a79a53af11312c55af15998bf7a3f46d3">__gnu_parallel::_Settings::partial_sort_minimal_n</a></div><div class="ttdeci">_SequenceIndex partial_sort_minimal_n</div><div class="ttdoc">Minimal input size for partial_sort.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00203">settings.h:203</a></div></div>
<div class="ttc" id="a09635_html_a524589fca5b42e749dd5d5c2561fdacd"><div class="ttname"><a href="a09635.html#a524589fca5b42e749dd5d5c2561fdacd">__gnu_parallel::_Settings::replace_minimal_n</a></div><div class="ttdeci">_SequenceIndex replace_minimal_n</div><div class="ttdoc">Minimal input size for replace and replace_if.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00216">settings.h:216</a></div></div>
<div class="ttc" id="a09635_html_a4859415fa2642fbdf9324007b75b020e"><div class="ttname"><a href="a09635.html#a4859415fa2642fbdf9324007b75b020e">__gnu_parallel::_Settings::multiway_merge_minimal_k</a></div><div class="ttdeci">int multiway_merge_minimal_k</div><div class="ttdoc">Oversampling factor for multiway_merge.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00184">settings.h:184</a></div></div>
<div class="ttc" id="a09635_html_ad1123e5b2d57ff40c415d893cfbf5a11"><div class="ttname"><a href="a09635.html#ad1123e5b2d57ff40c415d893cfbf5a11">__gnu_parallel::_Settings::find_scale_factor</a></div><div class="ttdeci">float find_scale_factor</div><div class="ttdoc">Block size scale-down factor with respect to current position.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00276">settings.h:276</a></div></div>
<div class="ttc" id="a09635_html_a2918b2f3f97a4fbbcfe990e73ace805b"><div class="ttname"><a href="a09635.html#a2918b2f3f97a4fbbcfe990e73ace805b">__gnu_parallel::_Settings::cache_line_size</a></div><div class="ttdeci">unsigned int cache_line_size</div><div class="ttdoc">Overestimation of cache line size. Used to avoid false sharing, i.e. elements of different threads ar...</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00265">settings.h:265</a></div></div>
<div class="ttc" id="a01575_html_ace24b9f316fde5ea598815403cfd02bb"><div class="ttname"><a href="a01575.html#ace24b9f316fde5ea598815403cfd02bb">__gnu_parallel::_SplittingAlgorithm</a></div><div class="ttdeci">_SplittingAlgorithm</div><div class="ttdoc">Sorting/merging algorithms: sampling, __exact.</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00098">types.h:98</a></div></div>
<div class="ttc" id="a09635_html_ad2087c371858b65ed5af5070e82fc80b"><div class="ttname"><a href="a09635.html#ad2087c371858b65ed5af5070e82fc80b">__gnu_parallel::_Settings::qsb_steals</a></div><div class="ttdeci">_SequenceIndex qsb_steals</div><div class="ttdoc">The number of stolen ranges in load-balanced quicksort.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00270">settings.h:270</a></div></div>
<div class="ttc" id="a09635_html_aaac9b17f2715c8b9101a2905562a43d1"><div class="ttname"><a href="a09635.html#aaac9b17f2715c8b9101a2905562a43d1">__gnu_parallel::_Settings::partition_chunk_share</a></div><div class="ttdeci">double partition_chunk_share</div><div class="ttdoc">Chunk size for partition, relative to input size. If > 0.0, this value overrides partition_chunk_size...</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00197">settings.h:197</a></div></div>
<div class="ttc" id="a09635_html_a14ded8ea54764e899f1d24ef1fe12b19"><div class="ttname"><a href="a09635.html#a14ded8ea54764e899f1d24ef1fe12b19">__gnu_parallel::_Settings::merge_oversampling</a></div><div class="ttdeci">unsigned int merge_oversampling</div><div class="ttdoc">Oversampling factor for merge.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00175">settings.h:175</a></div></div>
<div class="ttc" id="a09635_html_a9450672486f402afac0c0741fe1d76a8"><div class="ttname"><a href="a09635.html#a9450672486f402afac0c0741fe1d76a8">__gnu_parallel::_Settings::find_increasing_factor</a></div><div class="ttdeci">double find_increasing_factor</div><div class="ttdoc">Block size increase factor for find.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00151">settings.h:151</a></div></div>
<div class="ttc" id="a01575_html_abf16f5ba3af149689c7ed95309b7e91d"><div class="ttname"><a href="a01575.html#abf16f5ba3af149689c7ed95309b7e91d">__gnu_parallel::_MultiwayMergeAlgorithm</a></div><div class="ttdeci">_MultiwayMergeAlgorithm</div><div class="ttdoc">Merging algorithms:</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00085">types.h:85</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="a09635_html_a5b63306dcd3a70e85dd42790b91aa0af"><div class="ttname"><a href="a09635.html#a5b63306dcd3a70e85dd42790b91aa0af">__gnu_parallel::_Settings::set_difference_minimal_n</a></div><div class="ttdeci">_SequenceIndex set_difference_minimal_n</div><div class="ttdoc">Minimal input size for set_difference.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00219">settings.h:219</a></div></div>
<div class="ttc" id="a09635_html_a52caf5becdee8026dc2bf029f46e15d1"><div class="ttname"><a href="a09635.html#a52caf5becdee8026dc2bf029f46e15d1">__gnu_parallel::_Settings::find_initial_block_size</a></div><div class="ttdeci">_SequenceIndex find_initial_block_size</div><div class="ttdoc">Initial block size for find.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00154">settings.h:154</a></div></div>
<div class="ttc" id="a09635_html_ab8315853244a863923059790ac776299"><div class="ttname"><a href="a09635.html#ab8315853244a863923059790ac776299">__gnu_parallel::_Settings::set</a></div><div class="ttdeci">static void set(_Settings &)</div><div class="ttdoc">Set the global settings.</div></div>
<div class="ttc" id="a09635_html_a5685189f3c14bde3fc8857e5217a359d"><div class="ttname"><a href="a09635.html#a5685189f3c14bde3fc8857e5217a359d">__gnu_parallel::_Settings::TLB_size</a></div><div class="ttdeci">unsigned int TLB_size</div><div class="ttdoc">size of the Translation Lookaside Buffer (underestimation).</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00260">settings.h:260</a></div></div>
<div class="ttc" id="a09635_html_a54ef7c9960d233b219343ac7894c7fc4"><div class="ttname"><a href="a09635.html#a54ef7c9960d233b219343ac7894c7fc4">__gnu_parallel::_Settings::adjacent_difference_minimal_n</a></div><div class="ttdeci">unsigned int adjacent_difference_minimal_n</div><div class="ttdoc">Minimal input size for adjacent_difference.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00142">settings.h:142</a></div></div>
<div class="ttc" id="a09635_html_ab42faf337cfe7b64edfb7e61c6dadd08"><div class="ttname"><a href="a09635.html#ab42faf337cfe7b64edfb7e61c6dadd08">__gnu_parallel::_Settings::set_union_minimal_n</a></div><div class="ttdeci">_SequenceIndex set_union_minimal_n</div><div class="ttdoc">Minimal input size for set_union.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00228">settings.h:228</a></div></div>
<div class="ttc" id="a01575_html_abfff682f83a1eacf1b43ad2b33a1954f"><div class="ttname"><a href="a01575.html#abfff682f83a1eacf1b43ad2b33a1954f">__gnu_parallel::_AlgorithmStrategy</a></div><div class="ttdeci">_AlgorithmStrategy</div><div class="ttdoc">Strategies for run-time algorithm selection:</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00067">types.h:67</a></div></div>
<div class="ttc" id="a09635_html_ad796aab8446ea9eaadfbc0b7b0787c71"><div class="ttname"><a href="a09635.html#ad796aab8446ea9eaadfbc0b7b0787c71">__gnu_parallel::_Settings::partition_chunk_size</a></div><div class="ttdeci">_SequenceIndex partition_chunk_size</div><div class="ttdoc">Chunk size for partition.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00193">settings.h:193</a></div></div>
<div class="ttc" id="a09635_html_afc0b0f931fe74be4ec20cb3a34168898"><div class="ttname"><a href="a09635.html#afc0b0f931fe74be4ec20cb3a34168898">__gnu_parallel::_Settings::unique_copy_minimal_n</a></div><div class="ttdeci">_SequenceIndex unique_copy_minimal_n</div><div class="ttdoc">Minimal input size for unique_copy.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00247">settings.h:247</a></div></div>
<div class="ttc" id="a09635_html_a5a8b6a19fe32819d625800fdcdb97c25"><div class="ttname"><a href="a09635.html#a5a8b6a19fe32819d625800fdcdb97c25">__gnu_parallel::_Settings::L2_cache_size</a></div><div class="ttdeci">unsigned long long L2_cache_size</div><div class="ttdoc">size of the L2 cache in bytes (underestimation).</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00257">settings.h:257</a></div></div>
<div class="ttc" id="a09635_html_a755b0ae67b24dfe7d6f436e097a49620"><div class="ttname"><a href="a09635.html#a755b0ae67b24dfe7d6f436e097a49620">__gnu_parallel::_Settings::find_sequential_search_size</a></div><div class="ttdeci">_SequenceIndex find_sequential_search_size</div><div class="ttdoc">Start with looking for this many elements sequentially, for find.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00160">settings.h:160</a></div></div>
<div class="ttc" id="a09635_html_a0a323f305cb24d5c555e35031553ef02"><div class="ttname"><a href="a09635.html#a0a323f305cb24d5c555e35031553ef02">__gnu_parallel::_Settings::search_minimal_n</a></div><div class="ttdeci">_SequenceIndex search_minimal_n</div><div class="ttdoc">Minimal input size for search and search_n.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00273">settings.h:273</a></div></div>
<div class="ttc" id="a09635_html_abc4965eacae0b49945ebc887cb11adc1"><div class="ttname"><a href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">__gnu_parallel::_Settings::get</a></div><div class="ttdeci">static const _Settings & get()</div><div class="ttdoc">Get the global settings.</div></div>
<div class="ttc" id="a01575_html_a6a4a811c81e2fb4a7722ee69762c7380"><div class="ttname"><a href="a01575.html#a6a4a811c81e2fb4a7722ee69762c7380">__gnu_parallel::_PartialSumAlgorithm</a></div><div class="ttdeci">_PartialSumAlgorithm</div><div class="ttdoc">Partial sum algorithms: recursive, linear.</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00091">types.h:91</a></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="a09635_html_a5726332beba72b016508f1c641978265"><div class="ttname"><a href="a09635.html#a5726332beba72b016508f1c641978265">__gnu_parallel::_Settings::random_shuffle_minimal_n</a></div><div class="ttdeci">unsigned int random_shuffle_minimal_n</div><div class="ttdoc">Minimal input size for random_shuffle.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00213">settings.h:213</a></div></div>
<div class="ttc" id="a01575_html_a1cbb61a4863a306daa23823d89f9bef1"><div class="ttname"><a href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">__gnu_parallel::_SequenceIndex</a></div><div class="ttdeci">uint64_t _SequenceIndex</div><div class="ttdoc">Unsigned integer to index __elements. The total number of elements for each algorithm must fit into t...</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00117">types.h:117</a></div></div>
<div class="ttc" id="a09635_html_a334f583634130237ff56881c3e3e9570"><div class="ttname"><a href="a09635.html#a334f583634130237ff56881c3e3e9570">__gnu_parallel::_Settings::for_each_minimal_n</a></div><div class="ttdeci">_SequenceIndex for_each_minimal_n</div><div class="ttdoc">Minimal input size for for_each.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00163">settings.h:163</a></div></div>
<div class="ttc" id="a09635_html_ae12932b6ecb49293c8c68a0d5dbf8919"><div class="ttname"><a href="a09635.html#ae12932b6ecb49293c8c68a0d5dbf8919">__gnu_parallel::_Settings::fill_minimal_n</a></div><div class="ttdeci">_SequenceIndex fill_minimal_n</div><div class="ttdoc">Minimal input size for fill.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00148">settings.h:148</a></div></div>
<div class="ttc" id="a09635_html_ad8cdfe2324ea2ea32021f2625b2299f1"><div class="ttname"><a href="a09635.html#ad8cdfe2324ea2ea32021f2625b2299f1">__gnu_parallel::_Settings::count_minimal_n</a></div><div class="ttdeci">_SequenceIndex count_minimal_n</div><div class="ttdoc">Minimal input size for count and count_if.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00145">settings.h:145</a></div></div>
<div class="ttc" id="a09635_html_aebdcc2cdd7ed5932001f979f6cd1167c"><div class="ttname"><a href="a09635.html#aebdcc2cdd7ed5932001f979f6cd1167c">__gnu_parallel::_Settings::transform_minimal_n</a></div><div class="ttdeci">_SequenceIndex transform_minimal_n</div><div class="ttdoc">Minimal input size for parallel std::transform.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00244">settings.h:244</a></div></div>
<div class="ttc" id="a09635_html_aca7032b6e6e0e84d00e83ea57e6f89d4"><div class="ttname"><a href="a09635.html#aca7032b6e6e0e84d00e83ea57e6f89d4">__gnu_parallel::_Settings::accumulate_minimal_n</a></div><div class="ttdeci">_SequenceIndex accumulate_minimal_n</div><div class="ttdoc">Minimal input size for accumulate.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00139">settings.h:139</a></div></div>
<div class="ttc" id="a09635_html_ad032e9ab491119f763bfb79cbfcc24d8"><div class="ttname"><a href="a09635.html#ad032e9ab491119f763bfb79cbfcc24d8">__gnu_parallel::_Settings::max_element_minimal_n</a></div><div class="ttdeci">_SequenceIndex max_element_minimal_n</div><div class="ttdoc">Minimal input size for max_element.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00169">settings.h:169</a></div></div>
<div class="ttc" id="a01575_html_a1a75203febda4d2e4fab646bf6a94252"><div class="ttname"><a href="a01575.html#a1a75203febda4d2e4fab646bf6a94252">__gnu_parallel::_FindAlgorithm</a></div><div class="ttdeci">_FindAlgorithm</div><div class="ttdoc">Find algorithms:</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00106">types.h:106</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="a00962.html">settings.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
>
855
