<!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++: list_partition.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('a00905_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">list_partition.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00905.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/list_partition.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief _Functionality to split __sequence referenced by only input</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * iterators.</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> </div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// Written by Leonor Frias Moya and Johannes Singler.</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_LIST_PARTITION_H</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_LIST_PARTITION_H 1</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <<a class="code" href="a00935.html">parallel/parallel.h</a>></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <<a class="code" href="a00182.html">vector</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> {<span class="comment"></span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> /** @brief Shrinks and doubles the ranges.</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * @param __os_starts Start positions worked on (oversampled).</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * @param __count_to_two Counts up to 2.</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * @param __range_length Current length of a chunk.</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * @param __make_twice Whether the @c __os_starts is allowed to be</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * grown or not</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> */</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="a01575.html#ade684b015a28793b63a9e8f14c096066"> 50</a></span>  <a class="code" href="a01575.html#ade684b015a28793b63a9e8f14c096066">__shrink_and_double</a>(<a class="code" href="a07923.html">std::vector<_IIter></a>& __os_starts,</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordtype">size_t</span>& __count_to_two, <span class="keywordtype">size_t</span>& __range_length,</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> __make_twice)</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  {</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  ++__count_to_two;</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">if</span> (!__make_twice || __count_to_two < 2)</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <a class="code" href="a01575.html#adf42868b36ffd42054d85449f63b12aa">__shrink</a>(__os_starts, __count_to_two, __range_length);</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  __os_starts.<a class="code" href="a07923.html#a1134bcc83ff6c70cf78bab3cd426feaf">resize</a>((__os_starts.<a class="code" href="a07923.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a>() - 1) * 2 + 1);</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  __count_to_two = 0;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"></span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> /** @brief Combines two ranges into one and thus halves the number of ranges.</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> * @param __os_starts Start positions worked on (oversampled).</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> * @param __count_to_two Counts up to 2.</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> * @param __range_length Current length of a chunk. */</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="a01575.html#adf42868b36ffd42054d85449f63b12aa"> 70</a></span>  <a class="code" href="a01575.html#adf42868b36ffd42054d85449f63b12aa">__shrink</a>(<a class="code" href="a07923.html">std::vector<_IIter></a>& __os_starts, <span class="keywordtype">size_t</span>& __count_to_two,</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordtype">size_t</span>& __range_length)</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="keywordflow">for</span> (<span class="keyword">typename</span> std::vector<_IIter>::size_type __i = 0;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  __i <= (__os_starts.<a class="code" href="a07923.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a>() / 2); ++__i)</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  __os_starts[__i] = __os_starts[__i * 2];</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  __range_length *= 2;</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> <span class="comment"></span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> /** @brief Splits a sequence given by input iterators into parts of</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> * almost equal size</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> *</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> * The function needs only one pass over the sequence.</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * @param __begin Begin iterator of input sequence.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> * @param __end End iterator of input sequence.</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> * @param __starts Start iterators for the resulting parts, dimension</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> * @c __num_parts+1. For convenience, @c __starts @c [__num_parts]</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> * contains the end iterator of the sequence.</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> * @param __lengths Length of the resulting parts.</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> * @param __num_parts Number of parts to split the sequence into.</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> * @param __f Functor to be applied to each element by traversing __it</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * @param __oversampling Oversampling factor. If 0, then the</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> * partitions will differ in at most </span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> * \f$\sqrt{\mathrm{end} - \mathrm{begin}}\f$ </span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"> * elements. Otherwise, the ratio between the</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> * longest and the shortest part is bounded by</span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> * \f$1/(\mathrm{oversampling} \cdot \mathrm{num\_parts})\f$</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> * @return Length of the whole sequence.</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> */</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">typename</span> _FunctorType></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordtype">size_t</span></div><div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="a01575.html#ad3be0fcbf87a1f43b3ecd406841e7b0d"> 101</a></span>  <a class="code" href="a01575.html#ad3be0fcbf87a1f43b3ecd406841e7b0d">list_partition</a>(<span class="keyword">const</span> _IIter __begin, <span class="keyword">const</span> _IIter __end,</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  _IIter* __starts, <span class="keywordtype">size_t</span>* __lengths, <span class="keyword">const</span> <span class="keywordtype">int</span> __num_parts,</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  _FunctorType& __f, <span class="keywordtype">int</span> __oversampling = 0)</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  {</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordtype">bool</span> __make_twice = <span class="keyword">false</span>;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// The resizing algorithm is chosen according to the oversampling factor.</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">if</span> (__oversampling == 0)</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  __make_twice = <span class="keyword">true</span>;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  __oversampling = 1;</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <a class="code" href="a07923.html">std::vector<_IIter></a> __os_starts(2 * __oversampling * __num_parts + 1);</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  __os_starts[0] = __begin;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  _IIter __prev = __begin, __it = __begin;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordtype">size_t</span> __dist_limit = 0, __dist = 0;</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordtype">size_t</span> __cur = 1, __next = 1;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordtype">size_t</span> __range_length = 1;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordtype">size_t</span> __count_to_two = 0;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">while</span> (__it != __end)</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  {</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  __cur = __next;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">for</span> (; __cur < __os_starts.<a class="code" href="a07923.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a>() and __it != __end; ++__cur)</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>  <span class="keywordflow">for</span> (__dist_limit += __range_length;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  __dist < __dist_limit and __it != __end; ++__dist)</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  {</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  __f(__it);</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  ++__it;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  }</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  __os_starts[__cur] = __it;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  }</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">// Must compare for end and not __cur < __os_starts.size() , because</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// __cur could be == __os_starts.size() as well</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">if</span> (__it == __end)</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <a class="code" href="a01575.html#ade684b015a28793b63a9e8f14c096066">__shrink_and_double</a>(__os_starts, __count_to_two, __range_length,</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  __make_twice);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  __next = __os_starts.<a class="code" href="a07923.html#aedc1ee21f6ca2b8304b4f1f430125c8d">size</a>() / 2 + 1;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> </div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// Calculation of the parts (one must be extracted from __current</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// because the partition beginning at end, consists only of</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">// itself).</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordtype">size_t</span> __size_part = (__cur - 1) / __num_parts;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordtype">int</span> __size_greater = static_cast<int>((__cur - 1) % __num_parts);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  __starts[0] = __os_starts[0];</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordtype">size_t</span> __index = 0;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> </div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// Smallest partitions.</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> __i = 1; __i < (__num_parts + 1 - __size_greater); ++__i)</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  {</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  __lengths[__i - 1] = __size_part * __range_length;</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  __index += __size_part;</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  __starts[__i] = __os_starts[__index];</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  }</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> </div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// Biggest partitions.</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> __i = __num_parts + 1 - __size_greater; __i <= __num_parts;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  ++__i)</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  {</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  __lengths[__i - 1] = (__size_part+1) * __range_length;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  __index += (__size_part+1);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  __starts[__i] = __os_starts[__index];</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// Correction of the end size (the end iteration has not finished).</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  __lengths[__num_parts - 1] -= (__dist_limit - __dist);</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">return</span> __dist;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  }</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> }</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_LIST_PARTITION_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a07923_html"><div class="ttname"><a href="a07923.html">std::vector</a></div><div class="ttdoc">A standard container which offers fixed time access to individual elements in any order.</div><div class="ttdef"><b>Definition:</b> <a href="a00599_source.html#l00339">stl_vector.h:339</a></div></div>
<div class="ttc" id="a00935_html"><div class="ttname"><a href="a00935.html">parallel.h</a></div><div class="ttdoc">End-user include file. Provides advanced settings and tuning options. This file is a GNU parallel ext...</div></div>
<div class="ttc" id="a01575_html_ad3be0fcbf87a1f43b3ecd406841e7b0d"><div class="ttname"><a href="a01575.html#ad3be0fcbf87a1f43b3ecd406841e7b0d">__gnu_parallel::list_partition</a></div><div class="ttdeci">size_t list_partition(const _IIter __begin, const _IIter __end, _IIter *__starts, size_t *__lengths, const int __num_parts, _FunctorType &__f, int __oversampling=0)</div><div class="ttdoc">Splits a sequence given by input iterators into parts of almost equal size.</div><div class="ttdef"><b>Definition:</b> <a href="a00905_source.html#l00101">list_partition.h:101</a></div></div>
<div class="ttc" id="a00182_html"><div class="ttname"><a href="a00182.html">vector</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_adf42868b36ffd42054d85449f63b12aa"><div class="ttname"><a href="a01575.html#adf42868b36ffd42054d85449f63b12aa">__gnu_parallel::__shrink</a></div><div class="ttdeci">void __shrink(std::vector< _IIter > &__os_starts, size_t &__count_to_two, size_t &__range_length)</div><div class="ttdoc">Combines two ranges into one and thus halves the number of ranges.</div><div class="ttdef"><b>Definition:</b> <a href="a00905_source.html#l00070">list_partition.h:70</a></div></div>
<div class="ttc" id="a07923_html_a1134bcc83ff6c70cf78bab3cd426feaf"><div class="ttname"><a href="a07923.html#a1134bcc83ff6c70cf78bab3cd426feaf">std::vector::resize</a></div><div class="ttdeci">void resize(size_type __new_size)</div><div class="ttdoc">Resizes the vector to the specified number of elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00599_source.html#l00824">stl_vector.h:824</a></div></div>
<div class="ttc" id="a01575_html_ade684b015a28793b63a9e8f14c096066"><div class="ttname"><a href="a01575.html#ade684b015a28793b63a9e8f14c096066">__gnu_parallel::__shrink_and_double</a></div><div class="ttdeci">void __shrink_and_double(std::vector< _IIter > &__os_starts, size_t &__count_to_two, size_t &__range_length, const bool __make_twice)</div><div class="ttdoc">Shrinks and doubles the ranges.</div><div class="ttdef"><b>Definition:</b> <a href="a00905_source.html#l00050">list_partition.h:50</a></div></div>
<div class="ttc" id="a07923_html_aedc1ee21f6ca2b8304b4f1f430125c8d"><div class="ttname"><a href="a07923.html#aedc1ee21f6ca2b8304b4f1f430125c8d">std::vector::size</a></div><div class="ttdeci">size_type size() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00599_source.html#l00805">stl_vector.h:805</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="a00905.html">list_partition.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
>
801
