<!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++: algorithm 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('a16458_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">ext/algorithm</div> </div>
</div><!--header-->
<div class="contents">
<a href="a16458.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">// Algorithm extensions -*- 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</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 ext/algorithm</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * This file is a GNU extension to the Standard C++ Library (possibly</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * containing extensions from the HP/SGI STL subset).</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 _EXT_ALGORITHM</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _EXT_ALGORITHM 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">#pragma GCC system_header</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> </div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#include <<a class="code" href="a16458.html">algorithm</a>></span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="keyword">namespace </span><a class="code" href="a01544.html">__gnu_cxx</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> {</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keyword">using</span> std::ptrdiff_t;</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">using</span> <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a>;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">using</span> <a class="code" href="a07764.html">std::pair</a>;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keyword">using</span> <a class="code" href="a07652.html">std::input_iterator_tag</a>;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">using</span> <a class="code" href="a07668.html">std::random_access_iterator_tag</a>;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">using</span> std::iterator_traits;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">//--------------------------------------------------</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="comment">// copy_n (not part of the C++ standard)</span></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="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Size, <span class="keyword">typename</span> _OutputIterator></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  pair<_InputIterator, _OutputIterator></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  __copy_n(_InputIterator __first, _Size __count,</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  _OutputIterator __result,</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  input_iterator_tag)</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  {</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">for</span> ( ; __count > 0; --__count)</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  *__result = *__first;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  ++__first;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  ++__result;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">return</span> pair<_InputIterator, _OutputIterator>(__first, __result);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RAIterator, <span class="keyword">typename</span> _Size, <span class="keyword">typename</span> _OutputIterator></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">inline</span> pair<_RAIterator, _OutputIterator></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  __copy_n(_RAIterator __first, _Size __count,</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  _OutputIterator __result,</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  random_access_iterator_tag)</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  _RAIterator __last = __first + __count;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">return</span> pair<_RAIterator, _OutputIterator>(__last, std::copy(__first,</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  __last,</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  __result));</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"></span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> /**</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"> * @brief Copies the range [first,first+count) into [result,result+count).</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"> * @param __count The number of elements to copy.</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> * @param __result An output iterator.</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> * @return A std::pair composed of first+count and result+count.</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> *</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> * This is an SGI extension.</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> * This inline function will boil down to a call to @c memmove whenever</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> * possible. Failing that, if random access iterators are passed, then the</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> * loop count will be known (and therefore a candidate for compiler</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> * optimizations such as unrolling).</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> * @ingroup SGIextensions</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> _InputIterator, <span class="keyword">typename</span> _Size, <span class="keyword">typename</span> _OutputIterator></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">inline</span> pair<_InputIterator, _OutputIterator></div><div class="line"><a name="l00120"></a><span class="lineno"><a class="line" href="a01459.html#ga72c21e0f95b2b3cb6ea2785ee4108b01"> 120</a></span>  <a class="code" href="a01459.html#ga72c21e0f95b2b3cb6ea2785ee4108b01">copy_n</a>(_InputIterator __first, _Size __count, _OutputIterator __result)</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(_InputIteratorConcept<_InputIterator>)</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type>)</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">return</span> __gnu_cxx::__copy_n(__first, __count, __result,</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <a class="code" href="a01504.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a>(__first));</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordtype">int</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  __lexicographical_compare_3way(_InputIterator1 __first1,</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  _InputIterator1 __last1,</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  _InputIterator2 __first2,</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  _InputIterator2 __last2)</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  {</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">while</span> (__first1 != __last1 && __first2 != __last2)</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  {</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">if</span> (*__first1 < *__first2)</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">if</span> (*__first2 < *__first1)</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  ++__first1;</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  ++__first2;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  }</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">if</span> (__first2 == __last2)</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">return</span> !(__first1 == __last1);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">return</span> -1;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  }</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">inline</span> <span class="keywordtype">int</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  __lexicographical_compare_3way(<span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* __first1,</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* __last1,</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* __first2,</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* __last2)</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  {</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">const</span> ptrdiff_t __len1 = __last1 - __first1;</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keyword">const</span> ptrdiff_t __len2 = __last2 - __first2;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> __result = __builtin_memcmp(__first1, __first2,</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">min</a>(__len1, __len2));</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">return</span> __result != 0 ? __result</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  : (__len1 == __len2 ? 0 : (__len1 < __len2 ? -1 : 1));</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  }</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> </div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">inline</span> <span class="keywordtype">int</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  __lexicographical_compare_3way(<span class="keyword">const</span> <span class="keywordtype">char</span>* __first1, <span class="keyword">const</span> <span class="keywordtype">char</span>* __last1,</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keyword">const</span> <span class="keywordtype">char</span>* __first2, <span class="keyword">const</span> <span class="keywordtype">char</span>* __last2)</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  {</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="preprocessor">#if CHAR_MAX == SCHAR_MAX</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">return</span> __lexicographical_compare_3way((<span class="keyword">const</span> <span class="keywordtype">signed</span> <span class="keywordtype">char</span>*) __first1,</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  (<span class="keyword">const</span> <span class="keywordtype">signed</span> <span class="keywordtype">char</span>*) __last1,</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  (<span class="keyword">const</span> <span class="keywordtype">signed</span> <span class="keywordtype">char</span>*) __first2,</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  (<span class="keyword">const</span> <span class="keywordtype">signed</span> <span class="keywordtype">char</span>*) __last2);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">return</span> __lexicographical_compare_3way((<span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*) __first1,</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  (<span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*) __last1,</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  (<span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*) __first2,</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  (<span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*) __last2);</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"></span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"> /**</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> * @brief @c memcmp on steroids.</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="comment"> * @param __first1 An input iterator.</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="comment"> * @param __last1 An input iterator.</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="comment"> * @param __first2 An input iterator.</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="comment"> * @param __last2 An input iterator.</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"> * @return An int, as with @c memcmp.</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="comment"> * The return value will be less than zero if the first range is</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> * <em>lexigraphically less than</em> the second, greater than zero</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"> * if the second range is <em>lexigraphically less than</em> the</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"> * first, and zero otherwise.</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> * This is an SGI extension.</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"> * @ingroup SGIextensions</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> */</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator1, <span class="keyword">typename</span> _InputIterator2></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordtype">int</span></div><div class="line"><a name="l00201"></a><span class="lineno"><a class="line" href="a01459.html#gadd7eb026c10d4a6929b8c61d0501bdee"> 201</a></span>  <a class="code" href="a01459.html#gadd7eb026c10d4a6929b8c61d0501bdee">lexicographical_compare_3way</a>(_InputIterator1 __first1,</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  _InputIterator1 __last1,</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  _InputIterator2 __first2,</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  _InputIterator2 __last2)</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  {</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  __glibcxx_function_requires(_LessThanComparableConcept<</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">typename</span> iterator_traits<_InputIterator1>::value_type>)</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  __glibcxx_function_requires(_LessThanComparableConcept<</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">typename</span> iterator_traits<_InputIterator2>::value_type>)</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  __glibcxx_requires_valid_range(__first1, __last1);</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  __glibcxx_requires_valid_range(__first2, __last2);</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> </div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">return</span> __lexicographical_compare_3way(__first1, __last1, __first2,</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  __last2);</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  }</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> </div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="comment">// count and count_if: this version, whose return type is void, was present</span></div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">// in the HP STL, and is retained as an extension for backward compatibility.</span></div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Size></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  count(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keyword">const</span> _Tp& __value,</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  _Size& __n)</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">// concept requirements</span></div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  __glibcxx_function_requires(_EqualityComparableConcept<</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type >)</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  __glibcxx_function_requires(_EqualityComparableConcept<_Tp>)</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  for ( ; __first != __last; ++__first)</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  if (*__first == __value)</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  ++__n;</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> </div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  template<typename _InputIterator, typename _Predicate, typename _Size></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  count_if(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  _Predicate __pred,</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  _Size& __n)</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  {</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate,</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keyword">typename</span> iterator_traits<_InputIterator>::value_type>)</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> </div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  for ( ; __first != __last; ++__first)</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  if (__pred(*__first))</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  ++__n;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> </div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">// random_sample and random_sample_n (extensions, not part of the standard).</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"> /**</span></div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment"> * This is an SGI extension.</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"> * @ingroup SGIextensions</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> * @doctodo</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"> */</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  template<typename _ForwardIterator, typename _OutputIterator,</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  typename _Distance></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  _OutputIterator</div><div class="line"><a name="l00267"></a><span class="lineno"><a class="line" href="a01459.html#ga4992181b3aa066878aff43c4bfb84ae5"> 267</a></span>  <a class="code" href="a01459.html#ga4992181b3aa066878aff43c4bfb84ae5">random_sample_n</a>(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  _OutputIterator __out, const _Distance __n)</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  {</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keyword">typename</span> iterator_traits<_ForwardIterator>::value_type>)</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  _Distance __remaining = <a class="code" href="a01538.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last);</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  _Distance __m = <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">min</a>(__n, __remaining);</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> </div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">while</span> (__m > 0)</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  {</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">if</span> ((std::rand() % __remaining) < __m)</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  {</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  *__out = *__first;</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  ++__out;</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  --__m;</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  }</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  --__remaining;</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  ++__first;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">return</span> __out;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="comment"></span></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="comment"> /**</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment"> * This is an SGI extension.</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"> * @ingroup SGIextensions</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment"> * @doctodo</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="comment"> */</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _OutputIterator,</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keyword">typename</span> _Distance, <span class="keyword">typename</span> _RandomNumberGenerator></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  _OutputIterator</div><div class="line"><a name="l00301"></a><span class="lineno"><a class="line" href="a01459.html#gafa6f89a01277d183380798fae9826172"> 301</a></span>  <a class="code" href="a01459.html#ga4992181b3aa066878aff43c4bfb84ae5">random_sample_n</a>(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  _OutputIterator __out, <span class="keyword">const</span> _Distance __n,</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  _RandomNumberGenerator& __rand)</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  {</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keyword">typename</span> iterator_traits<_ForwardIterator>::value_type>)</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  __glibcxx_function_requires(_UnaryFunctionConcept<</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  _RandomNumberGenerator, _Distance, _Distance>)</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> </div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  _Distance __remaining = <a class="code" href="a01538.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__first, __last);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  _Distance __m = <a class="code" href="a01482.html#gad48656de2f272a953455e1fff2532125">min</a>(__n, __remaining);</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> </div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">while</span> (__m > 0)</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  {</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">if</span> (__rand(__remaining) < __m)</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  {</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  *__out = *__first;</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  ++__out;</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  --__m;</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>  --__remaining;</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>  }</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">return</span> __out;</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  }</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> </div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _RandomAccessIterator,</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keyword">typename</span> _Distance></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  _RandomAccessIterator</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  __random_sample(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  _RandomAccessIterator __out,</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keyword">const</span> _Distance __n)</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  {</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  _Distance __m = 0;</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  _Distance __t = __n;</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">for</span> ( ; __first != __last && __m < __n; ++__m, ++__first)</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  __out[__m] = *__first;</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> </div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">while</span> (__first != __last)</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  {</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  ++__t;</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  _Distance __M = std::rand() % (__t);</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">if</span> (__M < __n)</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  __out[__M] = *__first;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  ++__first;</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="keywordflow">return</span> __out + __m;</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> </div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _RandomAccessIterator,</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keyword">typename</span> _RandomNumberGenerator, <span class="keyword">typename</span> _Distance></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  _RandomAccessIterator</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  __random_sample(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  _RandomAccessIterator __out,</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  _RandomNumberGenerator& __rand,</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">const</span> _Distance __n)</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  {</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  __glibcxx_function_requires(_UnaryFunctionConcept<</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  _RandomNumberGenerator, _Distance, _Distance>)</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> </div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  _Distance __m = 0;</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  _Distance __t = __n;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  for ( ; __first != __last && __m < __n; ++__m, ++__first)</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  __out[__m] = *__first;</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> </div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  while (__first != __last)</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>  ++__t;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  _Distance __M = __rand(__t);</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">if</span> (__M < __n)</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  __out[__M] = *__first;</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  ++__first;</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  }</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">return</span> __out + __m;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  }</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="comment"></span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment"> /**</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment"> * This is an SGI extension.</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment"> * @ingroup SGIextensions</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="comment"> * @doctodo</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="comment"> */</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _RandomAccessIterator></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keyword">inline</span> _RandomAccessIterator</div><div class="line"><a name="l00388"></a><span class="lineno"><a class="line" href="a01459.html#ga5ebfe3733a0ab6455f0fc33dce0aedc1"> 388</a></span>  <a class="code" href="a01459.html#ga5ebfe3733a0ab6455f0fc33dce0aedc1">random_sample</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  _RandomAccessIterator __out_first,</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  _RandomAccessIterator __out_last)</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  {</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  __glibcxx_requires_valid_range(__out_first, __out_last);</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> </div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">return</span> __random_sample(__first, __last,</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  __out_first, __out_last - __out_first);</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  }</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="comment"></span></div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="comment"> /**</span></div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> <span class="comment"> * This is an SGI extension.</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="comment"> * @ingroup SGIextensions</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="comment"> * @doctodo</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="comment"> */</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator, <span class="keyword">typename</span> _RandomAccessIterator,</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keyword">typename</span> _RandomNumberGenerator></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keyword">inline</span> _RandomAccessIterator</div><div class="line"><a name="l00411"></a><span class="lineno"><a class="line" href="a01459.html#ga78e35bfad53c1a60a52486366d7f1f4e"> 411</a></span>  <a class="code" href="a01459.html#ga5ebfe3733a0ab6455f0fc33dce0aedc1">random_sample</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  _RandomAccessIterator __out_first,</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  _RandomAccessIterator __out_last,</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  _RandomNumberGenerator& __rand)</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  {</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>)</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept<</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  __glibcxx_requires_valid_range(__out_first, __out_last);</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordflow">return</span> __random_sample(__first, __last,</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  __out_first, __rand,</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  __out_last - __out_first);</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  }</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> </div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="keyword">using</span> std::is_heap;</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> <span class="comment"> /**</span></div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="comment"> * This is an SGI extension.</span></div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment"> * @ingroup SGIextensions</span></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment"> * @doctodo</span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment"> */</span></div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RandomAccessIterator></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last)</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  {</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  __glibcxx_function_requires(_RandomAccessIteratorConcept<</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  __glibcxx_function_requires(_LessThanComparableConcept<</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  typename iterator_traits<_RandomAccessIterator>::value_type>)</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> </div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  return <a class="code" href="a01538.html">std</a>::__is_heap(__first, __last - __first);</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  }</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <span class="comment"></span></div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="comment"> /**</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="comment"> * This is an SGI extension.</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <span class="comment"> * @ingroup SGIextensions</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> <span class="comment"> * @doctodo</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> <span class="comment"> */</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  template<typename _RandomAccessIterator, typename _StrictWeakOrdering></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  inline <span class="keywordtype">bool</span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  _StrictWeakOrdering __comp)</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  {</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  __glibcxx_function_requires(_RandomAccessIteratorConcept<</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  _RandomAccessIterator>)</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  __glibcxx_function_requires(_BinaryPredicateConcept<_StrictWeakOrdering,</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  typename iterator_traits<_RandomAccessIterator>::value_type,</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  typename iterator_traits<_RandomAccessIterator>::value_type>)</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> </div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  return <a class="code" href="a01538.html">std</a>::__is_heap(__first, __comp, __last - __first);</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  }</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> </div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keyword">using</span> std::is_sorted;</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="comment">// is_sorted, a predicated testing whether a range is sorted in</span></div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="comment">// nondescending order. This is an extension, not part of the C++</span></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="comment">// standard.</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span> <span class="comment"></span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> <span class="comment"> /**</span></div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span> <span class="comment"> * This is an SGI extension.</span></div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span> <span class="comment"> * @ingroup SGIextensions</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span> <span class="comment"> * @doctodo</span></div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> <span class="comment"> */</span></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator></div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  is_sorted(_ForwardIterator __first, _ForwardIterator __last)</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  {</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  __glibcxx_function_requires(_LessThanComparableConcept<</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keyword">typename</span> iterator_traits<_ForwardIterator>::value_type>)</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  __glibcxx_requires_valid_range(__first, __last);</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> </div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  if (__first == __last)</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  return true;</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span> </div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  _ForwardIterator __next = __first;</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  for (++__next; __next != __last; __first = __next, ++__next)</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  if (*__next < *__first)</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  return false;</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  return true;</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="comment"></span></div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span> <span class="comment"> /**</span></div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> <span class="comment"> * This is an SGI extension.</span></div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span> <span class="comment"> * @ingroup SGIextensions</span></div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> <span class="comment"> * @doctodo</span></div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="comment"> */</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  template<typename _ForwardIterator, typename _StrictWeakOrdering></div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  is_sorted(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  _StrictWeakOrdering __comp)</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  {</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>)</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  __glibcxx_function_requires(_BinaryPredicateConcept<_StrictWeakOrdering,</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keyword">typename</span> iterator_traits<_ForwardIterator>::value_type,</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keyword">typename</span> iterator_traits<_ForwardIterator>::value_type>)</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  __glibcxx_requires_valid_range(__first, __last);</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>  if (__first == __last)</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  return true;</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>  _ForwardIterator __next = __first;</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  for (++__next; __next != __last; __first = __next, ++__next)</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  if (__comp(*__next, *__first))</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  return false;</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  return true;</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  }</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <span class="preprocessor">#endif // C++11</span></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> <span class="comment"></span></div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> <span class="comment"> /**</span></div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span> <span class="comment"> * @brief Find the median of three values.</span></div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> <span class="comment"> * @param __a A value.</span></div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="comment"> * @param __b A value.</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> <span class="comment"> * @param __c A value.</span></div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="comment"> * @return One of @p a, @p b or @p c.</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="comment"> *</span></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="comment"> * If @c {l,m,n} is some convolution of @p {a,b,c} such that @c l<=m<=n</span></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <span class="comment"> * then the value returned will be @c m.</span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="comment"> * This is an SGI extension.</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="comment"> * @ingroup SGIextensions</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span> <span class="comment"> */</span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keyword">const</span> _Tp&</div><div class="line"><a name="l00546"></a><span class="lineno"><a class="line" href="a01459.html#ga0b1bd4fe66e82c6d9d2257570aea3f07"> 546</a></span>  <a class="code" href="a01459.html#ga0b1bd4fe66e82c6d9d2257570aea3f07">__median</a>(<span class="keyword">const</span> _Tp& __a, <span class="keyword">const</span> _Tp& __b, <span class="keyword">const</span> _Tp& __c)</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  {</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  __glibcxx_function_requires(_LessThanComparableConcept<_Tp>)</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keywordflow">if</span> (__a < __b)</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="keywordflow">if</span> (__b < __c)</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordflow">return</span> __b;</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__a < __c)</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordflow">return</span> __c;</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">return</span> __a;</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__a < __c)</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">return</span> __a;</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__b < __c)</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">return</span> __c;</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keywordflow">return</span> __b;</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  }</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="comment"></span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="comment"> /**</span></div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> <span class="comment"> * @brief Find the median of three values using a predicate for comparison.</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="comment"> * @param __a A value.</span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> <span class="comment"> * @param __b A value.</span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="comment"> * @param __c A value.</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> <span class="comment"> * @param __comp A binary predicate.</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> <span class="comment"> * @return One of @p a, @p b or @p c.</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> <span class="comment"> *</span></div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span> <span class="comment"> * If @c {l,m,n} is some convolution of @p {a,b,c} such that @p comp(l,m)</span></div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> <span class="comment"> * and @p comp(m,n) are both true then the value returned will be @c m.</span></div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> <span class="comment"> * This is an SGI extension.</span></div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span> <span class="comment"> * @ingroup SGIextensions</span></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="comment"> */</span></div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keyword">const</span> _Tp&</div><div class="line"><a name="l00580"></a><span class="lineno"><a class="line" href="a01459.html#gab2ccdd18aa0ed8eb2757efc6786f7481"> 580</a></span>  <a class="code" href="a01459.html#ga0b1bd4fe66e82c6d9d2257570aea3f07">__median</a>(<span class="keyword">const</span> _Tp& __a, <span class="keyword">const</span> _Tp& __b, <span class="keyword">const</span> _Tp& __c, _Compare __comp)</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  {</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  __glibcxx_function_requires(_BinaryFunctionConcept<_Compare, <span class="keywordtype">bool</span>,</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  _Tp, _Tp>)</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordflow">if</span> (__comp(__a, __b))</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordflow">if</span> (__comp(__b, __c))</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">return</span> __b;</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__comp(__a, __c))</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">return</span> __c;</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">return</span> __a;</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__comp(__a, __c))</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keywordflow">return</span> __a;</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__comp(__b, __c))</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordflow">return</span> __c;</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">return</span> __b;</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  }</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> </div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> </div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="preprocessor">#endif </span><span class="comment">/* _EXT_ALGORITHM */</span><span class="preprocessor"></span></div><div class="ttc" id="a01459_html_ga4992181b3aa066878aff43c4bfb84ae5"><div class="ttname"><a href="a01459.html#ga4992181b3aa066878aff43c4bfb84ae5">__gnu_cxx::random_sample_n</a></div><div class="ttdeci">_OutputIterator random_sample_n(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __out, const _Distance __n)</div><div class="ttdef"><b>Definition:</b> <a href="a16458_source.html#l00267">ext/algorithm:267</a></div></div>
<div class="ttc" id="a01459_html_ga72c21e0f95b2b3cb6ea2785ee4108b01"><div class="ttname"><a href="a01459.html#ga72c21e0f95b2b3cb6ea2785ee4108b01">__gnu_cxx::copy_n</a></div><div class="ttdeci">pair< _InputIterator, _OutputIterator > copy_n(_InputIterator __first, _Size __count, _OutputIterator __result)</div><div class="ttdoc">Copies the range [first,first+count) into [result,result+count).</div><div class="ttdef"><b>Definition:</b> <a href="a16458_source.html#l00120">ext/algorithm:120</a></div></div>
<div class="ttc" id="a01544_html"><div class="ttname"><a href="a01544.html">__gnu_cxx</a></div><div class="ttdoc">GNU extensions for public use.</div></div>
<div class="ttc" id="a01459_html_ga0b1bd4fe66e82c6d9d2257570aea3f07"><div class="ttname"><a href="a01459.html#ga0b1bd4fe66e82c6d9d2257570aea3f07">__gnu_cxx::__median</a></div><div class="ttdeci">const _Tp & __median(const _Tp &__a, const _Tp &__b, const _Tp &__c)</div><div class="ttdoc">Find the median of three values.</div><div class="ttdef"><b>Definition:</b> <a href="a16458_source.html#l00546">ext/algorithm:546</a></div></div>
<div class="ttc" id="a07652_html"><div class="ttname"><a href="a07652.html">std::input_iterator_tag</a></div><div class="ttdoc">Marking input iterators.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00089">stl_iterator_base_types.h:89</a></div></div>
<div class="ttc" id="a01538_html"><div class="ttname"><a href="a01538.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div>
<div class="ttc" id="a01538_html_a99b049793a96260d190d781f847038bc"><div class="ttname"><a href="a01538.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="a01482_html_gad48656de2f272a953455e1fff2532125"><div class="ttname"><a href="a01482.html#gad48656de2f272a953455e1fff2532125">std::min</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR const _Tp & min(const _Tp &, const _Tp &)</div><div class="ttdoc">This does what you think it does.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00195">stl_algobase.h:195</a></div></div>
<div class="ttc" id="a01459_html_gadd7eb026c10d4a6929b8c61d0501bdee"><div class="ttname"><a href="a01459.html#gadd7eb026c10d4a6929b8c61d0501bdee">__gnu_cxx::lexicographical_compare_3way</a></div><div class="ttdeci">int lexicographical_compare_3way(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2)</div><div class="ttdoc">memcmp on steroids.</div><div class="ttdef"><b>Definition:</b> <a href="a16458_source.html#l00201">ext/algorithm:201</a></div></div>
<div class="ttc" id="a01459_html_ga5ebfe3733a0ab6455f0fc33dce0aedc1"><div class="ttname"><a href="a01459.html#ga5ebfe3733a0ab6455f0fc33dce0aedc1">__gnu_cxx::random_sample</a></div><div class="ttdeci">_RandomAccessIterator random_sample(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __out_first, _RandomAccessIterator __out_last)</div><div class="ttdef"><b>Definition:</b> <a href="a16458_source.html#l00388">ext/algorithm:388</a></div></div>
<div class="ttc" id="a07668_html"><div class="ttname"><a href="a07668.html">std::random_access_iterator_tag</a></div><div class="ttdoc">Random-access iterators support a superset of bidirectional iterator operations.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00103">stl_iterator_base_types.h:103</a></div></div>
<div class="ttc" id="a01504_html_ga89d3a7d239086516917bb7f6f9da213c"><div class="ttname"><a href="a01504.html#ga89d3a7d239086516917bb7f6f9da213c">std::__iterator_category</a></div><div class="ttdeci">constexpr iterator_traits< _Iter >::iterator_category __iterator_category(const _Iter &)</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00205">stl_iterator_base_types.h:205</a></div></div>
<div class="ttc" id="a16458_html"><div class="ttname"><a href="a16458.html">algorithm</a></div></div>
<div class="ttc" id="a07764_html"><div class="ttname"><a href="a07764.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00208">stl_pair.h:208</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_d6815ee4ad7be618f033845800be3017.html">ext</a></li><li class="navelem"><a class="el" href="a16458.html">algorithm</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>
