<!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++: search.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('a00953_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">search.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00953.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/search.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Parallel implementation base for std::search() and</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * std::search_n().</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 Felix Putze.</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_SEARCH_H</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_SEARCH_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="a00530.html">bits/stl_algobase.h</a>></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include <<a class="code" href="a00932.html">parallel/parallel.h</a>></span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include <<a class="code" href="a00881.html">parallel/equally_split.h</a>></span></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="keyword">namespace </span><a class="code" href="a01572.html">__gnu_parallel</a></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"> /**</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * @brief Precalculate __advances for Knuth-Morris-Pratt algorithm.</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * @param __elements Begin iterator of sequence to search for.</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * @param __length Length of sequence to search for.</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * @param __off Returned __offsets. </span></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="keyword">template</span><<span class="keyword">typename</span> _RAIter, <span class="keyword">typename</span> _DifferenceTp></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00051"></a><span class="lineno"><a class="line" href="a01572.html#ab9807ee5cc58530be7b997207e2bf1f3"> 51</a></span>  <a class="code" href="a01572.html#ab9807ee5cc58530be7b997207e2bf1f3">__calc_borders</a>(_RAIter __elements, _DifferenceTp __length, </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  _DifferenceTp* __off)</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  {</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">typedef</span> _DifferenceTp _DifferenceType;</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  __off[0] = -1;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">if</span> (__length > 1)</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  __off[1] = 0;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  _DifferenceType __k = 0;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">for</span> (_DifferenceType __j = 2; __j <= __length; __j++)</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>  <span class="keywordflow">while</span> ((__k >= 0) && !(__elements[__k] == __elements[__j-1]))</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  __k = __off[__k];</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  __off[__j] = ++__k;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  }</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  }</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> </div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">// Generic parallel find algorithm (requires random access iterator).</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"></span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> /** @brief Parallel std::search.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * @param __end1 End iterator of first sequence.</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * @param __end2 End iterator of second sequence.</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * @param __pred Find predicate.</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * @return Place of finding in first sequences. */</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">template</span><<span class="keyword">typename</span> __RAIter1,</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">typename</span> __RAIter2,</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">typename</span> _Pred></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  __RAIter1</div><div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="a01572.html#af1e654f03e48e80a0c73db7ad88e8a86"> 81</a></span>  <a class="code" href="a01572.html#af1e654f03e48e80a0c73db7ad88e8a86">__search_template</a>(__RAIter1 __begin1, __RAIter1 __end1,</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  __RAIter2 __begin2, __RAIter2 __end2,</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  _Pred __pred)</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">typedef</span> std::iterator_traits<__RAIter1> _TraitsType;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <a class="code" href="a00878.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>((__end1 - __begin1) + (__end2 - __begin2));</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  _DifferenceType __pattern_length = __end2 - __begin2;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// Pattern too short.</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span>(__pattern_length <= 0)</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">return</span> __end1;</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">// Last point to start search.</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  _DifferenceType __input_length = (__end1 - __begin1) - __pattern_length;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// Where is first occurrence of pattern? defaults to end.</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  _DifferenceType __result = (__end1 - __begin1);</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  _DifferenceType *__splitters;</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">// Pattern too long.</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">if</span> (__input_length < 0)</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">return</span> __end1;</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>  omp_lock_t __result_lock;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  omp_init_lock(&__result_lock);</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>  <a class="code" href="a01572.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads = std::max<_DifferenceType></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  (1, std::min<_DifferenceType>(__input_length,</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  __get_max_threads()));</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>  _DifferenceType __advances[__pattern_length];</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <a class="code" href="a01572.html#ab9807ee5cc58530be7b997207e2bf1f3">__calc_borders</a>(__begin2, __pattern_length, __advances);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="preprocessor"># pragma omp parallel num_threads(__num_threads)</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="preprocessor"># pragma omp single</span></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  {</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  __num_threads = omp_get_num_threads();</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  __splitters = <span class="keyword">new</span> _DifferenceType[__num_threads + 1];</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <a class="code" href="a01572.html#ac799255921e70b0378d145924d673f9c">__equally_split</a>(__input_length, __num_threads, __splitters);</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> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <a class="code" href="a01572.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __iam = omp_get_thread_num();</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  _DifferenceType __start = __splitters[__iam],</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  __stop = __splitters[__iam + 1];</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  _DifferenceType __pos_in_pattern = 0;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordtype">bool</span> __found_pattern = <span class="keyword">false</span>;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">while</span> (__start <= __stop && !__found_pattern)</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">// Get new value of result.</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="preprocessor">#pragma omp flush(__result)</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// No chance for this thread to find first occurrence.</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">if</span> (__result < __start)</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">while</span> (__pred(__begin1[__start + __pos_in_pattern],</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  __begin2[__pos_in_pattern]))</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  {</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  ++__pos_in_pattern;</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">if</span> (__pos_in_pattern == __pattern_length)</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  {</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// Found new candidate for result.</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  omp_set_lock(&__result_lock);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  __result = <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__result, __start);</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  omp_unset_lock(&__result_lock);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  __found_pattern = <span class="keyword">true</span>;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">break</span>;</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>  }</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// Make safe jump.</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  __start += (__pos_in_pattern - __advances[__pos_in_pattern]);</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  __pos_in_pattern = (__advances[__pos_in_pattern] < 0</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  ? 0 : __advances[__pos_in_pattern]);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  } <span class="comment">//parallel</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>  omp_destroy_lock(&__result_lock);</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keyword">delete</span>[] __splitters;</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>  <span class="comment">// Return iterator on found element.</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">return</span> (__begin1 + __result);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> } <span class="comment">// end namespace</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="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_SEARCH_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a00530_html"><div class="ttname"><a href="a00530.html">stl_algobase.h</a></div></div>
<div class="ttc" id="a01572_html_ac799255921e70b0378d145924d673f9c"><div class="ttname"><a href="a01572.html#ac799255921e70b0378d145924d673f9c">__gnu_parallel::__equally_split</a></div><div class="ttdeci">_OutputIterator __equally_split(_DifferenceType __n, _ThreadIndex __num_threads, _OutputIterator __s)</div><div class="ttdoc">function to split a sequence into parts of almost equal size.</div><div class="ttdef"><b>Definition:</b> <a href="a00881_source.html#l00048">equally_split.h:48</a></div></div>
<div class="ttc" id="a01572_html_ab9807ee5cc58530be7b997207e2bf1f3"><div class="ttname"><a href="a01572.html#ab9807ee5cc58530be7b997207e2bf1f3">__gnu_parallel::__calc_borders</a></div><div class="ttdeci">void __calc_borders(_RAIter __elements, _DifferenceTp __length, _DifferenceTp *__off)</div><div class="ttdoc">Precalculate __advances for Knuth-Morris-Pratt algorithm.</div><div class="ttdef"><b>Definition:</b> <a href="a00953_source.html#l00051">search.h:51</a></div></div>
<div class="ttc" id="a01572_html_a05e502e51bfc3233671730f74a44dc6a"><div class="ttname"><a href="a01572.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="a00968_source.html#l00123">types.h:123</a></div></div>
<div class="ttc" id="a00878_html_a77fb93c9cecec331ccee755972695128"><div class="ttname"><a href="a00878.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a></div><div class="ttdeci">#define _GLIBCXX_CALL(__n)</div><div class="ttdoc">Macro to produce log message when entering a function.</div><div class="ttdef"><b>Definition:</b> <a href="a00878_source.html#l00044">compiletime_settings.h:44</a></div></div>
<div class="ttc" id="a00881_html"><div class="ttname"><a href="a00881.html">equally_split.h</a></div></div>
<div class="ttc" id="a01572_html_af1e654f03e48e80a0c73db7ad88e8a86"><div class="ttname"><a href="a01572.html#af1e654f03e48e80a0c73db7ad88e8a86">__gnu_parallel::__search_template</a></div><div class="ttdeci">__RAIter1 __search_template(__RAIter1 __begin1, __RAIter1 __end1, __RAIter2 __begin2, __RAIter2 __end2, _Pred __pred)</div><div class="ttdoc">Parallel std::search.</div><div class="ttdef"><b>Definition:</b> <a href="a00953_source.html#l00081">search.h:81</a></div></div>
<div class="ttc" id="a00932_html"><div class="ttname"><a href="a00932.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="a01482_html_gad48656de2f272a953455e1fff2532125"><div class="ttname"><a href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR const _Tp & min(const _Tp &, const _Tp &)</div><div class="ttdoc">This does what you think it does.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00195">stl_algobase.h:195</a></div></div>
<div class="ttc" id="a01572_html"><div class="ttname"><a href="a01572.html">__gnu_parallel</a></div><div class="ttdoc">GNU parallel code for public use.</div><div class="ttdef"><b>Definition:</b> <a href="a00869_source.html#l00061">balanced_quicksort.h:61</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_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_2f1ac407c3bb97b79c0150323d069a39.html">parallel</a></li><li class="navelem"><a class="el" href="a00953.html">search.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
>
0448c66ab6afa2f787658c5e6488e2d9
>
files
>
847
