<!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++: stl_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('a00530_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">stl_algobase.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00530.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">// Core algorithmic facilities -*- 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) 2001-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</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later 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,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but 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</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU 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> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/*</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> *</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Copyright (c) 1994</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * Hewlett-Packard Company</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> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> *</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> *</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * Copyright (c) 1996-1998</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span></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"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</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"> 50</span> <span class="comment"></span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">/** @file bits/stl_algobase.h</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * Do not attempt to use it directly. @headername{algorithm}</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> */</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#ifndef _STL_ALGOBASE_H</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _STL_ALGOBASE_H 1</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#include <<a class="code" href="a00656.html">bits/c++config.h</a>></span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#include <<a class="code" href="a00356.html">bits/functexcept.h</a>></span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#include <<a class="code" href="a00311.html">bits/cpp_type_traits.h</a>></span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor">#include <<a class="code" href="a01091.html">ext/type_traits.h</a>></span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#include <<a class="code" href="a01058.html">ext/numeric_traits.h</a>></span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor">#include <<a class="code" href="a00572.html">bits/stl_pair.h</a>></span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor">#include <<a class="code" href="a00554.html">bits/stl_iterator_base_types.h</a>></span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor">#include <<a class="code" href="a00551.html">bits/stl_iterator_base_funcs.h</a>></span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="preprocessor">#include <<a class="code" href="a17145.html">bits/stl_iterator.h</a>></span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor">#include <<a class="code" href="a00308.html">bits/concept_check.h</a>></span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor">#include <<a class="code" href="a00746.html">debug/debug.h</a>></span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="preprocessor">#include <<a class="code" href="a00422.html">bits/move.h</a>></span> <span class="comment">// For std::swap</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor">#include <<a class="code" href="a00443.html">bits/predefined_ops.h</a>></span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> {</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// See http://gcc.gnu.org/ml/libstdc++/2004-08/msg00167.html: in a</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">// nutshell, we are partially implementing the resolution of DR 187,</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// when it's safe, i.e., the value_types are equal.</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _BoolType></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">struct </span>__iter_swap</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  {</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator1, <span class="keyword">typename</span> _ForwardIterator2></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">static</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)</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="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_ForwardIterator1>::value_type</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  _ValueType1;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  _ValueType1 __tmp = *__a;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  *__a = *__b;</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  *__b = __tmp;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  }</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> </div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">struct </span>__iter_swap<true></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator1, <span class="keyword">typename</span> _ForwardIterator2></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">static</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  {</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  swap(*__a, *__b);</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="preprocessor">#endif</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"></span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> /**</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> * @brief Swaps the contents of two iterators.</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> * @ingroup mutating_algorithms</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> * @param __a An iterator.</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> * @param __b Another iterator.</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> * @return Nothing.</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> *</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> * This function swaps the values pointed to by two iterators, not the</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> * iterators themselves.</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="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator1, <span class="keyword">typename</span> _ForwardIterator2></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00120"></a><span class="lineno"><a class="line" href="a01483.html#gad93e66478d9a63e5777733be09931388"> 120</a></span>  iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  {</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  _ForwardIterator1>)</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  _ForwardIterator2>)</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="preprocessor">#if __cplusplus < 201103L</span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_ForwardIterator1>::value_type</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  _ValueType1;</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_ForwardIterator2>::value_type</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  _ValueType2;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  __glibcxx_function_requires(_ConvertibleConcept<_ValueType1,</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  _ValueType2>)</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  __glibcxx_function_requires(_ConvertibleConcept<_ValueType2,</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  _ValueType1>)</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="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_ForwardIterator1>::reference</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  _ReferenceType1;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_ForwardIterator2>::reference</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  _ReferenceType2;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  std::__iter_swap<__are_same<_ValueType1, _ValueType2>::__value</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  && __are_same<_ValueType1&, _ReferenceType1>::__value</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  && __are_same<_ValueType2&, _ReferenceType2>::__value>::</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  iter_swap(__a, __b);</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  swap(*__a, *__b);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="preprocessor">#endif</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"></span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment"> /**</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="comment"> * @brief Swap the elements of two sequences.</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="comment"> * @ingroup mutating_algorithms</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="comment"> * @param __first1 A forward iterator.</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"> * @param __last1 A forward iterator.</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"> * @param __first2 A forward iterator.</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"> * @return An iterator equal to @p first2+(last1-first1).</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> *</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> * Swaps each element in the range @p [first1,last1) with the</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> * corresponding element in the range @p [first2,(last1-first1)).</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="comment"> * The ranges must not overlap.</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> */</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator1, <span class="keyword">typename</span> _ForwardIterator2></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  _ForwardIterator2</div><div class="line"><a name="l00166"></a><span class="lineno"><a class="line" href="a01483.html#gae9603907c05659cb5cfc6ea20be9ae01"> 166</a></span>  swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1,</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  _ForwardIterator2 __first2)</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="comment">// concept requirements</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  _ForwardIterator1>)</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  _ForwardIterator2>)</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> </div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">for</span> (; __first1 != __last1; ++__first1, (void)++__first2)</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <a class="code" href="a01483.html#gad93e66478d9a63e5777733be09931388">std::iter_swap</a>(__first1, __first2);</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">return</span> __first2;</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  }</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"></span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> /**</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> * @brief This does what you think it does.</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> * @ingroup sorting_algorithms</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"> * @param __a A thing of arbitrary type.</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> * @param __b Another thing of arbitrary type.</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"> * @return The lesser of the parameters.</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> *</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"> * This is the simple classic generic implementation. It will work on</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> * temporary expressions, since they are only evaluated once, unlike a</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"> * preprocessor macro.</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> */</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  _GLIBCXX14_CONSTEXPR</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">inline</span> <span class="keyword">const</span> _Tp&</div><div class="line"><a name="l00195"></a><span class="lineno"><a class="line" href="a01485.html#gad48656de2f272a953455e1fff2532125"> 195</a></span>  <a class="code" href="a01485.html#gad48656de2f272a953455e1fff2532125">min</a>(<span class="keyword">const</span> _Tp& __a, <span class="keyword">const</span> _Tp& __b)</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="comment">// concept requirements</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  __glibcxx_function_requires(_LessThanComparableConcept<_Tp>)</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">//return __b < __a ? __b : __a;</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">if</span> (__b < __a)</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">return</span> __b;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">return</span> __a;</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  }</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"></span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment"> /**</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment"> * @brief This does what you think it does.</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment"> * @ingroup sorting_algorithms</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"> * @param __a A thing of arbitrary type.</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"> * @param __b Another thing of arbitrary type.</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment"> * @return The greater of the parameters.</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"> *</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="comment"> * This is the simple classic generic implementation. It will work on</span></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> <span class="comment"> * temporary expressions, since they are only evaluated once, unlike a</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="comment"> * preprocessor macro.</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment"> */</span></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  _GLIBCXX14_CONSTEXPR</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keyword">inline</span> <span class="keyword">const</span> _Tp&</div><div class="line"><a name="l00219"></a><span class="lineno"><a class="line" href="a01485.html#ga84d30d8c4b3f2cbe8ec2055c34a578da"> 219</a></span>  <a class="code" href="a01485.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">max</a>(<span class="keyword">const</span> _Tp& __a, <span class="keyword">const</span> _Tp& __b)</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  {</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  __glibcxx_function_requires(_LessThanComparableConcept<_Tp>)</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">//return __a < __b ? __b : __a;</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">if</span> (__a < __b)</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">return</span> __b;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">return</span> __a;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment"></span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment"> /**</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="comment"> * @brief This does what you think it does.</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="comment"> * @ingroup sorting_algorithms</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="comment"> * @param __a A thing of arbitrary type.</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="comment"> * @param __b Another thing of arbitrary type.</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="comment"> * @param __comp A @link comparison_functors comparison functor@endlink.</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="comment"> * @return The lesser of the parameters.</span></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="comment"> *</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="comment"> * This will work on temporary expressions, since they are only evaluated</span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment"> * once, unlike a preprocessor macro.</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment"> */</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  _GLIBCXX14_CONSTEXPR</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keyword">inline</span> <span class="keyword">const</span> _Tp&</div><div class="line"><a name="l00243"></a><span class="lineno"><a class="line" href="a01485.html#ga6499dc0f7db12560643a3b79db5357f6"> 243</a></span>  <a class="code" href="a01485.html#gad48656de2f272a953455e1fff2532125">min</a>(<span class="keyword">const</span> _Tp& __a, <span class="keyword">const</span> _Tp& __b, _Compare __comp)</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  {</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">//return __comp(__b, __a) ? __b : __a;</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">if</span> (__comp(__b, __a))</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">return</span> __b;</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">return</span> __a;</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  }</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment"></span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment"> /**</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment"> * @brief This does what you think it does.</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment"> * @ingroup sorting_algorithms</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment"> * @param __a A thing of arbitrary type.</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment"> * @param __b Another thing of arbitrary type.</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment"> * @param __comp A @link comparison_functors comparison functor@endlink.</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment"> * @return The greater of the parameters.</span></div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment"> *</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment"> * This will work on temporary expressions, since they are only evaluated</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment"> * once, unlike a preprocessor macro.</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"> */</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  _GLIBCXX14_CONSTEXPR</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keyword">inline</span> <span class="keyword">const</span> _Tp&</div><div class="line"><a name="l00265"></a><span class="lineno"><a class="line" href="a01485.html#ga2a22232a7bcd3b1f87a45a5fb01ac9c3"> 265</a></span>  <a class="code" href="a01485.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">max</a>(<span class="keyword">const</span> _Tp& __a, <span class="keyword">const</span> _Tp& __b, _Compare __comp)</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">//return __comp(__a, __b) ? __b : __a;</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">if</span> (__comp(__a, __b))</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">return</span> __b;</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">return</span> __a;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">// Fallback implementation of the function in bits/stl_iterator.h used to</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// remove the __normal_iterator wrapper. See copy, fill, ...</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Iterator></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">inline</span> _Iterator</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  __niter_base(_Iterator __it)</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  { <span class="keywordflow">return</span> __it; }</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="comment">// All of these auxiliary structs serve two purposes. (1) Replace</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// calls to copy with memmove whenever possible. (Memmove, not memcpy,</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">// because the input and output ranges are permitted to overlap.)</span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// (2) If we're using random access iterators, then write the loop as</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">// a for loop with an explicit count.</span></div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span>, <span class="keywordtype">bool</span>, <span class="keyword">typename</span>></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keyword">struct </span>__copy_move</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  {</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II, <span class="keyword">typename</span> _OI></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keyword">static</span> _OI</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  __copy_m(_II __first, _II __last, _OI __result)</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  {</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">for</span> (; __first != __last; ++__result, (void)++__first)</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  *__result = *__first;</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  };</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span> </div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Category></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">struct </span>__copy_move<true, false, _Category></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  {</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II, <span class="keyword">typename</span> _OI></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keyword">static</span> _OI</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  __copy_m(_II __first, _II __last, _OI __result)</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  {</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">for</span> (; __first != __last; ++__result, (void)++__first)</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  *__result = std::move(*__first);</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</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="preprocessor">#endif</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> </div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keyword">struct </span>__copy_move<false, false, random_access_iterator_tag></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  {</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II, <span class="keyword">typename</span> _OI></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keyword">static</span> _OI</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  __copy_m(_II __first, _II __last, _OI __result)</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="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_II>::difference_type _Distance;</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">for</span>(_Distance __n = __last - __first; __n > 0; --__n)</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  {</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  *__result = *__first;</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  ++__first;</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  ++__result;</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  }</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">return</span> __result;</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>  };</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> </div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keyword">struct </span>__copy_move<true, false, random_access_iterator_tag></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  {</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II, <span class="keyword">typename</span> _OI></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keyword">static</span> _OI</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  __copy_m(_II __first, _II __last, _OI __result)</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  {</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_II>::difference_type _Distance;</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">for</span>(_Distance __n = __last - __first; __n > 0; --__n)</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  {</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  *__result = std::move(*__first);</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  ++__first;</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  ++__result;</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  }</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  }</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  };</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _IsMove></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">struct </span>__copy_move<_IsMove, true, random_access_iterator_tag></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  {</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keyword">static</span> _Tp*</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  __copy_m(<span class="keyword">const</span> _Tp* __first, <span class="keyword">const</span> _Tp* __last, _Tp* __result)</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="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keyword">using</span> __assignable = conditional<_IsMove,</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  is_move_assignable<_Tp>,</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  is_copy_assignable<_Tp>>;</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="comment">// trivial types can have deleted assignment</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  static_assert( __assignable::type::value, <span class="stringliteral">"type is not assignable"</span> );</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keyword">const</span> ptrdiff_t _Num = __last - __first;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">if</span> (_Num)</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  __builtin_memmove(__result, __first, <span class="keyword">sizeof</span>(_Tp) * _Num);</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">return</span> __result + _Num;</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  }</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> </div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _IsMove, <span class="keyword">typename</span> _II, <span class="keyword">typename</span> _OI></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keyword">inline</span> _OI</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  __copy_move_a(_II __first, _II __last, _OI __result)</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> <span class="keyword">typename</span> iterator_traits<_II>::value_type _ValueTypeI;</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_OI>::value_type _ValueTypeO;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_II>::iterator_category _Category;</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> __simple = (__is_trivial(_ValueTypeI)</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  && __is_pointer<_II>::__value</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  && __is_pointer<_OI>::__value</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  && __are_same<_ValueTypeI, _ValueTypeO>::__value);</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> </div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">return</span> std::__copy_move<_IsMove, __simple,</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  _Category>::__copy_m(__first, __last, __result);</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  }</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> </div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="comment">// Helpers for streambuf iterators (either istream or ostream).</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="comment">// NB: avoid including <iosfwd>, relatively large.</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keyword">struct </span>char_traits;</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> </div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keyword">class </span>istreambuf_iterator;</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> </div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _CharT, <span class="keyword">typename</span> _Traits></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keyword">class </span>ostreambuf_iterator;</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> </div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _IsMove, <span class="keyword">typename</span> _CharT></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keyword">typename</span> __gnu_cxx::__enable_if<__is_char<_CharT>::__value,</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  __copy_move_a2(_CharT*, _CharT*,</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  ostreambuf_iterator<_CharT, char_traits<_CharT> >);</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> </div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _IsMove, <span class="keyword">typename</span> _CharT></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keyword">typename</span> __gnu_cxx::__enable_if<__is_char<_CharT>::__value,</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  __copy_move_a2(<span class="keyword">const</span> _CharT*, <span class="keyword">const</span> _CharT*,</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  ostreambuf_iterator<_CharT, char_traits<_CharT> >);</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="keyword">template</span><<span class="keywordtype">bool</span> _IsMove, <span class="keyword">typename</span> _CharT></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keyword">typename</span> __gnu_cxx::__enable_if<__is_char<_CharT>::__value,</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  _CharT*>::__type</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  __copy_move_a2(istreambuf_iterator<_CharT, char_traits<_CharT> >,</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  istreambuf_iterator<_CharT, char_traits<_CharT> >, _CharT*);</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> </div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _IsMove, <span class="keyword">typename</span> _II, <span class="keyword">typename</span> _OI></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keyword">inline</span> _OI</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  __copy_move_a2(_II __first, _II __last, _OI __result)</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="keywordflow">return</span> _OI(std::__copy_move_a<_IsMove>(std::__niter_base(__first),</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  std::__niter_base(__last),</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  std::__niter_base(__result)));</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  }</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment"></span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment"> /**</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment"> * @brief Copies the range [first,last) into result.</span></div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="comment"> * @ingroup mutating_algorithms</span></div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="comment"> * @param __result An output iterator.</span></div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment"> * @return result + (first - last)</span></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment"> *</span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment"> * This inline function will boil down to a call to @c memmove whenever</span></div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment"> * possible. Failing that, if random access iterators are passed, then the</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment"> * loop count will be known (and therefore a candidate for compiler</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment"> * optimizations such as unrolling). Result may not be contained within</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="comment"> * [first,last); the copy_backward function should be used instead.</span></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment"> *</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment"> * Note that the end of the output range is permitted to be contained</span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="comment"> * within [first,last).</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="comment"> */</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II, <span class="keyword">typename</span> _OI></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keyword">inline</span> _OI</div><div class="line"><a name="l00446"></a><span class="lineno"><a class="line" href="a01483.html#ga894f503412130680dc19c87af289f4f4"> 446</a></span>  <a class="code" href="a01483.html#ga894f503412130680dc19c87af289f4f4">copy</a>(_II __first, _II __last, _OI __result)</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  {</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  __glibcxx_function_requires(_InputIteratorConcept<_II>)</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  __glibcxx_function_requires(_OutputIteratorConcept<_OI,</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keyword">typename</span> iterator_traits<_II>::value_type>)</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> </div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">return</span> (std::__copy_move_a2<__is_move_iterator<_II>::__value></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  (std::__miter_base(__first), std::__miter_base(__last),</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  __result));</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  }</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span> </div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> <span class="comment"> /**</span></div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> <span class="comment"> * @brief Moves the range [first,last) into result.</span></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="comment"> * @ingroup mutating_algorithms</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> <span class="comment"> * @param __result An output iterator.</span></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="comment"> * @return result + (first - last)</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="comment"> *</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <span class="comment"> * This inline function will boil down to a call to @c memmove whenever</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> <span class="comment"> * possible. Failing that, if random access iterators are passed, then the</span></div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> <span class="comment"> * loop count will be known (and therefore a candidate for compiler</span></div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> <span class="comment"> * optimizations such as unrolling). Result may not be contained within</span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> <span class="comment"> * [first,last); the move_backward function should be used instead.</span></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="comment"> *</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="comment"> * Note that the end of the output range is permitted to be contained</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> <span class="comment"> * within [first,last).</span></div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="comment"> */</span></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II, <span class="keyword">typename</span> _OI></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keyword">inline</span> _OI</div><div class="line"><a name="l00479"></a><span class="lineno"><a class="line" href="a01483.html#gaedffc88b77674cbf9966e30a9c275bb6"> 479</a></span>  <a class="code" href="a01483.html#gaedffc88b77674cbf9966e30a9c275bb6">move</a>(_II __first, _II __last, _OI __result)</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  {</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  __glibcxx_function_requires(_InputIteratorConcept<_II>)</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  __glibcxx_function_requires(_OutputIteratorConcept<_OI,</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keyword">typename</span> iterator_traits<_II>::value_type>)</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span> </div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordflow">return</span> std::__copy_move_a2<true>(std::__miter_base(__first),</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  std::__miter_base(__last), __result);</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  }</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> </div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="preprocessor">#define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::move(_Tp, _Up, _Vp)</span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="preprocessor">#define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::copy(_Tp, _Up, _Vp)</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span> </div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span>, <span class="keywordtype">bool</span>, <span class="keyword">typename</span>></div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keyword">struct </span>__copy_move_backward</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  {</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _BI1, <span class="keyword">typename</span> _BI2></div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keyword">static</span> _BI2</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  {</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordflow">while</span> (__first != __last)</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  *--__result = *--__last;</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  };</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> </div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Category></div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keyword">struct </span>__copy_move_backward<true, false, _Category></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  {</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _BI1, <span class="keyword">typename</span> _BI2></div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keyword">static</span> _BI2</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  {</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">while</span> (__first != __last)</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  *--__result = std::move(*--__last);</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  }</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  };</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> </div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keyword">struct </span>__copy_move_backward<false, false, random_access_iterator_tag></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  {</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _BI1, <span class="keyword">typename</span> _BI2></div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keyword">static</span> _BI2</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  {</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keyword">typename</span> iterator_traits<_BI1>::difference_type __n;</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keywordflow">for</span> (__n = __last - __first; __n > 0; --__n)</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  *--__result = *--__last;</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  }</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  };</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> </div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keyword">struct </span>__copy_move_backward<true, false, random_access_iterator_tag></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  {</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _BI1, <span class="keyword">typename</span> _BI2></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keyword">static</span> _BI2</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result)</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  {</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keyword">typename</span> iterator_traits<_BI1>::difference_type __n;</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keywordflow">for</span> (__n = __last - __first; __n > 0; --__n)</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  *--__result = std::move(*--__last);</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  }</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  };</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span> </div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _IsMove></div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keyword">struct </span>__copy_move_backward<_IsMove, true, random_access_iterator_tag></div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  {</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keyword">static</span> _Tp*</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  __copy_move_b(<span class="keyword">const</span> _Tp* __first, <span class="keyword">const</span> _Tp* __last, _Tp* __result)</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  {</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keyword">using</span> __assignable = conditional<_IsMove,</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  is_move_assignable<_Tp>,</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  is_copy_assignable<_Tp>>;</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// trivial types can have deleted assignment</span></div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  static_assert( __assignable::type::value, <span class="stringliteral">"type is not assignable"</span> );</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keyword">const</span> ptrdiff_t _Num = __last - __first;</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">if</span> (_Num)</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  __builtin_memmove(__result - _Num, __first, <span class="keyword">sizeof</span>(_Tp) * _Num);</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keywordflow">return</span> __result - _Num;</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  }</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  };</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> </div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _IsMove, <span class="keyword">typename</span> _BI1, <span class="keyword">typename</span> _BI2></div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keyword">inline</span> _BI2</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  __copy_move_backward_a(_BI1 __first, _BI1 __last, _BI2 __result)</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  {</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_BI1>::value_type _ValueType1;</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_BI2>::value_type _ValueType2;</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_BI1>::iterator_category _Category;</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> __simple = (__is_trivial(_ValueType1)</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  && __is_pointer<_BI1>::__value</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  && __is_pointer<_BI2>::__value</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  && __are_same<_ValueType1, _ValueType2>::__value);</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> </div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">return</span> std::__copy_move_backward<_IsMove, __simple,</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  _Category>::__copy_move_b(__first,</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  __last,</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  __result);</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  }</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span> </div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _IsMove, <span class="keyword">typename</span> _BI1, <span class="keyword">typename</span> _BI2></div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keyword">inline</span> _BI2</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  __copy_move_backward_a2(_BI1 __first, _BI1 __last, _BI2 __result)</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  {</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">return</span> _BI2(std::__copy_move_backward_a<_IsMove></div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  (std::__niter_base(__first), std::__niter_base(__last),</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  std::__niter_base(__result)));</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  }</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="comment"></span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment"> /**</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="comment"> * @brief Copies the range [first,last) into result.</span></div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment"> * @ingroup mutating_algorithms</span></div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment"> * @param __first A bidirectional iterator.</span></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment"> * @param __last A bidirectional iterator.</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="comment"> * @param __result A bidirectional iterator.</span></div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span> <span class="comment"> * @return result - (first - last)</span></div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span> <span class="comment"> *</span></div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span> <span class="comment"> * The function has the same effect as copy, but starts at the end of the</span></div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span> <span class="comment"> * range and works its way to the start, returning the start of the result.</span></div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span> <span class="comment"> * This inline function will boil down to a call to @c memmove whenever</span></div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> <span class="comment"> * possible. Failing that, if random access iterators are passed, then the</span></div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="comment"> * loop count will be known (and therefore a candidate for compiler</span></div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span> <span class="comment"> * optimizations such as unrolling).</span></div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span> <span class="comment"> *</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span> <span class="comment"> * Result may not be in the range (first,last]. Use copy instead. Note</span></div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span> <span class="comment"> * that the start of the output range may overlap [first,last).</span></div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span> <span class="comment"> */</span></div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _BI1, <span class="keyword">typename</span> _BI2></div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keyword">inline</span> _BI2</div><div class="line"><a name="l00622"></a><span class="lineno"><a class="line" href="a01483.html#gaf0de0305e64a82131960e2769624a740"> 622</a></span>  copy_backward(_BI1 __first, _BI1 __last, _BI2 __result)</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  {</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  __glibcxx_function_requires(_BidirectionalIteratorConcept<_BI1>)</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<_BI2>)</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  __glibcxx_function_requires(_ConvertibleConcept<</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keyword">typename</span> iterator_traits<_BI1>::value_type,</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keyword">typename</span> iterator_traits<_BI2>::value_type>)</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span> </div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keywordflow">return</span> (std::__copy_move_backward_a2<__is_move_iterator<_BI1>::__value></div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  (std::__miter_base(__first), std::__miter_base(__last),</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  __result));</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  }</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> </div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span> <span class="comment"> /**</span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span> <span class="comment"> * @brief Moves the range [first,last) into result.</span></div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> <span class="comment"> * @ingroup mutating_algorithms</span></div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> <span class="comment"> * @param __first A bidirectional iterator.</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="comment"> * @param __last A bidirectional iterator.</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> <span class="comment"> * @param __result A bidirectional iterator.</span></div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment"> * @return result - (first - last)</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span> <span class="comment"> *</span></div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="comment"> * The function has the same effect as move, but starts at the end of the</span></div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span> <span class="comment"> * range and works its way to the start, returning the start of the result.</span></div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span> <span class="comment"> * This inline function will boil down to a call to @c memmove whenever</span></div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span> <span class="comment"> * possible. Failing that, if random access iterators are passed, then the</span></div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span> <span class="comment"> * loop count will be known (and therefore a candidate for compiler</span></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> <span class="comment"> * optimizations such as unrolling).</span></div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span> <span class="comment"> *</span></div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> <span class="comment"> * Result may not be in the range (first,last]. Use move instead. Note</span></div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span> <span class="comment"> * that the start of the output range may overlap [first,last).</span></div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span> <span class="comment"> */</span></div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _BI1, <span class="keyword">typename</span> _BI2></div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keyword">inline</span> _BI2</div><div class="line"><a name="l00658"></a><span class="lineno"><a class="line" href="a01483.html#ga1743475fe627f5302b98ae41f8bf0ad5"> 658</a></span>  move_backward(_BI1 __first, _BI1 __last, _BI2 __result)</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  {</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  __glibcxx_function_requires(_BidirectionalIteratorConcept<_BI1>)</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept<_BI2>)</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  __glibcxx_function_requires(_ConvertibleConcept<</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="keyword">typename</span> iterator_traits<_BI1>::value_type,</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keyword">typename</span> iterator_traits<_BI2>::value_type>)</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span> </div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keywordflow">return</span> std::__copy_move_backward_a2<true>(std::__miter_base(__first),</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  std::__miter_base(__last),</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  __result);</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  }</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span> </div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> <span class="preprocessor">#define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::move_backward(_Tp, _Up, _Vp)</span></div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span> <span class="preprocessor">#define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::copy_backward(_Tp, _Up, _Vp)</span></div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span> </div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keyword">inline</span> <span class="keyword">typename</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, <span class="keywordtype">void</span>>::__type</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  __fill_a(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keyword">const</span> _Tp& __value)</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  {</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  *__first = __value;</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  }</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span> </div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="keyword">inline</span> <span class="keyword">typename</span></div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, <span class="keywordtype">void</span>>::__type</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  __fill_a(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="keyword">const</span> _Tp& __value)</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  {</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keyword">const</span> _Tp __tmp = __value;</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordflow">for</span> (; __first != __last; ++__first)</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  *__first = __tmp;</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  }</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span> </div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="comment">// Specialization: for char types we can use memset.</span></div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="keyword">inline</span> <span class="keyword">typename</span></div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, <span class="keywordtype">void</span>>::__type</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  __fill_a(_Tp* __first, _Tp* __last, <span class="keyword">const</span> _Tp& __c)</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  {</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keyword">const</span> _Tp __tmp = __c;</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keywordflow">if</span> (<span class="keyword">const</span> <span class="keywordtype">size_t</span> __len = __last - __first)</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  __builtin_memset(__first, static_cast<unsigned char>(__tmp), __len);</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  }</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> <span class="comment"></span></div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span> <span class="comment"> /**</span></div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span> <span class="comment"> * @brief Fills the range [first,last) with copies of value.</span></div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span> <span class="comment"> * @ingroup mutating_algorithms</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span> <span class="comment"> * @param __first A forward iterator.</span></div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span> <span class="comment"> * @param __last A forward iterator.</span></div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span> <span class="comment"> * @param __value A reference-to-const of arbitrary type.</span></div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span> <span class="comment"> * @return Nothing.</span></div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span> <span class="comment"> *</span></div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span> <span class="comment"> * This function fills a range with copies of the same value. For char</span></div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> <span class="comment"> * types filling contiguous areas of memory, this becomes an inline call</span></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> <span class="comment"> * to @c memset or @c wmemset.</span></div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span> <span class="comment"> */</span></div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l00724"></a><span class="lineno"><a class="line" href="a01483.html#gab2e4bb5cc3300aaf6c0e5bdc3371bf06"> 724</a></span>  fill(_ForwardIterator __first, _ForwardIterator __last, <span class="keyword">const</span> _Tp& __value)</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  {</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  __glibcxx_function_requires(_Mutable_ForwardIteratorConcept<</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  _ForwardIterator>)</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span> </div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  std::__fill_a(std::__niter_base(__first), std::__niter_base(__last),</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  __value);</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  }</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> </div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _OutputIterator, <span class="keyword">typename</span> _Size, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keyword">inline</span> <span class="keyword">typename</span></div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, _OutputIterator>::__type</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  __fill_n_a(_OutputIterator __first, _Size __n, <span class="keyword">const</span> _Tp& __value)</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  {</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keywordflow">for</span> (__decltype(__n + 0) __niter = __n;</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  __niter > 0; --__niter, (void) ++__first)</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  *__first = __value;</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keywordflow">return</span> __first;</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  }</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span> </div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _OutputIterator, <span class="keyword">typename</span> _Size, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keyword">inline</span> <span class="keyword">typename</span></div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, _OutputIterator>::__type</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  __fill_n_a(_OutputIterator __first, _Size __n, <span class="keyword">const</span> _Tp& __value)</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  {</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keyword">const</span> _Tp __tmp = __value;</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keywordflow">for</span> (__decltype(__n + 0) __niter = __n;</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  __niter > 0; --__niter, (void) ++__first)</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  *__first = __tmp;</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keywordflow">return</span> __first;</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  }</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> </div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Size, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keyword">inline</span> <span class="keyword">typename</span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, _Tp*>::__type</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  __fill_n_a(_Tp* __first, _Size __n, <span class="keyword">const</span> _Tp& __c)</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  {</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  std::__fill_a(__first, __first + __n, __c);</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keywordflow">return</span> __first + __n;</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  }</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span> <span class="comment"></span></div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="comment"> /**</span></div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> <span class="comment"> * @brief Fills the range [first,first+n) with copies of value.</span></div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span> <span class="comment"> * @ingroup mutating_algorithms</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="comment"> * @param __first An output iterator.</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span> <span class="comment"> * @param __n The count of copies to perform.</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="comment"> * @param __value A reference-to-const of arbitrary type.</span></div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> <span class="comment"> * @return The iterator at first+n.</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span> <span class="comment"> *</span></div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span> <span class="comment"> * This function fills a range with copies of the same value. For char</span></div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span> <span class="comment"> * types filling contiguous areas of memory, this becomes an inline call</span></div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> <span class="comment"> * to @c memset or @ wmemset.</span></div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span> <span class="comment"> *</span></div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span> <span class="comment"> * _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span> <span class="comment"> * DR 865. More algorithms that throw away information</span></div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span> <span class="comment"> */</span></div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _OI, <span class="keyword">typename</span> _Size, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keyword">inline</span> _OI</div><div class="line"><a name="l00784"></a><span class="lineno"><a class="line" href="a01483.html#ga0af400b776b8486401daf6ecf91bacca"> 784</a></span>  fill_n(_OI __first, _Size __n, <span class="keyword">const</span> _Tp& __value)</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  {</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  __glibcxx_function_requires(_OutputIteratorConcept<_OI, _Tp>)</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span> </div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">return</span> _OI(std::__fill_n_a(std::__niter_base(__first), __n, __value));</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  }</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span> </div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _BoolType></div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keyword">struct </span>__equal</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  {</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2></div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  equal(_II1 __first1, _II1 __last1, _II2 __first2)</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  {</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="keywordflow">for</span> (; __first1 != __last1; ++__first1, (void) ++__first2)</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="keywordflow">if</span> (!(*__first1 == *__first2))</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  }</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  };</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span> </div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keyword">struct </span>__equal<true></div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  {</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  equal(<span class="keyword">const</span> _Tp* __first1, <span class="keyword">const</span> _Tp* __last1, <span class="keyword">const</span> _Tp* __first2)</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  {</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keywordflow">if</span> (<span class="keyword">const</span> <span class="keywordtype">size_t</span> __len = (__last1 - __first1))</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keywordflow">return</span> !__builtin_memcmp(__first1, __first2, <span class="keyword">sizeof</span>(_Tp) * __len);</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  }</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  };</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span> </div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  __equal_aux(_II1 __first1, _II1 __last1, _II2 __first2)</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  {</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_II1>::value_type _ValueType1;</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_II2>::value_type _ValueType2;</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> __simple = ((__is_integer<_ValueType1>::__value</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  || __is_pointer<_ValueType1>::__value)</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  && __is_pointer<_II1>::__value</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  && __is_pointer<_II2>::__value</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  && __are_same<_ValueType1, _ValueType2>::__value);</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span> </div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordflow">return</span> <a class="code" href="a01484.html#ga8e56a22bed21e9134369f4b2a47ba407">std::__equal<__simple>::equal</a>(__first1, __last1, __first2);</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  }</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span> </div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keyword">template</span><<span class="keyword">typename</span>, <span class="keyword">typename</span>></div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="keyword">struct </span>__lc_rai</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  {</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2></div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keyword">static</span> _II1</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  __newlast1(_II1, _II1 __last1, _II2, _II2)</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  { <span class="keywordflow">return</span> __last1; }</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span> </div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II></div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  __cnd2(_II __first, _II __last)</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  { <span class="keywordflow">return</span> __first != __last; }</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  };</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span> </div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keyword">struct </span>__lc_rai<random_access_iterator_tag, random_access_iterator_tag></div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  {</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAI1, <span class="keyword">typename</span> _RAI2></div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="keyword">static</span> _RAI1</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  __newlast1(_RAI1 __first1, _RAI1 __last1,</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  _RAI2 __first2, _RAI2 __last2)</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  {</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keyword">const</span> <span class="keyword">typename</span> iterator_traits<_RAI1>::difference_type</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  __diff1 = __last1 - __first1;</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keyword">const</span> <span class="keyword">typename</span> iterator_traits<_RAI2>::difference_type</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  __diff2 = __last2 - __first2;</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keywordflow">return</span> __diff2 < __diff1 ? __first1 + __diff2 : __last1;</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  }</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span> </div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAI></div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  __cnd2(_RAI, _RAI)</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  };</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span> </div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  __lexicographical_compare_impl(_II1 __first1, _II1 __last1,</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  _II2 __first2, _II2 __last2,</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  _Compare __comp)</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  {</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_II1>::iterator_category _Category1;</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_II2>::iterator_category _Category2;</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="keyword">typedef</span> std::__lc_rai<_Category1, _Category2> __rai_type;</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span> </div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2);</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keywordflow">for</span> (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2);</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  ++__first1, (void)++__first2)</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  {</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="keywordflow">if</span> (__comp(__first1, __first2))</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keywordflow">if</span> (__comp(__first2, __first1))</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  }</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keywordflow">return</span> __first1 == __last1 && __first2 != __last2;</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  }</div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span> </div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _BoolType></div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keyword">struct </span>__lexicographical_compare</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  {</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2></div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span> __lc(_II1, _II1, _II2, _II2);</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  };</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span> </div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> _BoolType></div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2></div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  __lexicographical_compare<_BoolType>::</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2)</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  {</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keywordflow">return</span> std::__lexicographical_compare_impl(__first1, __last1,</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  __first2, __last2,</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  __gnu_cxx::__ops::__iter_less_iter());</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  }</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span> </div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keyword">struct </span>__lexicographical_compare<true></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  {</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Up></div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  __lc(<span class="keyword">const</span> _Tp* __first1, <span class="keyword">const</span> _Tp* __last1,</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keyword">const</span> _Up* __first2, <span class="keyword">const</span> _Up* __last2)</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  {</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __len1 = __last1 - __first1;</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __len2 = __last2 - __first2;</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordflow">if</span> (<span class="keyword">const</span> <span class="keywordtype">size_t</span> __len = <a class="code" href="a01485.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__len1, __len2))</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="keywordflow">if</span> (<span class="keywordtype">int</span> __result = __builtin_memcmp(__first1, __first2, __len))</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keywordflow">return</span> __result < 0;</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keywordflow">return</span> __len1 < __len2;</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  }</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  };</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span> </div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2></div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  __lexicographical_compare_aux(_II1 __first1, _II1 __last1,</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  _II2 __first2, _II2 __last2)</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  {</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_II1>::value_type _ValueType1;</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_II2>::value_type _ValueType2;</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> __simple =</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  (__is_byte<_ValueType1>::__value && __is_byte<_ValueType2>::__value</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  && !__gnu_cxx::__numeric_traits<_ValueType1>::__is_signed</div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  && !__gnu_cxx::__numeric_traits<_ValueType2>::__is_signed</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  && __is_pointer<_II1>::__value</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  && __is_pointer<_II2>::__value);</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span> </div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keywordflow">return</span> std::__lexicographical_compare<__simple>::__lc(__first1, __last1,</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  __first2, __last2);</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  }</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span> </div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  _ForwardIterator</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  __lower_bound(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="keyword">const</span> _Tp& __val, _Compare __comp)</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  {</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_ForwardIterator>::difference_type</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  _DistanceType;</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span> </div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  _DistanceType __len = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last);</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span> </div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keywordflow">while</span> (__len > 0)</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  {</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  _DistanceType __half = __len >> 1;</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  _ForwardIterator __middle = __first;</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <a class="code" href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a>(__middle, __half);</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keywordflow">if</span> (__comp(__middle, __val))</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  {</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  __first = __middle;</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  ++__first;</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  __len = __len - __half - 1;</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  }</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  __len = __half;</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  }</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="keywordflow">return</span> __first;</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  }</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span> <span class="comment"></span></div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span> <span class="comment"> /**</span></div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span> <span class="comment"> * @brief Finds the first position in which @a val could be inserted</span></div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span> <span class="comment"> * without changing the ordering.</span></div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span> <span class="comment"> * @param __first An iterator.</span></div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> <span class="comment"> * @param __last Another iterator.</span></div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span> <span class="comment"> * @param __val The search term.</span></div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span> <span class="comment"> * @return An iterator pointing to the first element <em>not less</span></div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span> <span class="comment"> * than</em> @a val, or end() if every element is less than</span></div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span> <span class="comment"> * @a val.</span></div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span> <span class="comment"> * @ingroup binary_search_algorithms</span></div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span> <span class="comment"> */</span></div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="keyword">inline</span> _ForwardIterator</div><div class="line"><a name="l00984"></a><span class="lineno"><a class="line" href="a01487.html#ga6f1d41eed9a1fabbae1d54b384b07061"> 984</a></span>  lower_bound(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keyword">const</span> _Tp& __val)</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  {</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  __glibcxx_function_requires(_LessThanOpConcept<</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keyword">typename</span> iterator_traits<_ForwardIterator>::value_type, _Tp>)</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  __glibcxx_requires_partitioned_lower(__first, __last, __val);</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span> </div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="keywordflow">return</span> std::__lower_bound(__first, __last, __val,</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  __gnu_cxx::__ops::__iter_less_val());</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  }</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span> <span class="comment"></span></div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span> <span class="comment"> /// This is a helper function for the sort routines and for random.tcc.</span></div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span> <span class="comment"></span> <span class="comment">// Precondition: __n > 0.</span></div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="keyword">inline</span> _GLIBCXX_CONSTEXPR <span class="keywordtype">int</span></div><div class="line"><a name="l01000"></a><span class="lineno"><a class="line" href="a01541.html#a95f3b611c88f611e8bf7662d6b8db444"> 1000</a></span>  <a class="code" href="a01541.html#a95f3b611c88f611e8bf7662d6b8db444">__lg</a>(<span class="keywordtype">int</span> __n)</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  { <span class="keywordflow">return</span> (<span class="keywordtype">int</span>)<span class="keyword">sizeof</span>(int) * __CHAR_BIT__ - 1 - __builtin_clz(__n); }</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span> </div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  <span class="keyword">inline</span> _GLIBCXX_CONSTEXPR <span class="keywordtype">unsigned</span></div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <a class="code" href="a01541.html#a95f3b611c88f611e8bf7662d6b8db444">__lg</a>(<span class="keywordtype">unsigned</span> __n)</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  { <span class="keywordflow">return</span> (<span class="keywordtype">int</span>)<span class="keyword">sizeof</span>(int) * __CHAR_BIT__ - 1 - __builtin_clz(__n); }</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> </div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="keyword">inline</span> _GLIBCXX_CONSTEXPR <span class="keywordtype">long</span></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <a class="code" href="a01541.html#a95f3b611c88f611e8bf7662d6b8db444">__lg</a>(<span class="keywordtype">long</span> __n)</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  { <span class="keywordflow">return</span> (<span class="keywordtype">int</span>)<span class="keyword">sizeof</span>(long) * __CHAR_BIT__ - 1 - __builtin_clzl(__n); }</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span> </div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="keyword">inline</span> _GLIBCXX_CONSTEXPR <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span></div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <a class="code" href="a01541.html#a95f3b611c88f611e8bf7662d6b8db444">__lg</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> __n)</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  { <span class="keywordflow">return</span> (<span class="keywordtype">int</span>)<span class="keyword">sizeof</span>(long) * __CHAR_BIT__ - 1 - __builtin_clzl(__n); }</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span> </div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="keyword">inline</span> _GLIBCXX_CONSTEXPR <span class="keywordtype">long</span> <span class="keywordtype">long</span></div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <a class="code" href="a01541.html#a95f3b611c88f611e8bf7662d6b8db444">__lg</a>(<span class="keywordtype">long</span> <span class="keywordtype">long</span> __n)</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  { <span class="keywordflow">return</span> (<span class="keywordtype">int</span>)<span class="keyword">sizeof</span>(<span class="keywordtype">long</span> long) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); }</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span> </div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keyword">inline</span> _GLIBCXX_CONSTEXPR <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span></div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <a class="code" href="a01541.html#a95f3b611c88f611e8bf7662d6b8db444">__lg</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> __n)</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  { <span class="keywordflow">return</span> (<span class="keywordtype">int</span>)<span class="keyword">sizeof</span>(<span class="keywordtype">long</span> long) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); }</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> </div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> _GLIBCXX_BEGIN_NAMESPACE_ALGO</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span> <span class="comment"></span></div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span> <span class="comment"> /**</span></div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> <span class="comment"> * @brief Tests a range for element-wise equality.</span></div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span> <span class="comment"> * @ingroup non_mutating_algorithms</span></div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> <span class="comment"> * @param __first1 An input iterator.</span></div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span> <span class="comment"> * @param __last1 An input iterator.</span></div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span> <span class="comment"> * @param __first2 An input iterator.</span></div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span> <span class="comment"> * @return A boolean true or false.</span></div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> <span class="comment"> *</span></div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span> <span class="comment"> * This compares the elements of two ranges using @c == and returns true or</span></div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span> <span class="comment"> * false depending on whether all of the corresponding elements of the</span></div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> <span class="comment"> * ranges are equal.</span></div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span> <span class="comment"> */</span></div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2></div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01039"></a><span class="lineno"><a class="line" href="a01484.html#gad9f16258cd8b86bb63165c004cf660d5"> 1039</a></span>  equal(_II1 __first1, _II1 __last1, _II2 __first2)</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  {</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  __glibcxx_function_requires(_InputIteratorConcept<_II1>)</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  __glibcxx_function_requires(_InputIteratorConcept<_II2>)</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  __glibcxx_function_requires(_EqualOpConcept<</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  <span class="keyword">typename</span> iterator_traits<_II1>::value_type,</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="keyword">typename</span> iterator_traits<_II2>::value_type>)</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span> </div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keywordflow">return</span> std::__equal_aux(std::__niter_base(__first1),</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  std::__niter_base(__last1),</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  std::__niter_base(__first2));</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  }</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span> <span class="comment"></span></div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span> <span class="comment"> /**</span></div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span> <span class="comment"> * @brief Tests a range for element-wise equality.</span></div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span> <span class="comment"> * @ingroup non_mutating_algorithms</span></div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span> <span class="comment"> * @param __first1 An input iterator.</span></div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span> <span class="comment"> * @param __last1 An input iterator.</span></div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span> <span class="comment"> * @param __first2 An input iterator.</span></div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span> <span class="comment"> * @param __binary_pred A binary predicate @link functors</span></div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> <span class="comment"> * functor@endlink.</span></div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span> <span class="comment"> * @return A boolean true or false.</span></div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> <span class="comment"> *</span></div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span> <span class="comment"> * This compares the elements of two ranges using the binary_pred</span></div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> <span class="comment"> * parameter, and returns true or</span></div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span> <span class="comment"> * false depending on whether all of the corresponding elements of the</span></div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span> <span class="comment"> * ranges are equal.</span></div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span> <span class="comment"> */</span></div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</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="l01070"></a><span class="lineno"> 1070</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01071"></a><span class="lineno"><a class="line" href="a01484.html#ga444f163947d0a55953d1c317b31aee89"> 1071</a></span>  equal(_IIter1 __first1, _IIter1 __last1,</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  _IIter2 __first2, _BinaryPredicate __binary_pred)</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  {</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  __glibcxx_function_requires(_InputIteratorConcept<_IIter1>)</div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  __glibcxx_function_requires(_InputIteratorConcept<_IIter2>)</div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span> </div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="keywordflow">for</span> (; __first1 != __last1; ++__first1, (void)++__first2)</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="keywordflow">if</span> (!<span class="keywordtype">bool</span>(__binary_pred(*__first1, *__first2)))</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  }</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span> </div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <span class="comment">// 4-iterator version of std::equal<It1, It2> for use in C++11.</span></div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2></div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  __equal4(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2)</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  {</div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="keyword">using</span> _RATag = random_access_iterator_tag;</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <span class="keyword">using</span> _Cat1 = <span class="keyword">typename</span> iterator_traits<_II1>::iterator_category;</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keyword">using</span> _Cat2 = <span class="keyword">typename</span> iterator_traits<_II2>::iterator_category;</div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keyword">using</span> _RAIters = __and_<is_same<_Cat1, _RATag>, is_same<_Cat2, _RATag>>;</div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="keywordflow">if</span> (_RAIters())</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  {</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="keyword">auto</span> __d1 = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first1, __last1);</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="keyword">auto</span> __d2 = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first2, __last2);</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <span class="keywordflow">if</span> (__d1 != __d2)</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keywordflow">return</span> <a class="code" href="a01484.html#ga8e56a22bed21e9134369f4b2a47ba407">_GLIBCXX_STD_A::equal</a>(__first1, __last1, __first2);</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  }</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span> </div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  <span class="keywordflow">for</span> (; __first1 != __last1 && __first2 != __last2;</div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  ++__first1, (void)++__first2)</div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="keywordflow">if</span> (!(*__first1 == *__first2))</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="keywordflow">return</span> __first1 == __last1 && __first2 == __last2;</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  }</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span> </div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="comment">// 4-iterator version of std::equal<It1, It2, BinaryPred> for use in C++11.</span></div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2, <span class="keyword">typename</span> _BinaryPredicate></div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  __equal4(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2,</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  _BinaryPredicate __binary_pred)</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  {</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="keyword">using</span> _RATag = random_access_iterator_tag;</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keyword">using</span> _Cat1 = <span class="keyword">typename</span> iterator_traits<_II1>::iterator_category;</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="keyword">using</span> _Cat2 = <span class="keyword">typename</span> iterator_traits<_II2>::iterator_category;</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  <span class="keyword">using</span> _RAIters = __and_<is_same<_Cat1, _RATag>, is_same<_Cat2, _RATag>>;</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  <span class="keywordflow">if</span> (_RAIters())</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  {</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <span class="keyword">auto</span> __d1 = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first1, __last1);</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="keyword">auto</span> __d2 = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first2, __last2);</div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="keywordflow">if</span> (__d1 != __d2)</div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="keywordflow">return</span> <a class="code" href="a01484.html#ga8e56a22bed21e9134369f4b2a47ba407">_GLIBCXX_STD_A::equal</a>(__first1, __last1, __first2,</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  __binary_pred);</div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  }</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span> </div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  <span class="keywordflow">for</span> (; __first1 != __last1 && __first2 != __last2;</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  ++__first1, (void)++__first2)</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="keywordflow">if</span> (!<span class="keywordtype">bool</span>(__binary_pred(*__first1, *__first2)))</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  <span class="keywordflow">return</span> __first1 == __last1 && __first2 == __last2;</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  }</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span> <span class="preprocessor">#endif // C++11</span></div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span> </div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span> </div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span> <span class="preprocessor">#define __cpp_lib_robust_nonmodifying_seq_ops 201304</span></div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span> <span class="comment"></span></div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span> <span class="comment"> /**</span></div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span> <span class="comment"> * @brief Tests a range for element-wise equality.</span></div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span> <span class="comment"> * @ingroup non_mutating_algorithms</span></div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span> <span class="comment"> * @param __first1 An input iterator.</span></div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span> <span class="comment"> * @param __last1 An input iterator.</span></div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span> <span class="comment"> * @param __first2 An input iterator.</span></div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span> <span class="comment"> * @param __last2 An input iterator.</span></div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span> <span class="comment"> * @return A boolean true or false.</span></div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span> <span class="comment"> *</span></div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span> <span class="comment"> * This compares the elements of two ranges using @c == and returns true or</span></div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span> <span class="comment"> * false depending on whether all of the corresponding elements of the</span></div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span> <span class="comment"> * ranges are equal.</span></div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span> <span class="comment"> */</span></div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2></div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01158"></a><span class="lineno"><a class="line" href="a01484.html#ga89c2fd41282045655b0edaa54773d4db"> 1158</a></span>  equal(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2)</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  {</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  __glibcxx_function_requires(_InputIteratorConcept<_II1>)</div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  __glibcxx_function_requires(_InputIteratorConcept<_II2>)</div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  __glibcxx_function_requires(_EqualOpConcept<</div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <span class="keyword">typename</span> iterator_traits<_II1>::value_type,</div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  <span class="keyword">typename</span> iterator_traits<_II2>::value_type>)</div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  __glibcxx_requires_valid_range(__first2, __last2);</div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span> </div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::__equal4(__first1, __last1, __first2, __last2);</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  }</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span> <span class="comment"></span></div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span> <span class="comment"> /**</span></div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span> <span class="comment"> * @brief Tests a range for element-wise equality.</span></div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span> <span class="comment"> * @ingroup non_mutating_algorithms</span></div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span> <span class="comment"> * @param __first1 An input iterator.</span></div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span> <span class="comment"> * @param __last1 An input iterator.</span></div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span> <span class="comment"> * @param __first2 An input iterator.</span></div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span> <span class="comment"> * @param __last2 An input iterator.</span></div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span> <span class="comment"> * @param __binary_pred A binary predicate @link functors</span></div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span> <span class="comment"> * functor@endlink.</span></div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span> <span class="comment"> * @return A boolean true or false.</span></div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span> <span class="comment"> *</span></div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span> <span class="comment"> * This compares the elements of two ranges using the binary_pred</span></div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span> <span class="comment"> * parameter, and returns true or</span></div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span> <span class="comment"> * false depending on whether all of the corresponding elements of the</span></div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span> <span class="comment"> * ranges are equal.</span></div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span> <span class="comment"> */</span></div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</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="l01189"></a><span class="lineno"> 1189</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01190"></a><span class="lineno"><a class="line" href="a01484.html#ga8e56a22bed21e9134369f4b2a47ba407"> 1190</a></span>  equal(_IIter1 __first1, _IIter1 __last1,</div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  _IIter2 __first2, _IIter2 __last2, _BinaryPredicate __binary_pred)</div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  {</div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  __glibcxx_function_requires(_InputIteratorConcept<_IIter1>)</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  __glibcxx_function_requires(_InputIteratorConcept<_IIter2>)</div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  __glibcxx_requires_valid_range(__first2, __last2);</div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span> </div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::__equal4(__first1, __last1, __first2, __last2,</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  __binary_pred);</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  }</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span> <span class="preprocessor">#endif // C++14</span></div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span> <span class="comment"></span></div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span> <span class="comment"> /**</span></div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span> <span class="comment"> * @brief Performs @b dictionary comparison on ranges.</span></div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span> <span class="comment"> * @ingroup sorting_algorithms</span></div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span> <span class="comment"> * @param __first1 An input iterator.</span></div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span> <span class="comment"> * @param __last1 An input iterator.</span></div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span> <span class="comment"> * @param __first2 An input iterator.</span></div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span> <span class="comment"> * @param __last2 An input iterator.</span></div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span> <span class="comment"> * @return A boolean true or false.</span></div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span> <span class="comment"> *</span></div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span> <span class="comment"> * <em>Returns true if the sequence of elements defined by the range</span></div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span> <span class="comment"> * [first1,last1) is lexicographically less than the sequence of elements</span></div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span> <span class="comment"> * defined by the range [first2,last2). Returns false otherwise.</em></span></div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span> <span class="comment"> * (Quoted from [25.3.8]/1.) If the iterators are all character pointers,</span></div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span> <span class="comment"> * then this is an inline call to @c memcmp.</span></div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span> <span class="comment"> */</span></div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2></div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01221"></a><span class="lineno"><a class="line" href="a01485.html#ga869d1fd6bb4929ef491edbfdbcc9f7b9"> 1221</a></span>  lexicographical_compare(_II1 __first1, _II1 __last1,</div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  _II2 __first2, _II2 __last2)</div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  {</div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span> <span class="preprocessor">#ifdef _GLIBCXX_CONCEPT_CHECKS</span></div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_II1>::value_type _ValueType1;</div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> iterator_traits<_II2>::value_type _ValueType2;</div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  __glibcxx_function_requires(_InputIteratorConcept<_II1>)</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  __glibcxx_function_requires(_InputIteratorConcept<_II2>)</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>)</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>)</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  __glibcxx_requires_valid_range(__first2, __last2);</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span> </div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  <span class="keywordflow">return</span> std::__lexicographical_compare_aux(std::__niter_base(__first1),</div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  std::__niter_base(__last1),</div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  std::__niter_base(__first2),</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  std::__niter_base(__last2));</div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  }</div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span> <span class="comment"></span></div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span> <span class="comment"> /**</span></div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span> <span class="comment"> * @brief Performs @b dictionary comparison on ranges.</span></div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span> <span class="comment"> * @ingroup sorting_algorithms</span></div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span> <span class="comment"> * @param __first1 An input iterator.</span></div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span> <span class="comment"> * @param __last1 An input iterator.</span></div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span> <span class="comment"> * @param __first2 An input iterator.</span></div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span> <span class="comment"> * @param __last2 An input iterator.</span></div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span> <span class="comment"> * @param __comp A @link comparison_functors comparison functor@endlink.</span></div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span> <span class="comment"> * @return A boolean true or false.</span></div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span> <span class="comment"> *</span></div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span> <span class="comment"> * The same as the four-parameter @c lexicographical_compare, but uses the</span></div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span> <span class="comment"> * comp parameter instead of @c <.</span></div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span> <span class="comment"> */</span></div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _II1, <span class="keyword">typename</span> _II2, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01257"></a><span class="lineno"><a class="line" href="a01485.html#gae179ce2d015dc0908973644687dce4c6"> 1257</a></span>  lexicographical_compare(_II1 __first1, _II1 __last1,</div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  _II2 __first2, _II2 __last2, _Compare __comp)</div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  {</div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  __glibcxx_function_requires(_InputIteratorConcept<_II1>)</div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  __glibcxx_function_requires(_InputIteratorConcept<_II2>)</div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  __glibcxx_requires_valid_range(__first2, __last2);</div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span> </div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="keywordflow">return</span> std::__lexicographical_compare_impl</div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  (__first1, __last1, __first2, __last2,</div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  __gnu_cxx::__ops::__iter_comp_iter(__comp));</div><div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  }</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</span> </div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2,</div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  <span class="keyword">typename</span> _BinaryPredicate></div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  pair<_InputIterator1, _InputIterator2></div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  __mismatch(_InputIterator1 __first1, _InputIterator1 __last1,</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  _InputIterator2 __first2, _BinaryPredicate __binary_pred)</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  {</div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="keywordflow">while</span> (__first1 != __last1 && __binary_pred(__first1, __first2))</div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  {</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  ++__first1;</div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  ++__first2;</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  }</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  <span class="keywordflow">return</span> pair<_InputIterator1, _InputIterator2>(__first1, __first2);</div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  }</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span> <span class="comment"></span></div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span> <span class="comment"> /**</span></div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span> <span class="comment"> * @brief Finds the places in ranges which don't match.</span></div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span> <span class="comment"> * @ingroup non_mutating_algorithms</span></div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span> <span class="comment"> * @param __first1 An input iterator.</span></div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> <span class="comment"> * @param __last1 An input iterator.</span></div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span> <span class="comment"> * @param __first2 An input iterator.</span></div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span> <span class="comment"> * @return A pair of iterators pointing to the first mismatch.</span></div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span> <span class="comment"> *</span></div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span> <span class="comment"> * This compares the elements of two ranges using @c == and returns a pair</span></div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span> <span class="comment"> * of iterators. The first iterator points into the first range, the</span></div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span> <span class="comment"> * second iterator points into the second range, and the elements pointed</span></div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span> <span class="comment"> * to by the iterators are not equal.</span></div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span> <span class="comment"> */</span></div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2></div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <span class="keyword">inline</span> pair<_InputIterator1, _InputIterator2></div><div class="line"><a name="l01300"></a><span class="lineno"><a class="line" href="a01484.html#ga44ee120346d18fb398be3891eb4a8c0c"> 1300</a></span>  mismatch(_InputIterator1 __first1, _InputIterator1 __last1,</div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  _InputIterator2 __first2)</div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  {</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)</div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  __glibcxx_function_requires(_EqualOpConcept<</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  <span class="keyword">typename</span> iterator_traits<_InputIterator1>::value_type,</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  <span class="keyword">typename</span> iterator_traits<_InputIterator2>::value_type>)</div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span> </div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::__mismatch(__first1, __last1, __first2,</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  __gnu_cxx::__ops::__iter_equal_to_iter());</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  }</div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span> <span class="comment"></span></div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span> <span class="comment"> /**</span></div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span> <span class="comment"> * @brief Finds the places in ranges which don't match.</span></div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span> <span class="comment"> * @ingroup non_mutating_algorithms</span></div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span> <span class="comment"> * @param __first1 An input iterator.</span></div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span> <span class="comment"> * @param __last1 An input iterator.</span></div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span> <span class="comment"> * @param __first2 An input iterator.</span></div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span> <span class="comment"> * @param __binary_pred A binary predicate @link functors</span></div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span> <span class="comment"> * functor@endlink.</span></div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span> <span class="comment"> * @return A pair of iterators pointing to the first mismatch.</span></div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span> <span class="comment"> *</span></div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span> <span class="comment"> * This compares the elements of two ranges using the binary_pred</span></div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span> <span class="comment"> * parameter, and returns a pair</span></div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span> <span class="comment"> * of iterators. The first iterator points into the first range, the</span></div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span> <span class="comment"> * second iterator points into the second range, and the elements pointed</span></div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span> <span class="comment"> * to by the iterators are not equal.</span></div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span> <span class="comment"> */</span></div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2,</div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="keyword">typename</span> _BinaryPredicate></div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  <span class="keyword">inline</span> pair<_InputIterator1, _InputIterator2></div><div class="line"><a name="l01334"></a><span class="lineno"><a class="line" href="a01484.html#gad3cb7460f4803c1073882c89456bb75c"> 1334</a></span>  mismatch(_InputIterator1 __first1, _InputIterator1 __last1,</div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  _InputIterator2 __first2, _BinaryPredicate __binary_pred)</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  {</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)</div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span> </div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::__mismatch(__first1, __last1, __first2,</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  __gnu_cxx::__ops::__iter_comp_iter(__binary_pred));</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  }</div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span> </div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span> </div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2,</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <span class="keyword">typename</span> _BinaryPredicate></div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  pair<_InputIterator1, _InputIterator2></div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  __mismatch(_InputIterator1 __first1, _InputIterator1 __last1,</div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  _InputIterator2 __first2, _InputIterator2 __last2,</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  _BinaryPredicate __binary_pred)</div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  {</div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  <span class="keywordflow">while</span> (__first1 != __last1 && __first2 != __last2</div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  && __binary_pred(__first1, __first2))</div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  {</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  ++__first1;</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  ++__first2;</div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  }</div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="keywordflow">return</span> pair<_InputIterator1, _InputIterator2>(__first1, __first2);</div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  }</div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span> <span class="comment"></span></div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span> <span class="comment"> /**</span></div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span> <span class="comment"> * @brief Finds the places in ranges which don't match.</span></div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span> <span class="comment"> * @ingroup non_mutating_algorithms</span></div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span> <span class="comment"> * @param __first1 An input iterator.</span></div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span> <span class="comment"> * @param __last1 An input iterator.</span></div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span> <span class="comment"> * @param __first2 An input iterator.</span></div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span> <span class="comment"> * @param __last2 An input iterator.</span></div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span> <span class="comment"> * @return A pair of iterators pointing to the first mismatch.</span></div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span> <span class="comment"> *</span></div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span> <span class="comment"> * This compares the elements of two ranges using @c == and returns a pair</span></div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span> <span class="comment"> * of iterators. The first iterator points into the first range, the</span></div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span> <span class="comment"> * second iterator points into the second range, and the elements pointed</span></div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span> <span class="comment"> * to by the iterators are not equal.</span></div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span> <span class="comment"> */</span></div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2></div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  <span class="keyword">inline</span> pair<_InputIterator1, _InputIterator2></div><div class="line"><a name="l01380"></a><span class="lineno"><a class="line" href="a01484.html#ga67d3e43b97d25f32dd1661a93aa85ff1"> 1380</a></span>  mismatch(_InputIterator1 __first1, _InputIterator1 __last1,</div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  _InputIterator2 __first2, _InputIterator2 __last2)</div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  {</div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)</div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  __glibcxx_function_requires(_EqualOpConcept<</div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  <span class="keyword">typename</span> iterator_traits<_InputIterator1>::value_type,</div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  <span class="keyword">typename</span> iterator_traits<_InputIterator2>::value_type>)</div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  __glibcxx_requires_valid_range(__first2, __last2);</div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span> </div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::__mismatch(__first1, __last1, __first2, __last2,</div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  __gnu_cxx::__ops::__iter_equal_to_iter());</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  }</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span> <span class="comment"></span></div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span> <span class="comment"> /**</span></div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span> <span class="comment"> * @brief Finds the places in ranges which don't match.</span></div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span> <span class="comment"> * @ingroup non_mutating_algorithms</span></div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span> <span class="comment"> * @param __first1 An input iterator.</span></div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span> <span class="comment"> * @param __last1 An input iterator.</span></div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span> <span class="comment"> * @param __first2 An input iterator.</span></div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span> <span class="comment"> * @param __last2 An input iterator.</span></div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span> <span class="comment"> * @param __binary_pred A binary predicate @link functors</span></div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span> <span class="comment"> * functor@endlink.</span></div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span> <span class="comment"> * @return A pair of iterators pointing to the first mismatch.</span></div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span> <span class="comment"> *</span></div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span> <span class="comment"> * This compares the elements of two ranges using the binary_pred</span></div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span> <span class="comment"> * parameter, and returns a pair</span></div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span> <span class="comment"> * of iterators. The first iterator points into the first range, the</span></div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span> <span class="comment"> * second iterator points into the second range, and the elements pointed</span></div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span> <span class="comment"> * to by the iterators are not equal.</span></div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span> <span class="comment"> */</span></div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2,</div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  <span class="keyword">typename</span> _BinaryPredicate></div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  <span class="keyword">inline</span> pair<_InputIterator1, _InputIterator2></div><div class="line"><a name="l01416"></a><span class="lineno"><a class="line" href="a01484.html#ga07f5690e64fb9ece316f84ec99c28e5d"> 1416</a></span>  mismatch(_InputIterator1 __first1, _InputIterator1 __last1,</div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  _InputIterator2 __first2, _InputIterator2 __last2,</div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  _BinaryPredicate __binary_pred)</div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  {</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)</div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)</div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  __glibcxx_requires_valid_range(__first2, __last2);</div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span> </div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  <span class="keywordflow">return</span> _GLIBCXX_STD_A::__mismatch(__first1, __last1, __first2, __last2,</div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  __gnu_cxx::__ops::__iter_comp_iter(__binary_pred));</div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  }</div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span> </div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span> _GLIBCXX_END_NAMESPACE_ALGO</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span> </div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span> <span class="comment">// NB: This file is included within many other C++ includes, as a way</span></div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span> <span class="comment">// of getting the base algorithms. So, make sure that parallel bits</span></div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span> <span class="comment">// come in too if requested.</span></div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span> <span class="preprocessor">#ifdef _GLIBCXX_PARALLEL</span></div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span> <span class="preprocessor"># include <<a class="code" href="a00869.html">parallel/algobase.h</a>></span></div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span> </div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="a00422_html"><div class="ttname"><a href="a00422.html">move.h</a></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="a00356_html"><div class="ttname"><a href="a00356.html">functexcept.h</a></div></div>
<div class="ttc" id="a00656_html"><div class="ttname"><a href="a00656.html">c++config.h</a></div></div>
<div class="ttc" id="a17145_html"><div class="ttname"><a href="a17145.html">stl_iterator.h</a></div></div>
<div class="ttc" id="a01091_html"><div class="ttname"><a href="a01091.html">type_traits.h</a></div></div>
<div class="ttc" id="a01483_html_gaedffc88b77674cbf9966e30a9c275bb6"><div class="ttname"><a href="a01483.html#gaedffc88b77674cbf9966e30a9c275bb6">std::move</a></div><div class="ttdeci">_OI move(_II __first, _II __last, _OI __result)</div><div class="ttdoc">Moves the range [first,last) into result.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00479">stl_algobase.h:479</a></div></div>
<div class="ttc" id="a01541_html_aeb89c7ad75934cae5b0970b922879fdb"><div class="ttname"><a href="a01541.html#aeb89c7ad75934cae5b0970b922879fdb">std::advance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR void advance(_InputIterator &__i, _Distance __n)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00202">stl_iterator_base_funcs.h:202</a></div></div>
<div class="ttc" id="a00443_html"><div class="ttname"><a href="a00443.html">predefined_ops.h</a></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="a01485_html_gad48656de2f272a953455e1fff2532125"><div class="ttname"><a href="a01485.html#gad48656de2f272a953455e1fff2532125">std::min</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR const _Tp & min(const _Tp &, const _Tp &)</div><div class="ttdoc">This does what you think it does.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00195">stl_algobase.h:195</a></div></div>
<div class="ttc" id="a00746_html"><div class="ttname"><a href="a00746.html">debug.h</a></div></div>
<div class="ttc" id="a01483_html_ga894f503412130680dc19c87af289f4f4"><div class="ttname"><a href="a01483.html#ga894f503412130680dc19c87af289f4f4">std::copy</a></div><div class="ttdeci">_OI copy(_II __first, _II __last, _OI __result)</div><div class="ttdoc">Copies the range [first,last) into result.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00446">stl_algobase.h:446</a></div></div>
<div class="ttc" id="a01483_html_gad93e66478d9a63e5777733be09931388"><div class="ttname"><a href="a01483.html#gad93e66478d9a63e5777733be09931388">std::iter_swap</a></div><div class="ttdeci">void iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b)</div><div class="ttdoc">Swaps the contents of two iterators.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00120">stl_algobase.h:120</a></div></div>
<div class="ttc" id="a01058_html"><div class="ttname"><a href="a01058.html">numeric_traits.h</a></div></div>
<div class="ttc" id="a00554_html"><div class="ttname"><a href="a00554.html">stl_iterator_base_types.h</a></div></div>
<div class="ttc" id="a01541_html_a95f3b611c88f611e8bf7662d6b8db444"><div class="ttname"><a href="a01541.html#a95f3b611c88f611e8bf7662d6b8db444">std::__lg</a></div><div class="ttdeci">constexpr int __lg(int __n)</div><div class="ttdoc">This is a helper function for the sort routines and for random.tcc.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l01000">stl_algobase.h:1000</a></div></div>
<div class="ttc" id="a00311_html"><div class="ttname"><a href="a00311.html">cpp_type_traits.h</a></div></div>
<div class="ttc" id="a00869_html"><div class="ttname"><a href="a00869.html">algobase.h</a></div><div class="ttdoc">Parallel STL function calls corresponding to the stl_algobase.h header. The functions defined here ma...</div></div>
<div class="ttc" id="a00308_html"><div class="ttname"><a href="a00308.html">concept_check.h</a></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="a01484_html_ga8e56a22bed21e9134369f4b2a47ba407"><div class="ttname"><a href="a01484.html#ga8e56a22bed21e9134369f4b2a47ba407">std::equal</a></div><div class="ttdeci">bool equal(_IIter1 __first1, _IIter1 __last1, _IIter2 __first2, _IIter2 __last2, _BinaryPredicate __binary_pred)</div><div class="ttdoc">Tests a range for element-wise equality.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l01190">stl_algobase.h:1190</a></div></div>
<div class="ttc" id="a00551_html"><div class="ttname"><a href="a00551.html">stl_iterator_base_funcs.h</a></div></div>
<div class="ttc" id="a01485_html_ga84d30d8c4b3f2cbe8ec2055c34a578da"><div class="ttname"><a href="a01485.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">std::max</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR const _Tp & max(const _Tp &, const _Tp &)</div><div class="ttdoc">This does what you think it does.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00219">stl_algobase.h:219</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_d56d7bef09446c5da887ab10055bb2f4.html">bits</a></li><li class="navelem"><a class="el" href="a00530.html">stl_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
>
485
