<!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++: algobase.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('a00869_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">algobase.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00869.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/algobase.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Parallel STL function calls corresponding to the</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * stl_algobase.h header. The functions defined here mainly do case</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * switches and call the actual parallelized versions in other files.</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> * Inlining policy: Functions that basically only contain one</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * function call, are declared inline.</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * This file is a GNU parallel extension to the Standard C++ Library.</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> */</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> </div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// Written by Johannes Singler and Felix Putze.</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">#ifndef _GLIBCXX_PARALLEL_ALGOBASE_H</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_ALGOBASE_H 1</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include <<a class="code" href="a00530.html">bits/stl_algobase.h</a>></span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include <<a class="code" href="a16491.html">parallel/base.h</a>></span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include <<a class="code" href="a16473.html">parallel/algorithmfwd.h</a>></span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include <<a class="code" href="a00890.html">parallel/find.h</a>></span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include <<a class="code" href="a00893.html">parallel/find_selectors.h</a>></span></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="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> {</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="keyword">namespace </span>__parallel</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> {</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// NB: equal and lexicographical_compare require mismatch.</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> </div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// Sequential fallback</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">inline</span> pair<_IIter1, _IIter2></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2,</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <a class="code" href="a09639.html">__gnu_parallel::sequential_tag</a>)</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  { <span class="keywordflow">return</span> _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2); }</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// Sequential fallback</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">inline</span> pair<_IIter1, _IIter2></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2,</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  _Predicate __pred, <a class="code" href="a09639.html">__gnu_parallel::sequential_tag</a>)</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  { <span class="keywordflow">return</span> _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); }</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">// Sequential fallback for input iterator case</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2,</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keyword">typename</span> _Predicate, <span class="keyword">typename</span> _IteratorTag1, <span class="keyword">typename</span> _IteratorTag2></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">inline</span> pair<_IIter1, _IIter2></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  __mismatch_switch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2,</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  _Predicate __pred, _IteratorTag1, _IteratorTag2)</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  { <span class="keywordflow">return</span> _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred); }</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// Parallel mismatch for random access iterators</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2, <span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  pair<_RAIter1, _RAIter2></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  __mismatch_switch(_RAIter1 __begin1, _RAIter1 __end1,</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  _RAIter2 __begin2, _Predicate __pred, </div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  random_access_iterator_tag, random_access_iterator_tag)</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>  <span class="keywordflow">if</span> (<a class="code" href="a00962.html#ad816e8f52b933c9300598977cada7d18">_GLIBCXX_PARALLEL_CONDITION</a>(<span class="keyword">true</span>))</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  _RAIter1 __res =</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <a class="code" href="a01575.html#a98f2d50d4b5c617ce47d37a162e6081a">__gnu_parallel::__find_template</a>(__begin1, __end1, __begin2, __pred,</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <a class="code" href="a01575.html">__gnu_parallel</a>::</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  __mismatch_selector()).first;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">return</span> <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">make_pair</a>(__res , __begin2 + (__res - __begin1));</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>  <span class="keywordflow">else</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::mismatch(__begin1, __end1, __begin2, __pred);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</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">// Public interface</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">inline</span> pair<_IIter1, _IIter2></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2)</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  {</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">typedef</span> <a class="code" href="a09303.html">__gnu_parallel::_EqualTo</a><</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">typename</span> std::iterator_traits<_IIter1>::value_type,</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">typename</span> std::iterator_traits<_IIter2>::value_type> _EqualTo;</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">return</span> __mismatch_switch(__begin1, __end1, __begin2, _EqualTo(),</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__begin1),</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__begin2));</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// Public interface</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">inline</span> pair<_IIter1, _IIter2></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2,</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  _Predicate __pred)</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">return</span> __mismatch_switch(__begin1, __end1, __begin2, __pred,</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__begin1),</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__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="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="comment">// Sequential fallback.</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2></div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">inline</span> pair<_InputIterator1, _InputIterator2></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  mismatch(_InputIterator1 __first1, _InputIterator1 __last1,</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  _InputIterator2 __first2, _InputIterator2 __last2,</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <a class="code" href="a09639.html">__gnu_parallel::sequential_tag</a>)</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  { <span class="keywordflow">return</span> _GLIBCXX_STD_A::mismatch(__first1, __last1, __first2, __last2); }</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>  <span class="comment">// Sequential fallback.</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2,</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">typename</span> _BinaryPredicate></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">inline</span> pair<_InputIterator1, _InputIterator2></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  mismatch(_InputIterator1 __first1, _InputIterator1 __last1,</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  _InputIterator2 __first2, _InputIterator2 __last2,</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  _BinaryPredicate __binary_pred,</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <a class="code" href="a09639.html">__gnu_parallel::sequential_tag</a>)</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>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::mismatch(__first1, __last1, __first2, __last2,</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  __binary_pred);</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</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>  <span class="comment">// Sequential fallback for input iterator case</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2,</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">typename</span> _Predicate, <span class="keyword">typename</span> _IteratorTag1, <span class="keyword">typename</span> _IteratorTag2></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keyword">inline</span> pair<_IIter1, _IIter2></div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  __mismatch_switch(_IIter1 __begin1, _IIter1 __end1,</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  _IIter2 __begin2, _IIter2 __end2, _Predicate __pred,</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  _IteratorTag1, _IteratorTag2)</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="keywordflow">return</span> _GLIBCXX_STD_A::mismatch(__begin1, __end1,</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  __begin2, __end2, __pred);</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> </div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">// Parallel mismatch for random access iterators</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2, <span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  pair<_RAIter1, _RAIter2></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  __mismatch_switch(_RAIter1 __begin1, _RAIter1 __end1,</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  _RAIter2 __begin2, _RAIter2 __end2, _Predicate __pred, </div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  random_access_iterator_tag, random_access_iterator_tag)</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="keywordflow">if</span> (<a class="code" href="a00962.html#ad816e8f52b933c9300598977cada7d18">_GLIBCXX_PARALLEL_CONDITION</a>(<span class="keyword">true</span>))</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>  <span class="keywordflow">if</span> ((__end2 - __begin2) < (__end1 - __begin1))</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  __end1 = __begin1 + (__end2 - __begin2);</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>  _RAIter1 __res =</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <a class="code" href="a01575.html#a98f2d50d4b5c617ce47d37a162e6081a">__gnu_parallel::__find_template</a>(__begin1, __end1, __begin2, __pred,</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <a class="code" href="a01575.html">__gnu_parallel</a>::</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  __mismatch_selector()).first;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">return</span> <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">make_pair</a>(__res , __begin2 + (__res - __begin1));</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>  <span class="keywordflow">else</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::mismatch(__begin1, __end1,</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  __begin2, __end2, __pred);</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</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">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keyword">inline</span> pair<_IIter1, _IIter2></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  mismatch(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, _IIter2 __end2)</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="keyword">typedef</span> <a class="code" href="a09303.html">__gnu_parallel::_EqualTo</a><</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keyword">typename</span> std::iterator_traits<_IIter1>::value_type,</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keyword">typename</span> std::iterator_traits<_IIter2>::value_type> _EqualTo;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">return</span> __mismatch_switch(__begin1, __end1, __begin2, __end2, _EqualTo(),</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__begin1),</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__begin2));</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  }</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> </div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2,</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keyword">typename</span> _BinaryPredicate></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keyword">inline</span> pair<_InputIterator1, _InputIterator2></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  mismatch(_InputIterator1 __begin1, _InputIterator1 __end1,</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  _InputIterator2 __begin2, _InputIterator2 __end2,</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  _BinaryPredicate __binary_pred)</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>  <span class="keywordflow">return</span> __mismatch_switch(__begin1, __end1, __begin2, __end2,</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  __binary_pred,</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__begin1),</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__begin2));</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="comment">// Sequential fallback</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  equal(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, </div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <a class="code" href="a09639.html">__gnu_parallel::sequential_tag</a>)</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  { <span class="keywordflow">return</span> _GLIBCXX_STD_A::equal(__begin1, __end1, __begin2); }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> </div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="comment">// Sequential fallback</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  equal(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  _Predicate __pred, <a class="code" href="a09639.html">__gnu_parallel::sequential_tag</a>)</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  { <span class="keywordflow">return</span> _GLIBCXX_STD_A::equal(__begin1, __end1, __begin2, __pred); }</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> </div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="comment">// Public interface</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  equal(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2)</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  {</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">return</span> __gnu_parallel::mismatch(__begin1, __end1, __begin2).first</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  == __end1;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> </div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">// Public interface</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  equal(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, </div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  _Predicate __pred)</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  {</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">return</span> __gnu_parallel::mismatch(__begin1, __end1, __begin2, __pred).first</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  == __end1;</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> </div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="comment">// Sequential fallback</span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  equal(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, _IIter2 __end2,</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <a class="code" href="a09639.html">__gnu_parallel::sequential_tag</a>)</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  {</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::equal(__begin1, __end1, __begin2, __end2);</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> </div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// Sequential fallback</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _BinaryPredicate></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  equal(_IIter1 __begin1, _IIter1 __end1,</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  _IIter2 __begin2, _IIter2 __end2, _BinaryPredicate __binary_pred,</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <a class="code" href="a09639.html">__gnu_parallel::sequential_tag</a>)</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  {</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::equal(__begin1, __end1, __begin2, __end2,</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  __binary_pred);</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> </div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="comment">// Sequential fallback for input iterator case</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2,</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keyword">typename</span> _Predicate, <span class="keyword">typename</span> _IteratorTag1, <span class="keyword">typename</span> _IteratorTag2></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  __equal_switch(_IIter1 __begin1, _IIter1 __end1,</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  _IIter2 __begin2, _IIter2 __end2, _Predicate __pred,</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  _IteratorTag1, _IteratorTag2)</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  {</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::equal(__begin1, __end1,</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  __begin2, __end2, __pred);</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  }</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// Parallel equal for random access iterators</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2, <span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  __equal_switch(_RAIter1 __begin1, _RAIter1 __end1,</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  _RAIter2 __begin2, _RAIter2 __end2, _Predicate __pred, </div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  random_access_iterator_tag, random_access_iterator_tag)</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  {</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">if</span> (<a class="code" href="a00962.html#ad816e8f52b933c9300598977cada7d18">_GLIBCXX_PARALLEL_CONDITION</a>(<span class="keyword">true</span>))</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  {</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">if</span> (<a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__begin1, __end1)</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  != <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__begin2, __end2))</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">return</span> __gnu_parallel::mismatch(__begin1, __end1, __begin2, __end2,</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  __pred).first == __end1;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  }</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::equal(__begin1, __end1,</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  __begin2, __end2, __pred);</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  }</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  equal(_IIter1 __begin1, _IIter1 __end1, _IIter2 __begin2, _IIter2 __end2)</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  {</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">typedef</span> <a class="code" href="a09303.html">__gnu_parallel::_EqualTo</a><</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keyword">typename</span> std::iterator_traits<_IIter1>::value_type,</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keyword">typename</span> std::iterator_traits<_IIter2>::value_type> _EqualTo;</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> </div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">return</span> __equal_switch(__begin1, __end1, __begin2, __end2, _EqualTo(),</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__begin1),</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__begin2));</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  }</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span> </div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _BinaryPredicate></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  equal(_IIter1 __begin1, _IIter1 __end1,</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  _IIter2 __begin2, _IIter2 __end2, _BinaryPredicate __binary_pred)</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  {</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">return</span> __equal_switch(__begin1, __end1, __begin2, __end2, __binary_pred,</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__begin1),</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <a class="code" href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__begin2));</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  }</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> </div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// Sequential fallback</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  lexicographical_compare(_IIter1 __begin1, _IIter1 __end1, </div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  _IIter2 __begin2, _IIter2 __end2, </div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <a class="code" href="a09639.html">__gnu_parallel::sequential_tag</a>)</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  { <span class="keywordflow">return</span> _GLIBCXX_STD_A::lexicographical_compare(__begin1, __end1,</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  __begin2, __end2); }</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> </div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// Sequential fallback</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  lexicographical_compare(_IIter1 __begin1, _IIter1 __end1, </div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  _IIter2 __begin2, _IIter2 __end2, </div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  _Predicate __pred, <a class="code" href="a09639.html">__gnu_parallel::sequential_tag</a>)</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  { <span class="keywordflow">return</span> _GLIBCXX_STD_A::lexicographical_compare(</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  __begin1, __end1, __begin2, __end2, __pred); }</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> </div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// Sequential fallback for input iterator case</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2,</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keyword">typename</span> _Predicate, <span class="keyword">typename</span> _IteratorTag1, <span class="keyword">typename</span> _IteratorTag2></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  __lexicographical_compare_switch(_IIter1 __begin1, _IIter1 __end1,</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  _IIter2 __begin2, _IIter2 __end2, </div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  _Predicate __pred,</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  _IteratorTag1, _IteratorTag2)</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  { <span class="keywordflow">return</span> _GLIBCXX_STD_A::lexicographical_compare(</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  __begin1, __end1, __begin2, __end2, __pred); }</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">// Parallel lexicographical_compare for random access iterators</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// Limitation: Both valuetypes must be the same</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIter1, <span class="keyword">typename</span> _RAIter2, <span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  __lexicographical_compare_switch(_RAIter1 __begin1, _RAIter1 __end1,</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  _RAIter2 __begin2, _RAIter2 __end2,</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  _Predicate __pred,</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  random_access_iterator_tag, </div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  random_access_iterator_tag)</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  {</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordflow">if</span> (<a class="code" href="a00962.html#ad816e8f52b933c9300598977cada7d18">_GLIBCXX_PARALLEL_CONDITION</a>(<span class="keyword">true</span>))</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  {</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">typedef</span> iterator_traits<_RAIter1> _TraitsType1;</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType1::value_type _ValueType1;</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> </div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keyword">typedef</span> iterator_traits<_RAIter2> _TraitsType2;</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType2::value_type _ValueType2;</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> </div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">typedef</span> __gnu_parallel::</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  _EqualFromLess<_ValueType1, _ValueType2, _Predicate></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  _EqualFromLessCompare;</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> </div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="comment">// Longer sequence in first place.</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">if</span> ((__end1 - __begin1) < (__end2 - __begin2))</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  {</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keyword">typedef</span> pair<_RAIter1, _RAIter2> _SpotType;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  _SpotType __mm = __mismatch_switch(__begin1, __end1, __begin2, </div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  _EqualFromLessCompare(__pred), </div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  random_access_iterator_tag(), </div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  random_access_iterator_tag());</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> </div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">return</span> (__mm.first == __end1)</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  || bool(__pred(*__mm.first, *__mm.second));</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  {</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keyword">typedef</span> pair<_RAIter2, _RAIter1> _SpotType;</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  _SpotType __mm = __mismatch_switch(__begin2, __end2, __begin1, </div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  _EqualFromLessCompare(__pred), </div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  random_access_iterator_tag(), </div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  random_access_iterator_tag());</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> </div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">return</span> (__mm.first != __end2)</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  && bool(__pred(*__mm.second, *__mm.first));</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  }</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  }</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::lexicographical_compare(</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  __begin1, __end1, __begin2, __end2, __pred);</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  }</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> </div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="comment">// Public interface</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  lexicographical_compare(_IIter1 __begin1, _IIter1 __end1,</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  _IIter2 __begin2, _IIter2 __end2)</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  {</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keyword">typedef</span> iterator_traits<_IIter1> _TraitsType1;</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType1::value_type _ValueType1;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType1::iterator_category _IteratorCategory1;</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> </div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keyword">typedef</span> iterator_traits<_IIter2> _TraitsType2;</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType2::value_type _ValueType2;</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType2::iterator_category _IteratorCategory2;</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keyword">typedef</span> <a class="code" href="a09307.html">__gnu_parallel::_Less<_ValueType1, _ValueType2></a> _LessType;</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> </div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">return</span> __lexicographical_compare_switch(</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  __begin1, __end1, __begin2, __end2, _LessType(),</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  _IteratorCategory1(), _IteratorCategory2());</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  }</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> </div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="comment">// Public interface</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter1, <span class="keyword">typename</span> _IIter2, <span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  lexicographical_compare(_IIter1 __begin1, _IIter1 __end1,</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  _IIter2 __begin2, _IIter2 __end2,</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  _Predicate __pred)</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  {</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keyword">typedef</span> iterator_traits<_IIter1> _TraitsType1;</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType1::iterator_category _IteratorCategory1;</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> </div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keyword">typedef</span> iterator_traits<_IIter2> _TraitsType2;</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType2::iterator_category _IteratorCategory2;</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> </div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">return</span> __lexicographical_compare_switch(</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  __begin1, __end1, __begin2, __end2, __pred,</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  _IteratorCategory1(), _IteratorCategory2());</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  }</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> } <span class="comment">// end namespace</span></div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> } <span class="comment">// end namespace</span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> </div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_ALGOBASE_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a09639_html"><div class="ttname"><a href="a09639.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="a00968_source.html#l00042">tags.h:42</a></div></div>
<div class="ttc" id="a09303_html"><div class="ttname"><a href="a09303.html">__gnu_parallel::_EqualTo</a></div><div class="ttdoc">Similar to std::equal_to, but allows two different types.</div><div class="ttdef"><b>Definition:</b> <a href="a16491_source.html#l00244">parallel/base.h:244</a></div></div>
<div class="ttc" id="a00893_html"><div class="ttname"><a href="a00893.html">find_selectors.h</a></div><div class="ttdoc">_Function objects representing different tasks to be plugged into the parallel find algorithm....</div></div>
<div class="ttc" id="a01541_html_a99b049793a96260d190d781f847038bc"><div class="ttname"><a href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00138">stl_iterator_base_funcs.h:138</a></div></div>
<div class="ttc" id="a00530_html"><div class="ttname"><a href="a00530.html">stl_algobase.h</a></div></div>
<div class="ttc" id="a00962_html_ad816e8f52b933c9300598977cada7d18"><div class="ttname"><a href="a00962.html#ad816e8f52b933c9300598977cada7d18">_GLIBCXX_PARALLEL_CONDITION</a></div><div class="ttdeci">#define _GLIBCXX_PARALLEL_CONDITION(__c)</div><div class="ttdoc">Determine at compile(?)-time if the parallel variant of an algorithm should be called.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00095">settings.h:95</a></div></div>
<div class="ttc" id="a01480_html_ga0409e288f07b697cb6885d1002df0bd6"><div class="ttname"><a href="a01480.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="a16473_html"><div class="ttname"><a href="a16473.html">algorithmfwd.h</a></div></div>
<div class="ttc" id="a00890_html"><div class="ttname"><a href="a00890.html">find.h</a></div><div class="ttdoc">Parallel implementation base for std::find(), std::equal() and related functions. This file is a GNU ...</div></div>
<div class="ttc" id="a01541_html"><div class="ttname"><a href="a01541.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div>
<div class="ttc" id="a16491_html"><div class="ttname"><a href="a16491.html">base.h</a></div><div class="ttdoc">Sequential helper functions. This file is a GNU parallel extension to the Standard C++ Library.</div></div>
<div class="ttc" id="a01575_html"><div class="ttname"><a href="a01575.html">__gnu_parallel</a></div><div class="ttdoc">GNU parallel code for public use.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00061">balanced_quicksort.h:61</a></div></div>
<div class="ttc" id="a01507_html_ga89d3a7d239086516917bb7f6f9da213c"><div class="ttname"><a href="a01507.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a></div><div class="ttdeci">constexpr iterator_traits< _Iter >::iterator_category __iterator_category(const _Iter &)</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00205">stl_iterator_base_types.h:205</a></div></div>
<div class="ttc" id="a01575_html_a98f2d50d4b5c617ce47d37a162e6081a"><div class="ttname"><a href="a01575.html#a98f2d50d4b5c617ce47d37a162e6081a">__gnu_parallel::__find_template</a></div><div class="ttdeci">std::pair< _RAIter1, _RAIter2 > __find_template(_RAIter1 __begin1, _RAIter1 __end1, _RAIter2 __begin2, _Pred __pred, _Selector __selector)</div><div class="ttdoc">Parallel std::find, switch for different algorithms.</div><div class="ttdef"><b>Definition:</b> <a href="a00890_source.html#l00060">find.h:60</a></div></div>
<div class="ttc" id="a09307_html"><div class="ttname"><a href="a09307.html">__gnu_parallel::_Less</a></div><div class="ttdoc">Similar to std::less, but allows two different types.</div><div class="ttdef"><b>Definition:</b> <a href="a16491_source.html#l00252">parallel/base.h:252</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_8c50ddefd65cfbc3979f354ad979e527.html">parallel</a></li><li class="navelem"><a class="el" href="a00869.html">algobase.h</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
769
