<!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++: types.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('a00971_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">types.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00971.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/types.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Basic types and typedefs.</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * This file is a GNU parallel extension to the Standard C++ Library.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> */</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// Written by Johannes Singler and Felix Putze.</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_TYPES_H</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_TYPES_H 1</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include <<a class="code" href="a00242.html">cstdlib</a>></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <<a class="code" href="a00095.html">limits</a>></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <<a class="code" href="a16608.html">tr1/cstdint</a>></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="keyword">namespace </span><a class="code" href="a01575.html">__gnu_parallel</a></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> {</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="comment">// Enumerated types.</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"></span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> /// Run-time equivalents for the compile-time tags.</span></div><div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8"> 44</a></span> <span class="comment"></span> <span class="keyword">enum</span> <a class="code" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8">_Parallelism</a></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  {<span class="comment"></span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> /// Not parallel.</span></div><div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8a7e6aa054fd848be925726fcf7b4eb3ce"> 47</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8a7e6aa054fd848be925726fcf7b4eb3ce">sequential</a>,</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"></span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> /// Parallel unbalanced (equal-sized chunks).</span></div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8ac530f35e669c50e9676af20454e1676f"> 50</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8ac530f35e669c50e9676af20454e1676f">parallel_unbalanced</a>,</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"> /// Parallel balanced (work-stealing).</span></div><div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8a44044e5486122945728060ea6de7d32c"> 53</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8a44044e5486122945728060ea6de7d32c">parallel_balanced</a>,</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"></span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> /// Parallel with OpenMP dynamic load-balancing.</span></div><div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8ad1e39d5a03b2603328b50ada20730bd0"> 56</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8ad1e39d5a03b2603328b50ada20730bd0">parallel_omp_loop</a>,</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"></span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> /// Parallel with OpenMP static load-balancing.</span></div><div class="line"><a name="l00059"></a><span class="lineno"><a class="line" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8aa5624cdd99806daed0060c56908fd043"> 59</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8aa5624cdd99806daed0060c56908fd043">parallel_omp_loop_static</a>,</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"></span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> /// Parallel with OpenMP taskqueue construct.</span></div><div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8aec9d9a6b7777354079bb906baaec2ff4"> 62</a></span> <span class="comment"></span> <a class="code" href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8aec9d9a6b7777354079bb906baaec2ff4">parallel_taskqueue</a></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</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"> /// Strategies for run-time algorithm selection: </span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"></span> <span class="comment">// force_sequential, force_parallel, heuristic.</span></div><div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="a01575.html#abfff682f83a1eacf1b43ad2b33a1954f"> 67</a></span>  <span class="keyword">enum</span> <a class="code" href="a01575.html#abfff682f83a1eacf1b43ad2b33a1954f">_AlgorithmStrategy</a></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  heuristic,</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  force_sequential,</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  force_parallel</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  };</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"></span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> /// Sorting algorithms: </span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"></span> <span class="comment">// multi-way mergesort, quicksort, load-balanced quicksort.</span></div><div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="a01575.html#a35bfabad218af713f172257aecd8414e"> 76</a></span>  <span class="keyword">enum</span> <a class="code" href="a01575.html#a35bfabad218af713f172257aecd8414e">_SortAlgorithm</a> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  { </div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  MWMS, </div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  QS, </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  QS_BALANCED </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  };</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"></span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> /// Merging algorithms: </span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"></span> <span class="comment">// bubblesort-alike, loser-tree variants, enum __sentinel.</span></div><div class="line"><a name="l00085"></a><span class="lineno"><a class="line" href="a01575.html#abf16f5ba3af149689c7ed95309b7e91d"> 85</a></span>  <span class="keyword">enum</span> <a class="code" href="a01575.html#abf16f5ba3af149689c7ed95309b7e91d">_MultiwayMergeAlgorithm</a></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  {</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  LOSER_TREE</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  };</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"></span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> /// Partial sum algorithms: recursive, linear.</span></div><div class="line"><a name="l00091"></a><span class="lineno"><a class="line" href="a01575.html#a6a4a811c81e2fb4a7722ee69762c7380"> 91</a></span> <span class="comment"></span> <span class="keyword">enum</span> <a class="code" href="a01575.html#a6a4a811c81e2fb4a7722ee69762c7380">_PartialSumAlgorithm</a> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  { </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  RECURSIVE, </div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  LINEAR </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  };</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"></span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> /// Sorting/merging algorithms: sampling, __exact.</span></div><div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="a01575.html#ace24b9f316fde5ea598815403cfd02bb"> 98</a></span> <span class="comment"></span> <span class="keyword">enum</span> <a class="code" href="a01575.html#ace24b9f316fde5ea598815403cfd02bb">_SplittingAlgorithm</a> </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  { </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  SAMPLING, </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  EXACT </div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  };</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"></span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> /// Find algorithms:</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"></span> <span class="comment">// growing blocks, equal-sized blocks, equal splitting.</span></div><div class="line"><a name="l00106"></a><span class="lineno"><a class="line" href="a01575.html#a1a75203febda4d2e4fab646bf6a94252"> 106</a></span>  <span class="keyword">enum</span> <a class="code" href="a01575.html#a1a75203febda4d2e4fab646bf6a94252">_FindAlgorithm</a> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  { </div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  GROWING_BLOCKS, </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  CONSTANT_SIZE_BLOCKS, </div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  EQUAL_SPLIT </div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  };</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"></span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> /**</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> * @brief Unsigned integer to index __elements.</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> * The total number of elements for each algorithm must fit into this type.</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"><a class="line" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1"> 117</a></span>  <span class="keyword">typedef</span> uint64_t <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a>;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"></span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"> /**</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"> * @brief Unsigned integer to index a thread number.</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"> * The maximum thread number (for each processor) must fit into this type.</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> */</span></div><div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a"> 123</a></span>  <span class="keyword">typedef</span> uint16_t <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</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>  <span class="comment">// XXX atomics interface?</span><span class="comment"></span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"> /// Longest compare-and-swappable integer type on this platform.</span></div><div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="a01575.html#aa1171c39f9e5afad6392c7aeefb81115"> 127</a></span> <span class="comment"></span> <span class="keyword">typedef</span> int64_t <a class="code" href="a01575.html#aa1171c39f9e5afad6392c7aeefb81115">_CASable</a>;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment"></span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment"> /// Number of bits of _CASable.</span></div><div class="line"><a name="l00130"></a><span class="lineno"><a class="line" href="a01575.html#add7da76e5782016cb1271e7537f0e94b"> 130</a></span> <span class="comment"></span> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="a01575.html#add7da76e5782016cb1271e7537f0e94b">_CASable_bits</a> = <a class="code" href="a02523.html">std::numeric_limits<_CASable>::digits</a>;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"></span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"> /// ::_CASable with the right half of bits set to 1.</span></div><div class="line"><a name="l00133"></a><span class="lineno"><a class="line" href="a01575.html#ad26f1c0a23abae27911dfbd0560a6048"> 133</a></span> <span class="comment"></span> <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="a01575.html#aa1171c39f9e5afad6392c7aeefb81115">_CASable</a> <a class="code" href="a01575.html#ad26f1c0a23abae27911dfbd0560a6048">_CASable_mask</a> =</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  ((<a class="code" href="a01575.html#aa1171c39f9e5afad6392c7aeefb81115">_CASable</a>(1) << (<a class="code" href="a01575.html#add7da76e5782016cb1271e7537f0e94b">_CASable_bits</a> / 2)) - 1);</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> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_TYPES_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a01575_html_a76f6cbf29b1b8d57762cce1ed9bd01a8a44044e5486122945728060ea6de7d32c"><div class="ttname"><a href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8a44044e5486122945728060ea6de7d32c">__gnu_parallel::parallel_balanced</a></div><div class="ttdoc">Parallel balanced (work-stealing).</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00053">types.h:53</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="a00242_html"><div class="ttname"><a href="a00242.html">cstdlib</a></div></div>
<div class="ttc" id="a16608_html"><div class="ttname"><a href="a16608.html">cstdint</a></div></div>
<div class="ttc" id="a01575_html_a76f6cbf29b1b8d57762cce1ed9bd01a8aec9d9a6b7777354079bb906baaec2ff4"><div class="ttname"><a href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8aec9d9a6b7777354079bb906baaec2ff4">__gnu_parallel::parallel_taskqueue</a></div><div class="ttdoc">Parallel with OpenMP taskqueue construct.</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00062">types.h:62</a></div></div>
<div class="ttc" id="a01575_html_aa1171c39f9e5afad6392c7aeefb81115"><div class="ttname"><a href="a01575.html#aa1171c39f9e5afad6392c7aeefb81115">__gnu_parallel::_CASable</a></div><div class="ttdeci">int64_t _CASable</div><div class="ttdoc">Longest compare-and-swappable integer type on this platform.</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00127">types.h:127</a></div></div>
<div class="ttc" id="a01575_html_a76f6cbf29b1b8d57762cce1ed9bd01a8ad1e39d5a03b2603328b50ada20730bd0"><div class="ttname"><a href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8ad1e39d5a03b2603328b50ada20730bd0">__gnu_parallel::parallel_omp_loop</a></div><div class="ttdoc">Parallel with OpenMP dynamic load-balancing.</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00056">types.h:56</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="a02523_html"><div class="ttname"><a href="a02523.html">std::numeric_limits</a></div><div class="ttdoc">Properties of fundamental types.</div><div class="ttdef"><b>Definition:</b> <a href="a00095_source.html#l00312">limits:312</a></div></div>
<div class="ttc" id="a01575_html_a76f6cbf29b1b8d57762cce1ed9bd01a8a7e6aa054fd848be925726fcf7b4eb3ce"><div class="ttname"><a href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8a7e6aa054fd848be925726fcf7b4eb3ce">__gnu_parallel::sequential</a></div><div class="ttdoc">Not parallel.</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00047">types.h:47</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_ad26f1c0a23abae27911dfbd0560a6048"><div class="ttname"><a href="a01575.html#ad26f1c0a23abae27911dfbd0560a6048">__gnu_parallel::_CASable_mask</a></div><div class="ttdeci">static const _CASable _CASable_mask</div><div class="ttdoc">_CASable with the right half of bits set to 1.</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00133">types.h:133</a></div></div>
<div class="ttc" id="a00095_html"><div class="ttname"><a href="a00095.html">limits</a></div></div>
<div class="ttc" id="a01575_html"><div class="ttname"><a href="a01575.html">__gnu_parallel</a></div><div class="ttdoc">GNU parallel code for public use.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00061">balanced_quicksort.h:61</a></div></div>
<div class="ttc" id="a01575_html_add7da76e5782016cb1271e7537f0e94b"><div class="ttname"><a href="a01575.html#add7da76e5782016cb1271e7537f0e94b">__gnu_parallel::_CASable_bits</a></div><div class="ttdeci">static const int _CASable_bits</div><div class="ttdoc">Number of bits of _CASable.</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00130">types.h:130</a></div></div>
<div class="ttc" id="a01575_html_a76f6cbf29b1b8d57762cce1ed9bd01a8aa5624cdd99806daed0060c56908fd043"><div class="ttname"><a href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8aa5624cdd99806daed0060c56908fd043">__gnu_parallel::parallel_omp_loop_static</a></div><div class="ttdoc">Parallel with OpenMP static load-balancing.</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00059">types.h:59</a></div></div>
<div class="ttc" id="a01575_html_a76f6cbf29b1b8d57762cce1ed9bd01a8ac530f35e669c50e9676af20454e1676f"><div class="ttname"><a href="a01575.html#a76f6cbf29b1b8d57762cce1ed9bd01a8ac530f35e669c50e9676af20454e1676f">__gnu_parallel::parallel_unbalanced</a></div><div class="ttdoc">Parallel unbalanced (equal-sized chunks).</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00050">types.h:50</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="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="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="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="a01575_html_a05e502e51bfc3233671730f74a44dc6a"><div class="ttname"><a href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">__gnu_parallel::_ThreadIndex</a></div><div class="ttdeci">uint16_t _ThreadIndex</div><div class="ttdoc">Unsigned integer to index a thread number. The maximum thread number (for each processor) must fit in...</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00123">types.h:123</a></div></div>
<div class="ttc" id="a01575_html_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="a00971.html">types.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
>
863
