<!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++: unique_copy.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">unique_copy.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/unique_copy.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Parallel implementations of std::unique_copy().</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 Robert Geisberger and Robin Dapp.</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_UNIQUE_COPY_H</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_UNIQUE_COPY_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="a00932.html">parallel/parallel.h</a>></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <<a class="code" href="a00911.html">parallel/multiseq_selection.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="keyword">namespace </span><a class="code" href="a01572.html">__gnu_parallel</a></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"> /** @brief Parallel std::unique_copy(), w/__o explicit equality predicate.</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * @param __first Begin iterator of input sequence.</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * @param __last End iterator of input sequence.</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * @param __result Begin iterator of result __sequence.</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * @param __binary_pred Equality predicate.</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * @return End iterator of result __sequence. */</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter,</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keyword">class </span>_OutputIterator,</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keyword">class </span>_BinaryPredicate></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  _OutputIterator</div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="a01572.html#a15f31ee1c15e180d0d838571cd6c8b24"> 50</a></span>  <a class="code" href="a01572.html#a15f31ee1c15e180d0d838571cd6c8b24">__parallel_unique_copy</a>(_IIter __first, _IIter __last,</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  _OutputIterator __result,</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  _BinaryPredicate __binary_pred)</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>  <a class="code" href="a00878.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__last - __first)</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>  <span class="keyword">typedef</span> std::iterator_traits<_IIter> _TraitsType;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  _DifferenceType __size = __last - __first;</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">if</span> (__size == 0)</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// Let the first thread process two parts.</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  _DifferenceType *__counter;</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  _DifferenceType *__borders;</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>  <a class="code" href="a01572.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads = __get_max_threads();</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">// First part contains at least one element.</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor"># pragma omp parallel num_threads(__num_threads)</span></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="preprocessor"># pragma omp single</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  {</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  __num_threads = omp_get_num_threads();</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  __borders = <span class="keyword">new</span> _DifferenceType[__num_threads + 2];</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <a class="code" href="a01572.html#ac799255921e70b0378d145924d673f9c">__equally_split</a>(__size, __num_threads + 1, __borders);</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  __counter = <span class="keyword">new</span> _DifferenceType[__num_threads + 1];</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</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>  <a class="code" href="a01572.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __iam = omp_get_thread_num();</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>  _DifferenceType __begin, __end;</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="comment">// Check for length without duplicates</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// Needed for position in output</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  _DifferenceType __i = 0;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  _OutputIterator __out = __result;</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>  <span class="keywordflow">if</span> (__iam == 0)</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>  __begin = __borders[0] + 1; <span class="comment">// == 1</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  __end = __borders[__iam + 1];</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  ++__i;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  *__out++ = *__first;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">for</span> (_IIter __iter = __first + __begin; __iter < __first + __end;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  ++__iter)</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  {</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">if</span> (!__binary_pred(*__iter, *(__iter - 1)))</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>  ++__i;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  *__out++ = *__iter;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</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>  }</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">else</span></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>  __begin = __borders[__iam]; <span class="comment">//one part</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  __end = __borders[__iam + 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>  <span class="keywordflow">for</span> (_IIter __iter = __first + __begin; __iter < __first + __end;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  ++__iter)</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>  <span class="keywordflow">if</span> (!__binary_pred(*__iter, *(__iter - 1)))</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  ++__i;</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>  }</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  __counter[__iam] = __i;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// Last part still untouched.</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  _DifferenceType __begin_output;</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="preprocessor"># pragma omp barrier</span></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="comment">// Store result in output on calculated positions.</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  __begin_output = 0;</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>  <span class="keywordflow">if</span> (__iam == 0)</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>  <span class="keywordflow">for</span> (<a class="code" href="a01572.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __t = 0; __t < __num_threads; ++__t)</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  __begin_output += __counter[__t];</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>  __i = 0;</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>  _OutputIterator __iter_out = __result + __begin_output;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  __begin = __borders[__num_threads];</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  __end = __size;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> </div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">for</span> (_IIter __iter = __first + __begin; __iter < __first + __end;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  ++__iter)</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>  <span class="keywordflow">if</span> (__iter == __first</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  || !__binary_pred(*__iter, *(__iter - 1)))</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  {</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  ++__i;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  *__iter_out++ = *__iter;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</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> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  __counter[__num_threads] = __i;</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="keywordflow">else</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  {</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">for</span> (<a class="code" href="a01572.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __t = 0; __t < __iam; __t++)</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  __begin_output += __counter[__t];</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  _OutputIterator __iter_out = __result + __begin_output;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">for</span> (_IIter __iter = __first + __begin; __iter < __first + __end;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  ++__iter)</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  {</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">if</span> (!__binary_pred(*__iter, *(__iter - 1)))</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  *__iter_out++ = *__iter;</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>  }</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</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>  _DifferenceType __end_output = 0;</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">for</span> (<a class="code" href="a01572.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __t = 0; __t < __num_threads + 1; __t++)</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  __end_output += __counter[__t];</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> </div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">delete</span>[] __borders;</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> </div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">return</span> __result + __end_output;</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> <span class="comment"></span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"> /** @brief Parallel std::unique_copy(), without explicit equality predicate</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> * @param __first Begin iterator of input sequence.</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> * @param __last End iterator of input sequence.</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> * @param __result Begin iterator of result __sequence.</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> * @return End iterator of result __sequence. */</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter, <span class="keyword">class</span> _OutputIterator></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">inline</span> _OutputIterator</div><div class="line"><a name="l00186"></a><span class="lineno"><a class="line" href="a01572.html#a3b3bd19508b4e34708a1dc647f5bc131"> 186</a></span>  <a class="code" href="a01572.html#a15f31ee1c15e180d0d838571cd6c8b24">__parallel_unique_copy</a>(_IIter __first, _IIter __last,</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  _OutputIterator __result)</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  {</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_IIter>::value_type</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  _ValueType;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">return</span> <a class="code" href="a01572.html#a15f31ee1c15e180d0d838571cd6c8b24">__parallel_unique_copy</a>(__first, __last, __result,</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="code" href="a07364.html">std::equal_to<_ValueType></a>());</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> </div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> }<span class="comment">//namespace __gnu_parallel</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_UNIQUE_COPY_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a01572_html_a15f31ee1c15e180d0d838571cd6c8b24"><div class="ttname"><a href="a01572.html#a15f31ee1c15e180d0d838571cd6c8b24">__gnu_parallel::__parallel_unique_copy</a></div><div class="ttdeci">_OutputIterator __parallel_unique_copy(_IIter __first, _IIter __last, _OutputIterator __result, _BinaryPredicate __binary_pred)</div><div class="ttdoc">Parallel std::unique_copy(), w/__o explicit equality predicate.</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00050">unique_copy.h:50</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_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="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="a00911_html"><div class="ttname"><a href="a00911.html">multiseq_selection.h</a></div><div class="ttdoc">Functions to find elements of a certain global __rank in multiple sorted sequences....</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 class="ttc" id="a07364_html"><div class="ttname"><a href="a07364.html">std::equal_to</a></div><div class="ttdoc">One of the comparison functors.</div><div class="ttdef"><b>Definition:</b> <a href="a00542_source.html#l00331">stl_function.h:331</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="a00971.html">unique_copy.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
>
864
