<!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++: find_selectors.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('a00890_source.html','');}); /* @license-end */ </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">find_selectors.h</div> </div> </div><!--header--> <div class="contents"> <a href="a00890.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/find_selectors.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief _Function objects representing different tasks to be plugged</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * into the parallel find algorithm.</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_FIND_SELECTORS_H</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_FIND_SELECTORS_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="a00965.html">parallel/tags.h</a>></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <<a class="code" href="a00872.html">parallel/basic_iterator.h</a>></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include <<a class="code" href="a00572.html">bits/stl_pair.h</a>></span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> </div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">namespace </span><a class="code" href="a01572.html">__gnu_parallel</a></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> {<span class="comment"></span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> /** @brief Base class of all __gnu_parallel::__find_template selectors. */</span></div><div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="a09336.html"> 43</a></span>  <span class="keyword">struct </span><a class="code" href="a09336.html">__generic_find_selector</a></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  { };</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"> /** </span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * @brief Test predicate on a single element, used for std::find()</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * and std::find_if ().</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> */</span></div><div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="a09340.html"> 50</a></span>  <span class="keyword">struct </span><a class="code" href="a09340.html">__find_if_selector</a> : <span class="keyword">public</span> <a class="code" href="a09336.html">__generic_find_selector</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"> /** @brief Test on one position.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * @param __i1 _Iterator on first sequence.</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> * @param __i2 _Iterator on second sequence (unused).</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> * @param __pred Find predicate.</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> */</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">typename</span> _Pred></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordtype">bool</span> </div><div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="a09340.html#ab5c063395b4e4f3e1be257ac5327f8b2"> 60</a></span>  <a class="code" href="a09340.html#ab5c063395b4e4f3e1be257ac5327f8b2">operator()</a>(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  { <span class="keywordflow">return</span> __pred(*__i1); }</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"></span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> /** @brief Corresponding sequential algorithm on a sequence.</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> * @param __end1 End iterator of first sequence.</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> * @param __pred Find predicate.</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> */</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keyword">typename</span> _Pred></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <a class="code" href="a07764.html">std::pair<_RAIter1, _RAIter2></a> </div><div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="a09340.html#a63d5cc3dfce9c02f30dd7c4cc468d157"> 72</a></span>  <a class="code" href="a09340.html#a63d5cc3dfce9c02f30dd7c4cc468d157">_M_sequential_algorithm</a>(_RAIter1 __begin1,</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  _RAIter1 __end1,</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  _RAIter2 __begin2, _Pred __pred)</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  { <span class="keywordflow">return</span> <a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(find_if(__begin1, __end1, __pred,</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="a09636.html">sequential_tag</a>()), __begin2); }</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 Test predicate on two adjacent elements. */</span></div><div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="a09344.html"> 80</a></span>  <span class="keyword">struct </span><a class="code" href="a09344.html">__adjacent_find_selector</a> : <span class="keyword">public</span> <a class="code" href="a09336.html">__generic_find_selector</a></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"> /** @brief Test on one position.</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * @param __i1 _Iterator on first sequence.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> * @param __i2 _Iterator on second sequence (unused).</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> * @param __pred Find predicate.</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> */</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">typename</span> _Pred></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordtype">bool</span> </div><div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="a09344.html#afba73305cf46d20618b0deb3cbd4a1ba"> 90</a></span>  <a class="code" href="a09344.html#afba73305cf46d20618b0deb3cbd4a1ba">operator()</a>(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)</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">// Passed end iterator is one short.</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">return</span> __pred(*__i1, *(__i1 + 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> <span class="comment"></span></div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> /** @brief Corresponding sequential algorithm on a sequence.</span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> * @param __end1 End iterator of first sequence.</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> * @param __pred Find predicate.</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"> */</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">typename</span> _Pred></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="code" href="a07764.html">std::pair<_RAIter1, _RAIter2></a></div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="a09344.html#a89987a97e4d94cb47f92c113de4a1a48"> 105</a></span>  <a class="code" href="a09344.html#a89987a97e4d94cb47f92c113de4a1a48">_M_sequential_algorithm</a>(_RAIter1 __begin1,</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  _RAIter1 __end1,</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  _RAIter2 __begin2, _Pred __pred)</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  {</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// Passed end iterator is one short.</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  _RAIter1 __spot = adjacent_find(__begin1, __end1 + 1,</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  __pred, <a class="code" href="a09636.html">sequential_tag</a>());</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">if</span> (__spot == (__end1 + 1))</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  __spot = __end1;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> <a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__spot, __begin2);</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>  };</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"></span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"> /** @brief Test inverted predicate on a single element. */</span></div><div class="line"><a name="l00119"></a><span class="lineno"><a class="line" href="a09348.html"> 119</a></span>  <span class="keyword">struct </span><a class="code" href="a09348.html">__mismatch_selector</a> : <span class="keyword">public</span> <a class="code" href="a09336.html">__generic_find_selector</a></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  {<span class="comment"></span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"> /** </span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> * @brief Test on one position.</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment"> * @param __i1 _Iterator on first sequence.</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"> * @param __i2 _Iterator on second sequence (unused).</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"> * @param __pred Find predicate. </span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment"> */</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">typename</span> _Pred></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordtype">bool</span> </div><div class="line"><a name="l00130"></a><span class="lineno"><a class="line" href="a09348.html#acce7eaf03f5dcb028e255f8b40ad9dfd"> 130</a></span>  <a class="code" href="a09348.html#acce7eaf03f5dcb028e255f8b40ad9dfd">operator()</a>(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  { <span class="keywordflow">return</span> !__pred(*__i1, *__i2); }</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"></span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment"> /** </span></div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> * @brief Corresponding sequential algorithm on a sequence.</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span></div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"> * @param __end1 End iterator of first sequence.</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> * @param __pred Find predicate. </span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"> */</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">typename</span> _Pred></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="a07764.html">std::pair<_RAIter1, _RAIter2></a></div><div class="line"><a name="l00143"></a><span class="lineno"><a class="line" href="a09348.html#a9c307c47e6a7d2b3211c92c767d2a448"> 143</a></span>  <a class="code" href="a09348.html#a9c307c47e6a7d2b3211c92c767d2a448">_M_sequential_algorithm</a>(_RAIter1 __begin1,</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  _RAIter1 __end1,</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  _RAIter2 __begin2, _Pred __pred)</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  { <span class="keywordflow">return</span> mismatch(__begin1, __end1, __begin2,</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  __pred, <a class="code" href="a09636.html">sequential_tag</a>()); }</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  };</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment"></span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment"> /** @brief Test predicate on several elements. */</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _FIterator></div><div class="line"><a name="l00153"></a><span class="lineno"><a class="line" href="a09352.html"> 153</a></span>  <span class="keyword">struct </span><a class="code" href="a09352.html">__find_first_of_selector</a> : <span class="keyword">public</span> <a class="code" href="a09336.html">__generic_find_selector</a></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>  _FIterator _M_begin;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  _FIterator _M_end;</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>  <span class="keyword">explicit</span> <a class="code" href="a09352.html">__find_first_of_selector</a>(_FIterator __begin,</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  _FIterator __end)</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  : _M_begin(__begin), _M_end(__end) { }</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"></span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> /** @brief Test on one position.</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> * @param __i1 _Iterator on first sequence.</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"> * @param __i2 _Iterator on second sequence (unused).</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"> * @param __pred Find predicate. */</span></div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">typename</span> _Pred></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00169"></a><span class="lineno"><a class="line" href="a09352.html#ab86537005f7f266bbaebc18f9d44b077"> 169</a></span>  <a class="code" href="a09352.html#ab86537005f7f266bbaebc18f9d44b077">operator()</a>(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)</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>  <span class="keywordflow">for</span> (_FIterator __pos_in_candidates = _M_begin;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  __pos_in_candidates != _M_end; ++__pos_in_candidates)</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">if</span> (__pred(*__i1, *__pos_in_candidates))</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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> <span class="comment"></span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"> /** @brief Corresponding sequential algorithm on a sequence.</span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"> * @param __begin1 Begin iterator of first sequence.</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> * @param __end1 End iterator of first sequence.</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> * @param __begin2 Begin iterator of second sequence.</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> * @param __pred Find predicate. */</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2,</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">typename</span> _Pred></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <a class="code" href="a07764.html">std::pair<_RAIter1, _RAIter2></a></div><div class="line"><a name="l00186"></a><span class="lineno"><a class="line" href="a09352.html#a1b4029217a30dbc7e06ed2d022f30727"> 186</a></span>  <a class="code" href="a09352.html#a1b4029217a30dbc7e06ed2d022f30727">_M_sequential_algorithm</a>(_RAIter1 __begin1,</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  _RAIter1 __end1,</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  _RAIter2 __begin2, _Pred __pred)</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  {</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">return</span> <a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(find_first_of(__begin1, __end1,</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  _M_begin, _M_end, __pred,</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="code" href="a09636.html">sequential_tag</a>()), __begin2);</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> }</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_FIND_SELECTORS_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a09344_html"><div class="ttname"><a href="a09344.html">__gnu_parallel::__adjacent_find_selector</a></div><div class="ttdoc">Test predicate on two adjacent elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00080">find_selectors.h:80</a></div></div> <div class="ttc" id="a09344_html_a89987a97e4d94cb47f92c113de4a1a48"><div class="ttname"><a href="a09344.html#a89987a97e4d94cb47f92c113de4a1a48">__gnu_parallel::__adjacent_find_selector::_M_sequential_algorithm</a></div><div class="ttdeci">std::pair< _RAIter1, _RAIter2 > _M_sequential_algorithm(_RAIter1 __begin1, _RAIter1 __end1, _RAIter2 __begin2, _Pred __pred)</div><div class="ttdoc">Corresponding sequential algorithm on a sequence.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00105">find_selectors.h:105</a></div></div> <div class="ttc" id="a01477_html_ga0409e288f07b697cb6885d1002df0bd6"><div class="ttname"><a href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a></div><div class="ttdeci">constexpr pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)</div><div class="ttdoc">A convenience wrapper for creating a pair from two objects.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00524">stl_pair.h:524</a></div></div> <div class="ttc" id="a09352_html_a1b4029217a30dbc7e06ed2d022f30727"><div class="ttname"><a href="a09352.html#a1b4029217a30dbc7e06ed2d022f30727">__gnu_parallel::__find_first_of_selector::_M_sequential_algorithm</a></div><div class="ttdeci">std::pair< _RAIter1, _RAIter2 > _M_sequential_algorithm(_RAIter1 __begin1, _RAIter1 __end1, _RAIter2 __begin2, _Pred __pred)</div><div class="ttdoc">Corresponding sequential algorithm on a sequence.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00186">find_selectors.h:186</a></div></div> <div class="ttc" id="a09344_html_afba73305cf46d20618b0deb3cbd4a1ba"><div class="ttname"><a href="a09344.html#afba73305cf46d20618b0deb3cbd4a1ba">__gnu_parallel::__adjacent_find_selector::operator()</a></div><div class="ttdeci">bool operator()(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)</div><div class="ttdoc">Test on one position.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00090">find_selectors.h:90</a></div></div> <div class="ttc" id="a09352_html_ab86537005f7f266bbaebc18f9d44b077"><div class="ttname"><a href="a09352.html#ab86537005f7f266bbaebc18f9d44b077">__gnu_parallel::__find_first_of_selector::operator()</a></div><div class="ttdeci">bool operator()(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)</div><div class="ttdoc">Test on one position.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00169">find_selectors.h:169</a></div></div> <div class="ttc" id="a09340_html_a63d5cc3dfce9c02f30dd7c4cc468d157"><div class="ttname"><a href="a09340.html#a63d5cc3dfce9c02f30dd7c4cc468d157">__gnu_parallel::__find_if_selector::_M_sequential_algorithm</a></div><div class="ttdeci">std::pair< _RAIter1, _RAIter2 > _M_sequential_algorithm(_RAIter1 __begin1, _RAIter1 __end1, _RAIter2 __begin2, _Pred __pred)</div><div class="ttdoc">Corresponding sequential algorithm on a sequence.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00072">find_selectors.h:72</a></div></div> <div class="ttc" id="a09352_html"><div class="ttname"><a href="a09352.html">__gnu_parallel::__find_first_of_selector</a></div><div class="ttdoc">Test predicate on several elements.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00153">find_selectors.h:153</a></div></div> <div class="ttc" id="a09340_html"><div class="ttname"><a href="a09340.html">__gnu_parallel::__find_if_selector</a></div><div class="ttdoc">Test predicate on a single element, used for std::find() and std::find_if ().</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00050">find_selectors.h:50</a></div></div> <div class="ttc" id="a09348_html_a9c307c47e6a7d2b3211c92c767d2a448"><div class="ttname"><a href="a09348.html#a9c307c47e6a7d2b3211c92c767d2a448">__gnu_parallel::__mismatch_selector::_M_sequential_algorithm</a></div><div class="ttdeci">std::pair< _RAIter1, _RAIter2 > _M_sequential_algorithm(_RAIter1 __begin1, _RAIter1 __end1, _RAIter2 __begin2, _Pred __pred)</div><div class="ttdoc">Corresponding sequential algorithm on a sequence.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00143">find_selectors.h:143</a></div></div> <div class="ttc" id="a09348_html_acce7eaf03f5dcb028e255f8b40ad9dfd"><div class="ttname"><a href="a09348.html#acce7eaf03f5dcb028e255f8b40ad9dfd">__gnu_parallel::__mismatch_selector::operator()</a></div><div class="ttdeci">bool operator()(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)</div><div class="ttdoc">Test on one position.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00130">find_selectors.h:130</a></div></div> <div class="ttc" id="a00872_html"><div class="ttname"><a href="a00872.html">basic_iterator.h</a></div><div class="ttdoc">Includes the original header files concerned with iterators except for stream iterators....</div></div> <div class="ttc" id="a00572_html"><div class="ttname"><a href="a00572.html">stl_pair.h</a></div></div> <div class="ttc" id="a00965_html"><div class="ttname"><a href="a00965.html">tags.h</a></div><div class="ttdoc">Tags for compile-time selection. This file is a GNU parallel extension to the Standard C++ Library.</div></div> <div class="ttc" id="a09340_html_ab5c063395b4e4f3e1be257ac5327f8b2"><div class="ttname"><a href="a09340.html#ab5c063395b4e4f3e1be257ac5327f8b2">__gnu_parallel::__find_if_selector::operator()</a></div><div class="ttdeci">bool operator()(_RAIter1 __i1, _RAIter2 __i2, _Pred __pred)</div><div class="ttdoc">Test on one position.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00060">find_selectors.h:60</a></div></div> <div class="ttc" id="a09348_html"><div class="ttname"><a href="a09348.html">__gnu_parallel::__mismatch_selector</a></div><div class="ttdoc">Test inverted predicate on a single element.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00119">find_selectors.h:119</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 class="ttc" id="a09336_html"><div class="ttname"><a href="a09336.html">__gnu_parallel::__generic_find_selector</a></div><div class="ttdoc">Base class of all __gnu_parallel::__find_template selectors.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00043">find_selectors.h:43</a></div></div> <div class="ttc" id="a09636_html"><div class="ttname"><a href="a09636.html">__gnu_parallel::sequential_tag</a></div><div class="ttdoc">Forces sequential execution at compile time.</div><div class="ttdef"><b>Definition:</b> <a href="a00965_source.html#l00042">tags.h:42</a></div></div> <div class="ttc" id="a07764_html"><div class="ttname"><a href="a07764.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00208">stl_pair.h:208</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_e0ca5f9b79afec9781b100dc0e5c7504.html">include</a></li><li class="navelem"><a class="el" href="dir_d2331c0d6b7f7f8ed85dc9efb934eb07.html">parallel</a></li><li class="navelem"><a class="el" href="a00890.html">find_selectors.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>