diff options
Diffstat (limited to 'rep/usr/include/c++/4.3/bits/stl_algo.h.gcov.html')
| -rw-r--r-- | rep/usr/include/c++/4.3/bits/stl_algo.h.gcov.html | 5703 |
1 files changed, 0 insertions, 5703 deletions
diff --git a/rep/usr/include/c++/4.3/bits/stl_algo.h.gcov.html b/rep/usr/include/c++/4.3/bits/stl_algo.h.gcov.html deleted file mode 100644 index bb0c409..0000000 --- a/rep/usr/include/c++/4.3/bits/stl_algo.h.gcov.html +++ /dev/null @@ -1,5703 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> - -<html lang="en"> - -<head> - <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> - <title>LCOV - lcov.info - /usr/include/c++/4.3/bits/stl_algo.h</title> - <link rel="stylesheet" type="text/css" href="../../../../../gcov.css"> -</head> - -<body> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="title">LTP GCOV extension - code coverage report</td></tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - - <tr> - <td width="100%"> - <table cellpadding=1 border=0 width="100%"> - <tr> - <td class="headerItem" width="20%">Current view:</td> - <td class="headerValue" width="80%" colspan=4><a href="../../../../../index.html">directory</a> - <a href="index.html">usr/include/c++/4.3/bits</a> - stl_algo.h</td> - </tr> - <tr> - <td class="headerItem" width="20%">Test:</td> - <td class="headerValue" width="80%" colspan=4>lcov.info</td> - </tr> - <tr> - <td class="headerItem" width="20%">Date:</td> - <td class="headerValue" width="20%">2008-08-14</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Instrumented lines:</td> - <td class="headerValue" width="20%">226</td> - </tr> - <tr> - <td class="headerItem" width="20%">Code covered:</td> - <td class="headerValue" width="20%">85.0 %</td> - <td width="20%"></td> - <td class="headerItem" width="20%">Executed lines:</td> - <td class="headerValue" width="20%">192</td> - </tr> - </table> - </td> - </tr> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - </table> - - <table cellpadding=0 cellspacing=0 border=0> - <tr> - <td><br></td> - </tr> - <tr> - <td><pre class="source"> -<span class="lineNum"> 1 </span> : // Algorithm implementation -*- C++ -*- -<span class="lineNum"> 2 </span> : -<span class="lineNum"> 3 </span> : // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 -<span class="lineNum"> 4 </span> : // Free Software Foundation, Inc. -<span class="lineNum"> 5 </span> : // -<span class="lineNum"> 6 </span> : // This file is part of the GNU ISO C++ Library. This library is free -<span class="lineNum"> 7 </span> : // software; you can redistribute it and/or modify it under the -<span class="lineNum"> 8 </span> : // terms of the GNU General Public License as published by the -<span class="lineNum"> 9 </span> : // Free Software Foundation; either version 2, or (at your option) -<span class="lineNum"> 10 </span> : // any later version. -<span class="lineNum"> 11 </span> : -<span class="lineNum"> 12 </span> : // This library is distributed in the hope that it will be useful, -<span class="lineNum"> 13 </span> : // but WITHOUT ANY WARRANTY; without even the implied warranty of -<span class="lineNum"> 14 </span> : // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -<span class="lineNum"> 15 </span> : // GNU General Public License for more details. -<span class="lineNum"> 16 </span> : -<span class="lineNum"> 17 </span> : // You should have received a copy of the GNU General Public License along -<span class="lineNum"> 18 </span> : // with this library; see the file COPYING. If not, write to the Free -<span class="lineNum"> 19 </span> : // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, -<span class="lineNum"> 20 </span> : // USA. -<span class="lineNum"> 21 </span> : -<span class="lineNum"> 22 </span> : // As a special exception, you may use this file as part of a free software -<span class="lineNum"> 23 </span> : // library without restriction. Specifically, if other files instantiate -<span class="lineNum"> 24 </span> : // templates or use macros or inline functions from this file, or you compile -<span class="lineNum"> 25 </span> : // this file and link it with other files to produce an executable, this -<span class="lineNum"> 26 </span> : // file does not by itself cause the resulting executable to be covered by -<span class="lineNum"> 27 </span> : // the GNU General Public License. This exception does not however -<span class="lineNum"> 28 </span> : // invalidate any other reasons why the executable file might be covered by -<span class="lineNum"> 29 </span> : // the GNU General Public License. -<span class="lineNum"> 30 </span> : -<span class="lineNum"> 31 </span> : /* -<span class="lineNum"> 32 </span> : * -<span class="lineNum"> 33 </span> : * Copyright (c) 1994 -<span class="lineNum"> 34 </span> : * Hewlett-Packard Company -<span class="lineNum"> 35 </span> : * -<span class="lineNum"> 36 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 37 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 38 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 39 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 40 </span> : * in supporting documentation. Hewlett-Packard Company makes no -<span class="lineNum"> 41 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 42 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 43 </span> : * -<span class="lineNum"> 44 </span> : * -<span class="lineNum"> 45 </span> : * Copyright (c) 1996 -<span class="lineNum"> 46 </span> : * Silicon Graphics Computer Systems, Inc. -<span class="lineNum"> 47 </span> : * -<span class="lineNum"> 48 </span> : * Permission to use, copy, modify, distribute and sell this software -<span class="lineNum"> 49 </span> : * and its documentation for any purpose is hereby granted without fee, -<span class="lineNum"> 50 </span> : * provided that the above copyright notice appear in all copies and -<span class="lineNum"> 51 </span> : * that both that copyright notice and this permission notice appear -<span class="lineNum"> 52 </span> : * in supporting documentation. Silicon Graphics makes no -<span class="lineNum"> 53 </span> : * representations about the suitability of this software for any -<span class="lineNum"> 54 </span> : * purpose. It is provided "as is" without express or implied warranty. -<span class="lineNum"> 55 </span> : */ -<span class="lineNum"> 56 </span> : -<span class="lineNum"> 57 </span> : /** @file stl_algo.h -<span class="lineNum"> 58 </span> : * This is an internal header file, included by other library headers. -<span class="lineNum"> 59 </span> : * You should not attempt to use it directly. -<span class="lineNum"> 60 </span> : */ -<span class="lineNum"> 61 </span> : -<span class="lineNum"> 62 </span> : #ifndef _STL_ALGO_H -<span class="lineNum"> 63 </span> : #define _STL_ALGO_H 1 -<span class="lineNum"> 64 </span> : -<span class="lineNum"> 65 </span> : #include <cstdlib> // for rand -<span class="lineNum"> 66 </span> : #include <bits/algorithmfwd.h> -<span class="lineNum"> 67 </span> : #include <bits/stl_heap.h> -<span class="lineNum"> 68 </span> : #include <bits/stl_tempbuf.h> // for _Temporary_buffer -<span class="lineNum"> 69 </span> : #include <debug/debug.h> -<span class="lineNum"> 70 </span> : -<span class="lineNum"> 71 </span> : // See concept_check.h for the __glibcxx_*_requires macros. -<span class="lineNum"> 72 </span> : -<span class="lineNum"> 73 </span> : _GLIBCXX_BEGIN_NAMESPACE(std) -<span class="lineNum"> 74 </span> : -<span class="lineNum"> 75 </span> : /** -<span class="lineNum"> 76 </span> : * @brief Find the median of three values. -<span class="lineNum"> 77 </span> : * @param a A value. -<span class="lineNum"> 78 </span> : * @param b A value. -<span class="lineNum"> 79 </span> : * @param c A value. -<span class="lineNum"> 80 </span> : * @return One of @p a, @p b or @p c. -<span class="lineNum"> 81 </span> : * -<span class="lineNum"> 82 </span> : * If @c {l,m,n} is some convolution of @p {a,b,c} such that @c l<=m<=n -<span class="lineNum"> 83 </span> : * then the value returned will be @c m. -<span class="lineNum"> 84 </span> : * This is an SGI extension. -<span class="lineNum"> 85 </span> : * @ingroup SGIextensions -<span class="lineNum"> 86 </span> : */ -<span class="lineNum"> 87 </span> : template<typename _Tp> -<span class="lineNum"> 88 </span> : inline const _Tp& -<span class="lineNum"> 89 </span><span class="lineCov"> 133 : __median(const _Tp& __a, const _Tp& __b, const _Tp& __c)</span> -<span class="lineNum"> 90 </span> : { -<span class="lineNum"> 91 </span> : // concept requirements -<span class="lineNum"> 92 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) -<span class="lineNum"> 93 </span><span class="lineCov"> 133 : if (__a < __b)</span> -<span class="lineNum"> 94 </span><span class="lineCov"> 132 : if (__b < __c)</span> -<span class="lineNum"> 95 </span><span class="lineCov"> 132 : return __b;</span> -<span class="lineNum"> 96 </span><span class="lineNoCov"> 0 : else if (__a < __c)</span> -<span class="lineNum"> 97 </span><span class="lineNoCov"> 0 : return __c;</span> -<span class="lineNum"> 98 </span> : else -<span class="lineNum"> 99 </span><span class="lineNoCov"> 0 : return __a;</span> -<span class="lineNum"> 100 </span><span class="lineCov"> 1 : else if (__a < __c)</span> -<span class="lineNum"> 101 </span><span class="lineNoCov"> 0 : return __a;</span> -<span class="lineNum"> 102 </span><span class="lineCov"> 1 : else if (__b < __c)</span> -<span class="lineNum"> 103 </span><span class="lineNoCov"> 0 : return __c;</span> -<span class="lineNum"> 104 </span> : else -<span class="lineNum"> 105 </span><span class="lineCov"> 1 : return __b;</span> -<span class="lineNum"> 106 </span> : } -<span class="lineNum"> 107 </span> : -<span class="lineNum"> 108 </span> : /** -<span class="lineNum"> 109 </span> : * @brief Find the median of three values using a predicate for comparison. -<span class="lineNum"> 110 </span> : * @param a A value. -<span class="lineNum"> 111 </span> : * @param b A value. -<span class="lineNum"> 112 </span> : * @param c A value. -<span class="lineNum"> 113 </span> : * @param comp A binary predicate. -<span class="lineNum"> 114 </span> : * @return One of @p a, @p b or @p c. -<span class="lineNum"> 115 </span> : * -<span class="lineNum"> 116 </span> : * If @c {l,m,n} is some convolution of @p {a,b,c} such that @p comp(l,m) -<span class="lineNum"> 117 </span> : * and @p comp(m,n) are both true then the value returned will be @c m. -<span class="lineNum"> 118 </span> : * This is an SGI extension. -<span class="lineNum"> 119 </span> : * @ingroup SGIextensions -<span class="lineNum"> 120 </span> : */ -<span class="lineNum"> 121 </span> : template<typename _Tp, typename _Compare> -<span class="lineNum"> 122 </span> : inline const _Tp& -<span class="lineNum"> 123 </span><span class="lineCov"> 710 : __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp)</span> -<span class="lineNum"> 124 </span> : { -<span class="lineNum"> 125 </span> : // concept requirements -<span class="lineNum"> 126 </span> : __glibcxx_function_requires(_BinaryFunctionConcept<_Compare, bool, -<span class="lineNum"> 127 </span> : _Tp, _Tp>) -<span class="lineNum"> 128 </span><span class="lineCov"> 710 : if (__comp(__a, __b))</span> -<span class="lineNum"> 129 </span><span class="lineCov"> 433 : if (__comp(__b, __c))</span> -<span class="lineNum"> 130 </span><span class="lineCov"> 143 : return __b;</span> -<span class="lineNum"> 131 </span><span class="lineCov"> 290 : else if (__comp(__a, __c))</span> -<span class="lineNum"> 132 </span><span class="lineCov"> 54 : return __c;</span> -<span class="lineNum"> 133 </span> : else -<span class="lineNum"> 134 </span><span class="lineCov"> 236 : return __a;</span> -<span class="lineNum"> 135 </span><span class="lineCov"> 277 : else if (__comp(__a, __c))</span> -<span class="lineNum"> 136 </span><span class="lineCov"> 81 : return __a;</span> -<span class="lineNum"> 137 </span><span class="lineCov"> 196 : else if (__comp(__b, __c))</span> -<span class="lineNum"> 138 </span><span class="lineCov"> 99 : return __c;</span> -<span class="lineNum"> 139 </span> : else -<span class="lineNum"> 140 </span><span class="lineCov"> 97 : return __b;</span> -<span class="lineNum"> 141 </span> : } -<span class="lineNum"> 142 </span> : -<span class="lineNum"> 143 </span> : // for_each -<span class="lineNum"> 144 </span> : -<span class="lineNum"> 145 </span> : /// This is an overload used by find() for the Input Iterator case. -<span class="lineNum"> 146 </span> : template<typename _InputIterator, typename _Tp> -<span class="lineNum"> 147 </span> : inline _InputIterator -<span class="lineNum"> 148 </span> : __find(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 149 </span> : const _Tp& __val, input_iterator_tag) -<span class="lineNum"> 150 </span> : { -<span class="lineNum"> 151 </span> : while (__first != __last && !(*__first == __val)) -<span class="lineNum"> 152 </span> : ++__first; -<span class="lineNum"> 153 </span> : return __first; -<span class="lineNum"> 154 </span> : } -<span class="lineNum"> 155 </span> : -<span class="lineNum"> 156 </span> : /// This is an overload used by find_if() for the Input Iterator case. -<span class="lineNum"> 157 </span> : template<typename _InputIterator, typename _Predicate> -<span class="lineNum"> 158 </span> : inline _InputIterator -<span class="lineNum"> 159 </span> : __find_if(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 160 </span><span class="lineCov"> 3 : _Predicate __pred, input_iterator_tag)</span> -<span class="lineNum"> 161 </span> : { -<span class="lineNum"> 162 </span><span class="lineCov"> 7 : while (__first != __last && !bool(__pred(*__first)))</span> -<span class="lineNum"> 163 </span><span class="lineCov"> 1 : ++__first;</span> -<span class="lineNum"> 164 </span><span class="lineCov"> 3 : return __first;</span> -<span class="lineNum"> 165 </span> : } -<span class="lineNum"> 166 </span> : -<span class="lineNum"> 167 </span> : /// This is an overload used by find() for the RAI case. -<span class="lineNum"> 168 </span> : template<typename _RandomAccessIterator, typename _Tp> -<span class="lineNum"> 169 </span> : _RandomAccessIterator -<span class="lineNum"> 170 </span> : __find(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 171 </span><span class="lineCov"> 3362 : const _Tp& __val, random_access_iterator_tag)</span> -<span class="lineNum"> 172 </span> : { -<span class="lineNum"> 173 </span> : typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 174 </span><span class="lineCov"> 3362 : __trip_count = (__last - __first) >> 2;</span> -<span class="lineNum"> 175 </span> : -<span class="lineNum"> 176 </span><span class="lineCov"> 5967 : for (; __trip_count > 0; --__trip_count)</span> -<span class="lineNum"> 177 </span> : { -<span class="lineNum"> 178 </span><span class="lineCov"> 3337 : if (*__first == __val)</span> -<span class="lineNum"> 179 </span><span class="lineCov"> 42 : return __first;</span> -<span class="lineNum"> 180 </span><span class="lineCov"> 3295 : ++__first;</span> -<span class="lineNum"> 181 </span> : -<span class="lineNum"> 182 </span><span class="lineCov"> 3295 : if (*__first == __val)</span> -<span class="lineNum"> 183 </span><span class="lineCov"> 16 : return __first;</span> -<span class="lineNum"> 184 </span><span class="lineCov"> 3279 : ++__first;</span> -<span class="lineNum"> 185 </span> : -<span class="lineNum"> 186 </span><span class="lineCov"> 3279 : if (*__first == __val)</span> -<span class="lineNum"> 187 </span><span class="lineCov"> 42 : return __first;</span> -<span class="lineNum"> 188 </span><span class="lineCov"> 3237 : ++__first;</span> -<span class="lineNum"> 189 </span> : -<span class="lineNum"> 190 </span><span class="lineCov"> 3237 : if (*__first == __val)</span> -<span class="lineNum"> 191 </span><span class="lineCov"> 632 : return __first;</span> -<span class="lineNum"> 192 </span><span class="lineCov"> 2605 : ++__first;</span> -<span class="lineNum"> 193 </span> : } -<span class="lineNum"> 194 </span> : -<span class="lineNum"> 195 </span><span class="lineCov"> 2630 : switch (__last - __first)</span> -<span class="lineNum"> 196 </span> : { -<span class="lineNum"> 197 </span> : case 3: -<span class="lineNum"> 198 </span><span class="lineCov"> 107 : if (*__first == __val)</span> -<span class="lineNum"> 199 </span><span class="lineNoCov"> 0 : return __first;</span> -<span class="lineNum"> 200 </span><span class="lineCov"> 107 : ++__first;</span> -<span class="lineNum"> 201 </span> : case 2: -<span class="lineNum"> 202 </span><span class="lineCov"> 243 : if (*__first == __val)</span> -<span class="lineNum"> 203 </span><span class="lineNoCov"> 0 : return __first;</span> -<span class="lineNum"> 204 </span><span class="lineCov"> 243 : ++__first;</span> -<span class="lineNum"> 205 </span> : case 1: -<span class="lineNum"> 206 </span><span class="lineCov"> 370 : if (*__first == __val)</span> -<span class="lineNum"> 207 </span><span class="lineCov"> 370 : return __first;</span> -<span class="lineNum"> 208 </span><span class="lineNoCov"> 0 : ++__first;</span> -<span class="lineNum"> 209 </span> : case 0: -<span class="lineNum"> 210 </span> : default: -<span class="lineNum"> 211 </span><span class="lineCov"> 2260 : return __last;</span> -<span class="lineNum"> 212 </span> : } -<span class="lineNum"> 213 </span> : } -<span class="lineNum"> 214 </span> : -<span class="lineNum"> 215 </span> : /// This is an overload used by find_if() for the RAI case. -<span class="lineNum"> 216 </span> : template<typename _RandomAccessIterator, typename _Predicate> -<span class="lineNum"> 217 </span> : _RandomAccessIterator -<span class="lineNum"> 218 </span> : __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 219 </span> : _Predicate __pred, random_access_iterator_tag) -<span class="lineNum"> 220 </span> : { -<span class="lineNum"> 221 </span> : typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 222 </span> : __trip_count = (__last - __first) >> 2; -<span class="lineNum"> 223 </span> : -<span class="lineNum"> 224 </span> : for (; __trip_count > 0; --__trip_count) -<span class="lineNum"> 225 </span> : { -<span class="lineNum"> 226 </span> : if (__pred(*__first)) -<span class="lineNum"> 227 </span> : return __first; -<span class="lineNum"> 228 </span> : ++__first; -<span class="lineNum"> 229 </span> : -<span class="lineNum"> 230 </span> : if (__pred(*__first)) -<span class="lineNum"> 231 </span> : return __first; -<span class="lineNum"> 232 </span> : ++__first; -<span class="lineNum"> 233 </span> : -<span class="lineNum"> 234 </span> : if (__pred(*__first)) -<span class="lineNum"> 235 </span> : return __first; -<span class="lineNum"> 236 </span> : ++__first; -<span class="lineNum"> 237 </span> : -<span class="lineNum"> 238 </span> : if (__pred(*__first)) -<span class="lineNum"> 239 </span> : return __first; -<span class="lineNum"> 240 </span> : ++__first; -<span class="lineNum"> 241 </span> : } -<span class="lineNum"> 242 </span> : -<span class="lineNum"> 243 </span> : switch (__last - __first) -<span class="lineNum"> 244 </span> : { -<span class="lineNum"> 245 </span> : case 3: -<span class="lineNum"> 246 </span> : if (__pred(*__first)) -<span class="lineNum"> 247 </span> : return __first; -<span class="lineNum"> 248 </span> : ++__first; -<span class="lineNum"> 249 </span> : case 2: -<span class="lineNum"> 250 </span> : if (__pred(*__first)) -<span class="lineNum"> 251 </span> : return __first; -<span class="lineNum"> 252 </span> : ++__first; -<span class="lineNum"> 253 </span> : case 1: -<span class="lineNum"> 254 </span> : if (__pred(*__first)) -<span class="lineNum"> 255 </span> : return __first; -<span class="lineNum"> 256 </span> : ++__first; -<span class="lineNum"> 257 </span> : case 0: -<span class="lineNum"> 258 </span> : default: -<span class="lineNum"> 259 </span> : return __last; -<span class="lineNum"> 260 </span> : } -<span class="lineNum"> 261 </span> : } -<span class="lineNum"> 262 </span> : -<span class="lineNum"> 263 </span> : // set_difference -<span class="lineNum"> 264 </span> : // set_intersection -<span class="lineNum"> 265 </span> : // set_symmetric_difference -<span class="lineNum"> 266 </span> : // set_union -<span class="lineNum"> 267 </span> : // for_each -<span class="lineNum"> 268 </span> : // find -<span class="lineNum"> 269 </span> : // find_if -<span class="lineNum"> 270 </span> : // find_first_of -<span class="lineNum"> 271 </span> : // adjacent_find -<span class="lineNum"> 272 </span> : // count -<span class="lineNum"> 273 </span> : // count_if -<span class="lineNum"> 274 </span> : // search -<span class="lineNum"> 275 </span> : -<span class="lineNum"> 276 </span> : /** -<span class="lineNum"> 277 </span> : * This is an uglified -<span class="lineNum"> 278 </span> : * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) -<span class="lineNum"> 279 </span> : * overloaded for forward iterators. -<span class="lineNum"> 280 </span> : */ -<span class="lineNum"> 281 </span> : template<typename _ForwardIterator, typename _Integer, typename _Tp> -<span class="lineNum"> 282 </span> : _ForwardIterator -<span class="lineNum"> 283 </span> : __search_n(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 284 </span> : _Integer __count, const _Tp& __val, -<span class="lineNum"> 285 </span> : std::forward_iterator_tag) -<span class="lineNum"> 286 </span> : { -<span class="lineNum"> 287 </span> : __first = _GLIBCXX_STD_P::find(__first, __last, __val); -<span class="lineNum"> 288 </span> : while (__first != __last) -<span class="lineNum"> 289 </span> : { -<span class="lineNum"> 290 </span> : typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 291 </span> : __n = __count; -<span class="lineNum"> 292 </span> : _ForwardIterator __i = __first; -<span class="lineNum"> 293 </span> : ++__i; -<span class="lineNum"> 294 </span> : while (__i != __last && __n != 1 && *__i == __val) -<span class="lineNum"> 295 </span> : { -<span class="lineNum"> 296 </span> : ++__i; -<span class="lineNum"> 297 </span> : --__n; -<span class="lineNum"> 298 </span> : } -<span class="lineNum"> 299 </span> : if (__n == 1) -<span class="lineNum"> 300 </span> : return __first; -<span class="lineNum"> 301 </span> : if (__i == __last) -<span class="lineNum"> 302 </span> : return __last; -<span class="lineNum"> 303 </span> : __first = _GLIBCXX_STD_P::find(++__i, __last, __val); -<span class="lineNum"> 304 </span> : } -<span class="lineNum"> 305 </span> : return __last; -<span class="lineNum"> 306 </span> : } -<span class="lineNum"> 307 </span> : -<span class="lineNum"> 308 </span> : /** -<span class="lineNum"> 309 </span> : * This is an uglified -<span class="lineNum"> 310 </span> : * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&) -<span class="lineNum"> 311 </span> : * overloaded for random access iterators. -<span class="lineNum"> 312 </span> : */ -<span class="lineNum"> 313 </span> : template<typename _RandomAccessIter, typename _Integer, typename _Tp> -<span class="lineNum"> 314 </span> : _RandomAccessIter -<span class="lineNum"> 315 </span> : __search_n(_RandomAccessIter __first, _RandomAccessIter __last, -<span class="lineNum"> 316 </span> : _Integer __count, const _Tp& __val, -<span class="lineNum"> 317 </span> : std::random_access_iterator_tag) -<span class="lineNum"> 318 </span> : { -<span class="lineNum"> 319 </span> : -<span class="lineNum"> 320 </span> : typedef typename std::iterator_traits<_RandomAccessIter>::difference_type -<span class="lineNum"> 321 </span> : _DistanceType; -<span class="lineNum"> 322 </span> : -<span class="lineNum"> 323 </span> : _DistanceType __tailSize = __last - __first; -<span class="lineNum"> 324 </span> : const _DistanceType __pattSize = __count; -<span class="lineNum"> 325 </span> : -<span class="lineNum"> 326 </span> : if (__tailSize < __pattSize) -<span class="lineNum"> 327 </span> : return __last; -<span class="lineNum"> 328 </span> : -<span class="lineNum"> 329 </span> : const _DistanceType __skipOffset = __pattSize - 1; -<span class="lineNum"> 330 </span> : _RandomAccessIter __lookAhead = __first + __skipOffset; -<span class="lineNum"> 331 </span> : __tailSize -= __pattSize; -<span class="lineNum"> 332 </span> : -<span class="lineNum"> 333 </span> : while (1) // the main loop... -<span class="lineNum"> 334 </span> : { -<span class="lineNum"> 335 </span> : // __lookAhead here is always pointing to the last element of next -<span class="lineNum"> 336 </span> : // possible match. -<span class="lineNum"> 337 </span> : while (!(*__lookAhead == __val)) // the skip loop... -<span class="lineNum"> 338 </span> : { -<span class="lineNum"> 339 </span> : if (__tailSize < __pattSize) -<span class="lineNum"> 340 </span> : return __last; // Failure -<span class="lineNum"> 341 </span> : __lookAhead += __pattSize; -<span class="lineNum"> 342 </span> : __tailSize -= __pattSize; -<span class="lineNum"> 343 </span> : } -<span class="lineNum"> 344 </span> : _DistanceType __remainder = __skipOffset; -<span class="lineNum"> 345 </span> : for (_RandomAccessIter __backTrack = __lookAhead - 1; -<span class="lineNum"> 346 </span> : *__backTrack == __val; --__backTrack) -<span class="lineNum"> 347 </span> : { -<span class="lineNum"> 348 </span> : if (--__remainder == 0) -<span class="lineNum"> 349 </span> : return (__lookAhead - __skipOffset); // Success -<span class="lineNum"> 350 </span> : } -<span class="lineNum"> 351 </span> : if (__remainder > __tailSize) -<span class="lineNum"> 352 </span> : return __last; // Failure -<span class="lineNum"> 353 </span> : __lookAhead += __remainder; -<span class="lineNum"> 354 </span> : __tailSize -= __remainder; -<span class="lineNum"> 355 </span> : } -<span class="lineNum"> 356 </span> : } -<span class="lineNum"> 357 </span> : -<span class="lineNum"> 358 </span> : // search_n -<span class="lineNum"> 359 </span> : -<span class="lineNum"> 360 </span> : /** -<span class="lineNum"> 361 </span> : * This is an uglified -<span class="lineNum"> 362 </span> : * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, -<span class="lineNum"> 363 </span> : * _BinaryPredicate) -<span class="lineNum"> 364 </span> : * overloaded for forward iterators. -<span class="lineNum"> 365 </span> : */ -<span class="lineNum"> 366 </span> : template<typename _ForwardIterator, typename _Integer, typename _Tp, -<span class="lineNum"> 367 </span> : typename _BinaryPredicate> -<span class="lineNum"> 368 </span> : _ForwardIterator -<span class="lineNum"> 369 </span> : __search_n(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 370 </span> : _Integer __count, const _Tp& __val, -<span class="lineNum"> 371 </span> : _BinaryPredicate __binary_pred, std::forward_iterator_tag) -<span class="lineNum"> 372 </span> : { -<span class="lineNum"> 373 </span> : while (__first != __last && !bool(__binary_pred(*__first, __val))) -<span class="lineNum"> 374 </span> : ++__first; -<span class="lineNum"> 375 </span> : -<span class="lineNum"> 376 </span> : while (__first != __last) -<span class="lineNum"> 377 </span> : { -<span class="lineNum"> 378 </span> : typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 379 </span> : __n = __count; -<span class="lineNum"> 380 </span> : _ForwardIterator __i = __first; -<span class="lineNum"> 381 </span> : ++__i; -<span class="lineNum"> 382 </span> : while (__i != __last && __n != 1 && bool(__binary_pred(*__i, __val))) -<span class="lineNum"> 383 </span> : { -<span class="lineNum"> 384 </span> : ++__i; -<span class="lineNum"> 385 </span> : --__n; -<span class="lineNum"> 386 </span> : } -<span class="lineNum"> 387 </span> : if (__n == 1) -<span class="lineNum"> 388 </span> : return __first; -<span class="lineNum"> 389 </span> : if (__i == __last) -<span class="lineNum"> 390 </span> : return __last; -<span class="lineNum"> 391 </span> : __first = ++__i; -<span class="lineNum"> 392 </span> : while (__first != __last -<span class="lineNum"> 393 </span> : && !bool(__binary_pred(*__first, __val))) -<span class="lineNum"> 394 </span> : ++__first; -<span class="lineNum"> 395 </span> : } -<span class="lineNum"> 396 </span> : return __last; -<span class="lineNum"> 397 </span> : } -<span class="lineNum"> 398 </span> : -<span class="lineNum"> 399 </span> : /** -<span class="lineNum"> 400 </span> : * This is an uglified -<span class="lineNum"> 401 </span> : * search_n(_ForwardIterator, _ForwardIterator, _Integer, const _Tp&, -<span class="lineNum"> 402 </span> : * _BinaryPredicate) -<span class="lineNum"> 403 </span> : * overloaded for random access iterators. -<span class="lineNum"> 404 </span> : */ -<span class="lineNum"> 405 </span> : template<typename _RandomAccessIter, typename _Integer, typename _Tp, -<span class="lineNum"> 406 </span> : typename _BinaryPredicate> -<span class="lineNum"> 407 </span> : _RandomAccessIter -<span class="lineNum"> 408 </span> : __search_n(_RandomAccessIter __first, _RandomAccessIter __last, -<span class="lineNum"> 409 </span> : _Integer __count, const _Tp& __val, -<span class="lineNum"> 410 </span> : _BinaryPredicate __binary_pred, std::random_access_iterator_tag) -<span class="lineNum"> 411 </span> : { -<span class="lineNum"> 412 </span> : -<span class="lineNum"> 413 </span> : typedef typename std::iterator_traits<_RandomAccessIter>::difference_type -<span class="lineNum"> 414 </span> : _DistanceType; -<span class="lineNum"> 415 </span> : -<span class="lineNum"> 416 </span> : _DistanceType __tailSize = __last - __first; -<span class="lineNum"> 417 </span> : const _DistanceType __pattSize = __count; -<span class="lineNum"> 418 </span> : -<span class="lineNum"> 419 </span> : if (__tailSize < __pattSize) -<span class="lineNum"> 420 </span> : return __last; -<span class="lineNum"> 421 </span> : -<span class="lineNum"> 422 </span> : const _DistanceType __skipOffset = __pattSize - 1; -<span class="lineNum"> 423 </span> : _RandomAccessIter __lookAhead = __first + __skipOffset; -<span class="lineNum"> 424 </span> : __tailSize -= __pattSize; -<span class="lineNum"> 425 </span> : -<span class="lineNum"> 426 </span> : while (1) // the main loop... -<span class="lineNum"> 427 </span> : { -<span class="lineNum"> 428 </span> : // __lookAhead here is always pointing to the last element of next -<span class="lineNum"> 429 </span> : // possible match. -<span class="lineNum"> 430 </span> : while (!bool(__binary_pred(*__lookAhead, __val))) // the skip loop... -<span class="lineNum"> 431 </span> : { -<span class="lineNum"> 432 </span> : if (__tailSize < __pattSize) -<span class="lineNum"> 433 </span> : return __last; // Failure -<span class="lineNum"> 434 </span> : __lookAhead += __pattSize; -<span class="lineNum"> 435 </span> : __tailSize -= __pattSize; -<span class="lineNum"> 436 </span> : } -<span class="lineNum"> 437 </span> : _DistanceType __remainder = __skipOffset; -<span class="lineNum"> 438 </span> : for (_RandomAccessIter __backTrack = __lookAhead - 1; -<span class="lineNum"> 439 </span> : __binary_pred(*__backTrack, __val); --__backTrack) -<span class="lineNum"> 440 </span> : { -<span class="lineNum"> 441 </span> : if (--__remainder == 0) -<span class="lineNum"> 442 </span> : return (__lookAhead - __skipOffset); // Success -<span class="lineNum"> 443 </span> : } -<span class="lineNum"> 444 </span> : if (__remainder > __tailSize) -<span class="lineNum"> 445 </span> : return __last; // Failure -<span class="lineNum"> 446 </span> : __lookAhead += __remainder; -<span class="lineNum"> 447 </span> : __tailSize -= __remainder; -<span class="lineNum"> 448 </span> : } -<span class="lineNum"> 449 </span> : } -<span class="lineNum"> 450 </span> : -<span class="lineNum"> 451 </span> : // find_end for forward iterators. -<span class="lineNum"> 452 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2> -<span class="lineNum"> 453 </span> : _ForwardIterator1 -<span class="lineNum"> 454 </span> : __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 455 </span> : _ForwardIterator2 __first2, _ForwardIterator2 __last2, -<span class="lineNum"> 456 </span> : forward_iterator_tag, forward_iterator_tag) -<span class="lineNum"> 457 </span> : { -<span class="lineNum"> 458 </span> : if (__first2 == __last2) -<span class="lineNum"> 459 </span> : return __last1; -<span class="lineNum"> 460 </span> : else -<span class="lineNum"> 461 </span> : { -<span class="lineNum"> 462 </span> : _ForwardIterator1 __result = __last1; -<span class="lineNum"> 463 </span> : while (1) -<span class="lineNum"> 464 </span> : { -<span class="lineNum"> 465 </span> : _ForwardIterator1 __new_result -<span class="lineNum"> 466 </span> : = _GLIBCXX_STD_P::search(__first1, __last1, __first2, __last2); -<span class="lineNum"> 467 </span> : if (__new_result == __last1) -<span class="lineNum"> 468 </span> : return __result; -<span class="lineNum"> 469 </span> : else -<span class="lineNum"> 470 </span> : { -<span class="lineNum"> 471 </span> : __result = __new_result; -<span class="lineNum"> 472 </span> : __first1 = __new_result; -<span class="lineNum"> 473 </span> : ++__first1; -<span class="lineNum"> 474 </span> : } -<span class="lineNum"> 475 </span> : } -<span class="lineNum"> 476 </span> : } -<span class="lineNum"> 477 </span> : } -<span class="lineNum"> 478 </span> : -<span class="lineNum"> 479 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2, -<span class="lineNum"> 480 </span> : typename _BinaryPredicate> -<span class="lineNum"> 481 </span> : _ForwardIterator1 -<span class="lineNum"> 482 </span> : __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 483 </span> : _ForwardIterator2 __first2, _ForwardIterator2 __last2, -<span class="lineNum"> 484 </span> : forward_iterator_tag, forward_iterator_tag, -<span class="lineNum"> 485 </span> : _BinaryPredicate __comp) -<span class="lineNum"> 486 </span> : { -<span class="lineNum"> 487 </span> : if (__first2 == __last2) -<span class="lineNum"> 488 </span> : return __last1; -<span class="lineNum"> 489 </span> : else -<span class="lineNum"> 490 </span> : { -<span class="lineNum"> 491 </span> : _ForwardIterator1 __result = __last1; -<span class="lineNum"> 492 </span> : while (1) -<span class="lineNum"> 493 </span> : { -<span class="lineNum"> 494 </span> : _ForwardIterator1 __new_result -<span class="lineNum"> 495 </span> : = _GLIBCXX_STD_P::search(__first1, __last1, __first2, -<span class="lineNum"> 496 </span> : __last2, __comp); -<span class="lineNum"> 497 </span> : if (__new_result == __last1) -<span class="lineNum"> 498 </span> : return __result; -<span class="lineNum"> 499 </span> : else -<span class="lineNum"> 500 </span> : { -<span class="lineNum"> 501 </span> : __result = __new_result; -<span class="lineNum"> 502 </span> : __first1 = __new_result; -<span class="lineNum"> 503 </span> : ++__first1; -<span class="lineNum"> 504 </span> : } -<span class="lineNum"> 505 </span> : } -<span class="lineNum"> 506 </span> : } -<span class="lineNum"> 507 </span> : } -<span class="lineNum"> 508 </span> : -<span class="lineNum"> 509 </span> : // find_end for bidirectional iterators (much faster). -<span class="lineNum"> 510 </span> : template<typename _BidirectionalIterator1, typename _BidirectionalIterator2> -<span class="lineNum"> 511 </span> : _BidirectionalIterator1 -<span class="lineNum"> 512 </span> : __find_end(_BidirectionalIterator1 __first1, -<span class="lineNum"> 513 </span> : _BidirectionalIterator1 __last1, -<span class="lineNum"> 514 </span> : _BidirectionalIterator2 __first2, -<span class="lineNum"> 515 </span> : _BidirectionalIterator2 __last2, -<span class="lineNum"> 516 </span> : bidirectional_iterator_tag, bidirectional_iterator_tag) -<span class="lineNum"> 517 </span> : { -<span class="lineNum"> 518 </span> : // concept requirements -<span class="lineNum"> 519 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 520 </span> : _BidirectionalIterator1>) -<span class="lineNum"> 521 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 522 </span> : _BidirectionalIterator2>) -<span class="lineNum"> 523 </span> : -<span class="lineNum"> 524 </span> : typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; -<span class="lineNum"> 525 </span> : typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; -<span class="lineNum"> 526 </span> : -<span class="lineNum"> 527 </span> : _RevIterator1 __rlast1(__first1); -<span class="lineNum"> 528 </span> : _RevIterator2 __rlast2(__first2); -<span class="lineNum"> 529 </span> : _RevIterator1 __rresult = _GLIBCXX_STD_P::search(_RevIterator1(__last1), -<span class="lineNum"> 530 </span> : __rlast1, -<span class="lineNum"> 531 </span> : _RevIterator2(__last2), -<span class="lineNum"> 532 </span> : __rlast2); -<span class="lineNum"> 533 </span> : -<span class="lineNum"> 534 </span> : if (__rresult == __rlast1) -<span class="lineNum"> 535 </span> : return __last1; -<span class="lineNum"> 536 </span> : else -<span class="lineNum"> 537 </span> : { -<span class="lineNum"> 538 </span> : _BidirectionalIterator1 __result = __rresult.base(); -<span class="lineNum"> 539 </span> : std::advance(__result, -std::distance(__first2, __last2)); -<span class="lineNum"> 540 </span> : return __result; -<span class="lineNum"> 541 </span> : } -<span class="lineNum"> 542 </span> : } -<span class="lineNum"> 543 </span> : -<span class="lineNum"> 544 </span> : template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, -<span class="lineNum"> 545 </span> : typename _BinaryPredicate> -<span class="lineNum"> 546 </span> : _BidirectionalIterator1 -<span class="lineNum"> 547 </span> : __find_end(_BidirectionalIterator1 __first1, -<span class="lineNum"> 548 </span> : _BidirectionalIterator1 __last1, -<span class="lineNum"> 549 </span> : _BidirectionalIterator2 __first2, -<span class="lineNum"> 550 </span> : _BidirectionalIterator2 __last2, -<span class="lineNum"> 551 </span> : bidirectional_iterator_tag, bidirectional_iterator_tag, -<span class="lineNum"> 552 </span> : _BinaryPredicate __comp) -<span class="lineNum"> 553 </span> : { -<span class="lineNum"> 554 </span> : // concept requirements -<span class="lineNum"> 555 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 556 </span> : _BidirectionalIterator1>) -<span class="lineNum"> 557 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 558 </span> : _BidirectionalIterator2>) -<span class="lineNum"> 559 </span> : -<span class="lineNum"> 560 </span> : typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; -<span class="lineNum"> 561 </span> : typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; -<span class="lineNum"> 562 </span> : -<span class="lineNum"> 563 </span> : _RevIterator1 __rlast1(__first1); -<span class="lineNum"> 564 </span> : _RevIterator2 __rlast2(__first2); -<span class="lineNum"> 565 </span> : _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, -<span class="lineNum"> 566 </span> : _RevIterator2(__last2), __rlast2, -<span class="lineNum"> 567 </span> : __comp); -<span class="lineNum"> 568 </span> : -<span class="lineNum"> 569 </span> : if (__rresult == __rlast1) -<span class="lineNum"> 570 </span> : return __last1; -<span class="lineNum"> 571 </span> : else -<span class="lineNum"> 572 </span> : { -<span class="lineNum"> 573 </span> : _BidirectionalIterator1 __result = __rresult.base(); -<span class="lineNum"> 574 </span> : std::advance(__result, -std::distance(__first2, __last2)); -<span class="lineNum"> 575 </span> : return __result; -<span class="lineNum"> 576 </span> : } -<span class="lineNum"> 577 </span> : } -<span class="lineNum"> 578 </span> : -<span class="lineNum"> 579 </span> : /** -<span class="lineNum"> 580 </span> : * @brief Find last matching subsequence in a sequence. -<span class="lineNum"> 581 </span> : * @param first1 Start of range to search. -<span class="lineNum"> 582 </span> : * @param last1 End of range to search. -<span class="lineNum"> 583 </span> : * @param first2 Start of sequence to match. -<span class="lineNum"> 584 </span> : * @param last2 End of sequence to match. -<span class="lineNum"> 585 </span> : * @return The last iterator @c i in the range -<span class="lineNum"> 586 </span> : * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N) -<span class="lineNum"> 587 </span> : * for each @c N in the range @p [0,last2-first2), or @p last1 if no -<span class="lineNum"> 588 </span> : * such iterator exists. -<span class="lineNum"> 589 </span> : * -<span class="lineNum"> 590 </span> : * Searches the range @p [first1,last1) for a sub-sequence that compares -<span class="lineNum"> 591 </span> : * equal value-by-value with the sequence given by @p [first2,last2) and -<span class="lineNum"> 592 </span> : * returns an iterator to the first element of the sub-sequence, or -<span class="lineNum"> 593 </span> : * @p last1 if the sub-sequence is not found. The sub-sequence will be the -<span class="lineNum"> 594 </span> : * last such subsequence contained in [first,last1). -<span class="lineNum"> 595 </span> : * -<span class="lineNum"> 596 </span> : * Because the sub-sequence must lie completely within the range -<span class="lineNum"> 597 </span> : * @p [first1,last1) it must start at a position less than -<span class="lineNum"> 598 </span> : * @p last1-(last2-first2) where @p last2-first2 is the length of the -<span class="lineNum"> 599 </span> : * sub-sequence. -<span class="lineNum"> 600 </span> : * This means that the returned iterator @c i will be in the range -<span class="lineNum"> 601 </span> : * @p [first1,last1-(last2-first2)) -<span class="lineNum"> 602 </span> : */ -<span class="lineNum"> 603 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2> -<span class="lineNum"> 604 </span> : inline _ForwardIterator1 -<span class="lineNum"> 605 </span> : find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 606 </span> : _ForwardIterator2 __first2, _ForwardIterator2 __last2) -<span class="lineNum"> 607 </span> : { -<span class="lineNum"> 608 </span> : // concept requirements -<span class="lineNum"> 609 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) -<span class="lineNum"> 610 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) -<span class="lineNum"> 611 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 612 </span> : typename iterator_traits<_ForwardIterator1>::value_type, -<span class="lineNum"> 613 </span> : typename iterator_traits<_ForwardIterator2>::value_type>) -<span class="lineNum"> 614 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 615 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 616 </span> : -<span class="lineNum"> 617 </span> : return std::__find_end(__first1, __last1, __first2, __last2, -<span class="lineNum"> 618 </span> : std::__iterator_category(__first1), -<span class="lineNum"> 619 </span> : std::__iterator_category(__first2)); -<span class="lineNum"> 620 </span> : } -<span class="lineNum"> 621 </span> : -<span class="lineNum"> 622 </span> : /** -<span class="lineNum"> 623 </span> : * @brief Find last matching subsequence in a sequence using a predicate. -<span class="lineNum"> 624 </span> : * @param first1 Start of range to search. -<span class="lineNum"> 625 </span> : * @param last1 End of range to search. -<span class="lineNum"> 626 </span> : * @param first2 Start of sequence to match. -<span class="lineNum"> 627 </span> : * @param last2 End of sequence to match. -<span class="lineNum"> 628 </span> : * @param comp The predicate to use. -<span class="lineNum"> 629 </span> : * @return The last iterator @c i in the range -<span class="lineNum"> 630 </span> : * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p -<span class="lineNum"> 631 </span> : * (first2+N)) is true for each @c N in the range @p [0,last2-first2), or -<span class="lineNum"> 632 </span> : * @p last1 if no such iterator exists. -<span class="lineNum"> 633 </span> : * -<span class="lineNum"> 634 </span> : * Searches the range @p [first1,last1) for a sub-sequence that compares -<span class="lineNum"> 635 </span> : * equal value-by-value with the sequence given by @p [first2,last2) using -<span class="lineNum"> 636 </span> : * comp as a predicate and returns an iterator to the first element of the -<span class="lineNum"> 637 </span> : * sub-sequence, or @p last1 if the sub-sequence is not found. The -<span class="lineNum"> 638 </span> : * sub-sequence will be the last such subsequence contained in -<span class="lineNum"> 639 </span> : * [first,last1). -<span class="lineNum"> 640 </span> : * -<span class="lineNum"> 641 </span> : * Because the sub-sequence must lie completely within the range -<span class="lineNum"> 642 </span> : * @p [first1,last1) it must start at a position less than -<span class="lineNum"> 643 </span> : * @p last1-(last2-first2) where @p last2-first2 is the length of the -<span class="lineNum"> 644 </span> : * sub-sequence. -<span class="lineNum"> 645 </span> : * This means that the returned iterator @c i will be in the range -<span class="lineNum"> 646 </span> : * @p [first1,last1-(last2-first2)) -<span class="lineNum"> 647 </span> : */ -<span class="lineNum"> 648 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2, -<span class="lineNum"> 649 </span> : typename _BinaryPredicate> -<span class="lineNum"> 650 </span> : inline _ForwardIterator1 -<span class="lineNum"> 651 </span> : find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 652 </span> : _ForwardIterator2 __first2, _ForwardIterator2 __last2, -<span class="lineNum"> 653 </span> : _BinaryPredicate __comp) -<span class="lineNum"> 654 </span> : { -<span class="lineNum"> 655 </span> : // concept requirements -<span class="lineNum"> 656 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) -<span class="lineNum"> 657 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) -<span class="lineNum"> 658 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 659 </span> : typename iterator_traits<_ForwardIterator1>::value_type, -<span class="lineNum"> 660 </span> : typename iterator_traits<_ForwardIterator2>::value_type>) -<span class="lineNum"> 661 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 662 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 663 </span> : -<span class="lineNum"> 664 </span> : return std::__find_end(__first1, __last1, __first2, __last2, -<span class="lineNum"> 665 </span> : std::__iterator_category(__first1), -<span class="lineNum"> 666 </span> : std::__iterator_category(__first2), -<span class="lineNum"> 667 </span> : __comp); -<span class="lineNum"> 668 </span> : } -<span class="lineNum"> 669 </span> : -<span class="lineNum"> 670 </span> : -<span class="lineNum"> 671 </span> : /** -<span class="lineNum"> 672 </span> : * @brief Copy a sequence, removing elements of a given value. -<span class="lineNum"> 673 </span> : * @param first An input iterator. -<span class="lineNum"> 674 </span> : * @param last An input iterator. -<span class="lineNum"> 675 </span> : * @param result An output iterator. -<span class="lineNum"> 676 </span> : * @param value The value to be removed. -<span class="lineNum"> 677 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 678 </span> : * -<span class="lineNum"> 679 </span> : * Copies each element in the range @p [first,last) not equal to @p value -<span class="lineNum"> 680 </span> : * to the range beginning at @p result. -<span class="lineNum"> 681 </span> : * remove_copy() is stable, so the relative order of elements that are -<span class="lineNum"> 682 </span> : * copied is unchanged. -<span class="lineNum"> 683 </span> : */ -<span class="lineNum"> 684 </span> : template<typename _InputIterator, typename _OutputIterator, typename _Tp> -<span class="lineNum"> 685 </span> : _OutputIterator -<span class="lineNum"> 686 </span> : remove_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 687 </span> : _OutputIterator __result, const _Tp& __value) -<span class="lineNum"> 688 </span> : { -<span class="lineNum"> 689 </span> : // concept requirements -<span class="lineNum"> 690 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 691 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 692 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 693 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 694 </span> : typename iterator_traits<_InputIterator>::value_type, _Tp>) -<span class="lineNum"> 695 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 696 </span> : -<span class="lineNum"> 697 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 698 </span> : if (!(*__first == __value)) -<span class="lineNum"> 699 </span> : { -<span class="lineNum"> 700 </span> : *__result = *__first; -<span class="lineNum"> 701 </span> : ++__result; -<span class="lineNum"> 702 </span> : } -<span class="lineNum"> 703 </span> : return __result; -<span class="lineNum"> 704 </span> : } -<span class="lineNum"> 705 </span> : -<span class="lineNum"> 706 </span> : /** -<span class="lineNum"> 707 </span> : * @brief Copy a sequence, removing elements for which a predicate is true. -<span class="lineNum"> 708 </span> : * @param first An input iterator. -<span class="lineNum"> 709 </span> : * @param last An input iterator. -<span class="lineNum"> 710 </span> : * @param result An output iterator. -<span class="lineNum"> 711 </span> : * @param pred A predicate. -<span class="lineNum"> 712 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 713 </span> : * -<span class="lineNum"> 714 </span> : * Copies each element in the range @p [first,last) for which -<span class="lineNum"> 715 </span> : * @p pred returns false to the range beginning at @p result. -<span class="lineNum"> 716 </span> : * -<span class="lineNum"> 717 </span> : * remove_copy_if() is stable, so the relative order of elements that are -<span class="lineNum"> 718 </span> : * copied is unchanged. -<span class="lineNum"> 719 </span> : */ -<span class="lineNum"> 720 </span> : template<typename _InputIterator, typename _OutputIterator, -<span class="lineNum"> 721 </span> : typename _Predicate> -<span class="lineNum"> 722 </span> : _OutputIterator -<span class="lineNum"> 723 </span> : remove_copy_if(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 724 </span><span class="lineCov"> 16 : _OutputIterator __result, _Predicate __pred)</span> -<span class="lineNum"> 725 </span> : { -<span class="lineNum"> 726 </span> : // concept requirements -<span class="lineNum"> 727 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 728 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 729 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 730 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 731 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 732 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 733 </span> : -<span class="lineNum"> 734 </span><span class="lineCov"> 80 : for (; __first != __last; ++__first)</span> -<span class="lineNum"> 735 </span><span class="lineCov"> 64 : if (!bool(__pred(*__first)))</span> -<span class="lineNum"> 736 </span> : { -<span class="lineNum"> 737 </span><span class="lineCov"> 48 : *__result = *__first;</span> -<span class="lineNum"> 738 </span><span class="lineCov"> 48 : ++__result;</span> -<span class="lineNum"> 739 </span> : } -<span class="lineNum"> 740 </span><span class="lineCov"> 16 : return __result;</span> -<span class="lineNum"> 741 </span> : } -<span class="lineNum"> 742 </span> : -<span class="lineNum"> 743 </span> : /** -<span class="lineNum"> 744 </span> : * @brief Remove elements from a sequence. -<span class="lineNum"> 745 </span> : * @param first An input iterator. -<span class="lineNum"> 746 </span> : * @param last An input iterator. -<span class="lineNum"> 747 </span> : * @param value The value to be removed. -<span class="lineNum"> 748 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 749 </span> : * -<span class="lineNum"> 750 </span> : * All elements equal to @p value are removed from the range -<span class="lineNum"> 751 </span> : * @p [first,last). -<span class="lineNum"> 752 </span> : * -<span class="lineNum"> 753 </span> : * remove() is stable, so the relative order of elements that are -<span class="lineNum"> 754 </span> : * not removed is unchanged. -<span class="lineNum"> 755 </span> : * -<span class="lineNum"> 756 </span> : * Elements between the end of the resulting sequence and @p last -<span class="lineNum"> 757 </span> : * are still present, but their value is unspecified. -<span class="lineNum"> 758 </span> : */ -<span class="lineNum"> 759 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 760 </span> : _ForwardIterator -<span class="lineNum"> 761 </span> : remove(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 762 </span> : const _Tp& __value) -<span class="lineNum"> 763 </span> : { -<span class="lineNum"> 764 </span> : // concept requirements -<span class="lineNum"> 765 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 766 </span> : _ForwardIterator>) -<span class="lineNum"> 767 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 768 </span> : typename iterator_traits<_ForwardIterator>::value_type, _Tp>) -<span class="lineNum"> 769 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 770 </span> : -<span class="lineNum"> 771 </span> : __first = _GLIBCXX_STD_P::find(__first, __last, __value); -<span class="lineNum"> 772 </span> : if(__first == __last) -<span class="lineNum"> 773 </span> : return __first; -<span class="lineNum"> 774 </span> : _ForwardIterator __result = __first; -<span class="lineNum"> 775 </span> : ++__first; -<span class="lineNum"> 776 </span> : for(; __first != __last; ++__first) -<span class="lineNum"> 777 </span> : if(!(*__first == __value)) -<span class="lineNum"> 778 </span> : { -<span class="lineNum"> 779 </span> : *__result = _GLIBCXX_MOVE(*__first); -<span class="lineNum"> 780 </span> : ++__result; -<span class="lineNum"> 781 </span> : } -<span class="lineNum"> 782 </span> : return __result; -<span class="lineNum"> 783 </span> : } -<span class="lineNum"> 784 </span> : -<span class="lineNum"> 785 </span> : /** -<span class="lineNum"> 786 </span> : * @brief Remove elements from a sequence using a predicate. -<span class="lineNum"> 787 </span> : * @param first A forward iterator. -<span class="lineNum"> 788 </span> : * @param last A forward iterator. -<span class="lineNum"> 789 </span> : * @param pred A predicate. -<span class="lineNum"> 790 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 791 </span> : * -<span class="lineNum"> 792 </span> : * All elements for which @p pred returns true are removed from the range -<span class="lineNum"> 793 </span> : * @p [first,last). -<span class="lineNum"> 794 </span> : * -<span class="lineNum"> 795 </span> : * remove_if() is stable, so the relative order of elements that are -<span class="lineNum"> 796 </span> : * not removed is unchanged. -<span class="lineNum"> 797 </span> : * -<span class="lineNum"> 798 </span> : * Elements between the end of the resulting sequence and @p last -<span class="lineNum"> 799 </span> : * are still present, but their value is unspecified. -<span class="lineNum"> 800 </span> : */ -<span class="lineNum"> 801 </span> : template<typename _ForwardIterator, typename _Predicate> -<span class="lineNum"> 802 </span> : _ForwardIterator -<span class="lineNum"> 803 </span> : remove_if(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 804 </span> : _Predicate __pred) -<span class="lineNum"> 805 </span> : { -<span class="lineNum"> 806 </span> : // concept requirements -<span class="lineNum"> 807 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 808 </span> : _ForwardIterator>) -<span class="lineNum"> 809 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 810 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 811 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 812 </span> : -<span class="lineNum"> 813 </span> : __first = _GLIBCXX_STD_P::find_if(__first, __last, __pred); -<span class="lineNum"> 814 </span> : if(__first == __last) -<span class="lineNum"> 815 </span> : return __first; -<span class="lineNum"> 816 </span> : _ForwardIterator __result = __first; -<span class="lineNum"> 817 </span> : ++__first; -<span class="lineNum"> 818 </span> : for(; __first != __last; ++__first) -<span class="lineNum"> 819 </span> : if(!bool(__pred(*__first))) -<span class="lineNum"> 820 </span> : { -<span class="lineNum"> 821 </span> : *__result = _GLIBCXX_MOVE(*__first); -<span class="lineNum"> 822 </span> : ++__result; -<span class="lineNum"> 823 </span> : } -<span class="lineNum"> 824 </span> : return __result; -<span class="lineNum"> 825 </span> : } -<span class="lineNum"> 826 </span> : -<span class="lineNum"> 827 </span> : /** -<span class="lineNum"> 828 </span> : * @brief Remove consecutive duplicate values from a sequence. -<span class="lineNum"> 829 </span> : * @param first A forward iterator. -<span class="lineNum"> 830 </span> : * @param last A forward iterator. -<span class="lineNum"> 831 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 832 </span> : * -<span class="lineNum"> 833 </span> : * Removes all but the first element from each group of consecutive -<span class="lineNum"> 834 </span> : * values that compare equal. -<span class="lineNum"> 835 </span> : * unique() is stable, so the relative order of elements that are -<span class="lineNum"> 836 </span> : * not removed is unchanged. -<span class="lineNum"> 837 </span> : * Elements between the end of the resulting sequence and @p last -<span class="lineNum"> 838 </span> : * are still present, but their value is unspecified. -<span class="lineNum"> 839 </span> : */ -<span class="lineNum"> 840 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 841 </span> : _ForwardIterator -<span class="lineNum"> 842 </span> : unique(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 843 </span> : { -<span class="lineNum"> 844 </span> : // concept requirements -<span class="lineNum"> 845 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 846 </span> : _ForwardIterator>) -<span class="lineNum"> 847 </span> : __glibcxx_function_requires(_EqualityComparableConcept< -<span class="lineNum"> 848 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 849 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 850 </span> : -<span class="lineNum"> 851 </span> : // Skip the beginning, if already unique. -<span class="lineNum"> 852 </span> : __first = _GLIBCXX_STD_P::adjacent_find(__first, __last); -<span class="lineNum"> 853 </span> : if (__first == __last) -<span class="lineNum"> 854 </span> : return __last; -<span class="lineNum"> 855 </span> : -<span class="lineNum"> 856 </span> : // Do the real copy work. -<span class="lineNum"> 857 </span> : _ForwardIterator __dest = __first; -<span class="lineNum"> 858 </span> : ++__first; -<span class="lineNum"> 859 </span> : while (++__first != __last) -<span class="lineNum"> 860 </span> : if (!(*__dest == *__first)) -<span class="lineNum"> 861 </span> : *++__dest = _GLIBCXX_MOVE(*__first); -<span class="lineNum"> 862 </span> : return ++__dest; -<span class="lineNum"> 863 </span> : } -<span class="lineNum"> 864 </span> : -<span class="lineNum"> 865 </span> : /** -<span class="lineNum"> 866 </span> : * @brief Remove consecutive values from a sequence using a predicate. -<span class="lineNum"> 867 </span> : * @param first A forward iterator. -<span class="lineNum"> 868 </span> : * @param last A forward iterator. -<span class="lineNum"> 869 </span> : * @param binary_pred A binary predicate. -<span class="lineNum"> 870 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 871 </span> : * -<span class="lineNum"> 872 </span> : * Removes all but the first element from each group of consecutive -<span class="lineNum"> 873 </span> : * values for which @p binary_pred returns true. -<span class="lineNum"> 874 </span> : * unique() is stable, so the relative order of elements that are -<span class="lineNum"> 875 </span> : * not removed is unchanged. -<span class="lineNum"> 876 </span> : * Elements between the end of the resulting sequence and @p last -<span class="lineNum"> 877 </span> : * are still present, but their value is unspecified. -<span class="lineNum"> 878 </span> : */ -<span class="lineNum"> 879 </span> : template<typename _ForwardIterator, typename _BinaryPredicate> -<span class="lineNum"> 880 </span> : _ForwardIterator -<span class="lineNum"> 881 </span> : unique(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 882 </span> : _BinaryPredicate __binary_pred) -<span class="lineNum"> 883 </span> : { -<span class="lineNum"> 884 </span> : // concept requirements -<span class="lineNum"> 885 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 886 </span> : _ForwardIterator>) -<span class="lineNum"> 887 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 888 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 889 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 890 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 891 </span> : -<span class="lineNum"> 892 </span> : // Skip the beginning, if already unique. -<span class="lineNum"> 893 </span> : __first = _GLIBCXX_STD_P::adjacent_find(__first, __last, __binary_pred); -<span class="lineNum"> 894 </span> : if (__first == __last) -<span class="lineNum"> 895 </span> : return __last; -<span class="lineNum"> 896 </span> : -<span class="lineNum"> 897 </span> : // Do the real copy work. -<span class="lineNum"> 898 </span> : _ForwardIterator __dest = __first; -<span class="lineNum"> 899 </span> : ++__first; -<span class="lineNum"> 900 </span> : while (++__first != __last) -<span class="lineNum"> 901 </span> : if (!bool(__binary_pred(*__dest, *__first))) -<span class="lineNum"> 902 </span> : *++__dest = _GLIBCXX_MOVE(*__first); -<span class="lineNum"> 903 </span> : return ++__dest; -<span class="lineNum"> 904 </span> : } -<span class="lineNum"> 905 </span> : -<span class="lineNum"> 906 </span> : /** -<span class="lineNum"> 907 </span> : * This is an uglified unique_copy(_InputIterator, _InputIterator, -<span class="lineNum"> 908 </span> : * _OutputIterator) -<span class="lineNum"> 909 </span> : * overloaded for forward iterators and output iterator as result. -<span class="lineNum"> 910 </span> : */ -<span class="lineNum"> 911 </span> : template<typename _ForwardIterator, typename _OutputIterator> -<span class="lineNum"> 912 </span> : _OutputIterator -<span class="lineNum"> 913 </span> : __unique_copy(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 914 </span> : _OutputIterator __result, -<span class="lineNum"> 915 </span> : forward_iterator_tag, output_iterator_tag) -<span class="lineNum"> 916 </span> : { -<span class="lineNum"> 917 </span> : // concept requirements -- taken care of in dispatching function -<span class="lineNum"> 918 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 919 </span> : *__result = *__first; -<span class="lineNum"> 920 </span> : while (++__next != __last) -<span class="lineNum"> 921 </span> : if (!(*__first == *__next)) -<span class="lineNum"> 922 </span> : { -<span class="lineNum"> 923 </span> : __first = __next; -<span class="lineNum"> 924 </span> : *++__result = *__first; -<span class="lineNum"> 925 </span> : } -<span class="lineNum"> 926 </span> : return ++__result; -<span class="lineNum"> 927 </span> : } -<span class="lineNum"> 928 </span> : -<span class="lineNum"> 929 </span> : /** -<span class="lineNum"> 930 </span> : * This is an uglified unique_copy(_InputIterator, _InputIterator, -<span class="lineNum"> 931 </span> : * _OutputIterator) -<span class="lineNum"> 932 </span> : * overloaded for input iterators and output iterator as result. -<span class="lineNum"> 933 </span> : */ -<span class="lineNum"> 934 </span> : template<typename _InputIterator, typename _OutputIterator> -<span class="lineNum"> 935 </span> : _OutputIterator -<span class="lineNum"> 936 </span> : __unique_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 937 </span> : _OutputIterator __result, -<span class="lineNum"> 938 </span> : input_iterator_tag, output_iterator_tag) -<span class="lineNum"> 939 </span> : { -<span class="lineNum"> 940 </span> : // concept requirements -- taken care of in dispatching function -<span class="lineNum"> 941 </span> : typename iterator_traits<_InputIterator>::value_type __value = *__first; -<span class="lineNum"> 942 </span> : *__result = __value; -<span class="lineNum"> 943 </span> : while (++__first != __last) -<span class="lineNum"> 944 </span> : if (!(__value == *__first)) -<span class="lineNum"> 945 </span> : { -<span class="lineNum"> 946 </span> : __value = *__first; -<span class="lineNum"> 947 </span> : *++__result = __value; -<span class="lineNum"> 948 </span> : } -<span class="lineNum"> 949 </span> : return ++__result; -<span class="lineNum"> 950 </span> : } -<span class="lineNum"> 951 </span> : -<span class="lineNum"> 952 </span> : /** -<span class="lineNum"> 953 </span> : * This is an uglified unique_copy(_InputIterator, _InputIterator, -<span class="lineNum"> 954 </span> : * _OutputIterator) -<span class="lineNum"> 955 </span> : * overloaded for input iterators and forward iterator as result. -<span class="lineNum"> 956 </span> : */ -<span class="lineNum"> 957 </span> : template<typename _InputIterator, typename _ForwardIterator> -<span class="lineNum"> 958 </span> : _ForwardIterator -<span class="lineNum"> 959 </span> : __unique_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 960 </span> : _ForwardIterator __result, -<span class="lineNum"> 961 </span> : input_iterator_tag, forward_iterator_tag) -<span class="lineNum"> 962 </span> : { -<span class="lineNum"> 963 </span> : // concept requirements -- taken care of in dispatching function -<span class="lineNum"> 964 </span> : *__result = *__first; -<span class="lineNum"> 965 </span> : while (++__first != __last) -<span class="lineNum"> 966 </span> : if (!(*__result == *__first)) -<span class="lineNum"> 967 </span> : *++__result = *__first; -<span class="lineNum"> 968 </span> : return ++__result; -<span class="lineNum"> 969 </span> : } -<span class="lineNum"> 970 </span> : -<span class="lineNum"> 971 </span> : /** -<span class="lineNum"> 972 </span> : * This is an uglified -<span class="lineNum"> 973 </span> : * unique_copy(_InputIterator, _InputIterator, _OutputIterator, -<span class="lineNum"> 974 </span> : * _BinaryPredicate) -<span class="lineNum"> 975 </span> : * overloaded for forward iterators and output iterator as result. -<span class="lineNum"> 976 </span> : */ -<span class="lineNum"> 977 </span> : template<typename _ForwardIterator, typename _OutputIterator, -<span class="lineNum"> 978 </span> : typename _BinaryPredicate> -<span class="lineNum"> 979 </span> : _OutputIterator -<span class="lineNum"> 980 </span> : __unique_copy(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 981 </span> : _OutputIterator __result, _BinaryPredicate __binary_pred, -<span class="lineNum"> 982 </span> : forward_iterator_tag, output_iterator_tag) -<span class="lineNum"> 983 </span> : { -<span class="lineNum"> 984 </span> : // concept requirements -- iterators already checked -<span class="lineNum"> 985 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 986 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 987 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 988 </span> : -<span class="lineNum"> 989 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 990 </span> : *__result = *__first; -<span class="lineNum"> 991 </span> : while (++__next != __last) -<span class="lineNum"> 992 </span> : if (!bool(__binary_pred(*__first, *__next))) -<span class="lineNum"> 993 </span> : { -<span class="lineNum"> 994 </span> : __first = __next; -<span class="lineNum"> 995 </span> : *++__result = *__first; -<span class="lineNum"> 996 </span> : } -<span class="lineNum"> 997 </span> : return ++__result; -<span class="lineNum"> 998 </span> : } -<span class="lineNum"> 999 </span> : -<span class="lineNum"> 1000 </span> : /** -<span class="lineNum"> 1001 </span> : * This is an uglified -<span class="lineNum"> 1002 </span> : * unique_copy(_InputIterator, _InputIterator, _OutputIterator, -<span class="lineNum"> 1003 </span> : * _BinaryPredicate) -<span class="lineNum"> 1004 </span> : * overloaded for input iterators and output iterator as result. -<span class="lineNum"> 1005 </span> : */ -<span class="lineNum"> 1006 </span> : template<typename _InputIterator, typename _OutputIterator, -<span class="lineNum"> 1007 </span> : typename _BinaryPredicate> -<span class="lineNum"> 1008 </span> : _OutputIterator -<span class="lineNum"> 1009 </span> : __unique_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1010 </span> : _OutputIterator __result, _BinaryPredicate __binary_pred, -<span class="lineNum"> 1011 </span> : input_iterator_tag, output_iterator_tag) -<span class="lineNum"> 1012 </span> : { -<span class="lineNum"> 1013 </span> : // concept requirements -- iterators already checked -<span class="lineNum"> 1014 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 1015 </span> : typename iterator_traits<_InputIterator>::value_type, -<span class="lineNum"> 1016 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 1017 </span> : -<span class="lineNum"> 1018 </span> : typename iterator_traits<_InputIterator>::value_type __value = *__first; -<span class="lineNum"> 1019 </span> : *__result = __value; -<span class="lineNum"> 1020 </span> : while (++__first != __last) -<span class="lineNum"> 1021 </span> : if (!bool(__binary_pred(__value, *__first))) -<span class="lineNum"> 1022 </span> : { -<span class="lineNum"> 1023 </span> : __value = *__first; -<span class="lineNum"> 1024 </span> : *++__result = __value; -<span class="lineNum"> 1025 </span> : } -<span class="lineNum"> 1026 </span> : return ++__result; -<span class="lineNum"> 1027 </span> : } -<span class="lineNum"> 1028 </span> : -<span class="lineNum"> 1029 </span> : /** -<span class="lineNum"> 1030 </span> : * This is an uglified -<span class="lineNum"> 1031 </span> : * unique_copy(_InputIterator, _InputIterator, _OutputIterator, -<span class="lineNum"> 1032 </span> : * _BinaryPredicate) -<span class="lineNum"> 1033 </span> : * overloaded for input iterators and forward iterator as result. -<span class="lineNum"> 1034 </span> : */ -<span class="lineNum"> 1035 </span> : template<typename _InputIterator, typename _ForwardIterator, -<span class="lineNum"> 1036 </span> : typename _BinaryPredicate> -<span class="lineNum"> 1037 </span> : _ForwardIterator -<span class="lineNum"> 1038 </span> : __unique_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1039 </span> : _ForwardIterator __result, _BinaryPredicate __binary_pred, -<span class="lineNum"> 1040 </span> : input_iterator_tag, forward_iterator_tag) -<span class="lineNum"> 1041 </span> : { -<span class="lineNum"> 1042 </span> : // concept requirements -- iterators already checked -<span class="lineNum"> 1043 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 1044 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 1045 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 1046 </span> : -<span class="lineNum"> 1047 </span> : *__result = *__first; -<span class="lineNum"> 1048 </span> : while (++__first != __last) -<span class="lineNum"> 1049 </span> : if (!bool(__binary_pred(*__result, *__first))) -<span class="lineNum"> 1050 </span> : *++__result = *__first; -<span class="lineNum"> 1051 </span> : return ++__result; -<span class="lineNum"> 1052 </span> : } -<span class="lineNum"> 1053 </span> : -<span class="lineNum"> 1054 </span> : /** -<span class="lineNum"> 1055 </span> : * This is an uglified reverse(_BidirectionalIterator, -<span class="lineNum"> 1056 </span> : * _BidirectionalIterator) -<span class="lineNum"> 1057 </span> : * overloaded for bidirectional iterators. -<span class="lineNum"> 1058 </span> : */ -<span class="lineNum"> 1059 </span> : template<typename _BidirectionalIterator> -<span class="lineNum"> 1060 </span> : void -<span class="lineNum"> 1061 </span> : __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, -<span class="lineNum"> 1062 </span> : bidirectional_iterator_tag) -<span class="lineNum"> 1063 </span> : { -<span class="lineNum"> 1064 </span> : while (true) -<span class="lineNum"> 1065 </span> : if (__first == __last || __first == --__last) -<span class="lineNum"> 1066 </span> : return; -<span class="lineNum"> 1067 </span> : else -<span class="lineNum"> 1068 </span> : { -<span class="lineNum"> 1069 </span> : std::iter_swap(__first, __last); -<span class="lineNum"> 1070 </span> : ++__first; -<span class="lineNum"> 1071 </span> : } -<span class="lineNum"> 1072 </span> : } -<span class="lineNum"> 1073 </span> : -<span class="lineNum"> 1074 </span> : /** -<span class="lineNum"> 1075 </span> : * This is an uglified reverse(_BidirectionalIterator, -<span class="lineNum"> 1076 </span> : * _BidirectionalIterator) -<span class="lineNum"> 1077 </span> : * overloaded for random access iterators. -<span class="lineNum"> 1078 </span> : */ -<span class="lineNum"> 1079 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 1080 </span> : void -<span class="lineNum"> 1081 </span> : __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 1082 </span> : random_access_iterator_tag) -<span class="lineNum"> 1083 </span> : { -<span class="lineNum"> 1084 </span> : if (__first == __last) -<span class="lineNum"> 1085 </span> : return; -<span class="lineNum"> 1086 </span> : --__last; -<span class="lineNum"> 1087 </span> : while (__first < __last) -<span class="lineNum"> 1088 </span> : { -<span class="lineNum"> 1089 </span> : std::iter_swap(__first, __last); -<span class="lineNum"> 1090 </span> : ++__first; -<span class="lineNum"> 1091 </span> : --__last; -<span class="lineNum"> 1092 </span> : } -<span class="lineNum"> 1093 </span> : } -<span class="lineNum"> 1094 </span> : -<span class="lineNum"> 1095 </span> : /** -<span class="lineNum"> 1096 </span> : * @brief Reverse a sequence. -<span class="lineNum"> 1097 </span> : * @param first A bidirectional iterator. -<span class="lineNum"> 1098 </span> : * @param last A bidirectional iterator. -<span class="lineNum"> 1099 </span> : * @return reverse() returns no value. -<span class="lineNum"> 1100 </span> : * -<span class="lineNum"> 1101 </span> : * Reverses the order of the elements in the range @p [first,last), -<span class="lineNum"> 1102 </span> : * so that the first element becomes the last etc. -<span class="lineNum"> 1103 </span> : * For every @c i such that @p 0<=i<=(last-first)/2), @p reverse() -<span class="lineNum"> 1104 </span> : * swaps @p *(first+i) and @p *(last-(i+1)) -<span class="lineNum"> 1105 </span> : */ -<span class="lineNum"> 1106 </span> : template<typename _BidirectionalIterator> -<span class="lineNum"> 1107 </span> : inline void -<span class="lineNum"> 1108 </span> : reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) -<span class="lineNum"> 1109 </span> : { -<span class="lineNum"> 1110 </span> : // concept requirements -<span class="lineNum"> 1111 </span> : __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< -<span class="lineNum"> 1112 </span> : _BidirectionalIterator>) -<span class="lineNum"> 1113 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 1114 </span> : std::__reverse(__first, __last, std::__iterator_category(__first)); -<span class="lineNum"> 1115 </span> : } -<span class="lineNum"> 1116 </span> : -<span class="lineNum"> 1117 </span> : /** -<span class="lineNum"> 1118 </span> : * @brief Copy a sequence, reversing its elements. -<span class="lineNum"> 1119 </span> : * @param first A bidirectional iterator. -<span class="lineNum"> 1120 </span> : * @param last A bidirectional iterator. -<span class="lineNum"> 1121 </span> : * @param result An output iterator. -<span class="lineNum"> 1122 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 1123 </span> : * -<span class="lineNum"> 1124 </span> : * Copies the elements in the range @p [first,last) to the range -<span class="lineNum"> 1125 </span> : * @p [result,result+(last-first)) such that the order of the -<span class="lineNum"> 1126 </span> : * elements is reversed. -<span class="lineNum"> 1127 </span> : * For every @c i such that @p 0<=i<=(last-first), @p reverse_copy() -<span class="lineNum"> 1128 </span> : * performs the assignment @p *(result+(last-first)-i) = *(first+i). -<span class="lineNum"> 1129 </span> : * The ranges @p [first,last) and @p [result,result+(last-first)) -<span class="lineNum"> 1130 </span> : * must not overlap. -<span class="lineNum"> 1131 </span> : */ -<span class="lineNum"> 1132 </span> : template<typename _BidirectionalIterator, typename _OutputIterator> -<span class="lineNum"> 1133 </span> : _OutputIterator -<span class="lineNum"> 1134 </span> : reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, -<span class="lineNum"> 1135 </span> : _OutputIterator __result) -<span class="lineNum"> 1136 </span> : { -<span class="lineNum"> 1137 </span> : // concept requirements -<span class="lineNum"> 1138 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 1139 </span> : _BidirectionalIterator>) -<span class="lineNum"> 1140 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 1141 </span> : typename iterator_traits<_BidirectionalIterator>::value_type>) -<span class="lineNum"> 1142 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 1143 </span> : -<span class="lineNum"> 1144 </span> : while (__first != __last) -<span class="lineNum"> 1145 </span> : { -<span class="lineNum"> 1146 </span> : --__last; -<span class="lineNum"> 1147 </span> : *__result = *__last; -<span class="lineNum"> 1148 </span> : ++__result; -<span class="lineNum"> 1149 </span> : } -<span class="lineNum"> 1150 </span> : return __result; -<span class="lineNum"> 1151 </span> : } -<span class="lineNum"> 1152 </span> : -<span class="lineNum"> 1153 </span> : /** -<span class="lineNum"> 1154 </span> : * This is a helper function for the rotate algorithm specialized on RAIs. -<span class="lineNum"> 1155 </span> : * It returns the greatest common divisor of two integer values. -<span class="lineNum"> 1156 </span> : */ -<span class="lineNum"> 1157 </span> : template<typename _EuclideanRingElement> -<span class="lineNum"> 1158 </span> : _EuclideanRingElement -<span class="lineNum"> 1159 </span> : __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n) -<span class="lineNum"> 1160 </span> : { -<span class="lineNum"> 1161 </span> : while (__n != 0) -<span class="lineNum"> 1162 </span> : { -<span class="lineNum"> 1163 </span> : _EuclideanRingElement __t = __m % __n; -<span class="lineNum"> 1164 </span> : __m = __n; -<span class="lineNum"> 1165 </span> : __n = __t; -<span class="lineNum"> 1166 </span> : } -<span class="lineNum"> 1167 </span> : return __m; -<span class="lineNum"> 1168 </span> : } -<span class="lineNum"> 1169 </span> : -<span class="lineNum"> 1170 </span> : /// This is a helper function for the rotate algorithm. -<span class="lineNum"> 1171 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 1172 </span> : void -<span class="lineNum"> 1173 </span> : __rotate(_ForwardIterator __first, -<span class="lineNum"> 1174 </span> : _ForwardIterator __middle, -<span class="lineNum"> 1175 </span> : _ForwardIterator __last, -<span class="lineNum"> 1176 </span> : forward_iterator_tag) -<span class="lineNum"> 1177 </span> : { -<span class="lineNum"> 1178 </span> : if (__first == __middle || __last == __middle) -<span class="lineNum"> 1179 </span> : return; -<span class="lineNum"> 1180 </span> : -<span class="lineNum"> 1181 </span> : _ForwardIterator __first2 = __middle; -<span class="lineNum"> 1182 </span> : do -<span class="lineNum"> 1183 </span> : { -<span class="lineNum"> 1184 </span> : std::iter_swap(__first, __first2); -<span class="lineNum"> 1185 </span> : ++__first; -<span class="lineNum"> 1186 </span> : ++__first2; -<span class="lineNum"> 1187 </span> : if (__first == __middle) -<span class="lineNum"> 1188 </span> : __middle = __first2; -<span class="lineNum"> 1189 </span> : } -<span class="lineNum"> 1190 </span> : while (__first2 != __last); -<span class="lineNum"> 1191 </span> : -<span class="lineNum"> 1192 </span> : __first2 = __middle; -<span class="lineNum"> 1193 </span> : -<span class="lineNum"> 1194 </span> : while (__first2 != __last) -<span class="lineNum"> 1195 </span> : { -<span class="lineNum"> 1196 </span> : std::iter_swap(__first, __first2); -<span class="lineNum"> 1197 </span> : ++__first; -<span class="lineNum"> 1198 </span> : ++__first2; -<span class="lineNum"> 1199 </span> : if (__first == __middle) -<span class="lineNum"> 1200 </span> : __middle = __first2; -<span class="lineNum"> 1201 </span> : else if (__first2 == __last) -<span class="lineNum"> 1202 </span> : __first2 = __middle; -<span class="lineNum"> 1203 </span> : } -<span class="lineNum"> 1204 </span> : } -<span class="lineNum"> 1205 </span> : -<span class="lineNum"> 1206 </span> : /// This is a helper function for the rotate algorithm. -<span class="lineNum"> 1207 </span> : template<typename _BidirectionalIterator> -<span class="lineNum"> 1208 </span> : void -<span class="lineNum"> 1209 </span> : __rotate(_BidirectionalIterator __first, -<span class="lineNum"> 1210 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 1211 </span> : _BidirectionalIterator __last, -<span class="lineNum"> 1212 </span> : bidirectional_iterator_tag) -<span class="lineNum"> 1213 </span> : { -<span class="lineNum"> 1214 </span> : // concept requirements -<span class="lineNum"> 1215 </span> : __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< -<span class="lineNum"> 1216 </span> : _BidirectionalIterator>) -<span class="lineNum"> 1217 </span> : -<span class="lineNum"> 1218 </span> : if (__first == __middle || __last == __middle) -<span class="lineNum"> 1219 </span> : return; -<span class="lineNum"> 1220 </span> : -<span class="lineNum"> 1221 </span> : std::__reverse(__first, __middle, bidirectional_iterator_tag()); -<span class="lineNum"> 1222 </span> : std::__reverse(__middle, __last, bidirectional_iterator_tag()); -<span class="lineNum"> 1223 </span> : -<span class="lineNum"> 1224 </span> : while (__first != __middle && __middle != __last) -<span class="lineNum"> 1225 </span> : { -<span class="lineNum"> 1226 </span> : std::iter_swap(__first, --__last); -<span class="lineNum"> 1227 </span> : ++__first; -<span class="lineNum"> 1228 </span> : } -<span class="lineNum"> 1229 </span> : -<span class="lineNum"> 1230 </span> : if (__first == __middle) -<span class="lineNum"> 1231 </span> : std::__reverse(__middle, __last, bidirectional_iterator_tag()); -<span class="lineNum"> 1232 </span> : else -<span class="lineNum"> 1233 </span> : std::__reverse(__first, __middle, bidirectional_iterator_tag()); -<span class="lineNum"> 1234 </span> : } -<span class="lineNum"> 1235 </span> : -<span class="lineNum"> 1236 </span> : /// This is a helper function for the rotate algorithm. -<span class="lineNum"> 1237 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 1238 </span> : void -<span class="lineNum"> 1239 </span> : __rotate(_RandomAccessIterator __first, -<span class="lineNum"> 1240 </span> : _RandomAccessIterator __middle, -<span class="lineNum"> 1241 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 1242 </span> : random_access_iterator_tag) -<span class="lineNum"> 1243 </span> : { -<span class="lineNum"> 1244 </span> : // concept requirements -<span class="lineNum"> 1245 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 1246 </span> : _RandomAccessIterator>) -<span class="lineNum"> 1247 </span> : -<span class="lineNum"> 1248 </span> : if (__first == __middle || __last == __middle) -<span class="lineNum"> 1249 </span> : return; -<span class="lineNum"> 1250 </span> : -<span class="lineNum"> 1251 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 1252 </span> : _Distance; -<span class="lineNum"> 1253 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1254 </span> : _ValueType; -<span class="lineNum"> 1255 </span> : -<span class="lineNum"> 1256 </span> : const _Distance __n = __last - __first; -<span class="lineNum"> 1257 </span> : const _Distance __k = __middle - __first; -<span class="lineNum"> 1258 </span> : const _Distance __l = __n - __k; -<span class="lineNum"> 1259 </span> : -<span class="lineNum"> 1260 </span> : if (__k == __l) -<span class="lineNum"> 1261 </span> : { -<span class="lineNum"> 1262 </span> : std::swap_ranges(__first, __middle, __middle); -<span class="lineNum"> 1263 </span> : return; -<span class="lineNum"> 1264 </span> : } -<span class="lineNum"> 1265 </span> : -<span class="lineNum"> 1266 </span> : const _Distance __d = std::__gcd(__n, __k); -<span class="lineNum"> 1267 </span> : -<span class="lineNum"> 1268 </span> : for (_Distance __i = 0; __i < __d; __i++) -<span class="lineNum"> 1269 </span> : { -<span class="lineNum"> 1270 </span> : _ValueType __tmp = _GLIBCXX_MOVE(*__first); -<span class="lineNum"> 1271 </span> : _RandomAccessIterator __p = __first; -<span class="lineNum"> 1272 </span> : -<span class="lineNum"> 1273 </span> : if (__k < __l) -<span class="lineNum"> 1274 </span> : { -<span class="lineNum"> 1275 </span> : for (_Distance __j = 0; __j < __l / __d; __j++) -<span class="lineNum"> 1276 </span> : { -<span class="lineNum"> 1277 </span> : if (__p > __first + __l) -<span class="lineNum"> 1278 </span> : { -<span class="lineNum"> 1279 </span> : *__p = _GLIBCXX_MOVE(*(__p - __l)); -<span class="lineNum"> 1280 </span> : __p -= __l; -<span class="lineNum"> 1281 </span> : } -<span class="lineNum"> 1282 </span> : -<span class="lineNum"> 1283 </span> : *__p = _GLIBCXX_MOVE(*(__p + __k)); -<span class="lineNum"> 1284 </span> : __p += __k; -<span class="lineNum"> 1285 </span> : } -<span class="lineNum"> 1286 </span> : } -<span class="lineNum"> 1287 </span> : else -<span class="lineNum"> 1288 </span> : { -<span class="lineNum"> 1289 </span> : for (_Distance __j = 0; __j < __k / __d - 1; __j ++) -<span class="lineNum"> 1290 </span> : { -<span class="lineNum"> 1291 </span> : if (__p < __last - __k) -<span class="lineNum"> 1292 </span> : { -<span class="lineNum"> 1293 </span> : *__p = _GLIBCXX_MOVE(*(__p + __k)); -<span class="lineNum"> 1294 </span> : __p += __k; -<span class="lineNum"> 1295 </span> : } -<span class="lineNum"> 1296 </span> : *__p = _GLIBCXX_MOVE(*(__p - __l)); -<span class="lineNum"> 1297 </span> : __p -= __l; -<span class="lineNum"> 1298 </span> : } -<span class="lineNum"> 1299 </span> : } -<span class="lineNum"> 1300 </span> : -<span class="lineNum"> 1301 </span> : *__p = _GLIBCXX_MOVE(__tmp); -<span class="lineNum"> 1302 </span> : ++__first; -<span class="lineNum"> 1303 </span> : } -<span class="lineNum"> 1304 </span> : } -<span class="lineNum"> 1305 </span> : -<span class="lineNum"> 1306 </span> : /** -<span class="lineNum"> 1307 </span> : * @brief Rotate the elements of a sequence. -<span class="lineNum"> 1308 </span> : * @param first A forward iterator. -<span class="lineNum"> 1309 </span> : * @param middle A forward iterator. -<span class="lineNum"> 1310 </span> : * @param last A forward iterator. -<span class="lineNum"> 1311 </span> : * @return Nothing. -<span class="lineNum"> 1312 </span> : * -<span class="lineNum"> 1313 </span> : * Rotates the elements of the range @p [first,last) by @p (middle-first) -<span class="lineNum"> 1314 </span> : * positions so that the element at @p middle is moved to @p first, the -<span class="lineNum"> 1315 </span> : * element at @p middle+1 is moved to @first+1 and so on for each element -<span class="lineNum"> 1316 </span> : * in the range @p [first,last). -<span class="lineNum"> 1317 </span> : * -<span class="lineNum"> 1318 </span> : * This effectively swaps the ranges @p [first,middle) and -<span class="lineNum"> 1319 </span> : * @p [middle,last). -<span class="lineNum"> 1320 </span> : * -<span class="lineNum"> 1321 </span> : * Performs @p *(first+(n+(last-middle))%(last-first))=*(first+n) for -<span class="lineNum"> 1322 </span> : * each @p n in the range @p [0,last-first). -<span class="lineNum"> 1323 </span> : */ -<span class="lineNum"> 1324 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 1325 </span> : inline void -<span class="lineNum"> 1326 </span> : rotate(_ForwardIterator __first, _ForwardIterator __middle, -<span class="lineNum"> 1327 </span> : _ForwardIterator __last) -<span class="lineNum"> 1328 </span> : { -<span class="lineNum"> 1329 </span> : // concept requirements -<span class="lineNum"> 1330 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 1331 </span> : _ForwardIterator>) -<span class="lineNum"> 1332 </span> : __glibcxx_requires_valid_range(__first, __middle); -<span class="lineNum"> 1333 </span> : __glibcxx_requires_valid_range(__middle, __last); -<span class="lineNum"> 1334 </span> : -<span class="lineNum"> 1335 </span> : typedef typename iterator_traits<_ForwardIterator>::iterator_category -<span class="lineNum"> 1336 </span> : _IterType; -<span class="lineNum"> 1337 </span> : std::__rotate(__first, __middle, __last, _IterType()); -<span class="lineNum"> 1338 </span> : } -<span class="lineNum"> 1339 </span> : -<span class="lineNum"> 1340 </span> : /** -<span class="lineNum"> 1341 </span> : * @brief Copy a sequence, rotating its elements. -<span class="lineNum"> 1342 </span> : * @param first A forward iterator. -<span class="lineNum"> 1343 </span> : * @param middle A forward iterator. -<span class="lineNum"> 1344 </span> : * @param last A forward iterator. -<span class="lineNum"> 1345 </span> : * @param result An output iterator. -<span class="lineNum"> 1346 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 1347 </span> : * -<span class="lineNum"> 1348 </span> : * Copies the elements of the range @p [first,last) to the range -<span class="lineNum"> 1349 </span> : * beginning at @result, rotating the copied elements by @p (middle-first) -<span class="lineNum"> 1350 </span> : * positions so that the element at @p middle is moved to @p result, the -<span class="lineNum"> 1351 </span> : * element at @p middle+1 is moved to @result+1 and so on for each element -<span class="lineNum"> 1352 </span> : * in the range @p [first,last). -<span class="lineNum"> 1353 </span> : * -<span class="lineNum"> 1354 </span> : * Performs @p *(result+(n+(last-middle))%(last-first))=*(first+n) for -<span class="lineNum"> 1355 </span> : * each @p n in the range @p [0,last-first). -<span class="lineNum"> 1356 </span> : */ -<span class="lineNum"> 1357 </span> : template<typename _ForwardIterator, typename _OutputIterator> -<span class="lineNum"> 1358 </span> : _OutputIterator -<span class="lineNum"> 1359 </span> : rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, -<span class="lineNum"> 1360 </span> : _ForwardIterator __last, _OutputIterator __result) -<span class="lineNum"> 1361 </span> : { -<span class="lineNum"> 1362 </span> : // concept requirements -<span class="lineNum"> 1363 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 1364 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 1365 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 1366 </span> : __glibcxx_requires_valid_range(__first, __middle); -<span class="lineNum"> 1367 </span> : __glibcxx_requires_valid_range(__middle, __last); -<span class="lineNum"> 1368 </span> : -<span class="lineNum"> 1369 </span> : return std::copy(__first, __middle, -<span class="lineNum"> 1370 </span> : std::copy(__middle, __last, __result)); -<span class="lineNum"> 1371 </span> : } -<span class="lineNum"> 1372 </span> : -<span class="lineNum"> 1373 </span> : /// This is a helper function... -<span class="lineNum"> 1374 </span> : template<typename _ForwardIterator, typename _Predicate> -<span class="lineNum"> 1375 </span> : _ForwardIterator -<span class="lineNum"> 1376 </span> : __partition(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 1377 </span> : _Predicate __pred, forward_iterator_tag) -<span class="lineNum"> 1378 </span> : { -<span class="lineNum"> 1379 </span> : if (__first == __last) -<span class="lineNum"> 1380 </span> : return __first; -<span class="lineNum"> 1381 </span> : -<span class="lineNum"> 1382 </span> : while (__pred(*__first)) -<span class="lineNum"> 1383 </span> : if (++__first == __last) -<span class="lineNum"> 1384 </span> : return __first; -<span class="lineNum"> 1385 </span> : -<span class="lineNum"> 1386 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 1387 </span> : -<span class="lineNum"> 1388 </span> : while (++__next != __last) -<span class="lineNum"> 1389 </span> : if (__pred(*__next)) -<span class="lineNum"> 1390 </span> : { -<span class="lineNum"> 1391 </span> : std::iter_swap(__first, __next); -<span class="lineNum"> 1392 </span> : ++__first; -<span class="lineNum"> 1393 </span> : } -<span class="lineNum"> 1394 </span> : -<span class="lineNum"> 1395 </span> : return __first; -<span class="lineNum"> 1396 </span> : } -<span class="lineNum"> 1397 </span> : -<span class="lineNum"> 1398 </span> : /// This is a helper function... -<span class="lineNum"> 1399 </span> : template<typename _BidirectionalIterator, typename _Predicate> -<span class="lineNum"> 1400 </span> : _BidirectionalIterator -<span class="lineNum"> 1401 </span> : __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, -<span class="lineNum"> 1402 </span> : _Predicate __pred, bidirectional_iterator_tag) -<span class="lineNum"> 1403 </span> : { -<span class="lineNum"> 1404 </span> : while (true) -<span class="lineNum"> 1405 </span> : { -<span class="lineNum"> 1406 </span> : while (true) -<span class="lineNum"> 1407 </span> : if (__first == __last) -<span class="lineNum"> 1408 </span> : return __first; -<span class="lineNum"> 1409 </span> : else if (__pred(*__first)) -<span class="lineNum"> 1410 </span> : ++__first; -<span class="lineNum"> 1411 </span> : else -<span class="lineNum"> 1412 </span> : break; -<span class="lineNum"> 1413 </span> : --__last; -<span class="lineNum"> 1414 </span> : while (true) -<span class="lineNum"> 1415 </span> : if (__first == __last) -<span class="lineNum"> 1416 </span> : return __first; -<span class="lineNum"> 1417 </span> : else if (!bool(__pred(*__last))) -<span class="lineNum"> 1418 </span> : --__last; -<span class="lineNum"> 1419 </span> : else -<span class="lineNum"> 1420 </span> : break; -<span class="lineNum"> 1421 </span> : std::iter_swap(__first, __last); -<span class="lineNum"> 1422 </span> : ++__first; -<span class="lineNum"> 1423 </span> : } -<span class="lineNum"> 1424 </span> : } -<span class="lineNum"> 1425 </span> : -<span class="lineNum"> 1426 </span> : // partition -<span class="lineNum"> 1427 </span> : -<span class="lineNum"> 1428 </span> : /// This is a helper function... -<span class="lineNum"> 1429 </span> : template<typename _ForwardIterator, typename _Predicate, typename _Distance> -<span class="lineNum"> 1430 </span> : _ForwardIterator -<span class="lineNum"> 1431 </span> : __inplace_stable_partition(_ForwardIterator __first, -<span class="lineNum"> 1432 </span> : _ForwardIterator __last, -<span class="lineNum"> 1433 </span> : _Predicate __pred, _Distance __len) -<span class="lineNum"> 1434 </span> : { -<span class="lineNum"> 1435 </span> : if (__len == 1) -<span class="lineNum"> 1436 </span> : return __pred(*__first) ? __last : __first; -<span class="lineNum"> 1437 </span> : _ForwardIterator __middle = __first; -<span class="lineNum"> 1438 </span> : std::advance(__middle, __len / 2); -<span class="lineNum"> 1439 </span> : _ForwardIterator __begin = std::__inplace_stable_partition(__first, -<span class="lineNum"> 1440 </span> : __middle, -<span class="lineNum"> 1441 </span> : __pred, -<span class="lineNum"> 1442 </span> : __len / 2); -<span class="lineNum"> 1443 </span> : _ForwardIterator __end = std::__inplace_stable_partition(__middle, __last, -<span class="lineNum"> 1444 </span> : __pred, -<span class="lineNum"> 1445 </span> : __len -<span class="lineNum"> 1446 </span> : - __len / 2); -<span class="lineNum"> 1447 </span> : std::rotate(__begin, __middle, __end); -<span class="lineNum"> 1448 </span> : std::advance(__begin, std::distance(__middle, __end)); -<span class="lineNum"> 1449 </span> : return __begin; -<span class="lineNum"> 1450 </span> : } -<span class="lineNum"> 1451 </span> : -<span class="lineNum"> 1452 </span> : /// This is a helper function... -<span class="lineNum"> 1453 </span> : template<typename _ForwardIterator, typename _Pointer, typename _Predicate, -<span class="lineNum"> 1454 </span> : typename _Distance> -<span class="lineNum"> 1455 </span> : _ForwardIterator -<span class="lineNum"> 1456 </span> : __stable_partition_adaptive(_ForwardIterator __first, -<span class="lineNum"> 1457 </span> : _ForwardIterator __last, -<span class="lineNum"> 1458 </span> : _Predicate __pred, _Distance __len, -<span class="lineNum"> 1459 </span> : _Pointer __buffer, -<span class="lineNum"> 1460 </span> : _Distance __buffer_size) -<span class="lineNum"> 1461 </span> : { -<span class="lineNum"> 1462 </span> : if (__len <= __buffer_size) -<span class="lineNum"> 1463 </span> : { -<span class="lineNum"> 1464 </span> : _ForwardIterator __result1 = __first; -<span class="lineNum"> 1465 </span> : _Pointer __result2 = __buffer; -<span class="lineNum"> 1466 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 1467 </span> : if (__pred(*__first)) -<span class="lineNum"> 1468 </span> : { -<span class="lineNum"> 1469 </span> : *__result1 = *__first; -<span class="lineNum"> 1470 </span> : ++__result1; -<span class="lineNum"> 1471 </span> : } -<span class="lineNum"> 1472 </span> : else -<span class="lineNum"> 1473 </span> : { -<span class="lineNum"> 1474 </span> : *__result2 = *__first; -<span class="lineNum"> 1475 </span> : ++__result2; -<span class="lineNum"> 1476 </span> : } -<span class="lineNum"> 1477 </span> : std::copy(__buffer, __result2, __result1); -<span class="lineNum"> 1478 </span> : return __result1; -<span class="lineNum"> 1479 </span> : } -<span class="lineNum"> 1480 </span> : else -<span class="lineNum"> 1481 </span> : { -<span class="lineNum"> 1482 </span> : _ForwardIterator __middle = __first; -<span class="lineNum"> 1483 </span> : std::advance(__middle, __len / 2); -<span class="lineNum"> 1484 </span> : _ForwardIterator __begin = -<span class="lineNum"> 1485 </span> : std::__stable_partition_adaptive(__first, __middle, __pred, -<span class="lineNum"> 1486 </span> : __len / 2, __buffer, -<span class="lineNum"> 1487 </span> : __buffer_size); -<span class="lineNum"> 1488 </span> : _ForwardIterator __end = -<span class="lineNum"> 1489 </span> : std::__stable_partition_adaptive(__middle, __last, __pred, -<span class="lineNum"> 1490 </span> : __len - __len / 2, -<span class="lineNum"> 1491 </span> : __buffer, __buffer_size); -<span class="lineNum"> 1492 </span> : std::rotate(__begin, __middle, __end); -<span class="lineNum"> 1493 </span> : std::advance(__begin, std::distance(__middle, __end)); -<span class="lineNum"> 1494 </span> : return __begin; -<span class="lineNum"> 1495 </span> : } -<span class="lineNum"> 1496 </span> : } -<span class="lineNum"> 1497 </span> : -<span class="lineNum"> 1498 </span> : /** -<span class="lineNum"> 1499 </span> : * @brief Move elements for which a predicate is true to the beginning -<span class="lineNum"> 1500 </span> : * of a sequence, preserving relative ordering. -<span class="lineNum"> 1501 </span> : * @param first A forward iterator. -<span class="lineNum"> 1502 </span> : * @param last A forward iterator. -<span class="lineNum"> 1503 </span> : * @param pred A predicate functor. -<span class="lineNum"> 1504 </span> : * @return An iterator @p middle such that @p pred(i) is true for each -<span class="lineNum"> 1505 </span> : * iterator @p i in the range @p [first,middle) and false for each @p i -<span class="lineNum"> 1506 </span> : * in the range @p [middle,last). -<span class="lineNum"> 1507 </span> : * -<span class="lineNum"> 1508 </span> : * Performs the same function as @p partition() with the additional -<span class="lineNum"> 1509 </span> : * guarantee that the relative ordering of elements in each group is -<span class="lineNum"> 1510 </span> : * preserved, so any two elements @p x and @p y in the range -<span class="lineNum"> 1511 </span> : * @p [first,last) such that @p pred(x)==pred(y) will have the same -<span class="lineNum"> 1512 </span> : * relative ordering after calling @p stable_partition(). -<span class="lineNum"> 1513 </span> : */ -<span class="lineNum"> 1514 </span> : template<typename _ForwardIterator, typename _Predicate> -<span class="lineNum"> 1515 </span> : _ForwardIterator -<span class="lineNum"> 1516 </span> : stable_partition(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 1517 </span> : _Predicate __pred) -<span class="lineNum"> 1518 </span> : { -<span class="lineNum"> 1519 </span> : // concept requirements -<span class="lineNum"> 1520 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 1521 </span> : _ForwardIterator>) -<span class="lineNum"> 1522 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 1523 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 1524 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 1525 </span> : -<span class="lineNum"> 1526 </span> : if (__first == __last) -<span class="lineNum"> 1527 </span> : return __first; -<span class="lineNum"> 1528 </span> : else -<span class="lineNum"> 1529 </span> : { -<span class="lineNum"> 1530 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 1531 </span> : _ValueType; -<span class="lineNum"> 1532 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 1533 </span> : _DistanceType; -<span class="lineNum"> 1534 </span> : -<span class="lineNum"> 1535 </span> : _Temporary_buffer<_ForwardIterator, _ValueType> __buf(__first, -<span class="lineNum"> 1536 </span> : __last); -<span class="lineNum"> 1537 </span> : if (__buf.size() > 0) -<span class="lineNum"> 1538 </span> : return -<span class="lineNum"> 1539 </span> : std::__stable_partition_adaptive(__first, __last, __pred, -<span class="lineNum"> 1540 </span> : _DistanceType(__buf.requested_size()), -<span class="lineNum"> 1541 </span> : __buf.begin(), -<span class="lineNum"> 1542 </span> : _DistanceType(__buf.size())); -<span class="lineNum"> 1543 </span> : else -<span class="lineNum"> 1544 </span> : return -<span class="lineNum"> 1545 </span> : std::__inplace_stable_partition(__first, __last, __pred, -<span class="lineNum"> 1546 </span> : _DistanceType(__buf.requested_size())); -<span class="lineNum"> 1547 </span> : } -<span class="lineNum"> 1548 </span> : } -<span class="lineNum"> 1549 </span> : -<span class="lineNum"> 1550 </span> : /// This is a helper function for the sort routines. -<span class="lineNum"> 1551 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 1552 </span> : void -<span class="lineNum"> 1553 </span> : __heap_select(_RandomAccessIterator __first, -<span class="lineNum"> 1554 </span> : _RandomAccessIterator __middle, -<span class="lineNum"> 1555 </span><span class="lineNoCov"> 0 : _RandomAccessIterator __last)</span> -<span class="lineNum"> 1556 </span> : { -<span class="lineNum"> 1557 </span><span class="lineNoCov"> 0 : std::make_heap(__first, __middle);</span> -<span class="lineNum"> 1558 </span><span class="lineNoCov"> 0 : for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)</span> -<span class="lineNum"> 1559 </span><span class="lineNoCov"> 0 : if (*__i < *__first)</span> -<span class="lineNum"> 1560 </span><span class="lineNoCov"> 0 : std::__pop_heap(__first, __middle, __i);</span> -<span class="lineNum"> 1561 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 1562 </span> : -<span class="lineNum"> 1563 </span> : /// This is a helper function for the sort routines. -<span class="lineNum"> 1564 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 1565 </span> : void -<span class="lineNum"> 1566 </span> : __heap_select(_RandomAccessIterator __first, -<span class="lineNum"> 1567 </span> : _RandomAccessIterator __middle, -<span class="lineNum"> 1568 </span><span class="lineNoCov"> 0 : _RandomAccessIterator __last, _Compare __comp)</span> -<span class="lineNum"> 1569 </span> : { -<span class="lineNum"> 1570 </span><span class="lineNoCov"> 0 : std::make_heap(__first, __middle, __comp);</span> -<span class="lineNum"> 1571 </span><span class="lineNoCov"> 0 : for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)</span> -<span class="lineNum"> 1572 </span><span class="lineNoCov"> 0 : if (__comp(*__i, *__first))</span> -<span class="lineNum"> 1573 </span><span class="lineNoCov"> 0 : std::__pop_heap(__first, __middle, __i, __comp);</span> -<span class="lineNum"> 1574 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 1575 </span> : -<span class="lineNum"> 1576 </span> : // partial_sort -<span class="lineNum"> 1577 </span> : -<span class="lineNum"> 1578 </span> : /** -<span class="lineNum"> 1579 </span> : * @brief Copy the smallest elements of a sequence. -<span class="lineNum"> 1580 </span> : * @param first An iterator. -<span class="lineNum"> 1581 </span> : * @param last Another iterator. -<span class="lineNum"> 1582 </span> : * @param result_first A random-access iterator. -<span class="lineNum"> 1583 </span> : * @param result_last Another random-access iterator. -<span class="lineNum"> 1584 </span> : * @return An iterator indicating the end of the resulting sequence. -<span class="lineNum"> 1585 </span> : * -<span class="lineNum"> 1586 </span> : * Copies and sorts the smallest N values from the range @p [first,last) -<span class="lineNum"> 1587 </span> : * to the range beginning at @p result_first, where the number of -<span class="lineNum"> 1588 </span> : * elements to be copied, @p N, is the smaller of @p (last-first) and -<span class="lineNum"> 1589 </span> : * @p (result_last-result_first). -<span class="lineNum"> 1590 </span> : * After the sort if @p i and @j are iterators in the range -<span class="lineNum"> 1591 </span> : * @p [result_first,result_first+N) such that @i precedes @j then -<span class="lineNum"> 1592 </span> : * @p *j<*i is false. -<span class="lineNum"> 1593 </span> : * The value returned is @p result_first+N. -<span class="lineNum"> 1594 </span> : */ -<span class="lineNum"> 1595 </span> : template<typename _InputIterator, typename _RandomAccessIterator> -<span class="lineNum"> 1596 </span> : _RandomAccessIterator -<span class="lineNum"> 1597 </span> : partial_sort_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1598 </span> : _RandomAccessIterator __result_first, -<span class="lineNum"> 1599 </span> : _RandomAccessIterator __result_last) -<span class="lineNum"> 1600 </span> : { -<span class="lineNum"> 1601 </span> : typedef typename iterator_traits<_InputIterator>::value_type -<span class="lineNum"> 1602 </span> : _InputValueType; -<span class="lineNum"> 1603 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1604 </span> : _OutputValueType; -<span class="lineNum"> 1605 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 1606 </span> : _DistanceType; -<span class="lineNum"> 1607 </span> : -<span class="lineNum"> 1608 </span> : // concept requirements -<span class="lineNum"> 1609 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 1610 </span> : __glibcxx_function_requires(_ConvertibleConcept<_InputValueType, -<span class="lineNum"> 1611 </span> : _OutputValueType>) -<span class="lineNum"> 1612 </span> : __glibcxx_function_requires(_LessThanOpConcept<_InputValueType, -<span class="lineNum"> 1613 </span> : _OutputValueType>) -<span class="lineNum"> 1614 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_OutputValueType>) -<span class="lineNum"> 1615 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 1616 </span> : __glibcxx_requires_valid_range(__result_first, __result_last); -<span class="lineNum"> 1617 </span> : -<span class="lineNum"> 1618 </span> : if (__result_first == __result_last) -<span class="lineNum"> 1619 </span> : return __result_last; -<span class="lineNum"> 1620 </span> : _RandomAccessIterator __result_real_last = __result_first; -<span class="lineNum"> 1621 </span> : while(__first != __last && __result_real_last != __result_last) -<span class="lineNum"> 1622 </span> : { -<span class="lineNum"> 1623 </span> : *__result_real_last = *__first; -<span class="lineNum"> 1624 </span> : ++__result_real_last; -<span class="lineNum"> 1625 </span> : ++__first; -<span class="lineNum"> 1626 </span> : } -<span class="lineNum"> 1627 </span> : std::make_heap(__result_first, __result_real_last); -<span class="lineNum"> 1628 </span> : while (__first != __last) -<span class="lineNum"> 1629 </span> : { -<span class="lineNum"> 1630 </span> : if (*__first < *__result_first) -<span class="lineNum"> 1631 </span> : std::__adjust_heap(__result_first, _DistanceType(0), -<span class="lineNum"> 1632 </span> : _DistanceType(__result_real_last -<span class="lineNum"> 1633 </span> : - __result_first), -<span class="lineNum"> 1634 </span> : _InputValueType(*__first)); -<span class="lineNum"> 1635 </span> : ++__first; -<span class="lineNum"> 1636 </span> : } -<span class="lineNum"> 1637 </span> : std::sort_heap(__result_first, __result_real_last); -<span class="lineNum"> 1638 </span> : return __result_real_last; -<span class="lineNum"> 1639 </span> : } -<span class="lineNum"> 1640 </span> : -<span class="lineNum"> 1641 </span> : /** -<span class="lineNum"> 1642 </span> : * @brief Copy the smallest elements of a sequence using a predicate for -<span class="lineNum"> 1643 </span> : * comparison. -<span class="lineNum"> 1644 </span> : * @param first An input iterator. -<span class="lineNum"> 1645 </span> : * @param last Another input iterator. -<span class="lineNum"> 1646 </span> : * @param result_first A random-access iterator. -<span class="lineNum"> 1647 </span> : * @param result_last Another random-access iterator. -<span class="lineNum"> 1648 </span> : * @param comp A comparison functor. -<span class="lineNum"> 1649 </span> : * @return An iterator indicating the end of the resulting sequence. -<span class="lineNum"> 1650 </span> : * -<span class="lineNum"> 1651 </span> : * Copies and sorts the smallest N values from the range @p [first,last) -<span class="lineNum"> 1652 </span> : * to the range beginning at @p result_first, where the number of -<span class="lineNum"> 1653 </span> : * elements to be copied, @p N, is the smaller of @p (last-first) and -<span class="lineNum"> 1654 </span> : * @p (result_last-result_first). -<span class="lineNum"> 1655 </span> : * After the sort if @p i and @j are iterators in the range -<span class="lineNum"> 1656 </span> : * @p [result_first,result_first+N) such that @i precedes @j then -<span class="lineNum"> 1657 </span> : * @p comp(*j,*i) is false. -<span class="lineNum"> 1658 </span> : * The value returned is @p result_first+N. -<span class="lineNum"> 1659 </span> : */ -<span class="lineNum"> 1660 </span> : template<typename _InputIterator, typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 1661 </span> : _RandomAccessIterator -<span class="lineNum"> 1662 </span> : partial_sort_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 1663 </span> : _RandomAccessIterator __result_first, -<span class="lineNum"> 1664 </span> : _RandomAccessIterator __result_last, -<span class="lineNum"> 1665 </span> : _Compare __comp) -<span class="lineNum"> 1666 </span> : { -<span class="lineNum"> 1667 </span> : typedef typename iterator_traits<_InputIterator>::value_type -<span class="lineNum"> 1668 </span> : _InputValueType; -<span class="lineNum"> 1669 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1670 </span> : _OutputValueType; -<span class="lineNum"> 1671 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 1672 </span> : _DistanceType; -<span class="lineNum"> 1673 </span> : -<span class="lineNum"> 1674 </span> : // concept requirements -<span class="lineNum"> 1675 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 1676 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 1677 </span> : _RandomAccessIterator>) -<span class="lineNum"> 1678 </span> : __glibcxx_function_requires(_ConvertibleConcept<_InputValueType, -<span class="lineNum"> 1679 </span> : _OutputValueType>) -<span class="lineNum"> 1680 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 1681 </span> : _InputValueType, _OutputValueType>) -<span class="lineNum"> 1682 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 1683 </span> : _OutputValueType, _OutputValueType>) -<span class="lineNum"> 1684 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 1685 </span> : __glibcxx_requires_valid_range(__result_first, __result_last); -<span class="lineNum"> 1686 </span> : -<span class="lineNum"> 1687 </span> : if (__result_first == __result_last) -<span class="lineNum"> 1688 </span> : return __result_last; -<span class="lineNum"> 1689 </span> : _RandomAccessIterator __result_real_last = __result_first; -<span class="lineNum"> 1690 </span> : while(__first != __last && __result_real_last != __result_last) -<span class="lineNum"> 1691 </span> : { -<span class="lineNum"> 1692 </span> : *__result_real_last = *__first; -<span class="lineNum"> 1693 </span> : ++__result_real_last; -<span class="lineNum"> 1694 </span> : ++__first; -<span class="lineNum"> 1695 </span> : } -<span class="lineNum"> 1696 </span> : std::make_heap(__result_first, __result_real_last, __comp); -<span class="lineNum"> 1697 </span> : while (__first != __last) -<span class="lineNum"> 1698 </span> : { -<span class="lineNum"> 1699 </span> : if (__comp(*__first, *__result_first)) -<span class="lineNum"> 1700 </span> : std::__adjust_heap(__result_first, _DistanceType(0), -<span class="lineNum"> 1701 </span> : _DistanceType(__result_real_last -<span class="lineNum"> 1702 </span> : - __result_first), -<span class="lineNum"> 1703 </span> : _InputValueType(*__first), -<span class="lineNum"> 1704 </span> : __comp); -<span class="lineNum"> 1705 </span> : ++__first; -<span class="lineNum"> 1706 </span> : } -<span class="lineNum"> 1707 </span> : std::sort_heap(__result_first, __result_real_last, __comp); -<span class="lineNum"> 1708 </span> : return __result_real_last; -<span class="lineNum"> 1709 </span> : } -<span class="lineNum"> 1710 </span> : -<span class="lineNum"> 1711 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1712 </span> : template<typename _RandomAccessIterator, typename _Tp> -<span class="lineNum"> 1713 </span> : void -<span class="lineNum"> 1714 </span><span class="lineCov"> 2369 : __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val)</span> -<span class="lineNum"> 1715 </span> : { -<span class="lineNum"> 1716 </span><span class="lineCov"> 2369 : _RandomAccessIterator __next = __last;</span> -<span class="lineNum"> 1717 </span><span class="lineCov"> 2369 : --__next;</span> -<span class="lineNum"> 1718 </span><span class="lineCov"> 5033 : while (__val < *__next)</span> -<span class="lineNum"> 1719 </span> : { -<span class="lineNum"> 1720 </span><span class="lineCov"> 295 : *__last = *__next;</span> -<span class="lineNum"> 1721 </span><span class="lineCov"> 295 : __last = __next;</span> -<span class="lineNum"> 1722 </span><span class="lineCov"> 295 : --__next;</span> -<span class="lineNum"> 1723 </span> : } -<span class="lineNum"> 1724 </span><span class="lineCov"> 2369 : *__last = __val;</span> -<span class="lineNum"> 1725 </span><span class="lineCov"> 2369 : }</span> -<span class="lineNum"> 1726 </span> : -<span class="lineNum"> 1727 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1728 </span> : template<typename _RandomAccessIterator, typename _Tp, typename _Compare> -<span class="lineNum"> 1729 </span> : void -<span class="lineNum"> 1730 </span> : __unguarded_linear_insert(_RandomAccessIterator __last, _Tp __val, -<span class="lineNum"> 1731 </span><span class="lineCov"> 48163 : _Compare __comp)</span> -<span class="lineNum"> 1732 </span> : { -<span class="lineNum"> 1733 </span><span class="lineCov"> 48163 : _RandomAccessIterator __next = __last;</span> -<span class="lineNum"> 1734 </span><span class="lineCov"> 48163 : --__next;</span> -<span class="lineNum"> 1735 </span><span class="lineCov"> 273339 : while (__comp(__val, *__next))</span> -<span class="lineNum"> 1736 </span> : { -<span class="lineNum"> 1737 </span><span class="lineCov"> 177013 : *__last = *__next;</span> -<span class="lineNum"> 1738 </span><span class="lineCov"> 177013 : __last = __next;</span> -<span class="lineNum"> 1739 </span><span class="lineCov"> 177013 : --__next;</span> -<span class="lineNum"> 1740 </span> : } -<span class="lineNum"> 1741 </span><span class="lineCov"> 48163 : *__last = __val;</span> -<span class="lineNum"> 1742 </span><span class="lineCov"> 48163 : }</span> -<span class="lineNum"> 1743 </span> : -<span class="lineNum"> 1744 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1745 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 1746 </span> : void -<span class="lineNum"> 1747 </span> : __insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 1748 </span><span class="lineCov"> 81 : _RandomAccessIterator __last)</span> -<span class="lineNum"> 1749 </span> : { -<span class="lineNum"> 1750 </span><span class="lineCov"> 81 : if (__first == __last)</span> -<span class="lineNum"> 1751 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 1752 </span> : -<span class="lineNum"> 1753 </span><span class="lineCov"> 503 : for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)</span> -<span class="lineNum"> 1754 </span> : { -<span class="lineNum"> 1755 </span> : typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1756 </span><span class="lineCov"> 422 : __val = *__i;</span> -<span class="lineNum"> 1757 </span><span class="lineCov"> 422 : if (__val < *__first)</span> -<span class="lineNum"> 1758 </span> : { -<span class="lineNum"> 1759 </span><span class="lineCov"> 151 : std::copy_backward(__first, __i, __i + 1);</span> -<span class="lineNum"> 1760 </span><span class="lineCov"> 151 : *__first = __val;</span> -<span class="lineNum"> 1761 </span> : } -<span class="lineNum"> 1762 </span> : else -<span class="lineNum"> 1763 </span><span class="lineCov"> 271 : std::__unguarded_linear_insert(__i, __val);</span> -<span class="lineNum"> 1764 </span> : } -<span class="lineNum"> 1765 </span> : } -<span class="lineNum"> 1766 </span> : -<span class="lineNum"> 1767 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1768 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 1769 </span> : void -<span class="lineNum"> 1770 </span> : __insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 1771 </span><span class="lineCov"> 3938 : _RandomAccessIterator __last, _Compare __comp)</span> -<span class="lineNum"> 1772 </span> : { -<span class="lineNum"> 1773 </span><span class="lineCov"> 3938 : if (__first == __last) return;</span> -<span class="lineNum"> 1774 </span> : -<span class="lineNum"> 1775 </span><span class="lineCov"> 55255 : for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i)</span> -<span class="lineNum"> 1776 </span> : { -<span class="lineNum"> 1777 </span> : typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1778 </span><span class="lineCov"> 51317 : __val = *__i;</span> -<span class="lineNum"> 1779 </span><span class="lineCov"> 51317 : if (__comp(__val, *__first))</span> -<span class="lineNum"> 1780 </span> : { -<span class="lineNum"> 1781 </span><span class="lineCov"> 7625 : std::copy_backward(__first, __i, __i + 1);</span> -<span class="lineNum"> 1782 </span><span class="lineCov"> 7625 : *__first = __val;</span> -<span class="lineNum"> 1783 </span> : } -<span class="lineNum"> 1784 </span> : else -<span class="lineNum"> 1785 </span><span class="lineCov"> 43692 : std::__unguarded_linear_insert(__i, __val, __comp);</span> -<span class="lineNum"> 1786 </span> : } -<span class="lineNum"> 1787 </span> : } -<span class="lineNum"> 1788 </span> : -<span class="lineNum"> 1789 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1790 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 1791 </span> : inline void -<span class="lineNum"> 1792 </span> : __unguarded_insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 1793 </span><span class="lineCov"> 3 : _RandomAccessIterator __last)</span> -<span class="lineNum"> 1794 </span> : { -<span class="lineNum"> 1795 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1796 </span> : _ValueType; -<span class="lineNum"> 1797 </span> : -<span class="lineNum"> 1798 </span><span class="lineCov"> 2101 : for (_RandomAccessIterator __i = __first; __i != __last; ++__i)</span> -<span class="lineNum"> 1799 </span><span class="lineCov"> 2098 : std::__unguarded_linear_insert(__i, _ValueType(*__i));</span> -<span class="lineNum"> 1800 </span><span class="lineCov"> 3 : }</span> -<span class="lineNum"> 1801 </span> : -<span class="lineNum"> 1802 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1803 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 1804 </span> : inline void -<span class="lineNum"> 1805 </span> : __unguarded_insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 1806 </span><span class="lineCov"> 261 : _RandomAccessIterator __last, _Compare __comp)</span> -<span class="lineNum"> 1807 </span> : { -<span class="lineNum"> 1808 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1809 </span> : _ValueType; -<span class="lineNum"> 1810 </span> : -<span class="lineNum"> 1811 </span><span class="lineCov"> 4732 : for (_RandomAccessIterator __i = __first; __i != __last; ++__i)</span> -<span class="lineNum"> 1812 </span><span class="lineCov"> 4471 : std::__unguarded_linear_insert(__i, _ValueType(*__i), __comp);</span> -<span class="lineNum"> 1813 </span><span class="lineCov"> 261 : }</span> -<span class="lineNum"> 1814 </span> : -<span class="lineNum"> 1815 </span> : /** -<span class="lineNum"> 1816 </span> : * @doctodo -<span class="lineNum"> 1817 </span> : * This controls some aspect of the sort routines. -<span class="lineNum"> 1818 </span> : */ -<span class="lineNum"> 1819 </span> : enum { _S_threshold = 16 }; -<span class="lineNum"> 1820 </span> : -<span class="lineNum"> 1821 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1822 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 1823 </span> : void -<span class="lineNum"> 1824 </span> : __final_insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 1825 </span><span class="lineCov"> 81 : _RandomAccessIterator __last)</span> -<span class="lineNum"> 1826 </span> : { -<span class="lineNum"> 1827 </span><span class="lineCov"> 81 : if (__last - __first > int(_S_threshold))</span> -<span class="lineNum"> 1828 </span> : { -<span class="lineNum"> 1829 </span><span class="lineCov"> 3 : std::__insertion_sort(__first, __first + int(_S_threshold));</span> -<span class="lineNum"> 1830 </span><span class="lineCov"> 3 : std::__unguarded_insertion_sort(__first + int(_S_threshold), __last);</span> -<span class="lineNum"> 1831 </span> : } -<span class="lineNum"> 1832 </span> : else -<span class="lineNum"> 1833 </span><span class="lineCov"> 78 : std::__insertion_sort(__first, __last);</span> -<span class="lineNum"> 1834 </span><span class="lineCov"> 81 : }</span> -<span class="lineNum"> 1835 </span> : -<span class="lineNum"> 1836 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1837 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 1838 </span> : void -<span class="lineNum"> 1839 </span> : __final_insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 1840 </span><span class="lineCov"> 3938 : _RandomAccessIterator __last, _Compare __comp)</span> -<span class="lineNum"> 1841 </span> : { -<span class="lineNum"> 1842 </span><span class="lineCov"> 3938 : if (__last - __first > int(_S_threshold))</span> -<span class="lineNum"> 1843 </span> : { -<span class="lineNum"> 1844 </span><span class="lineCov"> 261 : std::__insertion_sort(__first, __first + int(_S_threshold), __comp);</span> -<span class="lineNum"> 1845 </span><span class="lineCov"> 261 : std::__unguarded_insertion_sort(__first + int(_S_threshold), __last,</span> -<span class="lineNum"> 1846 </span> : __comp); -<span class="lineNum"> 1847 </span> : } -<span class="lineNum"> 1848 </span> : else -<span class="lineNum"> 1849 </span><span class="lineCov"> 3677 : std::__insertion_sort(__first, __last, __comp);</span> -<span class="lineNum"> 1850 </span><span class="lineCov"> 3938 : }</span> -<span class="lineNum"> 1851 </span> : -<span class="lineNum"> 1852 </span> : /// This is a helper function... -<span class="lineNum"> 1853 </span> : template<typename _RandomAccessIterator, typename _Tp> -<span class="lineNum"> 1854 </span> : _RandomAccessIterator -<span class="lineNum"> 1855 </span> : __unguarded_partition(_RandomAccessIterator __first, -<span class="lineNum"> 1856 </span><span class="lineCov"> 183 : _RandomAccessIterator __last, _Tp __pivot)</span> -<span class="lineNum"> 1857 </span> : { -<span class="lineNum"> 1858 </span><span class="lineCov"> 50 : while (true)</span> -<span class="lineNum"> 1859 </span> : { -<span class="lineNum"> 1860 </span><span class="lineCov"> 6596 : while (*__first < __pivot)</span> -<span class="lineNum"> 1861 </span><span class="lineCov"> 6230 : ++__first;</span> -<span class="lineNum"> 1862 </span><span class="lineCov"> 183 : --__last;</span> -<span class="lineNum"> 1863 </span><span class="lineCov"> 6480 : while (__pivot < *__last)</span> -<span class="lineNum"> 1864 </span><span class="lineCov"> 6114 : --__last;</span> -<span class="lineNum"> 1865 </span><span class="lineCov"> 183 : if (!(__first < __last))</span> -<span class="lineNum"> 1866 </span><span class="lineCov"> 133 : return __first;</span> -<span class="lineNum"> 1867 </span><span class="lineCov"> 50 : std::iter_swap(__first, __last);</span> -<span class="lineNum"> 1868 </span><span class="lineCov"> 50 : ++__first;</span> -<span class="lineNum"> 1869 </span> : } -<span class="lineNum"> 1870 </span> : } -<span class="lineNum"> 1871 </span> : -<span class="lineNum"> 1872 </span> : /// This is a helper function... -<span class="lineNum"> 1873 </span> : template<typename _RandomAccessIterator, typename _Tp, typename _Compare> -<span class="lineNum"> 1874 </span> : _RandomAccessIterator -<span class="lineNum"> 1875 </span> : __unguarded_partition(_RandomAccessIterator __first, -<span class="lineNum"> 1876 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 1877 </span><span class="lineCov"> 7740 : _Tp __pivot, _Compare __comp)</span> -<span class="lineNum"> 1878 </span> : { -<span class="lineNum"> 1879 </span><span class="lineCov"> 7030 : while (true)</span> -<span class="lineNum"> 1880 </span> : { -<span class="lineNum"> 1881 </span><span class="lineCov"> 25088 : while (__comp(*__first, __pivot))</span> -<span class="lineNum"> 1882 </span><span class="lineCov"> 9608 : ++__first;</span> -<span class="lineNum"> 1883 </span><span class="lineCov"> 7740 : --__last;</span> -<span class="lineNum"> 1884 </span><span class="lineCov"> 23207 : while (__comp(__pivot, *__last))</span> -<span class="lineNum"> 1885 </span><span class="lineCov"> 7727 : --__last;</span> -<span class="lineNum"> 1886 </span><span class="lineCov"> 7740 : if (!(__first < __last))</span> -<span class="lineNum"> 1887 </span><span class="lineCov"> 710 : return __first;</span> -<span class="lineNum"> 1888 </span><span class="lineCov"> 7030 : std::iter_swap(__first, __last);</span> -<span class="lineNum"> 1889 </span><span class="lineCov"> 7030 : ++__first;</span> -<span class="lineNum"> 1890 </span> : } -<span class="lineNum"> 1891 </span> : } -<span class="lineNum"> 1892 </span> : -<span class="lineNum"> 1893 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1894 </span> : template<typename _RandomAccessIterator, typename _Size> -<span class="lineNum"> 1895 </span> : void -<span class="lineNum"> 1896 </span> : __introsort_loop(_RandomAccessIterator __first, -<span class="lineNum"> 1897 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 1898 </span><span class="lineCov"> 214 : _Size __depth_limit)</span> -<span class="lineNum"> 1899 </span> : { -<span class="lineNum"> 1900 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1901 </span> : _ValueType; -<span class="lineNum"> 1902 </span> : -<span class="lineNum"> 1903 </span><span class="lineCov"> 561 : while (__last - __first > int(_S_threshold))</span> -<span class="lineNum"> 1904 </span> : { -<span class="lineNum"> 1905 </span><span class="lineCov"> 133 : if (__depth_limit == 0)</span> -<span class="lineNum"> 1906 </span> : { -<span class="lineNum"> 1907 </span><span class="lineNoCov"> 0 : _GLIBCXX_STD_P::partial_sort(__first, __last, __last);</span> -<span class="lineNum"> 1908 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 1909 </span> : } -<span class="lineNum"> 1910 </span><span class="lineCov"> 133 : --__depth_limit;</span> -<span class="lineNum"> 1911 </span> : _RandomAccessIterator __cut = -<span class="lineNum"> 1912 </span> : std::__unguarded_partition(__first, __last, -<span class="lineNum"> 1913 </span> : _ValueType(std::__median(*__first, -<span class="lineNum"> 1914 </span> : *(__first -<span class="lineNum"> 1915 </span> : + (__last -<span class="lineNum"> 1916 </span> : - __first) -<span class="lineNum"> 1917 </span> : / 2), -<span class="lineNum"> 1918 </span> : *(__last -<span class="lineNum"> 1919 </span><span class="lineCov"> 133 : - 1))));</span> -<span class="lineNum"> 1920 </span><span class="lineCov"> 133 : std::__introsort_loop(__cut, __last, __depth_limit);</span> -<span class="lineNum"> 1921 </span><span class="lineCov"> 133 : __last = __cut;</span> -<span class="lineNum"> 1922 </span> : } -<span class="lineNum"> 1923 </span> : } -<span class="lineNum"> 1924 </span> : -<span class="lineNum"> 1925 </span> : /// This is a helper function for the sort routine. -<span class="lineNum"> 1926 </span> : template<typename _RandomAccessIterator, typename _Size, typename _Compare> -<span class="lineNum"> 1927 </span> : void -<span class="lineNum"> 1928 </span> : __introsort_loop(_RandomAccessIterator __first, -<span class="lineNum"> 1929 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 1930 </span><span class="lineCov"> 4648 : _Size __depth_limit, _Compare __comp)</span> -<span class="lineNum"> 1931 </span> : { -<span class="lineNum"> 1932 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1933 </span> : _ValueType; -<span class="lineNum"> 1934 </span> : -<span class="lineNum"> 1935 </span><span class="lineCov"> 10006 : while (__last - __first > int(_S_threshold))</span> -<span class="lineNum"> 1936 </span> : { -<span class="lineNum"> 1937 </span><span class="lineCov"> 710 : if (__depth_limit == 0)</span> -<span class="lineNum"> 1938 </span> : { -<span class="lineNum"> 1939 </span><span class="lineNoCov"> 0 : _GLIBCXX_STD_P::partial_sort(__first, __last, __last, __comp);</span> -<span class="lineNum"> 1940 </span><span class="lineNoCov"> 0 : return;</span> -<span class="lineNum"> 1941 </span> : } -<span class="lineNum"> 1942 </span><span class="lineCov"> 710 : --__depth_limit;</span> -<span class="lineNum"> 1943 </span> : _RandomAccessIterator __cut = -<span class="lineNum"> 1944 </span> : std::__unguarded_partition(__first, __last, -<span class="lineNum"> 1945 </span> : _ValueType(std::__median(*__first, -<span class="lineNum"> 1946 </span> : *(__first -<span class="lineNum"> 1947 </span> : + (__last -<span class="lineNum"> 1948 </span> : - __first) -<span class="lineNum"> 1949 </span> : / 2), -<span class="lineNum"> 1950 </span> : *(__last - 1), -<span class="lineNum"> 1951 </span> : __comp)), -<span class="lineNum"> 1952 </span><span class="lineCov"> 710 : __comp);</span> -<span class="lineNum"> 1953 </span><span class="lineCov"> 710 : std::__introsort_loop(__cut, __last, __depth_limit, __comp);</span> -<span class="lineNum"> 1954 </span><span class="lineCov"> 710 : __last = __cut;</span> -<span class="lineNum"> 1955 </span> : } -<span class="lineNum"> 1956 </span> : } -<span class="lineNum"> 1957 </span> : -<span class="lineNum"> 1958 </span> : /// This is a helper function for the sort routines. Precondition: __n > 0. -<span class="lineNum"> 1959 </span> : template<typename _Size> -<span class="lineNum"> 1960 </span> : inline _Size -<span class="lineNum"> 1961 </span> : __lg(_Size __n) -<span class="lineNum"> 1962 </span> : { -<span class="lineNum"> 1963 </span> : _Size __k; -<span class="lineNum"> 1964 </span> : for (__k = 0; __n != 0; __n >>= 1) -<span class="lineNum"> 1965 </span> : ++__k; -<span class="lineNum"> 1966 </span> : return __k - 1; -<span class="lineNum"> 1967 </span> : } -<span class="lineNum"> 1968 </span> : -<span class="lineNum"> 1969 </span> : inline int -<span class="lineNum"> 1970 </span><span class="lineCov"> 3946 : __lg(int __n)</span> -<span class="lineNum"> 1971 </span><span class="lineCov"> 3946 : { return sizeof(int) * __CHAR_BIT__ - 1 - __builtin_clz(__n); }</span> -<span class="lineNum"> 1972 </span> : -<span class="lineNum"> 1973 </span> : inline long -<span class="lineNum"> 1974 </span> : __lg(long __n) -<span class="lineNum"> 1975 </span> : { return sizeof(long) * __CHAR_BIT__ - 1 - __builtin_clzl(__n); } -<span class="lineNum"> 1976 </span> : -<span class="lineNum"> 1977 </span> : inline long long -<span class="lineNum"> 1978 </span> : __lg(long long __n) -<span class="lineNum"> 1979 </span> : { return sizeof(long long) * __CHAR_BIT__ - 1 - __builtin_clzll(__n); } -<span class="lineNum"> 1980 </span> : -<span class="lineNum"> 1981 </span> : // sort -<span class="lineNum"> 1982 </span> : -<span class="lineNum"> 1983 </span> : template<typename _RandomAccessIterator, typename _Size> -<span class="lineNum"> 1984 </span> : void -<span class="lineNum"> 1985 </span> : __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, -<span class="lineNum"> 1986 </span> : _RandomAccessIterator __last, _Size __depth_limit) -<span class="lineNum"> 1987 </span> : { -<span class="lineNum"> 1988 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 1989 </span> : _ValueType; -<span class="lineNum"> 1990 </span> : -<span class="lineNum"> 1991 </span> : while (__last - __first > 3) -<span class="lineNum"> 1992 </span> : { -<span class="lineNum"> 1993 </span> : if (__depth_limit == 0) -<span class="lineNum"> 1994 </span> : { -<span class="lineNum"> 1995 </span> : std::__heap_select(__first, __nth + 1, __last); -<span class="lineNum"> 1996 </span> : -<span class="lineNum"> 1997 </span> : // Place the nth largest element in its final position. -<span class="lineNum"> 1998 </span> : std::iter_swap(__first, __nth); -<span class="lineNum"> 1999 </span> : return; -<span class="lineNum"> 2000 </span> : } -<span class="lineNum"> 2001 </span> : --__depth_limit; -<span class="lineNum"> 2002 </span> : _RandomAccessIterator __cut = -<span class="lineNum"> 2003 </span> : std::__unguarded_partition(__first, __last, -<span class="lineNum"> 2004 </span> : _ValueType(std::__median(*__first, -<span class="lineNum"> 2005 </span> : *(__first -<span class="lineNum"> 2006 </span> : + (__last -<span class="lineNum"> 2007 </span> : - __first) -<span class="lineNum"> 2008 </span> : / 2), -<span class="lineNum"> 2009 </span> : *(__last -<span class="lineNum"> 2010 </span> : - 1)))); -<span class="lineNum"> 2011 </span> : if (__cut <= __nth) -<span class="lineNum"> 2012 </span> : __first = __cut; -<span class="lineNum"> 2013 </span> : else -<span class="lineNum"> 2014 </span> : __last = __cut; -<span class="lineNum"> 2015 </span> : } -<span class="lineNum"> 2016 </span> : std::__insertion_sort(__first, __last); -<span class="lineNum"> 2017 </span> : } -<span class="lineNum"> 2018 </span> : -<span class="lineNum"> 2019 </span> : template<typename _RandomAccessIterator, typename _Size, typename _Compare> -<span class="lineNum"> 2020 </span> : void -<span class="lineNum"> 2021 </span> : __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, -<span class="lineNum"> 2022 </span> : _RandomAccessIterator __last, _Size __depth_limit, -<span class="lineNum"> 2023 </span> : _Compare __comp) -<span class="lineNum"> 2024 </span> : { -<span class="lineNum"> 2025 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 2026 </span> : _ValueType; -<span class="lineNum"> 2027 </span> : -<span class="lineNum"> 2028 </span> : while (__last - __first > 3) -<span class="lineNum"> 2029 </span> : { -<span class="lineNum"> 2030 </span> : if (__depth_limit == 0) -<span class="lineNum"> 2031 </span> : { -<span class="lineNum"> 2032 </span> : std::__heap_select(__first, __nth + 1, __last, __comp); -<span class="lineNum"> 2033 </span> : // Place the nth largest element in its final position. -<span class="lineNum"> 2034 </span> : std::iter_swap(__first, __nth); -<span class="lineNum"> 2035 </span> : return; -<span class="lineNum"> 2036 </span> : } -<span class="lineNum"> 2037 </span> : --__depth_limit; -<span class="lineNum"> 2038 </span> : _RandomAccessIterator __cut = -<span class="lineNum"> 2039 </span> : std::__unguarded_partition(__first, __last, -<span class="lineNum"> 2040 </span> : _ValueType(std::__median(*__first, -<span class="lineNum"> 2041 </span> : *(__first -<span class="lineNum"> 2042 </span> : + (__last -<span class="lineNum"> 2043 </span> : - __first) -<span class="lineNum"> 2044 </span> : / 2), -<span class="lineNum"> 2045 </span> : *(__last - 1), -<span class="lineNum"> 2046 </span> : __comp)), -<span class="lineNum"> 2047 </span> : __comp); -<span class="lineNum"> 2048 </span> : if (__cut <= __nth) -<span class="lineNum"> 2049 </span> : __first = __cut; -<span class="lineNum"> 2050 </span> : else -<span class="lineNum"> 2051 </span> : __last = __cut; -<span class="lineNum"> 2052 </span> : } -<span class="lineNum"> 2053 </span> : std::__insertion_sort(__first, __last, __comp); -<span class="lineNum"> 2054 </span> : } -<span class="lineNum"> 2055 </span> : -<span class="lineNum"> 2056 </span> : // nth_element -<span class="lineNum"> 2057 </span> : -<span class="lineNum"> 2058 </span> : /** -<span class="lineNum"> 2059 </span> : * @brief Finds the first position in which @a val could be inserted -<span class="lineNum"> 2060 </span> : * without changing the ordering. -<span class="lineNum"> 2061 </span> : * @param first An iterator. -<span class="lineNum"> 2062 </span> : * @param last Another iterator. -<span class="lineNum"> 2063 </span> : * @param val The search term. -<span class="lineNum"> 2064 </span> : * @return An iterator pointing to the first element "not less -<span class="lineNum"> 2065 </span> : * than" @a val, or end() if every element is less than -<span class="lineNum"> 2066 </span> : * @a val. -<span class="lineNum"> 2067 </span> : * @ingroup binarysearch -<span class="lineNum"> 2068 </span> : */ -<span class="lineNum"> 2069 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 2070 </span> : _ForwardIterator -<span class="lineNum"> 2071 </span> : lower_bound(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2072 </span> : const _Tp& __val) -<span class="lineNum"> 2073 </span> : { -<span class="lineNum"> 2074 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2075 </span> : _ValueType; -<span class="lineNum"> 2076 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 2077 </span> : _DistanceType; -<span class="lineNum"> 2078 </span> : -<span class="lineNum"> 2079 </span> : // concept requirements -<span class="lineNum"> 2080 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2081 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType, _Tp>) -<span class="lineNum"> 2082 </span> : __glibcxx_requires_partitioned_lower(__first, __last, __val); -<span class="lineNum"> 2083 </span> : -<span class="lineNum"> 2084 </span> : _DistanceType __len = std::distance(__first, __last); -<span class="lineNum"> 2085 </span> : _DistanceType __half; -<span class="lineNum"> 2086 </span> : _ForwardIterator __middle; -<span class="lineNum"> 2087 </span> : -<span class="lineNum"> 2088 </span> : while (__len > 0) -<span class="lineNum"> 2089 </span> : { -<span class="lineNum"> 2090 </span> : __half = __len >> 1; -<span class="lineNum"> 2091 </span> : __middle = __first; -<span class="lineNum"> 2092 </span> : std::advance(__middle, __half); -<span class="lineNum"> 2093 </span> : if (*__middle < __val) -<span class="lineNum"> 2094 </span> : { -<span class="lineNum"> 2095 </span> : __first = __middle; -<span class="lineNum"> 2096 </span> : ++__first; -<span class="lineNum"> 2097 </span> : __len = __len - __half - 1; -<span class="lineNum"> 2098 </span> : } -<span class="lineNum"> 2099 </span> : else -<span class="lineNum"> 2100 </span> : __len = __half; -<span class="lineNum"> 2101 </span> : } -<span class="lineNum"> 2102 </span> : return __first; -<span class="lineNum"> 2103 </span> : } -<span class="lineNum"> 2104 </span> : -<span class="lineNum"> 2105 </span> : /** -<span class="lineNum"> 2106 </span> : * @brief Finds the first position in which @a val could be inserted -<span class="lineNum"> 2107 </span> : * without changing the ordering. -<span class="lineNum"> 2108 </span> : * @param first An iterator. -<span class="lineNum"> 2109 </span> : * @param last Another iterator. -<span class="lineNum"> 2110 </span> : * @param val The search term. -<span class="lineNum"> 2111 </span> : * @param comp A functor to use for comparisons. -<span class="lineNum"> 2112 </span> : * @return An iterator pointing to the first element "not less than" @a val, -<span class="lineNum"> 2113 </span> : * or end() if every element is less than @a val. -<span class="lineNum"> 2114 </span> : * @ingroup binarysearch -<span class="lineNum"> 2115 </span> : * -<span class="lineNum"> 2116 </span> : * The comparison function should have the same effects on ordering as -<span class="lineNum"> 2117 </span> : * the function used for the initial sort. -<span class="lineNum"> 2118 </span> : */ -<span class="lineNum"> 2119 </span> : template<typename _ForwardIterator, typename _Tp, typename _Compare> -<span class="lineNum"> 2120 </span> : _ForwardIterator -<span class="lineNum"> 2121 </span> : lower_bound(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2122 </span> : const _Tp& __val, _Compare __comp) -<span class="lineNum"> 2123 </span> : { -<span class="lineNum"> 2124 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2125 </span> : _ValueType; -<span class="lineNum"> 2126 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 2127 </span> : _DistanceType; -<span class="lineNum"> 2128 </span> : -<span class="lineNum"> 2129 </span> : // concept requirements -<span class="lineNum"> 2130 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2131 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 2132 </span> : _ValueType, _Tp>) -<span class="lineNum"> 2133 </span> : __glibcxx_requires_partitioned_lower_pred(__first, __last, -<span class="lineNum"> 2134 </span> : __val, __comp); -<span class="lineNum"> 2135 </span> : -<span class="lineNum"> 2136 </span> : _DistanceType __len = std::distance(__first, __last); -<span class="lineNum"> 2137 </span> : _DistanceType __half; -<span class="lineNum"> 2138 </span> : _ForwardIterator __middle; -<span class="lineNum"> 2139 </span> : -<span class="lineNum"> 2140 </span> : while (__len > 0) -<span class="lineNum"> 2141 </span> : { -<span class="lineNum"> 2142 </span> : __half = __len >> 1; -<span class="lineNum"> 2143 </span> : __middle = __first; -<span class="lineNum"> 2144 </span> : std::advance(__middle, __half); -<span class="lineNum"> 2145 </span> : if (__comp(*__middle, __val)) -<span class="lineNum"> 2146 </span> : { -<span class="lineNum"> 2147 </span> : __first = __middle; -<span class="lineNum"> 2148 </span> : ++__first; -<span class="lineNum"> 2149 </span> : __len = __len - __half - 1; -<span class="lineNum"> 2150 </span> : } -<span class="lineNum"> 2151 </span> : else -<span class="lineNum"> 2152 </span> : __len = __half; -<span class="lineNum"> 2153 </span> : } -<span class="lineNum"> 2154 </span> : return __first; -<span class="lineNum"> 2155 </span> : } -<span class="lineNum"> 2156 </span> : -<span class="lineNum"> 2157 </span> : /** -<span class="lineNum"> 2158 </span> : * @brief Finds the last position in which @a val could be inserted -<span class="lineNum"> 2159 </span> : * without changing the ordering. -<span class="lineNum"> 2160 </span> : * @param first An iterator. -<span class="lineNum"> 2161 </span> : * @param last Another iterator. -<span class="lineNum"> 2162 </span> : * @param val The search term. -<span class="lineNum"> 2163 </span> : * @return An iterator pointing to the first element greater than @a val, -<span class="lineNum"> 2164 </span> : * or end() if no elements are greater than @a val. -<span class="lineNum"> 2165 </span> : * @ingroup binarysearch -<span class="lineNum"> 2166 </span> : */ -<span class="lineNum"> 2167 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 2168 </span> : _ForwardIterator -<span class="lineNum"> 2169 </span> : upper_bound(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2170 </span> : const _Tp& __val) -<span class="lineNum"> 2171 </span> : { -<span class="lineNum"> 2172 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2173 </span> : _ValueType; -<span class="lineNum"> 2174 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 2175 </span> : _DistanceType; -<span class="lineNum"> 2176 </span> : -<span class="lineNum"> 2177 </span> : // concept requirements -<span class="lineNum"> 2178 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2179 </span> : __glibcxx_function_requires(_LessThanOpConcept<_Tp, _ValueType>) -<span class="lineNum"> 2180 </span> : __glibcxx_requires_partitioned_upper(__first, __last, __val); -<span class="lineNum"> 2181 </span> : -<span class="lineNum"> 2182 </span> : _DistanceType __len = std::distance(__first, __last); -<span class="lineNum"> 2183 </span> : _DistanceType __half; -<span class="lineNum"> 2184 </span> : _ForwardIterator __middle; -<span class="lineNum"> 2185 </span> : -<span class="lineNum"> 2186 </span> : while (__len > 0) -<span class="lineNum"> 2187 </span> : { -<span class="lineNum"> 2188 </span> : __half = __len >> 1; -<span class="lineNum"> 2189 </span> : __middle = __first; -<span class="lineNum"> 2190 </span> : std::advance(__middle, __half); -<span class="lineNum"> 2191 </span> : if (__val < *__middle) -<span class="lineNum"> 2192 </span> : __len = __half; -<span class="lineNum"> 2193 </span> : else -<span class="lineNum"> 2194 </span> : { -<span class="lineNum"> 2195 </span> : __first = __middle; -<span class="lineNum"> 2196 </span> : ++__first; -<span class="lineNum"> 2197 </span> : __len = __len - __half - 1; -<span class="lineNum"> 2198 </span> : } -<span class="lineNum"> 2199 </span> : } -<span class="lineNum"> 2200 </span> : return __first; -<span class="lineNum"> 2201 </span> : } -<span class="lineNum"> 2202 </span> : -<span class="lineNum"> 2203 </span> : /** -<span class="lineNum"> 2204 </span> : * @brief Finds the last position in which @a val could be inserted -<span class="lineNum"> 2205 </span> : * without changing the ordering. -<span class="lineNum"> 2206 </span> : * @param first An iterator. -<span class="lineNum"> 2207 </span> : * @param last Another iterator. -<span class="lineNum"> 2208 </span> : * @param val The search term. -<span class="lineNum"> 2209 </span> : * @param comp A functor to use for comparisons. -<span class="lineNum"> 2210 </span> : * @return An iterator pointing to the first element greater than @a val, -<span class="lineNum"> 2211 </span> : * or end() if no elements are greater than @a val. -<span class="lineNum"> 2212 </span> : * @ingroup binarysearch -<span class="lineNum"> 2213 </span> : * -<span class="lineNum"> 2214 </span> : * The comparison function should have the same effects on ordering as -<span class="lineNum"> 2215 </span> : * the function used for the initial sort. -<span class="lineNum"> 2216 </span> : */ -<span class="lineNum"> 2217 </span> : template<typename _ForwardIterator, typename _Tp, typename _Compare> -<span class="lineNum"> 2218 </span> : _ForwardIterator -<span class="lineNum"> 2219 </span> : upper_bound(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2220 </span> : const _Tp& __val, _Compare __comp) -<span class="lineNum"> 2221 </span> : { -<span class="lineNum"> 2222 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2223 </span> : _ValueType; -<span class="lineNum"> 2224 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 2225 </span> : _DistanceType; -<span class="lineNum"> 2226 </span> : -<span class="lineNum"> 2227 </span> : // concept requirements -<span class="lineNum"> 2228 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2229 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 2230 </span> : _Tp, _ValueType>) -<span class="lineNum"> 2231 </span> : __glibcxx_requires_partitioned_upper_pred(__first, __last, -<span class="lineNum"> 2232 </span> : __val, __comp); -<span class="lineNum"> 2233 </span> : -<span class="lineNum"> 2234 </span> : _DistanceType __len = std::distance(__first, __last); -<span class="lineNum"> 2235 </span> : _DistanceType __half; -<span class="lineNum"> 2236 </span> : _ForwardIterator __middle; -<span class="lineNum"> 2237 </span> : -<span class="lineNum"> 2238 </span> : while (__len > 0) -<span class="lineNum"> 2239 </span> : { -<span class="lineNum"> 2240 </span> : __half = __len >> 1; -<span class="lineNum"> 2241 </span> : __middle = __first; -<span class="lineNum"> 2242 </span> : std::advance(__middle, __half); -<span class="lineNum"> 2243 </span> : if (__comp(__val, *__middle)) -<span class="lineNum"> 2244 </span> : __len = __half; -<span class="lineNum"> 2245 </span> : else -<span class="lineNum"> 2246 </span> : { -<span class="lineNum"> 2247 </span> : __first = __middle; -<span class="lineNum"> 2248 </span> : ++__first; -<span class="lineNum"> 2249 </span> : __len = __len - __half - 1; -<span class="lineNum"> 2250 </span> : } -<span class="lineNum"> 2251 </span> : } -<span class="lineNum"> 2252 </span> : return __first; -<span class="lineNum"> 2253 </span> : } -<span class="lineNum"> 2254 </span> : -<span class="lineNum"> 2255 </span> : /** -<span class="lineNum"> 2256 </span> : * @brief Finds the largest subrange in which @a val could be inserted -<span class="lineNum"> 2257 </span> : * at any place in it without changing the ordering. -<span class="lineNum"> 2258 </span> : * @param first An iterator. -<span class="lineNum"> 2259 </span> : * @param last Another iterator. -<span class="lineNum"> 2260 </span> : * @param val The search term. -<span class="lineNum"> 2261 </span> : * @return An pair of iterators defining the subrange. -<span class="lineNum"> 2262 </span> : * @ingroup binarysearch -<span class="lineNum"> 2263 </span> : * -<span class="lineNum"> 2264 </span> : * This is equivalent to -<span class="lineNum"> 2265 </span> : * @code -<span class="lineNum"> 2266 </span> : * std::make_pair(lower_bound(first, last, val), -<span class="lineNum"> 2267 </span> : * upper_bound(first, last, val)) -<span class="lineNum"> 2268 </span> : * @endcode -<span class="lineNum"> 2269 </span> : * but does not actually call those functions. -<span class="lineNum"> 2270 </span> : */ -<span class="lineNum"> 2271 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 2272 </span> : pair<_ForwardIterator, _ForwardIterator> -<span class="lineNum"> 2273 </span> : equal_range(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2274 </span> : const _Tp& __val) -<span class="lineNum"> 2275 </span> : { -<span class="lineNum"> 2276 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2277 </span> : _ValueType; -<span class="lineNum"> 2278 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 2279 </span> : _DistanceType; -<span class="lineNum"> 2280 </span> : -<span class="lineNum"> 2281 </span> : // concept requirements -<span class="lineNum"> 2282 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2283 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType, _Tp>) -<span class="lineNum"> 2284 </span> : __glibcxx_function_requires(_LessThanOpConcept<_Tp, _ValueType>) -<span class="lineNum"> 2285 </span> : __glibcxx_requires_partitioned_lower(__first, __last, __val); -<span class="lineNum"> 2286 </span> : __glibcxx_requires_partitioned_upper(__first, __last, __val); -<span class="lineNum"> 2287 </span> : -<span class="lineNum"> 2288 </span> : _DistanceType __len = std::distance(__first, __last); -<span class="lineNum"> 2289 </span> : _DistanceType __half; -<span class="lineNum"> 2290 </span> : _ForwardIterator __middle, __left, __right; -<span class="lineNum"> 2291 </span> : -<span class="lineNum"> 2292 </span> : while (__len > 0) -<span class="lineNum"> 2293 </span> : { -<span class="lineNum"> 2294 </span> : __half = __len >> 1; -<span class="lineNum"> 2295 </span> : __middle = __first; -<span class="lineNum"> 2296 </span> : std::advance(__middle, __half); -<span class="lineNum"> 2297 </span> : if (*__middle < __val) -<span class="lineNum"> 2298 </span> : { -<span class="lineNum"> 2299 </span> : __first = __middle; -<span class="lineNum"> 2300 </span> : ++__first; -<span class="lineNum"> 2301 </span> : __len = __len - __half - 1; -<span class="lineNum"> 2302 </span> : } -<span class="lineNum"> 2303 </span> : else if (__val < *__middle) -<span class="lineNum"> 2304 </span> : __len = __half; -<span class="lineNum"> 2305 </span> : else -<span class="lineNum"> 2306 </span> : { -<span class="lineNum"> 2307 </span> : __left = std::lower_bound(__first, __middle, __val); -<span class="lineNum"> 2308 </span> : std::advance(__first, __len); -<span class="lineNum"> 2309 </span> : __right = std::upper_bound(++__middle, __first, __val); -<span class="lineNum"> 2310 </span> : return pair<_ForwardIterator, _ForwardIterator>(__left, __right); -<span class="lineNum"> 2311 </span> : } -<span class="lineNum"> 2312 </span> : } -<span class="lineNum"> 2313 </span> : return pair<_ForwardIterator, _ForwardIterator>(__first, __first); -<span class="lineNum"> 2314 </span> : } -<span class="lineNum"> 2315 </span> : -<span class="lineNum"> 2316 </span> : /** -<span class="lineNum"> 2317 </span> : * @brief Finds the largest subrange in which @a val could be inserted -<span class="lineNum"> 2318 </span> : * at any place in it without changing the ordering. -<span class="lineNum"> 2319 </span> : * @param first An iterator. -<span class="lineNum"> 2320 </span> : * @param last Another iterator. -<span class="lineNum"> 2321 </span> : * @param val The search term. -<span class="lineNum"> 2322 </span> : * @param comp A functor to use for comparisons. -<span class="lineNum"> 2323 </span> : * @return An pair of iterators defining the subrange. -<span class="lineNum"> 2324 </span> : * @ingroup binarysearch -<span class="lineNum"> 2325 </span> : * -<span class="lineNum"> 2326 </span> : * This is equivalent to -<span class="lineNum"> 2327 </span> : * @code -<span class="lineNum"> 2328 </span> : * std::make_pair(lower_bound(first, last, val, comp), -<span class="lineNum"> 2329 </span> : * upper_bound(first, last, val, comp)) -<span class="lineNum"> 2330 </span> : * @endcode -<span class="lineNum"> 2331 </span> : * but does not actually call those functions. -<span class="lineNum"> 2332 </span> : */ -<span class="lineNum"> 2333 </span> : template<typename _ForwardIterator, typename _Tp, typename _Compare> -<span class="lineNum"> 2334 </span> : pair<_ForwardIterator, _ForwardIterator> -<span class="lineNum"> 2335 </span> : equal_range(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2336 </span> : const _Tp& __val, -<span class="lineNum"> 2337 </span> : _Compare __comp) -<span class="lineNum"> 2338 </span> : { -<span class="lineNum"> 2339 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2340 </span> : _ValueType; -<span class="lineNum"> 2341 </span> : typedef typename iterator_traits<_ForwardIterator>::difference_type -<span class="lineNum"> 2342 </span> : _DistanceType; -<span class="lineNum"> 2343 </span> : -<span class="lineNum"> 2344 </span> : // concept requirements -<span class="lineNum"> 2345 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2346 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 2347 </span> : _ValueType, _Tp>) -<span class="lineNum"> 2348 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 2349 </span> : _Tp, _ValueType>) -<span class="lineNum"> 2350 </span> : __glibcxx_requires_partitioned_lower_pred(__first, __last, -<span class="lineNum"> 2351 </span> : __val, __comp); -<span class="lineNum"> 2352 </span> : __glibcxx_requires_partitioned_upper_pred(__first, __last, -<span class="lineNum"> 2353 </span> : __val, __comp); -<span class="lineNum"> 2354 </span> : -<span class="lineNum"> 2355 </span> : _DistanceType __len = std::distance(__first, __last); -<span class="lineNum"> 2356 </span> : _DistanceType __half; -<span class="lineNum"> 2357 </span> : _ForwardIterator __middle, __left, __right; -<span class="lineNum"> 2358 </span> : -<span class="lineNum"> 2359 </span> : while (__len > 0) -<span class="lineNum"> 2360 </span> : { -<span class="lineNum"> 2361 </span> : __half = __len >> 1; -<span class="lineNum"> 2362 </span> : __middle = __first; -<span class="lineNum"> 2363 </span> : std::advance(__middle, __half); -<span class="lineNum"> 2364 </span> : if (__comp(*__middle, __val)) -<span class="lineNum"> 2365 </span> : { -<span class="lineNum"> 2366 </span> : __first = __middle; -<span class="lineNum"> 2367 </span> : ++__first; -<span class="lineNum"> 2368 </span> : __len = __len - __half - 1; -<span class="lineNum"> 2369 </span> : } -<span class="lineNum"> 2370 </span> : else if (__comp(__val, *__middle)) -<span class="lineNum"> 2371 </span> : __len = __half; -<span class="lineNum"> 2372 </span> : else -<span class="lineNum"> 2373 </span> : { -<span class="lineNum"> 2374 </span> : __left = std::lower_bound(__first, __middle, __val, __comp); -<span class="lineNum"> 2375 </span> : std::advance(__first, __len); -<span class="lineNum"> 2376 </span> : __right = std::upper_bound(++__middle, __first, __val, __comp); -<span class="lineNum"> 2377 </span> : return pair<_ForwardIterator, _ForwardIterator>(__left, __right); -<span class="lineNum"> 2378 </span> : } -<span class="lineNum"> 2379 </span> : } -<span class="lineNum"> 2380 </span> : return pair<_ForwardIterator, _ForwardIterator>(__first, __first); -<span class="lineNum"> 2381 </span> : } -<span class="lineNum"> 2382 </span> : -<span class="lineNum"> 2383 </span> : /** -<span class="lineNum"> 2384 </span> : * @brief Determines whether an element exists in a range. -<span class="lineNum"> 2385 </span> : * @param first An iterator. -<span class="lineNum"> 2386 </span> : * @param last Another iterator. -<span class="lineNum"> 2387 </span> : * @param val The search term. -<span class="lineNum"> 2388 </span> : * @return True if @a val (or its equivalent) is in [@a first,@a last ]. -<span class="lineNum"> 2389 </span> : * @ingroup binarysearch -<span class="lineNum"> 2390 </span> : * -<span class="lineNum"> 2391 </span> : * Note that this does not actually return an iterator to @a val. For -<span class="lineNum"> 2392 </span> : * that, use std::find or a container's specialized find member functions. -<span class="lineNum"> 2393 </span> : */ -<span class="lineNum"> 2394 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 2395 </span> : bool -<span class="lineNum"> 2396 </span> : binary_search(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2397 </span> : const _Tp& __val) -<span class="lineNum"> 2398 </span> : { -<span class="lineNum"> 2399 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2400 </span> : _ValueType; -<span class="lineNum"> 2401 </span> : -<span class="lineNum"> 2402 </span> : // concept requirements -<span class="lineNum"> 2403 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2404 </span> : __glibcxx_function_requires(_LessThanOpConcept<_Tp, _ValueType>) -<span class="lineNum"> 2405 </span> : __glibcxx_requires_partitioned_lower(__first, __last, __val); -<span class="lineNum"> 2406 </span> : __glibcxx_requires_partitioned_upper(__first, __last, __val); -<span class="lineNum"> 2407 </span> : -<span class="lineNum"> 2408 </span> : _ForwardIterator __i = std::lower_bound(__first, __last, __val); -<span class="lineNum"> 2409 </span> : return __i != __last && !(__val < *__i); -<span class="lineNum"> 2410 </span> : } -<span class="lineNum"> 2411 </span> : -<span class="lineNum"> 2412 </span> : /** -<span class="lineNum"> 2413 </span> : * @brief Determines whether an element exists in a range. -<span class="lineNum"> 2414 </span> : * @param first An iterator. -<span class="lineNum"> 2415 </span> : * @param last Another iterator. -<span class="lineNum"> 2416 </span> : * @param val The search term. -<span class="lineNum"> 2417 </span> : * @param comp A functor to use for comparisons. -<span class="lineNum"> 2418 </span> : * @return True if @a val (or its equivalent) is in [@a first,@a last ]. -<span class="lineNum"> 2419 </span> : * @ingroup binarysearch -<span class="lineNum"> 2420 </span> : * -<span class="lineNum"> 2421 </span> : * Note that this does not actually return an iterator to @a val. For -<span class="lineNum"> 2422 </span> : * that, use std::find or a container's specialized find member functions. -<span class="lineNum"> 2423 </span> : * -<span class="lineNum"> 2424 </span> : * The comparison function should have the same effects on ordering as -<span class="lineNum"> 2425 </span> : * the function used for the initial sort. -<span class="lineNum"> 2426 </span> : */ -<span class="lineNum"> 2427 </span> : template<typename _ForwardIterator, typename _Tp, typename _Compare> -<span class="lineNum"> 2428 </span> : bool -<span class="lineNum"> 2429 </span> : binary_search(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 2430 </span> : const _Tp& __val, _Compare __comp) -<span class="lineNum"> 2431 </span> : { -<span class="lineNum"> 2432 </span> : typedef typename iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 2433 </span> : _ValueType; -<span class="lineNum"> 2434 </span> : -<span class="lineNum"> 2435 </span> : // concept requirements -<span class="lineNum"> 2436 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 2437 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 2438 </span> : _Tp, _ValueType>) -<span class="lineNum"> 2439 </span> : __glibcxx_requires_partitioned_lower_pred(__first, __last, -<span class="lineNum"> 2440 </span> : __val, __comp); -<span class="lineNum"> 2441 </span> : __glibcxx_requires_partitioned_upper_pred(__first, __last, -<span class="lineNum"> 2442 </span> : __val, __comp); -<span class="lineNum"> 2443 </span> : -<span class="lineNum"> 2444 </span> : _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp); -<span class="lineNum"> 2445 </span> : return __i != __last && !bool(__comp(__val, *__i)); -<span class="lineNum"> 2446 </span> : } -<span class="lineNum"> 2447 </span> : -<span class="lineNum"> 2448 </span> : // merge -<span class="lineNum"> 2449 </span> : -<span class="lineNum"> 2450 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2451 </span> : template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, -<span class="lineNum"> 2452 </span> : typename _BidirectionalIterator3> -<span class="lineNum"> 2453 </span> : _BidirectionalIterator3 -<span class="lineNum"> 2454 </span> : __merge_backward(_BidirectionalIterator1 __first1, -<span class="lineNum"> 2455 </span> : _BidirectionalIterator1 __last1, -<span class="lineNum"> 2456 </span> : _BidirectionalIterator2 __first2, -<span class="lineNum"> 2457 </span> : _BidirectionalIterator2 __last2, -<span class="lineNum"> 2458 </span> : _BidirectionalIterator3 __result) -<span class="lineNum"> 2459 </span> : { -<span class="lineNum"> 2460 </span> : if (__first1 == __last1) -<span class="lineNum"> 2461 </span> : return std::copy_backward(__first2, __last2, __result); -<span class="lineNum"> 2462 </span> : if (__first2 == __last2) -<span class="lineNum"> 2463 </span> : return std::copy_backward(__first1, __last1, __result); -<span class="lineNum"> 2464 </span> : --__last1; -<span class="lineNum"> 2465 </span> : --__last2; -<span class="lineNum"> 2466 </span> : while (true) -<span class="lineNum"> 2467 </span> : { -<span class="lineNum"> 2468 </span> : if (*__last2 < *__last1) -<span class="lineNum"> 2469 </span> : { -<span class="lineNum"> 2470 </span> : *--__result = *__last1; -<span class="lineNum"> 2471 </span> : if (__first1 == __last1) -<span class="lineNum"> 2472 </span> : return std::copy_backward(__first2, ++__last2, __result); -<span class="lineNum"> 2473 </span> : --__last1; -<span class="lineNum"> 2474 </span> : } -<span class="lineNum"> 2475 </span> : else -<span class="lineNum"> 2476 </span> : { -<span class="lineNum"> 2477 </span> : *--__result = *__last2; -<span class="lineNum"> 2478 </span> : if (__first2 == __last2) -<span class="lineNum"> 2479 </span> : return std::copy_backward(__first1, ++__last1, __result); -<span class="lineNum"> 2480 </span> : --__last2; -<span class="lineNum"> 2481 </span> : } -<span class="lineNum"> 2482 </span> : } -<span class="lineNum"> 2483 </span> : } -<span class="lineNum"> 2484 </span> : -<span class="lineNum"> 2485 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2486 </span> : template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, -<span class="lineNum"> 2487 </span> : typename _BidirectionalIterator3, typename _Compare> -<span class="lineNum"> 2488 </span> : _BidirectionalIterator3 -<span class="lineNum"> 2489 </span> : __merge_backward(_BidirectionalIterator1 __first1, -<span class="lineNum"> 2490 </span> : _BidirectionalIterator1 __last1, -<span class="lineNum"> 2491 </span> : _BidirectionalIterator2 __first2, -<span class="lineNum"> 2492 </span> : _BidirectionalIterator2 __last2, -<span class="lineNum"> 2493 </span> : _BidirectionalIterator3 __result, -<span class="lineNum"> 2494 </span> : _Compare __comp) -<span class="lineNum"> 2495 </span> : { -<span class="lineNum"> 2496 </span> : if (__first1 == __last1) -<span class="lineNum"> 2497 </span> : return std::copy_backward(__first2, __last2, __result); -<span class="lineNum"> 2498 </span> : if (__first2 == __last2) -<span class="lineNum"> 2499 </span> : return std::copy_backward(__first1, __last1, __result); -<span class="lineNum"> 2500 </span> : --__last1; -<span class="lineNum"> 2501 </span> : --__last2; -<span class="lineNum"> 2502 </span> : while (true) -<span class="lineNum"> 2503 </span> : { -<span class="lineNum"> 2504 </span> : if (__comp(*__last2, *__last1)) -<span class="lineNum"> 2505 </span> : { -<span class="lineNum"> 2506 </span> : *--__result = *__last1; -<span class="lineNum"> 2507 </span> : if (__first1 == __last1) -<span class="lineNum"> 2508 </span> : return std::copy_backward(__first2, ++__last2, __result); -<span class="lineNum"> 2509 </span> : --__last1; -<span class="lineNum"> 2510 </span> : } -<span class="lineNum"> 2511 </span> : else -<span class="lineNum"> 2512 </span> : { -<span class="lineNum"> 2513 </span> : *--__result = *__last2; -<span class="lineNum"> 2514 </span> : if (__first2 == __last2) -<span class="lineNum"> 2515 </span> : return std::copy_backward(__first1, ++__last1, __result); -<span class="lineNum"> 2516 </span> : --__last2; -<span class="lineNum"> 2517 </span> : } -<span class="lineNum"> 2518 </span> : } -<span class="lineNum"> 2519 </span> : } -<span class="lineNum"> 2520 </span> : -<span class="lineNum"> 2521 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2522 </span> : template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, -<span class="lineNum"> 2523 </span> : typename _Distance> -<span class="lineNum"> 2524 </span> : _BidirectionalIterator1 -<span class="lineNum"> 2525 </span> : __rotate_adaptive(_BidirectionalIterator1 __first, -<span class="lineNum"> 2526 </span> : _BidirectionalIterator1 __middle, -<span class="lineNum"> 2527 </span> : _BidirectionalIterator1 __last, -<span class="lineNum"> 2528 </span> : _Distance __len1, _Distance __len2, -<span class="lineNum"> 2529 </span> : _BidirectionalIterator2 __buffer, -<span class="lineNum"> 2530 </span> : _Distance __buffer_size) -<span class="lineNum"> 2531 </span> : { -<span class="lineNum"> 2532 </span> : _BidirectionalIterator2 __buffer_end; -<span class="lineNum"> 2533 </span> : if (__len1 > __len2 && __len2 <= __buffer_size) -<span class="lineNum"> 2534 </span> : { -<span class="lineNum"> 2535 </span> : __buffer_end = std::copy(__middle, __last, __buffer); -<span class="lineNum"> 2536 </span> : std::copy_backward(__first, __middle, __last); -<span class="lineNum"> 2537 </span> : return std::copy(__buffer, __buffer_end, __first); -<span class="lineNum"> 2538 </span> : } -<span class="lineNum"> 2539 </span> : else if (__len1 <= __buffer_size) -<span class="lineNum"> 2540 </span> : { -<span class="lineNum"> 2541 </span> : __buffer_end = std::copy(__first, __middle, __buffer); -<span class="lineNum"> 2542 </span> : std::copy(__middle, __last, __first); -<span class="lineNum"> 2543 </span> : return std::copy_backward(__buffer, __buffer_end, __last); -<span class="lineNum"> 2544 </span> : } -<span class="lineNum"> 2545 </span> : else -<span class="lineNum"> 2546 </span> : { -<span class="lineNum"> 2547 </span> : std::rotate(__first, __middle, __last); -<span class="lineNum"> 2548 </span> : std::advance(__first, std::distance(__middle, __last)); -<span class="lineNum"> 2549 </span> : return __first; -<span class="lineNum"> 2550 </span> : } -<span class="lineNum"> 2551 </span> : } -<span class="lineNum"> 2552 </span> : -<span class="lineNum"> 2553 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2554 </span> : template<typename _BidirectionalIterator, typename _Distance, -<span class="lineNum"> 2555 </span> : typename _Pointer> -<span class="lineNum"> 2556 </span> : void -<span class="lineNum"> 2557 </span> : __merge_adaptive(_BidirectionalIterator __first, -<span class="lineNum"> 2558 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 2559 </span> : _BidirectionalIterator __last, -<span class="lineNum"> 2560 </span> : _Distance __len1, _Distance __len2, -<span class="lineNum"> 2561 </span> : _Pointer __buffer, _Distance __buffer_size) -<span class="lineNum"> 2562 </span> : { -<span class="lineNum"> 2563 </span> : if (__len1 <= __len2 && __len1 <= __buffer_size) -<span class="lineNum"> 2564 </span> : { -<span class="lineNum"> 2565 </span> : _Pointer __buffer_end = std::copy(__first, __middle, __buffer); -<span class="lineNum"> 2566 </span> : _GLIBCXX_STD_P::merge(__buffer, __buffer_end, __middle, __last, -<span class="lineNum"> 2567 </span> : __first); -<span class="lineNum"> 2568 </span> : } -<span class="lineNum"> 2569 </span> : else if (__len2 <= __buffer_size) -<span class="lineNum"> 2570 </span> : { -<span class="lineNum"> 2571 </span> : _Pointer __buffer_end = std::copy(__middle, __last, __buffer); -<span class="lineNum"> 2572 </span> : std::__merge_backward(__first, __middle, __buffer, -<span class="lineNum"> 2573 </span> : __buffer_end, __last); -<span class="lineNum"> 2574 </span> : } -<span class="lineNum"> 2575 </span> : else -<span class="lineNum"> 2576 </span> : { -<span class="lineNum"> 2577 </span> : _BidirectionalIterator __first_cut = __first; -<span class="lineNum"> 2578 </span> : _BidirectionalIterator __second_cut = __middle; -<span class="lineNum"> 2579 </span> : _Distance __len11 = 0; -<span class="lineNum"> 2580 </span> : _Distance __len22 = 0; -<span class="lineNum"> 2581 </span> : if (__len1 > __len2) -<span class="lineNum"> 2582 </span> : { -<span class="lineNum"> 2583 </span> : __len11 = __len1 / 2; -<span class="lineNum"> 2584 </span> : std::advance(__first_cut, __len11); -<span class="lineNum"> 2585 </span> : __second_cut = std::lower_bound(__middle, __last, -<span class="lineNum"> 2586 </span> : *__first_cut); -<span class="lineNum"> 2587 </span> : __len22 = std::distance(__middle, __second_cut); -<span class="lineNum"> 2588 </span> : } -<span class="lineNum"> 2589 </span> : else -<span class="lineNum"> 2590 </span> : { -<span class="lineNum"> 2591 </span> : __len22 = __len2 / 2; -<span class="lineNum"> 2592 </span> : std::advance(__second_cut, __len22); -<span class="lineNum"> 2593 </span> : __first_cut = std::upper_bound(__first, __middle, -<span class="lineNum"> 2594 </span> : *__second_cut); -<span class="lineNum"> 2595 </span> : __len11 = std::distance(__first, __first_cut); -<span class="lineNum"> 2596 </span> : } -<span class="lineNum"> 2597 </span> : _BidirectionalIterator __new_middle = -<span class="lineNum"> 2598 </span> : std::__rotate_adaptive(__first_cut, __middle, __second_cut, -<span class="lineNum"> 2599 </span> : __len1 - __len11, __len22, __buffer, -<span class="lineNum"> 2600 </span> : __buffer_size); -<span class="lineNum"> 2601 </span> : std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, -<span class="lineNum"> 2602 </span> : __len22, __buffer, __buffer_size); -<span class="lineNum"> 2603 </span> : std::__merge_adaptive(__new_middle, __second_cut, __last, -<span class="lineNum"> 2604 </span> : __len1 - __len11, -<span class="lineNum"> 2605 </span> : __len2 - __len22, __buffer, __buffer_size); -<span class="lineNum"> 2606 </span> : } -<span class="lineNum"> 2607 </span> : } -<span class="lineNum"> 2608 </span> : -<span class="lineNum"> 2609 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2610 </span> : template<typename _BidirectionalIterator, typename _Distance, -<span class="lineNum"> 2611 </span> : typename _Pointer, typename _Compare> -<span class="lineNum"> 2612 </span> : void -<span class="lineNum"> 2613 </span> : __merge_adaptive(_BidirectionalIterator __first, -<span class="lineNum"> 2614 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 2615 </span> : _BidirectionalIterator __last, -<span class="lineNum"> 2616 </span> : _Distance __len1, _Distance __len2, -<span class="lineNum"> 2617 </span> : _Pointer __buffer, _Distance __buffer_size, -<span class="lineNum"> 2618 </span> : _Compare __comp) -<span class="lineNum"> 2619 </span> : { -<span class="lineNum"> 2620 </span> : if (__len1 <= __len2 && __len1 <= __buffer_size) -<span class="lineNum"> 2621 </span> : { -<span class="lineNum"> 2622 </span> : _Pointer __buffer_end = std::copy(__first, __middle, __buffer); -<span class="lineNum"> 2623 </span> : _GLIBCXX_STD_P::merge(__buffer, __buffer_end, __middle, __last, -<span class="lineNum"> 2624 </span> : __first, __comp); -<span class="lineNum"> 2625 </span> : } -<span class="lineNum"> 2626 </span> : else if (__len2 <= __buffer_size) -<span class="lineNum"> 2627 </span> : { -<span class="lineNum"> 2628 </span> : _Pointer __buffer_end = std::copy(__middle, __last, __buffer); -<span class="lineNum"> 2629 </span> : std::__merge_backward(__first, __middle, __buffer, __buffer_end, -<span class="lineNum"> 2630 </span> : __last, __comp); -<span class="lineNum"> 2631 </span> : } -<span class="lineNum"> 2632 </span> : else -<span class="lineNum"> 2633 </span> : { -<span class="lineNum"> 2634 </span> : _BidirectionalIterator __first_cut = __first; -<span class="lineNum"> 2635 </span> : _BidirectionalIterator __second_cut = __middle; -<span class="lineNum"> 2636 </span> : _Distance __len11 = 0; -<span class="lineNum"> 2637 </span> : _Distance __len22 = 0; -<span class="lineNum"> 2638 </span> : if (__len1 > __len2) -<span class="lineNum"> 2639 </span> : { -<span class="lineNum"> 2640 </span> : __len11 = __len1 / 2; -<span class="lineNum"> 2641 </span> : std::advance(__first_cut, __len11); -<span class="lineNum"> 2642 </span> : __second_cut = std::lower_bound(__middle, __last, *__first_cut, -<span class="lineNum"> 2643 </span> : __comp); -<span class="lineNum"> 2644 </span> : __len22 = std::distance(__middle, __second_cut); -<span class="lineNum"> 2645 </span> : } -<span class="lineNum"> 2646 </span> : else -<span class="lineNum"> 2647 </span> : { -<span class="lineNum"> 2648 </span> : __len22 = __len2 / 2; -<span class="lineNum"> 2649 </span> : std::advance(__second_cut, __len22); -<span class="lineNum"> 2650 </span> : __first_cut = std::upper_bound(__first, __middle, *__second_cut, -<span class="lineNum"> 2651 </span> : __comp); -<span class="lineNum"> 2652 </span> : __len11 = std::distance(__first, __first_cut); -<span class="lineNum"> 2653 </span> : } -<span class="lineNum"> 2654 </span> : _BidirectionalIterator __new_middle = -<span class="lineNum"> 2655 </span> : std::__rotate_adaptive(__first_cut, __middle, __second_cut, -<span class="lineNum"> 2656 </span> : __len1 - __len11, __len22, __buffer, -<span class="lineNum"> 2657 </span> : __buffer_size); -<span class="lineNum"> 2658 </span> : std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, -<span class="lineNum"> 2659 </span> : __len22, __buffer, __buffer_size, __comp); -<span class="lineNum"> 2660 </span> : std::__merge_adaptive(__new_middle, __second_cut, __last, -<span class="lineNum"> 2661 </span> : __len1 - __len11, -<span class="lineNum"> 2662 </span> : __len2 - __len22, __buffer, -<span class="lineNum"> 2663 </span> : __buffer_size, __comp); -<span class="lineNum"> 2664 </span> : } -<span class="lineNum"> 2665 </span> : } -<span class="lineNum"> 2666 </span> : -<span class="lineNum"> 2667 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2668 </span> : template<typename _BidirectionalIterator, typename _Distance> -<span class="lineNum"> 2669 </span> : void -<span class="lineNum"> 2670 </span> : __merge_without_buffer(_BidirectionalIterator __first, -<span class="lineNum"> 2671 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 2672 </span> : _BidirectionalIterator __last, -<span class="lineNum"> 2673 </span> : _Distance __len1, _Distance __len2) -<span class="lineNum"> 2674 </span> : { -<span class="lineNum"> 2675 </span> : if (__len1 == 0 || __len2 == 0) -<span class="lineNum"> 2676 </span> : return; -<span class="lineNum"> 2677 </span> : if (__len1 + __len2 == 2) -<span class="lineNum"> 2678 </span> : { -<span class="lineNum"> 2679 </span> : if (*__middle < *__first) -<span class="lineNum"> 2680 </span> : std::iter_swap(__first, __middle); -<span class="lineNum"> 2681 </span> : return; -<span class="lineNum"> 2682 </span> : } -<span class="lineNum"> 2683 </span> : _BidirectionalIterator __first_cut = __first; -<span class="lineNum"> 2684 </span> : _BidirectionalIterator __second_cut = __middle; -<span class="lineNum"> 2685 </span> : _Distance __len11 = 0; -<span class="lineNum"> 2686 </span> : _Distance __len22 = 0; -<span class="lineNum"> 2687 </span> : if (__len1 > __len2) -<span class="lineNum"> 2688 </span> : { -<span class="lineNum"> 2689 </span> : __len11 = __len1 / 2; -<span class="lineNum"> 2690 </span> : std::advance(__first_cut, __len11); -<span class="lineNum"> 2691 </span> : __second_cut = std::lower_bound(__middle, __last, *__first_cut); -<span class="lineNum"> 2692 </span> : __len22 = std::distance(__middle, __second_cut); -<span class="lineNum"> 2693 </span> : } -<span class="lineNum"> 2694 </span> : else -<span class="lineNum"> 2695 </span> : { -<span class="lineNum"> 2696 </span> : __len22 = __len2 / 2; -<span class="lineNum"> 2697 </span> : std::advance(__second_cut, __len22); -<span class="lineNum"> 2698 </span> : __first_cut = std::upper_bound(__first, __middle, *__second_cut); -<span class="lineNum"> 2699 </span> : __len11 = std::distance(__first, __first_cut); -<span class="lineNum"> 2700 </span> : } -<span class="lineNum"> 2701 </span> : std::rotate(__first_cut, __middle, __second_cut); -<span class="lineNum"> 2702 </span> : _BidirectionalIterator __new_middle = __first_cut; -<span class="lineNum"> 2703 </span> : std::advance(__new_middle, std::distance(__middle, __second_cut)); -<span class="lineNum"> 2704 </span> : std::__merge_without_buffer(__first, __first_cut, __new_middle, -<span class="lineNum"> 2705 </span> : __len11, __len22); -<span class="lineNum"> 2706 </span> : std::__merge_without_buffer(__new_middle, __second_cut, __last, -<span class="lineNum"> 2707 </span> : __len1 - __len11, __len2 - __len22); -<span class="lineNum"> 2708 </span> : } -<span class="lineNum"> 2709 </span> : -<span class="lineNum"> 2710 </span> : /// This is a helper function for the merge routines. -<span class="lineNum"> 2711 </span> : template<typename _BidirectionalIterator, typename _Distance, -<span class="lineNum"> 2712 </span> : typename _Compare> -<span class="lineNum"> 2713 </span> : void -<span class="lineNum"> 2714 </span> : __merge_without_buffer(_BidirectionalIterator __first, -<span class="lineNum"> 2715 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 2716 </span> : _BidirectionalIterator __last, -<span class="lineNum"> 2717 </span> : _Distance __len1, _Distance __len2, -<span class="lineNum"> 2718 </span> : _Compare __comp) -<span class="lineNum"> 2719 </span> : { -<span class="lineNum"> 2720 </span> : if (__len1 == 0 || __len2 == 0) -<span class="lineNum"> 2721 </span> : return; -<span class="lineNum"> 2722 </span> : if (__len1 + __len2 == 2) -<span class="lineNum"> 2723 </span> : { -<span class="lineNum"> 2724 </span> : if (__comp(*__middle, *__first)) -<span class="lineNum"> 2725 </span> : std::iter_swap(__first, __middle); -<span class="lineNum"> 2726 </span> : return; -<span class="lineNum"> 2727 </span> : } -<span class="lineNum"> 2728 </span> : _BidirectionalIterator __first_cut = __first; -<span class="lineNum"> 2729 </span> : _BidirectionalIterator __second_cut = __middle; -<span class="lineNum"> 2730 </span> : _Distance __len11 = 0; -<span class="lineNum"> 2731 </span> : _Distance __len22 = 0; -<span class="lineNum"> 2732 </span> : if (__len1 > __len2) -<span class="lineNum"> 2733 </span> : { -<span class="lineNum"> 2734 </span> : __len11 = __len1 / 2; -<span class="lineNum"> 2735 </span> : std::advance(__first_cut, __len11); -<span class="lineNum"> 2736 </span> : __second_cut = std::lower_bound(__middle, __last, *__first_cut, -<span class="lineNum"> 2737 </span> : __comp); -<span class="lineNum"> 2738 </span> : __len22 = std::distance(__middle, __second_cut); -<span class="lineNum"> 2739 </span> : } -<span class="lineNum"> 2740 </span> : else -<span class="lineNum"> 2741 </span> : { -<span class="lineNum"> 2742 </span> : __len22 = __len2 / 2; -<span class="lineNum"> 2743 </span> : std::advance(__second_cut, __len22); -<span class="lineNum"> 2744 </span> : __first_cut = std::upper_bound(__first, __middle, *__second_cut, -<span class="lineNum"> 2745 </span> : __comp); -<span class="lineNum"> 2746 </span> : __len11 = std::distance(__first, __first_cut); -<span class="lineNum"> 2747 </span> : } -<span class="lineNum"> 2748 </span> : std::rotate(__first_cut, __middle, __second_cut); -<span class="lineNum"> 2749 </span> : _BidirectionalIterator __new_middle = __first_cut; -<span class="lineNum"> 2750 </span> : std::advance(__new_middle, std::distance(__middle, __second_cut)); -<span class="lineNum"> 2751 </span> : std::__merge_without_buffer(__first, __first_cut, __new_middle, -<span class="lineNum"> 2752 </span> : __len11, __len22, __comp); -<span class="lineNum"> 2753 </span> : std::__merge_without_buffer(__new_middle, __second_cut, __last, -<span class="lineNum"> 2754 </span> : __len1 - __len11, __len2 - __len22, __comp); -<span class="lineNum"> 2755 </span> : } -<span class="lineNum"> 2756 </span> : -<span class="lineNum"> 2757 </span> : /** -<span class="lineNum"> 2758 </span> : * @brief Merges two sorted ranges in place. -<span class="lineNum"> 2759 </span> : * @param first An iterator. -<span class="lineNum"> 2760 </span> : * @param middle Another iterator. -<span class="lineNum"> 2761 </span> : * @param last Another iterator. -<span class="lineNum"> 2762 </span> : * @return Nothing. -<span class="lineNum"> 2763 </span> : * -<span class="lineNum"> 2764 </span> : * Merges two sorted and consecutive ranges, [first,middle) and -<span class="lineNum"> 2765 </span> : * [middle,last), and puts the result in [first,last). The output will -<span class="lineNum"> 2766 </span> : * be sorted. The sort is @e stable, that is, for equivalent -<span class="lineNum"> 2767 </span> : * elements in the two ranges, elements from the first range will always -<span class="lineNum"> 2768 </span> : * come before elements from the second. -<span class="lineNum"> 2769 </span> : * -<span class="lineNum"> 2770 </span> : * If enough additional memory is available, this takes (last-first)-1 -<span class="lineNum"> 2771 </span> : * comparisons. Otherwise an NlogN algorithm is used, where N is -<span class="lineNum"> 2772 </span> : * distance(first,last). -<span class="lineNum"> 2773 </span> : */ -<span class="lineNum"> 2774 </span> : template<typename _BidirectionalIterator> -<span class="lineNum"> 2775 </span> : void -<span class="lineNum"> 2776 </span> : inplace_merge(_BidirectionalIterator __first, -<span class="lineNum"> 2777 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 2778 </span> : _BidirectionalIterator __last) -<span class="lineNum"> 2779 </span> : { -<span class="lineNum"> 2780 </span> : typedef typename iterator_traits<_BidirectionalIterator>::value_type -<span class="lineNum"> 2781 </span> : _ValueType; -<span class="lineNum"> 2782 </span> : typedef typename iterator_traits<_BidirectionalIterator>::difference_type -<span class="lineNum"> 2783 </span> : _DistanceType; -<span class="lineNum"> 2784 </span> : -<span class="lineNum"> 2785 </span> : // concept requirements -<span class="lineNum"> 2786 </span> : __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< -<span class="lineNum"> 2787 </span> : _BidirectionalIterator>) -<span class="lineNum"> 2788 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 2789 </span> : __glibcxx_requires_sorted(__first, __middle); -<span class="lineNum"> 2790 </span> : __glibcxx_requires_sorted(__middle, __last); -<span class="lineNum"> 2791 </span> : -<span class="lineNum"> 2792 </span> : if (__first == __middle || __middle == __last) -<span class="lineNum"> 2793 </span> : return; -<span class="lineNum"> 2794 </span> : -<span class="lineNum"> 2795 </span> : _DistanceType __len1 = std::distance(__first, __middle); -<span class="lineNum"> 2796 </span> : _DistanceType __len2 = std::distance(__middle, __last); -<span class="lineNum"> 2797 </span> : -<span class="lineNum"> 2798 </span> : _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first, -<span class="lineNum"> 2799 </span> : __last); -<span class="lineNum"> 2800 </span> : if (__buf.begin() == 0) -<span class="lineNum"> 2801 </span> : std::__merge_without_buffer(__first, __middle, __last, __len1, __len2); -<span class="lineNum"> 2802 </span> : else -<span class="lineNum"> 2803 </span> : std::__merge_adaptive(__first, __middle, __last, __len1, __len2, -<span class="lineNum"> 2804 </span> : __buf.begin(), _DistanceType(__buf.size())); -<span class="lineNum"> 2805 </span> : } -<span class="lineNum"> 2806 </span> : -<span class="lineNum"> 2807 </span> : /** -<span class="lineNum"> 2808 </span> : * @brief Merges two sorted ranges in place. -<span class="lineNum"> 2809 </span> : * @param first An iterator. -<span class="lineNum"> 2810 </span> : * @param middle Another iterator. -<span class="lineNum"> 2811 </span> : * @param last Another iterator. -<span class="lineNum"> 2812 </span> : * @param comp A functor to use for comparisons. -<span class="lineNum"> 2813 </span> : * @return Nothing. -<span class="lineNum"> 2814 </span> : * -<span class="lineNum"> 2815 </span> : * Merges two sorted and consecutive ranges, [first,middle) and -<span class="lineNum"> 2816 </span> : * [middle,last), and puts the result in [first,last). The output will -<span class="lineNum"> 2817 </span> : * be sorted. The sort is @e stable, that is, for equivalent -<span class="lineNum"> 2818 </span> : * elements in the two ranges, elements from the first range will always -<span class="lineNum"> 2819 </span> : * come before elements from the second. -<span class="lineNum"> 2820 </span> : * -<span class="lineNum"> 2821 </span> : * If enough additional memory is available, this takes (last-first)-1 -<span class="lineNum"> 2822 </span> : * comparisons. Otherwise an NlogN algorithm is used, where N is -<span class="lineNum"> 2823 </span> : * distance(first,last). -<span class="lineNum"> 2824 </span> : * -<span class="lineNum"> 2825 </span> : * The comparison function should have the same effects on ordering as -<span class="lineNum"> 2826 </span> : * the function used for the initial sort. -<span class="lineNum"> 2827 </span> : */ -<span class="lineNum"> 2828 </span> : template<typename _BidirectionalIterator, typename _Compare> -<span class="lineNum"> 2829 </span> : void -<span class="lineNum"> 2830 </span> : inplace_merge(_BidirectionalIterator __first, -<span class="lineNum"> 2831 </span> : _BidirectionalIterator __middle, -<span class="lineNum"> 2832 </span> : _BidirectionalIterator __last, -<span class="lineNum"> 2833 </span> : _Compare __comp) -<span class="lineNum"> 2834 </span> : { -<span class="lineNum"> 2835 </span> : typedef typename iterator_traits<_BidirectionalIterator>::value_type -<span class="lineNum"> 2836 </span> : _ValueType; -<span class="lineNum"> 2837 </span> : typedef typename iterator_traits<_BidirectionalIterator>::difference_type -<span class="lineNum"> 2838 </span> : _DistanceType; -<span class="lineNum"> 2839 </span> : -<span class="lineNum"> 2840 </span> : // concept requirements -<span class="lineNum"> 2841 </span> : __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept< -<span class="lineNum"> 2842 </span> : _BidirectionalIterator>) -<span class="lineNum"> 2843 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 2844 </span> : _ValueType, _ValueType>) -<span class="lineNum"> 2845 </span> : __glibcxx_requires_sorted_pred(__first, __middle, __comp); -<span class="lineNum"> 2846 </span> : __glibcxx_requires_sorted_pred(__middle, __last, __comp); -<span class="lineNum"> 2847 </span> : -<span class="lineNum"> 2848 </span> : if (__first == __middle || __middle == __last) -<span class="lineNum"> 2849 </span> : return; -<span class="lineNum"> 2850 </span> : -<span class="lineNum"> 2851 </span> : const _DistanceType __len1 = std::distance(__first, __middle); -<span class="lineNum"> 2852 </span> : const _DistanceType __len2 = std::distance(__middle, __last); -<span class="lineNum"> 2853 </span> : -<span class="lineNum"> 2854 </span> : _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first, -<span class="lineNum"> 2855 </span> : __last); -<span class="lineNum"> 2856 </span> : if (__buf.begin() == 0) -<span class="lineNum"> 2857 </span> : std::__merge_without_buffer(__first, __middle, __last, __len1, -<span class="lineNum"> 2858 </span> : __len2, __comp); -<span class="lineNum"> 2859 </span> : else -<span class="lineNum"> 2860 </span> : std::__merge_adaptive(__first, __middle, __last, __len1, __len2, -<span class="lineNum"> 2861 </span> : __buf.begin(), _DistanceType(__buf.size()), -<span class="lineNum"> 2862 </span> : __comp); -<span class="lineNum"> 2863 </span> : } -<span class="lineNum"> 2864 </span> : -<span class="lineNum"> 2865 </span> : template<typename _RandomAccessIterator1, typename _RandomAccessIterator2, -<span class="lineNum"> 2866 </span> : typename _Distance> -<span class="lineNum"> 2867 </span> : void -<span class="lineNum"> 2868 </span> : __merge_sort_loop(_RandomAccessIterator1 __first, -<span class="lineNum"> 2869 </span> : _RandomAccessIterator1 __last, -<span class="lineNum"> 2870 </span> : _RandomAccessIterator2 __result, -<span class="lineNum"> 2871 </span> : _Distance __step_size) -<span class="lineNum"> 2872 </span> : { -<span class="lineNum"> 2873 </span> : const _Distance __two_step = 2 * __step_size; -<span class="lineNum"> 2874 </span> : -<span class="lineNum"> 2875 </span> : while (__last - __first >= __two_step) -<span class="lineNum"> 2876 </span> : { -<span class="lineNum"> 2877 </span> : __result = _GLIBCXX_STD_P::merge(__first, __first + __step_size, -<span class="lineNum"> 2878 </span> : __first + __step_size, -<span class="lineNum"> 2879 </span> : __first + __two_step, -<span class="lineNum"> 2880 </span> : __result); -<span class="lineNum"> 2881 </span> : __first += __two_step; -<span class="lineNum"> 2882 </span> : } -<span class="lineNum"> 2883 </span> : -<span class="lineNum"> 2884 </span> : __step_size = std::min(_Distance(__last - __first), __step_size); -<span class="lineNum"> 2885 </span> : _GLIBCXX_STD_P::merge(__first, __first + __step_size, -<span class="lineNum"> 2886 </span> : __first + __step_size, __last, -<span class="lineNum"> 2887 </span> : __result); -<span class="lineNum"> 2888 </span> : } -<span class="lineNum"> 2889 </span> : -<span class="lineNum"> 2890 </span> : template<typename _RandomAccessIterator1, typename _RandomAccessIterator2, -<span class="lineNum"> 2891 </span> : typename _Distance, typename _Compare> -<span class="lineNum"> 2892 </span> : void -<span class="lineNum"> 2893 </span> : __merge_sort_loop(_RandomAccessIterator1 __first, -<span class="lineNum"> 2894 </span> : _RandomAccessIterator1 __last, -<span class="lineNum"> 2895 </span> : _RandomAccessIterator2 __result, _Distance __step_size, -<span class="lineNum"> 2896 </span> : _Compare __comp) -<span class="lineNum"> 2897 </span> : { -<span class="lineNum"> 2898 </span> : const _Distance __two_step = 2 * __step_size; -<span class="lineNum"> 2899 </span> : -<span class="lineNum"> 2900 </span> : while (__last - __first >= __two_step) -<span class="lineNum"> 2901 </span> : { -<span class="lineNum"> 2902 </span> : __result = _GLIBCXX_STD_P::merge(__first, __first + __step_size, -<span class="lineNum"> 2903 </span> : __first + __step_size, __first + __two_step, -<span class="lineNum"> 2904 </span> : __result, -<span class="lineNum"> 2905 </span> : __comp); -<span class="lineNum"> 2906 </span> : __first += __two_step; -<span class="lineNum"> 2907 </span> : } -<span class="lineNum"> 2908 </span> : __step_size = std::min(_Distance(__last - __first), __step_size); -<span class="lineNum"> 2909 </span> : -<span class="lineNum"> 2910 </span> : _GLIBCXX_STD_P::merge(__first, __first + __step_size, -<span class="lineNum"> 2911 </span> : __first + __step_size, __last, __result, __comp); -<span class="lineNum"> 2912 </span> : } -<span class="lineNum"> 2913 </span> : -<span class="lineNum"> 2914 </span> : template<typename _RandomAccessIterator, typename _Distance> -<span class="lineNum"> 2915 </span> : void -<span class="lineNum"> 2916 </span> : __chunk_insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 2917 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 2918 </span> : _Distance __chunk_size) -<span class="lineNum"> 2919 </span> : { -<span class="lineNum"> 2920 </span> : while (__last - __first >= __chunk_size) -<span class="lineNum"> 2921 </span> : { -<span class="lineNum"> 2922 </span> : std::__insertion_sort(__first, __first + __chunk_size); -<span class="lineNum"> 2923 </span> : __first += __chunk_size; -<span class="lineNum"> 2924 </span> : } -<span class="lineNum"> 2925 </span> : std::__insertion_sort(__first, __last); -<span class="lineNum"> 2926 </span> : } -<span class="lineNum"> 2927 </span> : -<span class="lineNum"> 2928 </span> : template<typename _RandomAccessIterator, typename _Distance, -<span class="lineNum"> 2929 </span> : typename _Compare> -<span class="lineNum"> 2930 </span> : void -<span class="lineNum"> 2931 </span> : __chunk_insertion_sort(_RandomAccessIterator __first, -<span class="lineNum"> 2932 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 2933 </span> : _Distance __chunk_size, _Compare __comp) -<span class="lineNum"> 2934 </span> : { -<span class="lineNum"> 2935 </span> : while (__last - __first >= __chunk_size) -<span class="lineNum"> 2936 </span> : { -<span class="lineNum"> 2937 </span> : std::__insertion_sort(__first, __first + __chunk_size, __comp); -<span class="lineNum"> 2938 </span> : __first += __chunk_size; -<span class="lineNum"> 2939 </span> : } -<span class="lineNum"> 2940 </span> : std::__insertion_sort(__first, __last, __comp); -<span class="lineNum"> 2941 </span> : } -<span class="lineNum"> 2942 </span> : -<span class="lineNum"> 2943 </span> : enum { _S_chunk_size = 7 }; -<span class="lineNum"> 2944 </span> : -<span class="lineNum"> 2945 </span> : template<typename _RandomAccessIterator, typename _Pointer> -<span class="lineNum"> 2946 </span> : void -<span class="lineNum"> 2947 </span> : __merge_sort_with_buffer(_RandomAccessIterator __first, -<span class="lineNum"> 2948 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 2949 </span> : _Pointer __buffer) -<span class="lineNum"> 2950 </span> : { -<span class="lineNum"> 2951 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 2952 </span> : _Distance; -<span class="lineNum"> 2953 </span> : -<span class="lineNum"> 2954 </span> : const _Distance __len = __last - __first; -<span class="lineNum"> 2955 </span> : const _Pointer __buffer_last = __buffer + __len; -<span class="lineNum"> 2956 </span> : -<span class="lineNum"> 2957 </span> : _Distance __step_size = _S_chunk_size; -<span class="lineNum"> 2958 </span> : std::__chunk_insertion_sort(__first, __last, __step_size); -<span class="lineNum"> 2959 </span> : -<span class="lineNum"> 2960 </span> : while (__step_size < __len) -<span class="lineNum"> 2961 </span> : { -<span class="lineNum"> 2962 </span> : std::__merge_sort_loop(__first, __last, __buffer, __step_size); -<span class="lineNum"> 2963 </span> : __step_size *= 2; -<span class="lineNum"> 2964 </span> : std::__merge_sort_loop(__buffer, __buffer_last, __first, __step_size); -<span class="lineNum"> 2965 </span> : __step_size *= 2; -<span class="lineNum"> 2966 </span> : } -<span class="lineNum"> 2967 </span> : } -<span class="lineNum"> 2968 </span> : -<span class="lineNum"> 2969 </span> : template<typename _RandomAccessIterator, typename _Pointer, typename _Compare> -<span class="lineNum"> 2970 </span> : void -<span class="lineNum"> 2971 </span> : __merge_sort_with_buffer(_RandomAccessIterator __first, -<span class="lineNum"> 2972 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 2973 </span> : _Pointer __buffer, _Compare __comp) -<span class="lineNum"> 2974 </span> : { -<span class="lineNum"> 2975 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 2976 </span> : _Distance; -<span class="lineNum"> 2977 </span> : -<span class="lineNum"> 2978 </span> : const _Distance __len = __last - __first; -<span class="lineNum"> 2979 </span> : const _Pointer __buffer_last = __buffer + __len; -<span class="lineNum"> 2980 </span> : -<span class="lineNum"> 2981 </span> : _Distance __step_size = _S_chunk_size; -<span class="lineNum"> 2982 </span> : std::__chunk_insertion_sort(__first, __last, __step_size, __comp); -<span class="lineNum"> 2983 </span> : -<span class="lineNum"> 2984 </span> : while (__step_size < __len) -<span class="lineNum"> 2985 </span> : { -<span class="lineNum"> 2986 </span> : std::__merge_sort_loop(__first, __last, __buffer, -<span class="lineNum"> 2987 </span> : __step_size, __comp); -<span class="lineNum"> 2988 </span> : __step_size *= 2; -<span class="lineNum"> 2989 </span> : std::__merge_sort_loop(__buffer, __buffer_last, __first, -<span class="lineNum"> 2990 </span> : __step_size, __comp); -<span class="lineNum"> 2991 </span> : __step_size *= 2; -<span class="lineNum"> 2992 </span> : } -<span class="lineNum"> 2993 </span> : } -<span class="lineNum"> 2994 </span> : -<span class="lineNum"> 2995 </span> : template<typename _RandomAccessIterator, typename _Pointer, -<span class="lineNum"> 2996 </span> : typename _Distance> -<span class="lineNum"> 2997 </span> : void -<span class="lineNum"> 2998 </span> : __stable_sort_adaptive(_RandomAccessIterator __first, -<span class="lineNum"> 2999 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 3000 </span> : _Pointer __buffer, _Distance __buffer_size) -<span class="lineNum"> 3001 </span> : { -<span class="lineNum"> 3002 </span> : const _Distance __len = (__last - __first + 1) / 2; -<span class="lineNum"> 3003 </span> : const _RandomAccessIterator __middle = __first + __len; -<span class="lineNum"> 3004 </span> : if (__len > __buffer_size) -<span class="lineNum"> 3005 </span> : { -<span class="lineNum"> 3006 </span> : std::__stable_sort_adaptive(__first, __middle, -<span class="lineNum"> 3007 </span> : __buffer, __buffer_size); -<span class="lineNum"> 3008 </span> : std::__stable_sort_adaptive(__middle, __last, -<span class="lineNum"> 3009 </span> : __buffer, __buffer_size); -<span class="lineNum"> 3010 </span> : } -<span class="lineNum"> 3011 </span> : else -<span class="lineNum"> 3012 </span> : { -<span class="lineNum"> 3013 </span> : std::__merge_sort_with_buffer(__first, __middle, __buffer); -<span class="lineNum"> 3014 </span> : std::__merge_sort_with_buffer(__middle, __last, __buffer); -<span class="lineNum"> 3015 </span> : } -<span class="lineNum"> 3016 </span> : std::__merge_adaptive(__first, __middle, __last, -<span class="lineNum"> 3017 </span> : _Distance(__middle - __first), -<span class="lineNum"> 3018 </span> : _Distance(__last - __middle), -<span class="lineNum"> 3019 </span> : __buffer, __buffer_size); -<span class="lineNum"> 3020 </span> : } -<span class="lineNum"> 3021 </span> : -<span class="lineNum"> 3022 </span> : template<typename _RandomAccessIterator, typename _Pointer, -<span class="lineNum"> 3023 </span> : typename _Distance, typename _Compare> -<span class="lineNum"> 3024 </span> : void -<span class="lineNum"> 3025 </span> : __stable_sort_adaptive(_RandomAccessIterator __first, -<span class="lineNum"> 3026 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 3027 </span> : _Pointer __buffer, _Distance __buffer_size, -<span class="lineNum"> 3028 </span> : _Compare __comp) -<span class="lineNum"> 3029 </span> : { -<span class="lineNum"> 3030 </span> : const _Distance __len = (__last - __first + 1) / 2; -<span class="lineNum"> 3031 </span> : const _RandomAccessIterator __middle = __first + __len; -<span class="lineNum"> 3032 </span> : if (__len > __buffer_size) -<span class="lineNum"> 3033 </span> : { -<span class="lineNum"> 3034 </span> : std::__stable_sort_adaptive(__first, __middle, __buffer, -<span class="lineNum"> 3035 </span> : __buffer_size, __comp); -<span class="lineNum"> 3036 </span> : std::__stable_sort_adaptive(__middle, __last, __buffer, -<span class="lineNum"> 3037 </span> : __buffer_size, __comp); -<span class="lineNum"> 3038 </span> : } -<span class="lineNum"> 3039 </span> : else -<span class="lineNum"> 3040 </span> : { -<span class="lineNum"> 3041 </span> : std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp); -<span class="lineNum"> 3042 </span> : std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp); -<span class="lineNum"> 3043 </span> : } -<span class="lineNum"> 3044 </span> : std::__merge_adaptive(__first, __middle, __last, -<span class="lineNum"> 3045 </span> : _Distance(__middle - __first), -<span class="lineNum"> 3046 </span> : _Distance(__last - __middle), -<span class="lineNum"> 3047 </span> : __buffer, __buffer_size, -<span class="lineNum"> 3048 </span> : __comp); -<span class="lineNum"> 3049 </span> : } -<span class="lineNum"> 3050 </span> : -<span class="lineNum"> 3051 </span> : /// This is a helper function for the stable sorting routines. -<span class="lineNum"> 3052 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 3053 </span> : void -<span class="lineNum"> 3054 </span> : __inplace_stable_sort(_RandomAccessIterator __first, -<span class="lineNum"> 3055 </span> : _RandomAccessIterator __last) -<span class="lineNum"> 3056 </span> : { -<span class="lineNum"> 3057 </span> : if (__last - __first < 15) -<span class="lineNum"> 3058 </span> : { -<span class="lineNum"> 3059 </span> : std::__insertion_sort(__first, __last); -<span class="lineNum"> 3060 </span> : return; -<span class="lineNum"> 3061 </span> : } -<span class="lineNum"> 3062 </span> : _RandomAccessIterator __middle = __first + (__last - __first) / 2; -<span class="lineNum"> 3063 </span> : std::__inplace_stable_sort(__first, __middle); -<span class="lineNum"> 3064 </span> : std::__inplace_stable_sort(__middle, __last); -<span class="lineNum"> 3065 </span> : std::__merge_without_buffer(__first, __middle, __last, -<span class="lineNum"> 3066 </span> : __middle - __first, -<span class="lineNum"> 3067 </span> : __last - __middle); -<span class="lineNum"> 3068 </span> : } -<span class="lineNum"> 3069 </span> : -<span class="lineNum"> 3070 </span> : /// This is a helper function for the stable sorting routines. -<span class="lineNum"> 3071 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 3072 </span> : void -<span class="lineNum"> 3073 </span> : __inplace_stable_sort(_RandomAccessIterator __first, -<span class="lineNum"> 3074 </span> : _RandomAccessIterator __last, _Compare __comp) -<span class="lineNum"> 3075 </span> : { -<span class="lineNum"> 3076 </span> : if (__last - __first < 15) -<span class="lineNum"> 3077 </span> : { -<span class="lineNum"> 3078 </span> : std::__insertion_sort(__first, __last, __comp); -<span class="lineNum"> 3079 </span> : return; -<span class="lineNum"> 3080 </span> : } -<span class="lineNum"> 3081 </span> : _RandomAccessIterator __middle = __first + (__last - __first) / 2; -<span class="lineNum"> 3082 </span> : std::__inplace_stable_sort(__first, __middle, __comp); -<span class="lineNum"> 3083 </span> : std::__inplace_stable_sort(__middle, __last, __comp); -<span class="lineNum"> 3084 </span> : std::__merge_without_buffer(__first, __middle, __last, -<span class="lineNum"> 3085 </span> : __middle - __first, -<span class="lineNum"> 3086 </span> : __last - __middle, -<span class="lineNum"> 3087 </span> : __comp); -<span class="lineNum"> 3088 </span> : } -<span class="lineNum"> 3089 </span> : -<span class="lineNum"> 3090 </span> : // stable_sort -<span class="lineNum"> 3091 </span> : -<span class="lineNum"> 3092 </span> : // Set algorithms: includes, set_union, set_intersection, set_difference, -<span class="lineNum"> 3093 </span> : // set_symmetric_difference. All of these algorithms have the precondition -<span class="lineNum"> 3094 </span> : // that their input ranges are sorted and the postcondition that their output -<span class="lineNum"> 3095 </span> : // ranges are sorted. -<span class="lineNum"> 3096 </span> : -<span class="lineNum"> 3097 </span> : /** -<span class="lineNum"> 3098 </span> : * @brief Determines whether all elements of a sequence exists in a range. -<span class="lineNum"> 3099 </span> : * @param first1 Start of search range. -<span class="lineNum"> 3100 </span> : * @param last1 End of search range. -<span class="lineNum"> 3101 </span> : * @param first2 Start of sequence -<span class="lineNum"> 3102 </span> : * @param last2 End of sequence. -<span class="lineNum"> 3103 </span> : * @return True if each element in [first2,last2) is contained in order -<span class="lineNum"> 3104 </span> : * within [first1,last1). False otherwise. -<span class="lineNum"> 3105 </span> : * @ingroup setoperations -<span class="lineNum"> 3106 </span> : * -<span class="lineNum"> 3107 </span> : * This operation expects both [first1,last1) and [first2,last2) to be -<span class="lineNum"> 3108 </span> : * sorted. Searches for the presence of each element in [first2,last2) -<span class="lineNum"> 3109 </span> : * within [first1,last1). The iterators over each range only move forward, -<span class="lineNum"> 3110 </span> : * so this is a linear algorithm. If an element in [first2,last2) is not -<span class="lineNum"> 3111 </span> : * found before the search iterator reaches @a last2, false is returned. -<span class="lineNum"> 3112 </span> : */ -<span class="lineNum"> 3113 </span> : template<typename _InputIterator1, typename _InputIterator2> -<span class="lineNum"> 3114 </span> : bool -<span class="lineNum"> 3115 </span> : includes(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 3116 </span> : _InputIterator2 __first2, _InputIterator2 __last2) -<span class="lineNum"> 3117 </span> : { -<span class="lineNum"> 3118 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 3119 </span> : _ValueType1; -<span class="lineNum"> 3120 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 3121 </span> : _ValueType2; -<span class="lineNum"> 3122 </span> : -<span class="lineNum"> 3123 </span> : // concept requirements -<span class="lineNum"> 3124 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 3125 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 3126 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) -<span class="lineNum"> 3127 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 3128 </span> : __glibcxx_requires_sorted_set(__first1, __last1, __first2); -<span class="lineNum"> 3129 </span> : __glibcxx_requires_sorted_set(__first2, __last2, __first1); -<span class="lineNum"> 3130 </span> : -<span class="lineNum"> 3131 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 3132 </span> : if (*__first2 < *__first1) -<span class="lineNum"> 3133 </span> : return false; -<span class="lineNum"> 3134 </span> : else if(*__first1 < *__first2) -<span class="lineNum"> 3135 </span> : ++__first1; -<span class="lineNum"> 3136 </span> : else -<span class="lineNum"> 3137 </span> : ++__first1, ++__first2; -<span class="lineNum"> 3138 </span> : -<span class="lineNum"> 3139 </span> : return __first2 == __last2; -<span class="lineNum"> 3140 </span> : } -<span class="lineNum"> 3141 </span> : -<span class="lineNum"> 3142 </span> : /** -<span class="lineNum"> 3143 </span> : * @brief Determines whether all elements of a sequence exists in a range -<span class="lineNum"> 3144 </span> : * using comparison. -<span class="lineNum"> 3145 </span> : * @param first1 Start of search range. -<span class="lineNum"> 3146 </span> : * @param last1 End of search range. -<span class="lineNum"> 3147 </span> : * @param first2 Start of sequence -<span class="lineNum"> 3148 </span> : * @param last2 End of sequence. -<span class="lineNum"> 3149 </span> : * @param comp Comparison function to use. -<span class="lineNum"> 3150 </span> : * @return True if each element in [first2,last2) is contained in order -<span class="lineNum"> 3151 </span> : * within [first1,last1) according to comp. False otherwise. -<span class="lineNum"> 3152 </span> : * @ingroup setoperations -<span class="lineNum"> 3153 </span> : * -<span class="lineNum"> 3154 </span> : * This operation expects both [first1,last1) and [first2,last2) to be -<span class="lineNum"> 3155 </span> : * sorted. Searches for the presence of each element in [first2,last2) -<span class="lineNum"> 3156 </span> : * within [first1,last1), using comp to decide. The iterators over each -<span class="lineNum"> 3157 </span> : * range only move forward, so this is a linear algorithm. If an element -<span class="lineNum"> 3158 </span> : * in [first2,last2) is not found before the search iterator reaches @a -<span class="lineNum"> 3159 </span> : * last2, false is returned. -<span class="lineNum"> 3160 </span> : */ -<span class="lineNum"> 3161 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 3162 </span> : typename _Compare> -<span class="lineNum"> 3163 </span> : bool -<span class="lineNum"> 3164 </span> : includes(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 3165 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 3166 </span> : _Compare __comp) -<span class="lineNum"> 3167 </span> : { -<span class="lineNum"> 3168 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 3169 </span> : _ValueType1; -<span class="lineNum"> 3170 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 3171 </span> : _ValueType2; -<span class="lineNum"> 3172 </span> : -<span class="lineNum"> 3173 </span> : // concept requirements -<span class="lineNum"> 3174 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 3175 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 3176 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 3177 </span> : _ValueType1, _ValueType2>) -<span class="lineNum"> 3178 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 3179 </span> : _ValueType2, _ValueType1>) -<span class="lineNum"> 3180 </span> : __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); -<span class="lineNum"> 3181 </span> : __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); -<span class="lineNum"> 3182 </span> : -<span class="lineNum"> 3183 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 3184 </span> : if (__comp(*__first2, *__first1)) -<span class="lineNum"> 3185 </span> : return false; -<span class="lineNum"> 3186 </span> : else if(__comp(*__first1, *__first2)) -<span class="lineNum"> 3187 </span> : ++__first1; -<span class="lineNum"> 3188 </span> : else -<span class="lineNum"> 3189 </span> : ++__first1, ++__first2; -<span class="lineNum"> 3190 </span> : -<span class="lineNum"> 3191 </span> : return __first2 == __last2; -<span class="lineNum"> 3192 </span> : } -<span class="lineNum"> 3193 </span> : -<span class="lineNum"> 3194 </span> : // nth_element -<span class="lineNum"> 3195 </span> : // merge -<span class="lineNum"> 3196 </span> : // set_difference -<span class="lineNum"> 3197 </span> : // set_intersection -<span class="lineNum"> 3198 </span> : // set_union -<span class="lineNum"> 3199 </span> : // stable_sort -<span class="lineNum"> 3200 </span> : // set_symmetric_difference -<span class="lineNum"> 3201 </span> : // min_element -<span class="lineNum"> 3202 </span> : // max_element -<span class="lineNum"> 3203 </span> : -<span class="lineNum"> 3204 </span> : /** -<span class="lineNum"> 3205 </span> : * @brief Permute range into the next "dictionary" ordering. -<span class="lineNum"> 3206 </span> : * @param first Start of range. -<span class="lineNum"> 3207 </span> : * @param last End of range. -<span class="lineNum"> 3208 </span> : * @return False if wrapped to first permutation, true otherwise. -<span class="lineNum"> 3209 </span> : * -<span class="lineNum"> 3210 </span> : * Treats all permutations of the range as a set of "dictionary" sorted -<span class="lineNum"> 3211 </span> : * sequences. Permutes the current sequence into the next one of this set. -<span class="lineNum"> 3212 </span> : * Returns true if there are more sequences to generate. If the sequence -<span class="lineNum"> 3213 </span> : * is the largest of the set, the smallest is generated and false returned. -<span class="lineNum"> 3214 </span> : */ -<span class="lineNum"> 3215 </span> : template<typename _BidirectionalIterator> -<span class="lineNum"> 3216 </span> : bool -<span class="lineNum"> 3217 </span> : next_permutation(_BidirectionalIterator __first, -<span class="lineNum"> 3218 </span> : _BidirectionalIterator __last) -<span class="lineNum"> 3219 </span> : { -<span class="lineNum"> 3220 </span> : // concept requirements -<span class="lineNum"> 3221 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 3222 </span> : _BidirectionalIterator>) -<span class="lineNum"> 3223 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 3224 </span> : typename iterator_traits<_BidirectionalIterator>::value_type>) -<span class="lineNum"> 3225 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3226 </span> : -<span class="lineNum"> 3227 </span> : if (__first == __last) -<span class="lineNum"> 3228 </span> : return false; -<span class="lineNum"> 3229 </span> : _BidirectionalIterator __i = __first; -<span class="lineNum"> 3230 </span> : ++__i; -<span class="lineNum"> 3231 </span> : if (__i == __last) -<span class="lineNum"> 3232 </span> : return false; -<span class="lineNum"> 3233 </span> : __i = __last; -<span class="lineNum"> 3234 </span> : --__i; -<span class="lineNum"> 3235 </span> : -<span class="lineNum"> 3236 </span> : for(;;) -<span class="lineNum"> 3237 </span> : { -<span class="lineNum"> 3238 </span> : _BidirectionalIterator __ii = __i; -<span class="lineNum"> 3239 </span> : --__i; -<span class="lineNum"> 3240 </span> : if (*__i < *__ii) -<span class="lineNum"> 3241 </span> : { -<span class="lineNum"> 3242 </span> : _BidirectionalIterator __j = __last; -<span class="lineNum"> 3243 </span> : while (!(*__i < *--__j)) -<span class="lineNum"> 3244 </span> : {} -<span class="lineNum"> 3245 </span> : std::iter_swap(__i, __j); -<span class="lineNum"> 3246 </span> : std::reverse(__ii, __last); -<span class="lineNum"> 3247 </span> : return true; -<span class="lineNum"> 3248 </span> : } -<span class="lineNum"> 3249 </span> : if (__i == __first) -<span class="lineNum"> 3250 </span> : { -<span class="lineNum"> 3251 </span> : std::reverse(__first, __last); -<span class="lineNum"> 3252 </span> : return false; -<span class="lineNum"> 3253 </span> : } -<span class="lineNum"> 3254 </span> : } -<span class="lineNum"> 3255 </span> : } -<span class="lineNum"> 3256 </span> : -<span class="lineNum"> 3257 </span> : /** -<span class="lineNum"> 3258 </span> : * @brief Permute range into the next "dictionary" ordering using -<span class="lineNum"> 3259 </span> : * comparison functor. -<span class="lineNum"> 3260 </span> : * @param first Start of range. -<span class="lineNum"> 3261 </span> : * @param last End of range. -<span class="lineNum"> 3262 </span> : * @param comp A comparison functor. -<span class="lineNum"> 3263 </span> : * @return False if wrapped to first permutation, true otherwise. -<span class="lineNum"> 3264 </span> : * -<span class="lineNum"> 3265 </span> : * Treats all permutations of the range [first,last) as a set of -<span class="lineNum"> 3266 </span> : * "dictionary" sorted sequences ordered by @a comp. Permutes the current -<span class="lineNum"> 3267 </span> : * sequence into the next one of this set. Returns true if there are more -<span class="lineNum"> 3268 </span> : * sequences to generate. If the sequence is the largest of the set, the -<span class="lineNum"> 3269 </span> : * smallest is generated and false returned. -<span class="lineNum"> 3270 </span> : */ -<span class="lineNum"> 3271 </span> : template<typename _BidirectionalIterator, typename _Compare> -<span class="lineNum"> 3272 </span> : bool -<span class="lineNum"> 3273 </span> : next_permutation(_BidirectionalIterator __first, -<span class="lineNum"> 3274 </span> : _BidirectionalIterator __last, _Compare __comp) -<span class="lineNum"> 3275 </span> : { -<span class="lineNum"> 3276 </span> : // concept requirements -<span class="lineNum"> 3277 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 3278 </span> : _BidirectionalIterator>) -<span class="lineNum"> 3279 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 3280 </span> : typename iterator_traits<_BidirectionalIterator>::value_type, -<span class="lineNum"> 3281 </span> : typename iterator_traits<_BidirectionalIterator>::value_type>) -<span class="lineNum"> 3282 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3283 </span> : -<span class="lineNum"> 3284 </span> : if (__first == __last) -<span class="lineNum"> 3285 </span> : return false; -<span class="lineNum"> 3286 </span> : _BidirectionalIterator __i = __first; -<span class="lineNum"> 3287 </span> : ++__i; -<span class="lineNum"> 3288 </span> : if (__i == __last) -<span class="lineNum"> 3289 </span> : return false; -<span class="lineNum"> 3290 </span> : __i = __last; -<span class="lineNum"> 3291 </span> : --__i; -<span class="lineNum"> 3292 </span> : -<span class="lineNum"> 3293 </span> : for(;;) -<span class="lineNum"> 3294 </span> : { -<span class="lineNum"> 3295 </span> : _BidirectionalIterator __ii = __i; -<span class="lineNum"> 3296 </span> : --__i; -<span class="lineNum"> 3297 </span> : if (__comp(*__i, *__ii)) -<span class="lineNum"> 3298 </span> : { -<span class="lineNum"> 3299 </span> : _BidirectionalIterator __j = __last; -<span class="lineNum"> 3300 </span> : while (!bool(__comp(*__i, *--__j))) -<span class="lineNum"> 3301 </span> : {} -<span class="lineNum"> 3302 </span> : std::iter_swap(__i, __j); -<span class="lineNum"> 3303 </span> : std::reverse(__ii, __last); -<span class="lineNum"> 3304 </span> : return true; -<span class="lineNum"> 3305 </span> : } -<span class="lineNum"> 3306 </span> : if (__i == __first) -<span class="lineNum"> 3307 </span> : { -<span class="lineNum"> 3308 </span> : std::reverse(__first, __last); -<span class="lineNum"> 3309 </span> : return false; -<span class="lineNum"> 3310 </span> : } -<span class="lineNum"> 3311 </span> : } -<span class="lineNum"> 3312 </span> : } -<span class="lineNum"> 3313 </span> : -<span class="lineNum"> 3314 </span> : /** -<span class="lineNum"> 3315 </span> : * @brief Permute range into the previous "dictionary" ordering. -<span class="lineNum"> 3316 </span> : * @param first Start of range. -<span class="lineNum"> 3317 </span> : * @param last End of range. -<span class="lineNum"> 3318 </span> : * @return False if wrapped to last permutation, true otherwise. -<span class="lineNum"> 3319 </span> : * -<span class="lineNum"> 3320 </span> : * Treats all permutations of the range as a set of "dictionary" sorted -<span class="lineNum"> 3321 </span> : * sequences. Permutes the current sequence into the previous one of this -<span class="lineNum"> 3322 </span> : * set. Returns true if there are more sequences to generate. If the -<span class="lineNum"> 3323 </span> : * sequence is the smallest of the set, the largest is generated and false -<span class="lineNum"> 3324 </span> : * returned. -<span class="lineNum"> 3325 </span> : */ -<span class="lineNum"> 3326 </span> : template<typename _BidirectionalIterator> -<span class="lineNum"> 3327 </span> : bool -<span class="lineNum"> 3328 </span> : prev_permutation(_BidirectionalIterator __first, -<span class="lineNum"> 3329 </span> : _BidirectionalIterator __last) -<span class="lineNum"> 3330 </span> : { -<span class="lineNum"> 3331 </span> : // concept requirements -<span class="lineNum"> 3332 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 3333 </span> : _BidirectionalIterator>) -<span class="lineNum"> 3334 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 3335 </span> : typename iterator_traits<_BidirectionalIterator>::value_type>) -<span class="lineNum"> 3336 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3337 </span> : -<span class="lineNum"> 3338 </span> : if (__first == __last) -<span class="lineNum"> 3339 </span> : return false; -<span class="lineNum"> 3340 </span> : _BidirectionalIterator __i = __first; -<span class="lineNum"> 3341 </span> : ++__i; -<span class="lineNum"> 3342 </span> : if (__i == __last) -<span class="lineNum"> 3343 </span> : return false; -<span class="lineNum"> 3344 </span> : __i = __last; -<span class="lineNum"> 3345 </span> : --__i; -<span class="lineNum"> 3346 </span> : -<span class="lineNum"> 3347 </span> : for(;;) -<span class="lineNum"> 3348 </span> : { -<span class="lineNum"> 3349 </span> : _BidirectionalIterator __ii = __i; -<span class="lineNum"> 3350 </span> : --__i; -<span class="lineNum"> 3351 </span> : if (*__ii < *__i) -<span class="lineNum"> 3352 </span> : { -<span class="lineNum"> 3353 </span> : _BidirectionalIterator __j = __last; -<span class="lineNum"> 3354 </span> : while (!(*--__j < *__i)) -<span class="lineNum"> 3355 </span> : {} -<span class="lineNum"> 3356 </span> : std::iter_swap(__i, __j); -<span class="lineNum"> 3357 </span> : std::reverse(__ii, __last); -<span class="lineNum"> 3358 </span> : return true; -<span class="lineNum"> 3359 </span> : } -<span class="lineNum"> 3360 </span> : if (__i == __first) -<span class="lineNum"> 3361 </span> : { -<span class="lineNum"> 3362 </span> : std::reverse(__first, __last); -<span class="lineNum"> 3363 </span> : return false; -<span class="lineNum"> 3364 </span> : } -<span class="lineNum"> 3365 </span> : } -<span class="lineNum"> 3366 </span> : } -<span class="lineNum"> 3367 </span> : -<span class="lineNum"> 3368 </span> : /** -<span class="lineNum"> 3369 </span> : * @brief Permute range into the previous "dictionary" ordering using -<span class="lineNum"> 3370 </span> : * comparison functor. -<span class="lineNum"> 3371 </span> : * @param first Start of range. -<span class="lineNum"> 3372 </span> : * @param last End of range. -<span class="lineNum"> 3373 </span> : * @param comp A comparison functor. -<span class="lineNum"> 3374 </span> : * @return False if wrapped to last permutation, true otherwise. -<span class="lineNum"> 3375 </span> : * -<span class="lineNum"> 3376 </span> : * Treats all permutations of the range [first,last) as a set of -<span class="lineNum"> 3377 </span> : * "dictionary" sorted sequences ordered by @a comp. Permutes the current -<span class="lineNum"> 3378 </span> : * sequence into the previous one of this set. Returns true if there are -<span class="lineNum"> 3379 </span> : * more sequences to generate. If the sequence is the smallest of the set, -<span class="lineNum"> 3380 </span> : * the largest is generated and false returned. -<span class="lineNum"> 3381 </span> : */ -<span class="lineNum"> 3382 </span> : template<typename _BidirectionalIterator, typename _Compare> -<span class="lineNum"> 3383 </span> : bool -<span class="lineNum"> 3384 </span> : prev_permutation(_BidirectionalIterator __first, -<span class="lineNum"> 3385 </span> : _BidirectionalIterator __last, _Compare __comp) -<span class="lineNum"> 3386 </span> : { -<span class="lineNum"> 3387 </span> : // concept requirements -<span class="lineNum"> 3388 </span> : __glibcxx_function_requires(_BidirectionalIteratorConcept< -<span class="lineNum"> 3389 </span> : _BidirectionalIterator>) -<span class="lineNum"> 3390 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 3391 </span> : typename iterator_traits<_BidirectionalIterator>::value_type, -<span class="lineNum"> 3392 </span> : typename iterator_traits<_BidirectionalIterator>::value_type>) -<span class="lineNum"> 3393 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3394 </span> : -<span class="lineNum"> 3395 </span> : if (__first == __last) -<span class="lineNum"> 3396 </span> : return false; -<span class="lineNum"> 3397 </span> : _BidirectionalIterator __i = __first; -<span class="lineNum"> 3398 </span> : ++__i; -<span class="lineNum"> 3399 </span> : if (__i == __last) -<span class="lineNum"> 3400 </span> : return false; -<span class="lineNum"> 3401 </span> : __i = __last; -<span class="lineNum"> 3402 </span> : --__i; -<span class="lineNum"> 3403 </span> : -<span class="lineNum"> 3404 </span> : for(;;) -<span class="lineNum"> 3405 </span> : { -<span class="lineNum"> 3406 </span> : _BidirectionalIterator __ii = __i; -<span class="lineNum"> 3407 </span> : --__i; -<span class="lineNum"> 3408 </span> : if (__comp(*__ii, *__i)) -<span class="lineNum"> 3409 </span> : { -<span class="lineNum"> 3410 </span> : _BidirectionalIterator __j = __last; -<span class="lineNum"> 3411 </span> : while (!bool(__comp(*--__j, *__i))) -<span class="lineNum"> 3412 </span> : {} -<span class="lineNum"> 3413 </span> : std::iter_swap(__i, __j); -<span class="lineNum"> 3414 </span> : std::reverse(__ii, __last); -<span class="lineNum"> 3415 </span> : return true; -<span class="lineNum"> 3416 </span> : } -<span class="lineNum"> 3417 </span> : if (__i == __first) -<span class="lineNum"> 3418 </span> : { -<span class="lineNum"> 3419 </span> : std::reverse(__first, __last); -<span class="lineNum"> 3420 </span> : return false; -<span class="lineNum"> 3421 </span> : } -<span class="lineNum"> 3422 </span> : } -<span class="lineNum"> 3423 </span> : } -<span class="lineNum"> 3424 </span> : -<span class="lineNum"> 3425 </span> : // replace -<span class="lineNum"> 3426 </span> : // replace_if -<span class="lineNum"> 3427 </span> : -<span class="lineNum"> 3428 </span> : /** -<span class="lineNum"> 3429 </span> : * @brief Copy a sequence, replacing each element of one value with another -<span class="lineNum"> 3430 </span> : * value. -<span class="lineNum"> 3431 </span> : * @param first An input iterator. -<span class="lineNum"> 3432 </span> : * @param last An input iterator. -<span class="lineNum"> 3433 </span> : * @param result An output iterator. -<span class="lineNum"> 3434 </span> : * @param old_value The value to be replaced. -<span class="lineNum"> 3435 </span> : * @param new_value The replacement value. -<span class="lineNum"> 3436 </span> : * @return The end of the output sequence, @p result+(last-first). -<span class="lineNum"> 3437 </span> : * -<span class="lineNum"> 3438 </span> : * Copies each element in the input range @p [first,last) to the -<span class="lineNum"> 3439 </span> : * output range @p [result,result+(last-first)) replacing elements -<span class="lineNum"> 3440 </span> : * equal to @p old_value with @p new_value. -<span class="lineNum"> 3441 </span> : */ -<span class="lineNum"> 3442 </span> : template<typename _InputIterator, typename _OutputIterator, typename _Tp> -<span class="lineNum"> 3443 </span> : _OutputIterator -<span class="lineNum"> 3444 </span> : replace_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 3445 </span> : _OutputIterator __result, -<span class="lineNum"> 3446 </span> : const _Tp& __old_value, const _Tp& __new_value) -<span class="lineNum"> 3447 </span> : { -<span class="lineNum"> 3448 </span> : // concept requirements -<span class="lineNum"> 3449 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3450 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 3451 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 3452 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 3453 </span> : typename iterator_traits<_InputIterator>::value_type, _Tp>) -<span class="lineNum"> 3454 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3455 </span> : -<span class="lineNum"> 3456 </span> : for (; __first != __last; ++__first, ++__result) -<span class="lineNum"> 3457 </span> : if (*__first == __old_value) -<span class="lineNum"> 3458 </span> : *__result = __new_value; -<span class="lineNum"> 3459 </span> : else -<span class="lineNum"> 3460 </span> : *__result = *__first; -<span class="lineNum"> 3461 </span> : return __result; -<span class="lineNum"> 3462 </span> : } -<span class="lineNum"> 3463 </span> : -<span class="lineNum"> 3464 </span> : /** -<span class="lineNum"> 3465 </span> : * @brief Copy a sequence, replacing each value for which a predicate -<span class="lineNum"> 3466 </span> : * returns true with another value. -<span class="lineNum"> 3467 </span> : * @param first An input iterator. -<span class="lineNum"> 3468 </span> : * @param last An input iterator. -<span class="lineNum"> 3469 </span> : * @param result An output iterator. -<span class="lineNum"> 3470 </span> : * @param pred A predicate. -<span class="lineNum"> 3471 </span> : * @param new_value The replacement value. -<span class="lineNum"> 3472 </span> : * @return The end of the output sequence, @p result+(last-first). -<span class="lineNum"> 3473 </span> : * -<span class="lineNum"> 3474 </span> : * Copies each element in the range @p [first,last) to the range -<span class="lineNum"> 3475 </span> : * @p [result,result+(last-first)) replacing elements for which -<span class="lineNum"> 3476 </span> : * @p pred returns true with @p new_value. -<span class="lineNum"> 3477 </span> : */ -<span class="lineNum"> 3478 </span> : template<typename _InputIterator, typename _OutputIterator, -<span class="lineNum"> 3479 </span> : typename _Predicate, typename _Tp> -<span class="lineNum"> 3480 </span> : _OutputIterator -<span class="lineNum"> 3481 </span> : replace_copy_if(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 3482 </span> : _OutputIterator __result, -<span class="lineNum"> 3483 </span> : _Predicate __pred, const _Tp& __new_value) -<span class="lineNum"> 3484 </span> : { -<span class="lineNum"> 3485 </span> : // concept requirements -<span class="lineNum"> 3486 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3487 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 3488 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 3489 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 3490 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 3491 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3492 </span> : -<span class="lineNum"> 3493 </span> : for (; __first != __last; ++__first, ++__result) -<span class="lineNum"> 3494 </span> : if (__pred(*__first)) -<span class="lineNum"> 3495 </span> : *__result = __new_value; -<span class="lineNum"> 3496 </span> : else -<span class="lineNum"> 3497 </span> : *__result = *__first; -<span class="lineNum"> 3498 </span> : return __result; -<span class="lineNum"> 3499 </span> : } -<span class="lineNum"> 3500 </span> : -<span class="lineNum"> 3501 </span> : #ifdef __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 3502 </span> : /** -<span class="lineNum"> 3503 </span> : * @brief Determines whether the elements of a sequence are sorted. -<span class="lineNum"> 3504 </span> : * @param first An iterator. -<span class="lineNum"> 3505 </span> : * @param last Another iterator. -<span class="lineNum"> 3506 </span> : * @return True if the elements are sorted, false otherwise. -<span class="lineNum"> 3507 </span> : */ -<span class="lineNum"> 3508 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 3509 </span> : inline bool -<span class="lineNum"> 3510 </span> : is_sorted(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 3511 </span> : { return std::is_sorted_until(__first, __last) == __last; } -<span class="lineNum"> 3512 </span> : -<span class="lineNum"> 3513 </span> : /** -<span class="lineNum"> 3514 </span> : * @brief Determines whether the elements of a sequence are sorted -<span class="lineNum"> 3515 </span> : * according to a comparison functor. -<span class="lineNum"> 3516 </span> : * @param first An iterator. -<span class="lineNum"> 3517 </span> : * @param last Another iterator. -<span class="lineNum"> 3518 </span> : * @param comp A comparison functor. -<span class="lineNum"> 3519 </span> : * @return True if the elements are sorted, false otherwise. -<span class="lineNum"> 3520 </span> : */ -<span class="lineNum"> 3521 </span> : template<typename _ForwardIterator, typename _Compare> -<span class="lineNum"> 3522 </span> : inline bool -<span class="lineNum"> 3523 </span> : is_sorted(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 3524 </span> : _Compare __comp) -<span class="lineNum"> 3525 </span> : { return std::is_sorted_until(__first, __last, __comp) == __last; } -<span class="lineNum"> 3526 </span> : -<span class="lineNum"> 3527 </span> : /** -<span class="lineNum"> 3528 </span> : * @brief Determines the end of a sorted sequence. -<span class="lineNum"> 3529 </span> : * @param first An iterator. -<span class="lineNum"> 3530 </span> : * @param last Another iterator. -<span class="lineNum"> 3531 </span> : * @return An iterator pointing to the last iterator i in [first, last) -<span class="lineNum"> 3532 </span> : * for which the range [first, i) is sorted. -<span class="lineNum"> 3533 </span> : */ -<span class="lineNum"> 3534 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 3535 </span> : _ForwardIterator -<span class="lineNum"> 3536 </span> : is_sorted_until(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 3537 </span> : { -<span class="lineNum"> 3538 </span> : // concept requirements -<span class="lineNum"> 3539 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3540 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 3541 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3542 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3543 </span> : -<span class="lineNum"> 3544 </span> : if (__first == __last) -<span class="lineNum"> 3545 </span> : return __last; -<span class="lineNum"> 3546 </span> : -<span class="lineNum"> 3547 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 3548 </span> : for (++__next; __next != __last; __first = __next, ++__next) -<span class="lineNum"> 3549 </span> : if (*__next < *__first) -<span class="lineNum"> 3550 </span> : return __next; -<span class="lineNum"> 3551 </span> : return __next; -<span class="lineNum"> 3552 </span> : } -<span class="lineNum"> 3553 </span> : -<span class="lineNum"> 3554 </span> : /** -<span class="lineNum"> 3555 </span> : * @brief Determines the end of a sorted sequence using comparison functor. -<span class="lineNum"> 3556 </span> : * @param first An iterator. -<span class="lineNum"> 3557 </span> : * @param last Another iterator. -<span class="lineNum"> 3558 </span> : * @param comp A comparison functor. -<span class="lineNum"> 3559 </span> : * @return An iterator pointing to the last iterator i in [first, last) -<span class="lineNum"> 3560 </span> : * for which the range [first, i) is sorted. -<span class="lineNum"> 3561 </span> : */ -<span class="lineNum"> 3562 </span> : template<typename _ForwardIterator, typename _Compare> -<span class="lineNum"> 3563 </span> : _ForwardIterator -<span class="lineNum"> 3564 </span> : is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 3565 </span> : _Compare __comp) -<span class="lineNum"> 3566 </span> : { -<span class="lineNum"> 3567 </span> : // concept requirements -<span class="lineNum"> 3568 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3569 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 3570 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 3571 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3572 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3573 </span> : -<span class="lineNum"> 3574 </span> : if (__first == __last) -<span class="lineNum"> 3575 </span> : return __last; -<span class="lineNum"> 3576 </span> : -<span class="lineNum"> 3577 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 3578 </span> : for (++__next; __next != __last; __first = __next, ++__next) -<span class="lineNum"> 3579 </span> : if (__comp(*__next, *__first)) -<span class="lineNum"> 3580 </span> : return __next; -<span class="lineNum"> 3581 </span> : return __next; -<span class="lineNum"> 3582 </span> : } -<span class="lineNum"> 3583 </span> : -<span class="lineNum"> 3584 </span> : /** -<span class="lineNum"> 3585 </span> : * @brief Determines min and max at once as an ordered pair. -<span class="lineNum"> 3586 </span> : * @param a A thing of arbitrary type. -<span class="lineNum"> 3587 </span> : * @param b Another thing of arbitrary type. -<span class="lineNum"> 3588 </span> : * @return A pair(b, a) if b is smaller than a, pair(a, b) otherwise. -<span class="lineNum"> 3589 </span> : */ -<span class="lineNum"> 3590 </span> : template<typename _Tp> -<span class="lineNum"> 3591 </span> : inline pair<const _Tp&, const _Tp&> -<span class="lineNum"> 3592 </span> : minmax(const _Tp& __a, const _Tp& __b) -<span class="lineNum"> 3593 </span> : { -<span class="lineNum"> 3594 </span> : // concept requirements -<span class="lineNum"> 3595 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_Tp>) -<span class="lineNum"> 3596 </span> : -<span class="lineNum"> 3597 </span> : return __b < __a ? pair<const _Tp&, const _Tp&>(__b, __a) -<span class="lineNum"> 3598 </span> : : pair<const _Tp&, const _Tp&>(__a, __b); -<span class="lineNum"> 3599 </span> : } -<span class="lineNum"> 3600 </span> : -<span class="lineNum"> 3601 </span> : /** -<span class="lineNum"> 3602 </span> : * @brief Determines min and max at once as an ordered pair. -<span class="lineNum"> 3603 </span> : * @param a A thing of arbitrary type. -<span class="lineNum"> 3604 </span> : * @param b Another thing of arbitrary type. -<span class="lineNum"> 3605 </span> : * @param comp A @link s20_3_3_comparisons comparison functor@endlink. -<span class="lineNum"> 3606 </span> : * @return A pair(b, a) if b is smaller than a, pair(a, b) otherwise. -<span class="lineNum"> 3607 </span> : */ -<span class="lineNum"> 3608 </span> : template<typename _Tp, typename _Compare> -<span class="lineNum"> 3609 </span> : inline pair<const _Tp&, const _Tp&> -<span class="lineNum"> 3610 </span> : minmax(const _Tp& __a, const _Tp& __b, _Compare __comp) -<span class="lineNum"> 3611 </span> : { -<span class="lineNum"> 3612 </span> : return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) -<span class="lineNum"> 3613 </span> : : pair<const _Tp&, const _Tp&>(__a, __b); -<span class="lineNum"> 3614 </span> : } -<span class="lineNum"> 3615 </span> : -<span class="lineNum"> 3616 </span> : /** -<span class="lineNum"> 3617 </span> : * @brief Return a pair of iterators pointing to the minimum and maximum -<span class="lineNum"> 3618 </span> : * elements in a range. -<span class="lineNum"> 3619 </span> : * @param first Start of range. -<span class="lineNum"> 3620 </span> : * @param last End of range. -<span class="lineNum"> 3621 </span> : * @return make_pair(m, M), where m is the first iterator i in -<span class="lineNum"> 3622 </span> : * [first, last) such that no other element in the range is -<span class="lineNum"> 3623 </span> : * smaller, and where M is the last iterator i in [first, last) -<span class="lineNum"> 3624 </span> : * such that no other element in the range is larger. -<span class="lineNum"> 3625 </span> : */ -<span class="lineNum"> 3626 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 3627 </span> : pair<_ForwardIterator, _ForwardIterator> -<span class="lineNum"> 3628 </span> : minmax_element(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 3629 </span> : { -<span class="lineNum"> 3630 </span> : // concept requirements -<span class="lineNum"> 3631 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3632 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 3633 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3634 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3635 </span> : -<span class="lineNum"> 3636 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 3637 </span> : if (__first == __last -<span class="lineNum"> 3638 </span> : || ++__next == __last) -<span class="lineNum"> 3639 </span> : return std::make_pair(__first, __first); -<span class="lineNum"> 3640 </span> : -<span class="lineNum"> 3641 </span> : _ForwardIterator __min, __max; -<span class="lineNum"> 3642 </span> : if (*__next < *__first) -<span class="lineNum"> 3643 </span> : { -<span class="lineNum"> 3644 </span> : __min = __next; -<span class="lineNum"> 3645 </span> : __max = __first; -<span class="lineNum"> 3646 </span> : } -<span class="lineNum"> 3647 </span> : else -<span class="lineNum"> 3648 </span> : { -<span class="lineNum"> 3649 </span> : __min = __first; -<span class="lineNum"> 3650 </span> : __max = __next; -<span class="lineNum"> 3651 </span> : } -<span class="lineNum"> 3652 </span> : -<span class="lineNum"> 3653 </span> : __first = __next; -<span class="lineNum"> 3654 </span> : ++__first; -<span class="lineNum"> 3655 </span> : -<span class="lineNum"> 3656 </span> : while (__first != __last) -<span class="lineNum"> 3657 </span> : { -<span class="lineNum"> 3658 </span> : __next = __first; -<span class="lineNum"> 3659 </span> : if (++__next == __last) -<span class="lineNum"> 3660 </span> : { -<span class="lineNum"> 3661 </span> : if (*__first < *__min) -<span class="lineNum"> 3662 </span> : __min = __first; -<span class="lineNum"> 3663 </span> : else if (!(*__first < *__max)) -<span class="lineNum"> 3664 </span> : __max = __first; -<span class="lineNum"> 3665 </span> : break; -<span class="lineNum"> 3666 </span> : } -<span class="lineNum"> 3667 </span> : -<span class="lineNum"> 3668 </span> : if (*__next < *__first) -<span class="lineNum"> 3669 </span> : { -<span class="lineNum"> 3670 </span> : if (*__next < *__min) -<span class="lineNum"> 3671 </span> : __min = __next; -<span class="lineNum"> 3672 </span> : if (!(*__first < *__max)) -<span class="lineNum"> 3673 </span> : __max = __first; -<span class="lineNum"> 3674 </span> : } -<span class="lineNum"> 3675 </span> : else -<span class="lineNum"> 3676 </span> : { -<span class="lineNum"> 3677 </span> : if (*__first < *__min) -<span class="lineNum"> 3678 </span> : __min = __first; -<span class="lineNum"> 3679 </span> : if (!(*__next < *__max)) -<span class="lineNum"> 3680 </span> : __max = __next; -<span class="lineNum"> 3681 </span> : } -<span class="lineNum"> 3682 </span> : -<span class="lineNum"> 3683 </span> : __first = __next; -<span class="lineNum"> 3684 </span> : ++__first; -<span class="lineNum"> 3685 </span> : } -<span class="lineNum"> 3686 </span> : -<span class="lineNum"> 3687 </span> : return std::make_pair(__min, __max); -<span class="lineNum"> 3688 </span> : } -<span class="lineNum"> 3689 </span> : -<span class="lineNum"> 3690 </span> : /** -<span class="lineNum"> 3691 </span> : * @brief Return a pair of iterators pointing to the minimum and maximum -<span class="lineNum"> 3692 </span> : * elements in a range. -<span class="lineNum"> 3693 </span> : * @param first Start of range. -<span class="lineNum"> 3694 </span> : * @param last End of range. -<span class="lineNum"> 3695 </span> : * @param comp Comparison functor. -<span class="lineNum"> 3696 </span> : * @return make_pair(m, M), where m is the first iterator i in -<span class="lineNum"> 3697 </span> : * [first, last) such that no other element in the range is -<span class="lineNum"> 3698 </span> : * smaller, and where M is the last iterator i in [first, last) -<span class="lineNum"> 3699 </span> : * such that no other element in the range is larger. -<span class="lineNum"> 3700 </span> : */ -<span class="lineNum"> 3701 </span> : template<typename _ForwardIterator, typename _Compare> -<span class="lineNum"> 3702 </span> : pair<_ForwardIterator, _ForwardIterator> -<span class="lineNum"> 3703 </span> : minmax_element(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 3704 </span> : _Compare __comp) -<span class="lineNum"> 3705 </span> : { -<span class="lineNum"> 3706 </span> : // concept requirements -<span class="lineNum"> 3707 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3708 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 3709 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 3710 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3711 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3712 </span> : -<span class="lineNum"> 3713 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 3714 </span> : if (__first == __last -<span class="lineNum"> 3715 </span> : || ++__next == __last) -<span class="lineNum"> 3716 </span> : return std::make_pair(__first, __first); -<span class="lineNum"> 3717 </span> : -<span class="lineNum"> 3718 </span> : _ForwardIterator __min, __max; -<span class="lineNum"> 3719 </span> : if (__comp(*__next, *__first)) -<span class="lineNum"> 3720 </span> : { -<span class="lineNum"> 3721 </span> : __min = __next; -<span class="lineNum"> 3722 </span> : __max = __first; -<span class="lineNum"> 3723 </span> : } -<span class="lineNum"> 3724 </span> : else -<span class="lineNum"> 3725 </span> : { -<span class="lineNum"> 3726 </span> : __min = __first; -<span class="lineNum"> 3727 </span> : __max = __next; -<span class="lineNum"> 3728 </span> : } -<span class="lineNum"> 3729 </span> : -<span class="lineNum"> 3730 </span> : __first = __next; -<span class="lineNum"> 3731 </span> : ++__first; -<span class="lineNum"> 3732 </span> : -<span class="lineNum"> 3733 </span> : while (__first != __last) -<span class="lineNum"> 3734 </span> : { -<span class="lineNum"> 3735 </span> : __next = __first; -<span class="lineNum"> 3736 </span> : if (++__next == __last) -<span class="lineNum"> 3737 </span> : { -<span class="lineNum"> 3738 </span> : if (__comp(*__first, *__min)) -<span class="lineNum"> 3739 </span> : __min = __first; -<span class="lineNum"> 3740 </span> : else if (!__comp(*__first, *__max)) -<span class="lineNum"> 3741 </span> : __max = __first; -<span class="lineNum"> 3742 </span> : break; -<span class="lineNum"> 3743 </span> : } -<span class="lineNum"> 3744 </span> : -<span class="lineNum"> 3745 </span> : if (__comp(*__next, *__first)) -<span class="lineNum"> 3746 </span> : { -<span class="lineNum"> 3747 </span> : if (__comp(*__next, *__min)) -<span class="lineNum"> 3748 </span> : __min = __next; -<span class="lineNum"> 3749 </span> : if (!__comp(*__first, *__max)) -<span class="lineNum"> 3750 </span> : __max = __first; -<span class="lineNum"> 3751 </span> : } -<span class="lineNum"> 3752 </span> : else -<span class="lineNum"> 3753 </span> : { -<span class="lineNum"> 3754 </span> : if (__comp(*__first, *__min)) -<span class="lineNum"> 3755 </span> : __min = __first; -<span class="lineNum"> 3756 </span> : if (!__comp(*__next, *__max)) -<span class="lineNum"> 3757 </span> : __max = __next; -<span class="lineNum"> 3758 </span> : } -<span class="lineNum"> 3759 </span> : -<span class="lineNum"> 3760 </span> : __first = __next; -<span class="lineNum"> 3761 </span> : ++__first; -<span class="lineNum"> 3762 </span> : } -<span class="lineNum"> 3763 </span> : -<span class="lineNum"> 3764 </span> : return std::make_pair(__min, __max); -<span class="lineNum"> 3765 </span> : } -<span class="lineNum"> 3766 </span> : #endif // __GXX_EXPERIMENTAL_CXX0X__ -<span class="lineNum"> 3767 </span> : -<span class="lineNum"> 3768 </span> : _GLIBCXX_END_NAMESPACE -<span class="lineNum"> 3769 </span> : -<span class="lineNum"> 3770 </span> : _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_P) -<span class="lineNum"> 3771 </span> : -<span class="lineNum"> 3772 </span> : /** -<span class="lineNum"> 3773 </span> : * @brief Apply a function to every element of a sequence. -<span class="lineNum"> 3774 </span> : * @param first An input iterator. -<span class="lineNum"> 3775 </span> : * @param last An input iterator. -<span class="lineNum"> 3776 </span> : * @param f A unary function object. -<span class="lineNum"> 3777 </span> : * @return @p f. -<span class="lineNum"> 3778 </span> : * -<span class="lineNum"> 3779 </span> : * Applies the function object @p f to each element in the range -<span class="lineNum"> 3780 </span> : * @p [first,last). @p f must not modify the order of the sequence. -<span class="lineNum"> 3781 </span> : * If @p f has a return value it is ignored. -<span class="lineNum"> 3782 </span> : */ -<span class="lineNum"> 3783 </span> : template<typename _InputIterator, typename _Function> -<span class="lineNum"> 3784 </span> : _Function -<span class="lineNum"> 3785 </span> : for_each(_InputIterator __first, _InputIterator __last, _Function __f) -<span class="lineNum"> 3786 </span> : { -<span class="lineNum"> 3787 </span> : // concept requirements -<span class="lineNum"> 3788 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3789 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3790 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 3791 </span> : __f(*__first); -<span class="lineNum"> 3792 </span> : return __f; -<span class="lineNum"> 3793 </span> : } -<span class="lineNum"> 3794 </span> : -<span class="lineNum"> 3795 </span> : /** -<span class="lineNum"> 3796 </span> : * @brief Find the first occurrence of a value in a sequence. -<span class="lineNum"> 3797 </span> : * @param first An input iterator. -<span class="lineNum"> 3798 </span> : * @param last An input iterator. -<span class="lineNum"> 3799 </span> : * @param val The value to find. -<span class="lineNum"> 3800 </span> : * @return The first iterator @c i in the range @p [first,last) -<span class="lineNum"> 3801 </span> : * such that @c *i == @p val, or @p last if no such iterator exists. -<span class="lineNum"> 3802 </span> : */ -<span class="lineNum"> 3803 </span> : template<typename _InputIterator, typename _Tp> -<span class="lineNum"> 3804 </span> : inline _InputIterator -<span class="lineNum"> 3805 </span> : find(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 3806 </span><span class="lineCov"> 3362 : const _Tp& __val)</span> -<span class="lineNum"> 3807 </span> : { -<span class="lineNum"> 3808 </span> : // concept requirements -<span class="lineNum"> 3809 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3810 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 3811 </span> : typename iterator_traits<_InputIterator>::value_type, _Tp>) -<span class="lineNum"> 3812 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3813 </span> : return std::__find(__first, __last, __val, -<span class="lineNum"> 3814 </span><span class="lineCov"> 3362 : std::__iterator_category(__first));</span> -<span class="lineNum"> 3815 </span> : } -<span class="lineNum"> 3816 </span> : -<span class="lineNum"> 3817 </span> : /** -<span class="lineNum"> 3818 </span> : * @brief Find the first element in a sequence for which a -<span class="lineNum"> 3819 </span> : * predicate is true. -<span class="lineNum"> 3820 </span> : * @param first An input iterator. -<span class="lineNum"> 3821 </span> : * @param last An input iterator. -<span class="lineNum"> 3822 </span> : * @param pred A predicate. -<span class="lineNum"> 3823 </span> : * @return The first iterator @c i in the range @p [first,last) -<span class="lineNum"> 3824 </span> : * such that @p pred(*i) is true, or @p last if no such iterator exists. -<span class="lineNum"> 3825 </span> : */ -<span class="lineNum"> 3826 </span> : template<typename _InputIterator, typename _Predicate> -<span class="lineNum"> 3827 </span> : inline _InputIterator -<span class="lineNum"> 3828 </span> : find_if(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 3829 </span><span class="lineCov"> 3 : _Predicate __pred)</span> -<span class="lineNum"> 3830 </span> : { -<span class="lineNum"> 3831 </span> : // concept requirements -<span class="lineNum"> 3832 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3833 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 3834 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 3835 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3836 </span> : return std::__find_if(__first, __last, __pred, -<span class="lineNum"> 3837 </span><span class="lineCov"> 3 : std::__iterator_category(__first));</span> -<span class="lineNum"> 3838 </span> : } -<span class="lineNum"> 3839 </span> : -<span class="lineNum"> 3840 </span> : /** -<span class="lineNum"> 3841 </span> : * @brief Find element from a set in a sequence. -<span class="lineNum"> 3842 </span> : * @param first1 Start of range to search. -<span class="lineNum"> 3843 </span> : * @param last1 End of range to search. -<span class="lineNum"> 3844 </span> : * @param first2 Start of match candidates. -<span class="lineNum"> 3845 </span> : * @param last2 End of match candidates. -<span class="lineNum"> 3846 </span> : * @return The first iterator @c i in the range -<span class="lineNum"> 3847 </span> : * @p [first1,last1) such that @c *i == @p *(i2) such that i2 is an -<span class="lineNum"> 3848 </span> : * iterator in [first2,last2), or @p last1 if no such iterator exists. -<span class="lineNum"> 3849 </span> : * -<span class="lineNum"> 3850 </span> : * Searches the range @p [first1,last1) for an element that is equal to -<span class="lineNum"> 3851 </span> : * some element in the range [first2,last2). If found, returns an iterator -<span class="lineNum"> 3852 </span> : * in the range [first1,last1), otherwise returns @p last1. -<span class="lineNum"> 3853 </span> : */ -<span class="lineNum"> 3854 </span> : template<typename _InputIterator, typename _ForwardIterator> -<span class="lineNum"> 3855 </span> : _InputIterator -<span class="lineNum"> 3856 </span> : find_first_of(_InputIterator __first1, _InputIterator __last1, -<span class="lineNum"> 3857 </span> : _ForwardIterator __first2, _ForwardIterator __last2) -<span class="lineNum"> 3858 </span> : { -<span class="lineNum"> 3859 </span> : // concept requirements -<span class="lineNum"> 3860 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3861 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3862 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 3863 </span> : typename iterator_traits<_InputIterator>::value_type, -<span class="lineNum"> 3864 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3865 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 3866 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 3867 </span> : -<span class="lineNum"> 3868 </span> : for (; __first1 != __last1; ++__first1) -<span class="lineNum"> 3869 </span> : for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) -<span class="lineNum"> 3870 </span> : if (*__first1 == *__iter) -<span class="lineNum"> 3871 </span> : return __first1; -<span class="lineNum"> 3872 </span> : return __last1; -<span class="lineNum"> 3873 </span> : } -<span class="lineNum"> 3874 </span> : -<span class="lineNum"> 3875 </span> : /** -<span class="lineNum"> 3876 </span> : * @brief Find element from a set in a sequence using a predicate. -<span class="lineNum"> 3877 </span> : * @param first1 Start of range to search. -<span class="lineNum"> 3878 </span> : * @param last1 End of range to search. -<span class="lineNum"> 3879 </span> : * @param first2 Start of match candidates. -<span class="lineNum"> 3880 </span> : * @param last2 End of match candidates. -<span class="lineNum"> 3881 </span> : * @param comp Predicate to use. -<span class="lineNum"> 3882 </span> : * @return The first iterator @c i in the range -<span class="lineNum"> 3883 </span> : * @p [first1,last1) such that @c comp(*i, @p *(i2)) is true and i2 is an -<span class="lineNum"> 3884 </span> : * iterator in [first2,last2), or @p last1 if no such iterator exists. -<span class="lineNum"> 3885 </span> : * -<span class="lineNum"> 3886 </span> : -<span class="lineNum"> 3887 </span> : * Searches the range @p [first1,last1) for an element that is -<span class="lineNum"> 3888 </span> : * equal to some element in the range [first2,last2). If found, -<span class="lineNum"> 3889 </span> : * returns an iterator in the range [first1,last1), otherwise -<span class="lineNum"> 3890 </span> : * returns @p last1. -<span class="lineNum"> 3891 </span> : */ -<span class="lineNum"> 3892 </span> : template<typename _InputIterator, typename _ForwardIterator, -<span class="lineNum"> 3893 </span> : typename _BinaryPredicate> -<span class="lineNum"> 3894 </span> : _InputIterator -<span class="lineNum"> 3895 </span> : find_first_of(_InputIterator __first1, _InputIterator __last1, -<span class="lineNum"> 3896 </span> : _ForwardIterator __first2, _ForwardIterator __last2, -<span class="lineNum"> 3897 </span> : _BinaryPredicate __comp) -<span class="lineNum"> 3898 </span> : { -<span class="lineNum"> 3899 </span> : // concept requirements -<span class="lineNum"> 3900 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3901 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3902 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 3903 </span> : typename iterator_traits<_InputIterator>::value_type, -<span class="lineNum"> 3904 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3905 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 3906 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 3907 </span> : -<span class="lineNum"> 3908 </span> : for (; __first1 != __last1; ++__first1) -<span class="lineNum"> 3909 </span> : for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) -<span class="lineNum"> 3910 </span> : if (__comp(*__first1, *__iter)) -<span class="lineNum"> 3911 </span> : return __first1; -<span class="lineNum"> 3912 </span> : return __last1; -<span class="lineNum"> 3913 </span> : } -<span class="lineNum"> 3914 </span> : -<span class="lineNum"> 3915 </span> : /** -<span class="lineNum"> 3916 </span> : * @brief Find two adjacent values in a sequence that are equal. -<span class="lineNum"> 3917 </span> : * @param first A forward iterator. -<span class="lineNum"> 3918 </span> : * @param last A forward iterator. -<span class="lineNum"> 3919 </span> : * @return The first iterator @c i such that @c i and @c i+1 are both -<span class="lineNum"> 3920 </span> : * valid iterators in @p [first,last) and such that @c *i == @c *(i+1), -<span class="lineNum"> 3921 </span> : * or @p last if no such iterator exists. -<span class="lineNum"> 3922 </span> : */ -<span class="lineNum"> 3923 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 3924 </span> : _ForwardIterator -<span class="lineNum"> 3925 </span> : adjacent_find(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 3926 </span> : { -<span class="lineNum"> 3927 </span> : // concept requirements -<span class="lineNum"> 3928 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3929 </span> : __glibcxx_function_requires(_EqualityComparableConcept< -<span class="lineNum"> 3930 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3931 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3932 </span> : if (__first == __last) -<span class="lineNum"> 3933 </span> : return __last; -<span class="lineNum"> 3934 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 3935 </span> : while(++__next != __last) -<span class="lineNum"> 3936 </span> : { -<span class="lineNum"> 3937 </span> : if (*__first == *__next) -<span class="lineNum"> 3938 </span> : return __first; -<span class="lineNum"> 3939 </span> : __first = __next; -<span class="lineNum"> 3940 </span> : } -<span class="lineNum"> 3941 </span> : return __last; -<span class="lineNum"> 3942 </span> : } -<span class="lineNum"> 3943 </span> : -<span class="lineNum"> 3944 </span> : /** -<span class="lineNum"> 3945 </span> : * @brief Find two adjacent values in a sequence using a predicate. -<span class="lineNum"> 3946 </span> : * @param first A forward iterator. -<span class="lineNum"> 3947 </span> : * @param last A forward iterator. -<span class="lineNum"> 3948 </span> : * @param binary_pred A binary predicate. -<span class="lineNum"> 3949 </span> : * @return The first iterator @c i such that @c i and @c i+1 are both -<span class="lineNum"> 3950 </span> : * valid iterators in @p [first,last) and such that -<span class="lineNum"> 3951 </span> : * @p binary_pred(*i,*(i+1)) is true, or @p last if no such iterator -<span class="lineNum"> 3952 </span> : * exists. -<span class="lineNum"> 3953 </span> : */ -<span class="lineNum"> 3954 </span> : template<typename _ForwardIterator, typename _BinaryPredicate> -<span class="lineNum"> 3955 </span> : _ForwardIterator -<span class="lineNum"> 3956 </span> : adjacent_find(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 3957 </span> : _BinaryPredicate __binary_pred) -<span class="lineNum"> 3958 </span> : { -<span class="lineNum"> 3959 </span> : // concept requirements -<span class="lineNum"> 3960 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 3961 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 3962 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 3963 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 3964 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3965 </span> : if (__first == __last) -<span class="lineNum"> 3966 </span> : return __last; -<span class="lineNum"> 3967 </span> : _ForwardIterator __next = __first; -<span class="lineNum"> 3968 </span> : while(++__next != __last) -<span class="lineNum"> 3969 </span> : { -<span class="lineNum"> 3970 </span> : if (__binary_pred(*__first, *__next)) -<span class="lineNum"> 3971 </span> : return __first; -<span class="lineNum"> 3972 </span> : __first = __next; -<span class="lineNum"> 3973 </span> : } -<span class="lineNum"> 3974 </span> : return __last; -<span class="lineNum"> 3975 </span> : } -<span class="lineNum"> 3976 </span> : -<span class="lineNum"> 3977 </span> : /** -<span class="lineNum"> 3978 </span> : * @brief Count the number of copies of a value in a sequence. -<span class="lineNum"> 3979 </span> : * @param first An input iterator. -<span class="lineNum"> 3980 </span> : * @param last An input iterator. -<span class="lineNum"> 3981 </span> : * @param value The value to be counted. -<span class="lineNum"> 3982 </span> : * @return The number of iterators @c i in the range @p [first,last) -<span class="lineNum"> 3983 </span> : * for which @c *i == @p value -<span class="lineNum"> 3984 </span> : */ -<span class="lineNum"> 3985 </span> : template<typename _InputIterator, typename _Tp> -<span class="lineNum"> 3986 </span> : typename iterator_traits<_InputIterator>::difference_type -<span class="lineNum"> 3987 </span> : count(_InputIterator __first, _InputIterator __last, const _Tp& __value) -<span class="lineNum"> 3988 </span> : { -<span class="lineNum"> 3989 </span> : // concept requirements -<span class="lineNum"> 3990 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 3991 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 3992 </span> : typename iterator_traits<_InputIterator>::value_type, _Tp>) -<span class="lineNum"> 3993 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 3994 </span> : typename iterator_traits<_InputIterator>::difference_type __n = 0; -<span class="lineNum"> 3995 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 3996 </span> : if (*__first == __value) -<span class="lineNum"> 3997 </span> : ++__n; -<span class="lineNum"> 3998 </span> : return __n; -<span class="lineNum"> 3999 </span> : } -<span class="lineNum"> 4000 </span> : -<span class="lineNum"> 4001 </span> : /** -<span class="lineNum"> 4002 </span> : * @brief Count the elements of a sequence for which a predicate is true. -<span class="lineNum"> 4003 </span> : * @param first An input iterator. -<span class="lineNum"> 4004 </span> : * @param last An input iterator. -<span class="lineNum"> 4005 </span> : * @param pred A predicate. -<span class="lineNum"> 4006 </span> : * @return The number of iterators @c i in the range @p [first,last) -<span class="lineNum"> 4007 </span> : * for which @p pred(*i) is true. -<span class="lineNum"> 4008 </span> : */ -<span class="lineNum"> 4009 </span> : template<typename _InputIterator, typename _Predicate> -<span class="lineNum"> 4010 </span> : typename iterator_traits<_InputIterator>::difference_type -<span class="lineNum"> 4011 </span> : count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) -<span class="lineNum"> 4012 </span> : { -<span class="lineNum"> 4013 </span> : // concept requirements -<span class="lineNum"> 4014 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 4015 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 4016 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 4017 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4018 </span> : typename iterator_traits<_InputIterator>::difference_type __n = 0; -<span class="lineNum"> 4019 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 4020 </span> : if (__pred(*__first)) -<span class="lineNum"> 4021 </span> : ++__n; -<span class="lineNum"> 4022 </span> : return __n; -<span class="lineNum"> 4023 </span> : } -<span class="lineNum"> 4024 </span> : -<span class="lineNum"> 4025 </span> : /** -<span class="lineNum"> 4026 </span> : * @brief Search a sequence for a matching sub-sequence. -<span class="lineNum"> 4027 </span> : * @param first1 A forward iterator. -<span class="lineNum"> 4028 </span> : * @param last1 A forward iterator. -<span class="lineNum"> 4029 </span> : * @param first2 A forward iterator. -<span class="lineNum"> 4030 </span> : * @param last2 A forward iterator. -<span class="lineNum"> 4031 </span> : * @return The first iterator @c i in the range -<span class="lineNum"> 4032 </span> : * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N) -<span class="lineNum"> 4033 </span> : * for each @c N in the range @p [0,last2-first2), or @p last1 if no -<span class="lineNum"> 4034 </span> : * such iterator exists. -<span class="lineNum"> 4035 </span> : * -<span class="lineNum"> 4036 </span> : * Searches the range @p [first1,last1) for a sub-sequence that compares -<span class="lineNum"> 4037 </span> : * equal value-by-value with the sequence given by @p [first2,last2) and -<span class="lineNum"> 4038 </span> : * returns an iterator to the first element of the sub-sequence, or -<span class="lineNum"> 4039 </span> : * @p last1 if the sub-sequence is not found. -<span class="lineNum"> 4040 </span> : * -<span class="lineNum"> 4041 </span> : * Because the sub-sequence must lie completely within the range -<span class="lineNum"> 4042 </span> : * @p [first1,last1) it must start at a position less than -<span class="lineNum"> 4043 </span> : * @p last1-(last2-first2) where @p last2-first2 is the length of the -<span class="lineNum"> 4044 </span> : * sub-sequence. -<span class="lineNum"> 4045 </span> : * This means that the returned iterator @c i will be in the range -<span class="lineNum"> 4046 </span> : * @p [first1,last1-(last2-first2)) -<span class="lineNum"> 4047 </span> : */ -<span class="lineNum"> 4048 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2> -<span class="lineNum"> 4049 </span> : _ForwardIterator1 -<span class="lineNum"> 4050 </span> : search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 4051 </span> : _ForwardIterator2 __first2, _ForwardIterator2 __last2) -<span class="lineNum"> 4052 </span> : { -<span class="lineNum"> 4053 </span> : // concept requirements -<span class="lineNum"> 4054 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) -<span class="lineNum"> 4055 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) -<span class="lineNum"> 4056 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 4057 </span> : typename iterator_traits<_ForwardIterator1>::value_type, -<span class="lineNum"> 4058 </span> : typename iterator_traits<_ForwardIterator2>::value_type>) -<span class="lineNum"> 4059 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 4060 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 4061 </span> : -<span class="lineNum"> 4062 </span> : // Test for empty ranges -<span class="lineNum"> 4063 </span> : if (__first1 == __last1 || __first2 == __last2) -<span class="lineNum"> 4064 </span> : return __first1; -<span class="lineNum"> 4065 </span> : -<span class="lineNum"> 4066 </span> : // Test for a pattern of length 1. -<span class="lineNum"> 4067 </span> : _ForwardIterator2 __p1(__first2); -<span class="lineNum"> 4068 </span> : if (++__p1 == __last2) -<span class="lineNum"> 4069 </span> : return _GLIBCXX_STD_P::find(__first1, __last1, *__first2); -<span class="lineNum"> 4070 </span> : -<span class="lineNum"> 4071 </span> : // General case. -<span class="lineNum"> 4072 </span> : _ForwardIterator2 __p; -<span class="lineNum"> 4073 </span> : _ForwardIterator1 __current = __first1; -<span class="lineNum"> 4074 </span> : -<span class="lineNum"> 4075 </span> : for (;;) -<span class="lineNum"> 4076 </span> : { -<span class="lineNum"> 4077 </span> : __first1 = _GLIBCXX_STD_P::find(__first1, __last1, *__first2); -<span class="lineNum"> 4078 </span> : if (__first1 == __last1) -<span class="lineNum"> 4079 </span> : return __last1; -<span class="lineNum"> 4080 </span> : -<span class="lineNum"> 4081 </span> : __p = __p1; -<span class="lineNum"> 4082 </span> : __current = __first1; -<span class="lineNum"> 4083 </span> : if (++__current == __last1) -<span class="lineNum"> 4084 </span> : return __last1; -<span class="lineNum"> 4085 </span> : -<span class="lineNum"> 4086 </span> : while (*__current == *__p) -<span class="lineNum"> 4087 </span> : { -<span class="lineNum"> 4088 </span> : if (++__p == __last2) -<span class="lineNum"> 4089 </span> : return __first1; -<span class="lineNum"> 4090 </span> : if (++__current == __last1) -<span class="lineNum"> 4091 </span> : return __last1; -<span class="lineNum"> 4092 </span> : } -<span class="lineNum"> 4093 </span> : ++__first1; -<span class="lineNum"> 4094 </span> : } -<span class="lineNum"> 4095 </span> : return __first1; -<span class="lineNum"> 4096 </span> : } -<span class="lineNum"> 4097 </span> : -<span class="lineNum"> 4098 </span> : /** -<span class="lineNum"> 4099 </span> : * @brief Search a sequence for a matching sub-sequence using a predicate. -<span class="lineNum"> 4100 </span> : * @param first1 A forward iterator. -<span class="lineNum"> 4101 </span> : * @param last1 A forward iterator. -<span class="lineNum"> 4102 </span> : * @param first2 A forward iterator. -<span class="lineNum"> 4103 </span> : * @param last2 A forward iterator. -<span class="lineNum"> 4104 </span> : * @param predicate A binary predicate. -<span class="lineNum"> 4105 </span> : * @return The first iterator @c i in the range -<span class="lineNum"> 4106 </span> : * @p [first1,last1-(last2-first2)) such that -<span class="lineNum"> 4107 </span> : * @p predicate(*(i+N),*(first2+N)) is true for each @c N in the range -<span class="lineNum"> 4108 </span> : * @p [0,last2-first2), or @p last1 if no such iterator exists. -<span class="lineNum"> 4109 </span> : * -<span class="lineNum"> 4110 </span> : * Searches the range @p [first1,last1) for a sub-sequence that compares -<span class="lineNum"> 4111 </span> : * equal value-by-value with the sequence given by @p [first2,last2), -<span class="lineNum"> 4112 </span> : * using @p predicate to determine equality, and returns an iterator -<span class="lineNum"> 4113 </span> : * to the first element of the sub-sequence, or @p last1 if no such -<span class="lineNum"> 4114 </span> : * iterator exists. -<span class="lineNum"> 4115 </span> : * -<span class="lineNum"> 4116 </span> : * @see search(_ForwardIter1, _ForwardIter1, _ForwardIter2, _ForwardIter2) -<span class="lineNum"> 4117 </span> : */ -<span class="lineNum"> 4118 </span> : template<typename _ForwardIterator1, typename _ForwardIterator2, -<span class="lineNum"> 4119 </span> : typename _BinaryPredicate> -<span class="lineNum"> 4120 </span> : _ForwardIterator1 -<span class="lineNum"> 4121 </span> : search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, -<span class="lineNum"> 4122 </span> : _ForwardIterator2 __first2, _ForwardIterator2 __last2, -<span class="lineNum"> 4123 </span> : _BinaryPredicate __predicate) -<span class="lineNum"> 4124 </span> : { -<span class="lineNum"> 4125 </span> : // concept requirements -<span class="lineNum"> 4126 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator1>) -<span class="lineNum"> 4127 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator2>) -<span class="lineNum"> 4128 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 4129 </span> : typename iterator_traits<_ForwardIterator1>::value_type, -<span class="lineNum"> 4130 </span> : typename iterator_traits<_ForwardIterator2>::value_type>) -<span class="lineNum"> 4131 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 4132 </span> : __glibcxx_requires_valid_range(__first2, __last2); -<span class="lineNum"> 4133 </span> : -<span class="lineNum"> 4134 </span> : // Test for empty ranges -<span class="lineNum"> 4135 </span> : if (__first1 == __last1 || __first2 == __last2) -<span class="lineNum"> 4136 </span> : return __first1; -<span class="lineNum"> 4137 </span> : -<span class="lineNum"> 4138 </span> : // Test for a pattern of length 1. -<span class="lineNum"> 4139 </span> : _ForwardIterator2 __p1(__first2); -<span class="lineNum"> 4140 </span> : if (++__p1 == __last2) -<span class="lineNum"> 4141 </span> : { -<span class="lineNum"> 4142 </span> : while (__first1 != __last1 -<span class="lineNum"> 4143 </span> : && !bool(__predicate(*__first1, *__first2))) -<span class="lineNum"> 4144 </span> : ++__first1; -<span class="lineNum"> 4145 </span> : return __first1; -<span class="lineNum"> 4146 </span> : } -<span class="lineNum"> 4147 </span> : -<span class="lineNum"> 4148 </span> : // General case. -<span class="lineNum"> 4149 </span> : _ForwardIterator2 __p; -<span class="lineNum"> 4150 </span> : _ForwardIterator1 __current = __first1; -<span class="lineNum"> 4151 </span> : -<span class="lineNum"> 4152 </span> : for (;;) -<span class="lineNum"> 4153 </span> : { -<span class="lineNum"> 4154 </span> : while (__first1 != __last1 -<span class="lineNum"> 4155 </span> : && !bool(__predicate(*__first1, *__first2))) -<span class="lineNum"> 4156 </span> : ++__first1; -<span class="lineNum"> 4157 </span> : if (__first1 == __last1) -<span class="lineNum"> 4158 </span> : return __last1; -<span class="lineNum"> 4159 </span> : -<span class="lineNum"> 4160 </span> : __p = __p1; -<span class="lineNum"> 4161 </span> : __current = __first1; -<span class="lineNum"> 4162 </span> : if (++__current == __last1) -<span class="lineNum"> 4163 </span> : return __last1; -<span class="lineNum"> 4164 </span> : -<span class="lineNum"> 4165 </span> : while (__predicate(*__current, *__p)) -<span class="lineNum"> 4166 </span> : { -<span class="lineNum"> 4167 </span> : if (++__p == __last2) -<span class="lineNum"> 4168 </span> : return __first1; -<span class="lineNum"> 4169 </span> : if (++__current == __last1) -<span class="lineNum"> 4170 </span> : return __last1; -<span class="lineNum"> 4171 </span> : } -<span class="lineNum"> 4172 </span> : ++__first1; -<span class="lineNum"> 4173 </span> : } -<span class="lineNum"> 4174 </span> : return __first1; -<span class="lineNum"> 4175 </span> : } -<span class="lineNum"> 4176 </span> : -<span class="lineNum"> 4177 </span> : -<span class="lineNum"> 4178 </span> : /** -<span class="lineNum"> 4179 </span> : * @brief Search a sequence for a number of consecutive values. -<span class="lineNum"> 4180 </span> : * @param first A forward iterator. -<span class="lineNum"> 4181 </span> : * @param last A forward iterator. -<span class="lineNum"> 4182 </span> : * @param count The number of consecutive values. -<span class="lineNum"> 4183 </span> : * @param val The value to find. -<span class="lineNum"> 4184 </span> : * @return The first iterator @c i in the range @p [first,last-count) -<span class="lineNum"> 4185 </span> : * such that @c *(i+N) == @p val for each @c N in the range @p [0,count), -<span class="lineNum"> 4186 </span> : * or @p last if no such iterator exists. -<span class="lineNum"> 4187 </span> : * -<span class="lineNum"> 4188 </span> : * Searches the range @p [first,last) for @p count consecutive elements -<span class="lineNum"> 4189 </span> : * equal to @p val. -<span class="lineNum"> 4190 </span> : */ -<span class="lineNum"> 4191 </span> : template<typename _ForwardIterator, typename _Integer, typename _Tp> -<span class="lineNum"> 4192 </span> : _ForwardIterator -<span class="lineNum"> 4193 </span> : search_n(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 4194 </span> : _Integer __count, const _Tp& __val) -<span class="lineNum"> 4195 </span> : { -<span class="lineNum"> 4196 </span> : // concept requirements -<span class="lineNum"> 4197 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 4198 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 4199 </span> : typename iterator_traits<_ForwardIterator>::value_type, _Tp>) -<span class="lineNum"> 4200 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4201 </span> : -<span class="lineNum"> 4202 </span> : if (__count <= 0) -<span class="lineNum"> 4203 </span> : return __first; -<span class="lineNum"> 4204 </span> : if (__count == 1) -<span class="lineNum"> 4205 </span> : return _GLIBCXX_STD_P::find(__first, __last, __val); -<span class="lineNum"> 4206 </span> : return std::__search_n(__first, __last, __count, __val, -<span class="lineNum"> 4207 </span> : std::__iterator_category(__first)); -<span class="lineNum"> 4208 </span> : } -<span class="lineNum"> 4209 </span> : -<span class="lineNum"> 4210 </span> : -<span class="lineNum"> 4211 </span> : /** -<span class="lineNum"> 4212 </span> : * @brief Search a sequence for a number of consecutive values using a -<span class="lineNum"> 4213 </span> : * predicate. -<span class="lineNum"> 4214 </span> : * @param first A forward iterator. -<span class="lineNum"> 4215 </span> : * @param last A forward iterator. -<span class="lineNum"> 4216 </span> : * @param count The number of consecutive values. -<span class="lineNum"> 4217 </span> : * @param val The value to find. -<span class="lineNum"> 4218 </span> : * @param binary_pred A binary predicate. -<span class="lineNum"> 4219 </span> : * @return The first iterator @c i in the range @p [first,last-count) -<span class="lineNum"> 4220 </span> : * such that @p binary_pred(*(i+N),val) is true for each @c N in the -<span class="lineNum"> 4221 </span> : * range @p [0,count), or @p last if no such iterator exists. -<span class="lineNum"> 4222 </span> : * -<span class="lineNum"> 4223 </span> : * Searches the range @p [first,last) for @p count consecutive elements -<span class="lineNum"> 4224 </span> : * for which the predicate returns true. -<span class="lineNum"> 4225 </span> : */ -<span class="lineNum"> 4226 </span> : template<typename _ForwardIterator, typename _Integer, typename _Tp, -<span class="lineNum"> 4227 </span> : typename _BinaryPredicate> -<span class="lineNum"> 4228 </span> : _ForwardIterator -<span class="lineNum"> 4229 </span> : search_n(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 4230 </span> : _Integer __count, const _Tp& __val, -<span class="lineNum"> 4231 </span> : _BinaryPredicate __binary_pred) -<span class="lineNum"> 4232 </span> : { -<span class="lineNum"> 4233 </span> : // concept requirements -<span class="lineNum"> 4234 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 4235 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_BinaryPredicate, -<span class="lineNum"> 4236 </span> : typename iterator_traits<_ForwardIterator>::value_type, _Tp>) -<span class="lineNum"> 4237 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4238 </span> : -<span class="lineNum"> 4239 </span> : if (__count <= 0) -<span class="lineNum"> 4240 </span> : return __first; -<span class="lineNum"> 4241 </span> : if (__count == 1) -<span class="lineNum"> 4242 </span> : { -<span class="lineNum"> 4243 </span> : while (__first != __last && !bool(__binary_pred(*__first, __val))) -<span class="lineNum"> 4244 </span> : ++__first; -<span class="lineNum"> 4245 </span> : return __first; -<span class="lineNum"> 4246 </span> : } -<span class="lineNum"> 4247 </span> : return std::__search_n(__first, __last, __count, __val, __binary_pred, -<span class="lineNum"> 4248 </span> : std::__iterator_category(__first)); -<span class="lineNum"> 4249 </span> : } -<span class="lineNum"> 4250 </span> : -<span class="lineNum"> 4251 </span> : -<span class="lineNum"> 4252 </span> : /** -<span class="lineNum"> 4253 </span> : * @brief Perform an operation on a sequence. -<span class="lineNum"> 4254 </span> : * @param first An input iterator. -<span class="lineNum"> 4255 </span> : * @param last An input iterator. -<span class="lineNum"> 4256 </span> : * @param result An output iterator. -<span class="lineNum"> 4257 </span> : * @param unary_op A unary operator. -<span class="lineNum"> 4258 </span> : * @return An output iterator equal to @p result+(last-first). -<span class="lineNum"> 4259 </span> : * -<span class="lineNum"> 4260 </span> : * Applies the operator to each element in the input range and assigns -<span class="lineNum"> 4261 </span> : * the results to successive elements of the output sequence. -<span class="lineNum"> 4262 </span> : * Evaluates @p *(result+N)=unary_op(*(first+N)) for each @c N in the -<span class="lineNum"> 4263 </span> : * range @p [0,last-first). -<span class="lineNum"> 4264 </span> : * -<span class="lineNum"> 4265 </span> : * @p unary_op must not alter its argument. -<span class="lineNum"> 4266 </span> : */ -<span class="lineNum"> 4267 </span> : template<typename _InputIterator, typename _OutputIterator, -<span class="lineNum"> 4268 </span> : typename _UnaryOperation> -<span class="lineNum"> 4269 </span> : _OutputIterator -<span class="lineNum"> 4270 </span> : transform(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 4271 </span> : _OutputIterator __result, _UnaryOperation __unary_op) -<span class="lineNum"> 4272 </span> : { -<span class="lineNum"> 4273 </span> : // concept requirements -<span class="lineNum"> 4274 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 4275 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4276 </span> : // "the type returned by a _UnaryOperation" -<span class="lineNum"> 4277 </span> : __typeof__(__unary_op(*__first))>) -<span class="lineNum"> 4278 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4279 </span> : -<span class="lineNum"> 4280 </span> : for (; __first != __last; ++__first, ++__result) -<span class="lineNum"> 4281 </span> : *__result = __unary_op(*__first); -<span class="lineNum"> 4282 </span> : return __result; -<span class="lineNum"> 4283 </span> : } -<span class="lineNum"> 4284 </span> : -<span class="lineNum"> 4285 </span> : /** -<span class="lineNum"> 4286 </span> : * @brief Perform an operation on corresponding elements of two sequences. -<span class="lineNum"> 4287 </span> : * @param first1 An input iterator. -<span class="lineNum"> 4288 </span> : * @param last1 An input iterator. -<span class="lineNum"> 4289 </span> : * @param first2 An input iterator. -<span class="lineNum"> 4290 </span> : * @param result An output iterator. -<span class="lineNum"> 4291 </span> : * @param binary_op A binary operator. -<span class="lineNum"> 4292 </span> : * @return An output iterator equal to @p result+(last-first). -<span class="lineNum"> 4293 </span> : * -<span class="lineNum"> 4294 </span> : * Applies the operator to the corresponding elements in the two -<span class="lineNum"> 4295 </span> : * input ranges and assigns the results to successive elements of the -<span class="lineNum"> 4296 </span> : * output sequence. -<span class="lineNum"> 4297 </span> : * Evaluates @p *(result+N)=binary_op(*(first1+N),*(first2+N)) for each -<span class="lineNum"> 4298 </span> : * @c N in the range @p [0,last1-first1). -<span class="lineNum"> 4299 </span> : * -<span class="lineNum"> 4300 </span> : * @p binary_op must not alter either of its arguments. -<span class="lineNum"> 4301 </span> : */ -<span class="lineNum"> 4302 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 4303 </span> : typename _OutputIterator, typename _BinaryOperation> -<span class="lineNum"> 4304 </span> : _OutputIterator -<span class="lineNum"> 4305 </span> : transform(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 4306 </span> : _InputIterator2 __first2, _OutputIterator __result, -<span class="lineNum"> 4307 </span> : _BinaryOperation __binary_op) -<span class="lineNum"> 4308 </span> : { -<span class="lineNum"> 4309 </span> : // concept requirements -<span class="lineNum"> 4310 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 4311 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 4312 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4313 </span> : // "the type returned by a _BinaryOperation" -<span class="lineNum"> 4314 </span> : __typeof__(__binary_op(*__first1,*__first2))>) -<span class="lineNum"> 4315 </span> : __glibcxx_requires_valid_range(__first1, __last1); -<span class="lineNum"> 4316 </span> : -<span class="lineNum"> 4317 </span> : for (; __first1 != __last1; ++__first1, ++__first2, ++__result) -<span class="lineNum"> 4318 </span> : *__result = __binary_op(*__first1, *__first2); -<span class="lineNum"> 4319 </span> : return __result; -<span class="lineNum"> 4320 </span> : } -<span class="lineNum"> 4321 </span> : -<span class="lineNum"> 4322 </span> : /** -<span class="lineNum"> 4323 </span> : * @brief Replace each occurrence of one value in a sequence with another -<span class="lineNum"> 4324 </span> : * value. -<span class="lineNum"> 4325 </span> : * @param first A forward iterator. -<span class="lineNum"> 4326 </span> : * @param last A forward iterator. -<span class="lineNum"> 4327 </span> : * @param old_value The value to be replaced. -<span class="lineNum"> 4328 </span> : * @param new_value The replacement value. -<span class="lineNum"> 4329 </span> : * @return replace() returns no value. -<span class="lineNum"> 4330 </span> : * -<span class="lineNum"> 4331 </span> : * For each iterator @c i in the range @p [first,last) if @c *i == -<span class="lineNum"> 4332 </span> : * @p old_value then the assignment @c *i = @p new_value is performed. -<span class="lineNum"> 4333 </span> : */ -<span class="lineNum"> 4334 </span> : template<typename _ForwardIterator, typename _Tp> -<span class="lineNum"> 4335 </span> : void -<span class="lineNum"> 4336 </span> : replace(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 4337 </span> : const _Tp& __old_value, const _Tp& __new_value) -<span class="lineNum"> 4338 </span> : { -<span class="lineNum"> 4339 </span> : // concept requirements -<span class="lineNum"> 4340 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 4341 </span> : _ForwardIterator>) -<span class="lineNum"> 4342 </span> : __glibcxx_function_requires(_EqualOpConcept< -<span class="lineNum"> 4343 </span> : typename iterator_traits<_ForwardIterator>::value_type, _Tp>) -<span class="lineNum"> 4344 </span> : __glibcxx_function_requires(_ConvertibleConcept<_Tp, -<span class="lineNum"> 4345 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 4346 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4347 </span> : -<span class="lineNum"> 4348 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 4349 </span> : if (*__first == __old_value) -<span class="lineNum"> 4350 </span> : *__first = __new_value; -<span class="lineNum"> 4351 </span> : } -<span class="lineNum"> 4352 </span> : -<span class="lineNum"> 4353 </span> : /** -<span class="lineNum"> 4354 </span> : * @brief Replace each value in a sequence for which a predicate returns -<span class="lineNum"> 4355 </span> : * true with another value. -<span class="lineNum"> 4356 </span> : * @param first A forward iterator. -<span class="lineNum"> 4357 </span> : * @param last A forward iterator. -<span class="lineNum"> 4358 </span> : * @param pred A predicate. -<span class="lineNum"> 4359 </span> : * @param new_value The replacement value. -<span class="lineNum"> 4360 </span> : * @return replace_if() returns no value. -<span class="lineNum"> 4361 </span> : * -<span class="lineNum"> 4362 </span> : * For each iterator @c i in the range @p [first,last) if @p pred(*i) -<span class="lineNum"> 4363 </span> : * is true then the assignment @c *i = @p new_value is performed. -<span class="lineNum"> 4364 </span> : */ -<span class="lineNum"> 4365 </span> : template<typename _ForwardIterator, typename _Predicate, typename _Tp> -<span class="lineNum"> 4366 </span> : void -<span class="lineNum"> 4367 </span> : replace_if(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 4368 </span> : _Predicate __pred, const _Tp& __new_value) -<span class="lineNum"> 4369 </span> : { -<span class="lineNum"> 4370 </span> : // concept requirements -<span class="lineNum"> 4371 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 4372 </span> : _ForwardIterator>) -<span class="lineNum"> 4373 </span> : __glibcxx_function_requires(_ConvertibleConcept<_Tp, -<span class="lineNum"> 4374 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 4375 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 4376 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 4377 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4378 </span> : -<span class="lineNum"> 4379 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 4380 </span> : if (__pred(*__first)) -<span class="lineNum"> 4381 </span> : *__first = __new_value; -<span class="lineNum"> 4382 </span> : } -<span class="lineNum"> 4383 </span> : -<span class="lineNum"> 4384 </span> : /** -<span class="lineNum"> 4385 </span> : * @brief Assign the result of a function object to each value in a -<span class="lineNum"> 4386 </span> : * sequence. -<span class="lineNum"> 4387 </span> : * @param first A forward iterator. -<span class="lineNum"> 4388 </span> : * @param last A forward iterator. -<span class="lineNum"> 4389 </span> : * @param gen A function object taking no arguments and returning -<span class="lineNum"> 4390 </span> : * std::iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 4391 </span> : * @return generate() returns no value. -<span class="lineNum"> 4392 </span> : * -<span class="lineNum"> 4393 </span> : * Performs the assignment @c *i = @p gen() for each @c i in the range -<span class="lineNum"> 4394 </span> : * @p [first,last). -<span class="lineNum"> 4395 </span> : */ -<span class="lineNum"> 4396 </span> : template<typename _ForwardIterator, typename _Generator> -<span class="lineNum"> 4397 </span> : void -<span class="lineNum"> 4398 </span> : generate(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 4399 </span> : _Generator __gen) -<span class="lineNum"> 4400 </span> : { -<span class="lineNum"> 4401 </span> : // concept requirements -<span class="lineNum"> 4402 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 4403 </span> : __glibcxx_function_requires(_GeneratorConcept<_Generator, -<span class="lineNum"> 4404 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 4405 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4406 </span> : -<span class="lineNum"> 4407 </span> : for (; __first != __last; ++__first) -<span class="lineNum"> 4408 </span> : *__first = __gen(); -<span class="lineNum"> 4409 </span> : } -<span class="lineNum"> 4410 </span> : -<span class="lineNum"> 4411 </span> : /** -<span class="lineNum"> 4412 </span> : * @brief Assign the result of a function object to each value in a -<span class="lineNum"> 4413 </span> : * sequence. -<span class="lineNum"> 4414 </span> : * @param first A forward iterator. -<span class="lineNum"> 4415 </span> : * @param n The length of the sequence. -<span class="lineNum"> 4416 </span> : * @param gen A function object taking no arguments and returning -<span class="lineNum"> 4417 </span> : * std::iterator_traits<_ForwardIterator>::value_type -<span class="lineNum"> 4418 </span> : * @return The end of the sequence, @p first+n -<span class="lineNum"> 4419 </span> : * -<span class="lineNum"> 4420 </span> : * Performs the assignment @c *i = @p gen() for each @c i in the range -<span class="lineNum"> 4421 </span> : * @p [first,first+n). -<span class="lineNum"> 4422 </span> : */ -<span class="lineNum"> 4423 </span> : template<typename _OutputIterator, typename _Size, typename _Generator> -<span class="lineNum"> 4424 </span> : _OutputIterator -<span class="lineNum"> 4425 </span> : generate_n(_OutputIterator __first, _Size __n, _Generator __gen) -<span class="lineNum"> 4426 </span> : { -<span class="lineNum"> 4427 </span> : // concept requirements -<span class="lineNum"> 4428 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4429 </span> : // "the type returned by a _Generator" -<span class="lineNum"> 4430 </span> : __typeof__(__gen())>) -<span class="lineNum"> 4431 </span> : -<span class="lineNum"> 4432 </span> : for (; __n > 0; --__n, ++__first) -<span class="lineNum"> 4433 </span> : *__first = __gen(); -<span class="lineNum"> 4434 </span> : return __first; -<span class="lineNum"> 4435 </span> : } -<span class="lineNum"> 4436 </span> : -<span class="lineNum"> 4437 </span> : -<span class="lineNum"> 4438 </span> : /** -<span class="lineNum"> 4439 </span> : * @brief Copy a sequence, removing consecutive duplicate values. -<span class="lineNum"> 4440 </span> : * @param first An input iterator. -<span class="lineNum"> 4441 </span> : * @param last An input iterator. -<span class="lineNum"> 4442 </span> : * @param result An output iterator. -<span class="lineNum"> 4443 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 4444 </span> : * -<span class="lineNum"> 4445 </span> : * Copies each element in the range @p [first,last) to the range -<span class="lineNum"> 4446 </span> : * beginning at @p result, except that only the first element is copied -<span class="lineNum"> 4447 </span> : * from groups of consecutive elements that compare equal. -<span class="lineNum"> 4448 </span> : * unique_copy() is stable, so the relative order of elements that are -<span class="lineNum"> 4449 </span> : * copied is unchanged. -<span class="lineNum"> 4450 </span> : * -<span class="lineNum"> 4451 </span> : * _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 4452 </span> : * DR 241. Does unique_copy() require CopyConstructible and Assignable? -<span class="lineNum"> 4453 </span> : * -<span class="lineNum"> 4454 </span> : * _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 4455 </span> : * DR 538. 241 again: Does unique_copy() require CopyConstructible and -<span class="lineNum"> 4456 </span> : * Assignable? -<span class="lineNum"> 4457 </span> : */ -<span class="lineNum"> 4458 </span> : template<typename _InputIterator, typename _OutputIterator> -<span class="lineNum"> 4459 </span> : inline _OutputIterator -<span class="lineNum"> 4460 </span> : unique_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 4461 </span> : _OutputIterator __result) -<span class="lineNum"> 4462 </span> : { -<span class="lineNum"> 4463 </span> : // concept requirements -<span class="lineNum"> 4464 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 4465 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4466 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 4467 </span> : __glibcxx_function_requires(_EqualityComparableConcept< -<span class="lineNum"> 4468 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 4469 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4470 </span> : -<span class="lineNum"> 4471 </span> : if (__first == __last) -<span class="lineNum"> 4472 </span> : return __result; -<span class="lineNum"> 4473 </span> : return std::__unique_copy(__first, __last, __result, -<span class="lineNum"> 4474 </span> : std::__iterator_category(__first), -<span class="lineNum"> 4475 </span> : std::__iterator_category(__result)); -<span class="lineNum"> 4476 </span> : } -<span class="lineNum"> 4477 </span> : -<span class="lineNum"> 4478 </span> : /** -<span class="lineNum"> 4479 </span> : * @brief Copy a sequence, removing consecutive values using a predicate. -<span class="lineNum"> 4480 </span> : * @param first An input iterator. -<span class="lineNum"> 4481 </span> : * @param last An input iterator. -<span class="lineNum"> 4482 </span> : * @param result An output iterator. -<span class="lineNum"> 4483 </span> : * @param binary_pred A binary predicate. -<span class="lineNum"> 4484 </span> : * @return An iterator designating the end of the resulting sequence. -<span class="lineNum"> 4485 </span> : * -<span class="lineNum"> 4486 </span> : * Copies each element in the range @p [first,last) to the range -<span class="lineNum"> 4487 </span> : * beginning at @p result, except that only the first element is copied -<span class="lineNum"> 4488 </span> : * from groups of consecutive elements for which @p binary_pred returns -<span class="lineNum"> 4489 </span> : * true. -<span class="lineNum"> 4490 </span> : * unique_copy() is stable, so the relative order of elements that are -<span class="lineNum"> 4491 </span> : * copied is unchanged. -<span class="lineNum"> 4492 </span> : * -<span class="lineNum"> 4493 </span> : * _GLIBCXX_RESOLVE_LIB_DEFECTS -<span class="lineNum"> 4494 </span> : * DR 241. Does unique_copy() require CopyConstructible and Assignable? -<span class="lineNum"> 4495 </span> : */ -<span class="lineNum"> 4496 </span> : template<typename _InputIterator, typename _OutputIterator, -<span class="lineNum"> 4497 </span> : typename _BinaryPredicate> -<span class="lineNum"> 4498 </span> : inline _OutputIterator -<span class="lineNum"> 4499 </span> : unique_copy(_InputIterator __first, _InputIterator __last, -<span class="lineNum"> 4500 </span> : _OutputIterator __result, -<span class="lineNum"> 4501 </span> : _BinaryPredicate __binary_pred) -<span class="lineNum"> 4502 </span> : { -<span class="lineNum"> 4503 </span> : // concept requirements -- predicates checked later -<span class="lineNum"> 4504 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator>) -<span class="lineNum"> 4505 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4506 </span> : typename iterator_traits<_InputIterator>::value_type>) -<span class="lineNum"> 4507 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4508 </span> : -<span class="lineNum"> 4509 </span> : if (__first == __last) -<span class="lineNum"> 4510 </span> : return __result; -<span class="lineNum"> 4511 </span> : return std::__unique_copy(__first, __last, __result, __binary_pred, -<span class="lineNum"> 4512 </span> : std::__iterator_category(__first), -<span class="lineNum"> 4513 </span> : std::__iterator_category(__result)); -<span class="lineNum"> 4514 </span> : } -<span class="lineNum"> 4515 </span> : -<span class="lineNum"> 4516 </span> : -<span class="lineNum"> 4517 </span> : /** -<span class="lineNum"> 4518 </span> : * @brief Randomly shuffle the elements of a sequence. -<span class="lineNum"> 4519 </span> : * @param first A forward iterator. -<span class="lineNum"> 4520 </span> : * @param last A forward iterator. -<span class="lineNum"> 4521 </span> : * @return Nothing. -<span class="lineNum"> 4522 </span> : * -<span class="lineNum"> 4523 </span> : * Reorder the elements in the range @p [first,last) using a random -<span class="lineNum"> 4524 </span> : * distribution, so that every possible ordering of the sequence is -<span class="lineNum"> 4525 </span> : * equally likely. -<span class="lineNum"> 4526 </span> : */ -<span class="lineNum"> 4527 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 4528 </span> : inline void -<span class="lineNum"> 4529 </span> : random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) -<span class="lineNum"> 4530 </span> : { -<span class="lineNum"> 4531 </span> : // concept requirements -<span class="lineNum"> 4532 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4533 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4534 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4535 </span> : -<span class="lineNum"> 4536 </span> : if (__first != __last) -<span class="lineNum"> 4537 </span> : for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) -<span class="lineNum"> 4538 </span> : std::iter_swap(__i, __first + (std::rand() % ((__i - __first) + 1))); -<span class="lineNum"> 4539 </span> : } -<span class="lineNum"> 4540 </span> : -<span class="lineNum"> 4541 </span> : /** -<span class="lineNum"> 4542 </span> : * @brief Shuffle the elements of a sequence using a random number -<span class="lineNum"> 4543 </span> : * generator. -<span class="lineNum"> 4544 </span> : * @param first A forward iterator. -<span class="lineNum"> 4545 </span> : * @param last A forward iterator. -<span class="lineNum"> 4546 </span> : * @param rand The RNG functor or function. -<span class="lineNum"> 4547 </span> : * @return Nothing. -<span class="lineNum"> 4548 </span> : * -<span class="lineNum"> 4549 </span> : * Reorders the elements in the range @p [first,last) using @p rand to -<span class="lineNum"> 4550 </span> : * provide a random distribution. Calling @p rand(N) for a positive -<span class="lineNum"> 4551 </span> : * integer @p N should return a randomly chosen integer from the -<span class="lineNum"> 4552 </span> : * range [0,N). -<span class="lineNum"> 4553 </span> : */ -<span class="lineNum"> 4554 </span> : template<typename _RandomAccessIterator, typename _RandomNumberGenerator> -<span class="lineNum"> 4555 </span> : void -<span class="lineNum"> 4556 </span> : random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 4557 </span> : _RandomNumberGenerator& __rand) -<span class="lineNum"> 4558 </span> : { -<span class="lineNum"> 4559 </span> : // concept requirements -<span class="lineNum"> 4560 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4561 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4562 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4563 </span> : -<span class="lineNum"> 4564 </span> : if (__first == __last) -<span class="lineNum"> 4565 </span> : return; -<span class="lineNum"> 4566 </span> : for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) -<span class="lineNum"> 4567 </span> : std::iter_swap(__i, __first + __rand((__i - __first) + 1)); -<span class="lineNum"> 4568 </span> : } -<span class="lineNum"> 4569 </span> : -<span class="lineNum"> 4570 </span> : -<span class="lineNum"> 4571 </span> : /** -<span class="lineNum"> 4572 </span> : * @brief Move elements for which a predicate is true to the beginning -<span class="lineNum"> 4573 </span> : * of a sequence. -<span class="lineNum"> 4574 </span> : * @param first A forward iterator. -<span class="lineNum"> 4575 </span> : * @param last A forward iterator. -<span class="lineNum"> 4576 </span> : * @param pred A predicate functor. -<span class="lineNum"> 4577 </span> : * @return An iterator @p middle such that @p pred(i) is true for each -<span class="lineNum"> 4578 </span> : * iterator @p i in the range @p [first,middle) and false for each @p i -<span class="lineNum"> 4579 </span> : * in the range @p [middle,last). -<span class="lineNum"> 4580 </span> : * -<span class="lineNum"> 4581 </span> : * @p pred must not modify its operand. @p partition() does not preserve -<span class="lineNum"> 4582 </span> : * the relative ordering of elements in each group, use -<span class="lineNum"> 4583 </span> : * @p stable_partition() if this is needed. -<span class="lineNum"> 4584 </span> : */ -<span class="lineNum"> 4585 </span> : template<typename _ForwardIterator, typename _Predicate> -<span class="lineNum"> 4586 </span> : inline _ForwardIterator -<span class="lineNum"> 4587 </span> : partition(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 4588 </span> : _Predicate __pred) -<span class="lineNum"> 4589 </span> : { -<span class="lineNum"> 4590 </span> : // concept requirements -<span class="lineNum"> 4591 </span> : __glibcxx_function_requires(_Mutable_ForwardIteratorConcept< -<span class="lineNum"> 4592 </span> : _ForwardIterator>) -<span class="lineNum"> 4593 </span> : __glibcxx_function_requires(_UnaryPredicateConcept<_Predicate, -<span class="lineNum"> 4594 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 4595 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4596 </span> : -<span class="lineNum"> 4597 </span> : return std::__partition(__first, __last, __pred, -<span class="lineNum"> 4598 </span> : std::__iterator_category(__first)); -<span class="lineNum"> 4599 </span> : } -<span class="lineNum"> 4600 </span> : -<span class="lineNum"> 4601 </span> : -<span class="lineNum"> 4602 </span> : -<span class="lineNum"> 4603 </span> : /** -<span class="lineNum"> 4604 </span> : * @brief Sort the smallest elements of a sequence. -<span class="lineNum"> 4605 </span> : * @param first An iterator. -<span class="lineNum"> 4606 </span> : * @param middle Another iterator. -<span class="lineNum"> 4607 </span> : * @param last Another iterator. -<span class="lineNum"> 4608 </span> : * @return Nothing. -<span class="lineNum"> 4609 </span> : * -<span class="lineNum"> 4610 </span> : * Sorts the smallest @p (middle-first) elements in the range -<span class="lineNum"> 4611 </span> : * @p [first,last) and moves them to the range @p [first,middle). The -<span class="lineNum"> 4612 </span> : * order of the remaining elements in the range @p [middle,last) is -<span class="lineNum"> 4613 </span> : * undefined. -<span class="lineNum"> 4614 </span> : * After the sort if @p i and @j are iterators in the range -<span class="lineNum"> 4615 </span> : * @p [first,middle) such that @i precedes @j and @k is an iterator in -<span class="lineNum"> 4616 </span> : * the range @p [middle,last) then @p *j<*i and @p *k<*i are both false. -<span class="lineNum"> 4617 </span> : */ -<span class="lineNum"> 4618 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 4619 </span> : inline void -<span class="lineNum"> 4620 </span> : partial_sort(_RandomAccessIterator __first, -<span class="lineNum"> 4621 </span> : _RandomAccessIterator __middle, -<span class="lineNum"> 4622 </span><span class="lineNoCov"> 0 : _RandomAccessIterator __last)</span> -<span class="lineNum"> 4623 </span> : { -<span class="lineNum"> 4624 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4625 </span> : _ValueType; -<span class="lineNum"> 4626 </span> : -<span class="lineNum"> 4627 </span> : // concept requirements -<span class="lineNum"> 4628 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4629 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4630 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 4631 </span> : __glibcxx_requires_valid_range(__first, __middle); -<span class="lineNum"> 4632 </span> : __glibcxx_requires_valid_range(__middle, __last); -<span class="lineNum"> 4633 </span> : -<span class="lineNum"> 4634 </span><span class="lineNoCov"> 0 : std::__heap_select(__first, __middle, __last);</span> -<span class="lineNum"> 4635 </span><span class="lineNoCov"> 0 : std::sort_heap(__first, __middle);</span> -<span class="lineNum"> 4636 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 4637 </span> : -<span class="lineNum"> 4638 </span> : /** -<span class="lineNum"> 4639 </span> : * @brief Sort the smallest elements of a sequence using a predicate -<span class="lineNum"> 4640 </span> : * for comparison. -<span class="lineNum"> 4641 </span> : * @param first An iterator. -<span class="lineNum"> 4642 </span> : * @param middle Another iterator. -<span class="lineNum"> 4643 </span> : * @param last Another iterator. -<span class="lineNum"> 4644 </span> : * @param comp A comparison functor. -<span class="lineNum"> 4645 </span> : * @return Nothing. -<span class="lineNum"> 4646 </span> : * -<span class="lineNum"> 4647 </span> : * Sorts the smallest @p (middle-first) elements in the range -<span class="lineNum"> 4648 </span> : * @p [first,last) and moves them to the range @p [first,middle). The -<span class="lineNum"> 4649 </span> : * order of the remaining elements in the range @p [middle,last) is -<span class="lineNum"> 4650 </span> : * undefined. -<span class="lineNum"> 4651 </span> : * After the sort if @p i and @j are iterators in the range -<span class="lineNum"> 4652 </span> : * @p [first,middle) such that @i precedes @j and @k is an iterator in -<span class="lineNum"> 4653 </span> : * the range @p [middle,last) then @p *comp(j,*i) and @p comp(*k,*i) -<span class="lineNum"> 4654 </span> : * are both false. -<span class="lineNum"> 4655 </span> : */ -<span class="lineNum"> 4656 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 4657 </span> : inline void -<span class="lineNum"> 4658 </span> : partial_sort(_RandomAccessIterator __first, -<span class="lineNum"> 4659 </span> : _RandomAccessIterator __middle, -<span class="lineNum"> 4660 </span> : _RandomAccessIterator __last, -<span class="lineNum"> 4661 </span><span class="lineNoCov"> 0 : _Compare __comp)</span> -<span class="lineNum"> 4662 </span> : { -<span class="lineNum"> 4663 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4664 </span> : _ValueType; -<span class="lineNum"> 4665 </span> : -<span class="lineNum"> 4666 </span> : // concept requirements -<span class="lineNum"> 4667 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4668 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4669 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 4670 </span> : _ValueType, _ValueType>) -<span class="lineNum"> 4671 </span> : __glibcxx_requires_valid_range(__first, __middle); -<span class="lineNum"> 4672 </span> : __glibcxx_requires_valid_range(__middle, __last); -<span class="lineNum"> 4673 </span> : -<span class="lineNum"> 4674 </span><span class="lineNoCov"> 0 : std::__heap_select(__first, __middle, __last, __comp);</span> -<span class="lineNum"> 4675 </span><span class="lineNoCov"> 0 : std::sort_heap(__first, __middle, __comp);</span> -<span class="lineNum"> 4676 </span><span class="lineNoCov"> 0 : }</span> -<span class="lineNum"> 4677 </span> : -<span class="lineNum"> 4678 </span> : /** -<span class="lineNum"> 4679 </span> : * @brief Sort a sequence just enough to find a particular position. -<span class="lineNum"> 4680 </span> : * @param first An iterator. -<span class="lineNum"> 4681 </span> : * @param nth Another iterator. -<span class="lineNum"> 4682 </span> : * @param last Another iterator. -<span class="lineNum"> 4683 </span> : * @return Nothing. -<span class="lineNum"> 4684 </span> : * -<span class="lineNum"> 4685 </span> : * Rearranges the elements in the range @p [first,last) so that @p *nth -<span class="lineNum"> 4686 </span> : * is the same element that would have been in that position had the -<span class="lineNum"> 4687 </span> : * whole sequence been sorted. -<span class="lineNum"> 4688 </span> : * whole sequence been sorted. The elements either side of @p *nth are -<span class="lineNum"> 4689 </span> : * not completely sorted, but for any iterator @i in the range -<span class="lineNum"> 4690 </span> : * @p [first,nth) and any iterator @j in the range @p [nth,last) it -<span class="lineNum"> 4691 </span> : * holds that @p *j<*i is false. -<span class="lineNum"> 4692 </span> : */ -<span class="lineNum"> 4693 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 4694 </span> : inline void -<span class="lineNum"> 4695 </span> : nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, -<span class="lineNum"> 4696 </span> : _RandomAccessIterator __last) -<span class="lineNum"> 4697 </span> : { -<span class="lineNum"> 4698 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4699 </span> : _ValueType; -<span class="lineNum"> 4700 </span> : -<span class="lineNum"> 4701 </span> : // concept requirements -<span class="lineNum"> 4702 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4703 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4704 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 4705 </span> : __glibcxx_requires_valid_range(__first, __nth); -<span class="lineNum"> 4706 </span> : __glibcxx_requires_valid_range(__nth, __last); -<span class="lineNum"> 4707 </span> : -<span class="lineNum"> 4708 </span> : if (__first == __last || __nth == __last) -<span class="lineNum"> 4709 </span> : return; -<span class="lineNum"> 4710 </span> : -<span class="lineNum"> 4711 </span> : std::__introselect(__first, __nth, __last, -<span class="lineNum"> 4712 </span> : std::__lg(__last - __first) * 2); -<span class="lineNum"> 4713 </span> : } -<span class="lineNum"> 4714 </span> : -<span class="lineNum"> 4715 </span> : /** -<span class="lineNum"> 4716 </span> : * @brief Sort a sequence just enough to find a particular position -<span class="lineNum"> 4717 </span> : * using a predicate for comparison. -<span class="lineNum"> 4718 </span> : * @param first An iterator. -<span class="lineNum"> 4719 </span> : * @param nth Another iterator. -<span class="lineNum"> 4720 </span> : * @param last Another iterator. -<span class="lineNum"> 4721 </span> : * @param comp A comparison functor. -<span class="lineNum"> 4722 </span> : * @return Nothing. -<span class="lineNum"> 4723 </span> : * -<span class="lineNum"> 4724 </span> : * Rearranges the elements in the range @p [first,last) so that @p *nth -<span class="lineNum"> 4725 </span> : * is the same element that would have been in that position had the -<span class="lineNum"> 4726 </span> : * whole sequence been sorted. The elements either side of @p *nth are -<span class="lineNum"> 4727 </span> : * not completely sorted, but for any iterator @i in the range -<span class="lineNum"> 4728 </span> : * @p [first,nth) and any iterator @j in the range @p [nth,last) it -<span class="lineNum"> 4729 </span> : * holds that @p comp(*j,*i) is false. -<span class="lineNum"> 4730 </span> : */ -<span class="lineNum"> 4731 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 4732 </span> : inline void -<span class="lineNum"> 4733 </span> : nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, -<span class="lineNum"> 4734 </span> : _RandomAccessIterator __last, _Compare __comp) -<span class="lineNum"> 4735 </span> : { -<span class="lineNum"> 4736 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4737 </span> : _ValueType; -<span class="lineNum"> 4738 </span> : -<span class="lineNum"> 4739 </span> : // concept requirements -<span class="lineNum"> 4740 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4741 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4742 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 4743 </span> : _ValueType, _ValueType>) -<span class="lineNum"> 4744 </span> : __glibcxx_requires_valid_range(__first, __nth); -<span class="lineNum"> 4745 </span> : __glibcxx_requires_valid_range(__nth, __last); -<span class="lineNum"> 4746 </span> : -<span class="lineNum"> 4747 </span> : if (__first == __last || __nth == __last) -<span class="lineNum"> 4748 </span> : return; -<span class="lineNum"> 4749 </span> : -<span class="lineNum"> 4750 </span> : std::__introselect(__first, __nth, __last, -<span class="lineNum"> 4751 </span> : std::__lg(__last - __first) * 2, __comp); -<span class="lineNum"> 4752 </span> : } -<span class="lineNum"> 4753 </span> : -<span class="lineNum"> 4754 </span> : -<span class="lineNum"> 4755 </span> : /** -<span class="lineNum"> 4756 </span> : * @brief Sort the elements of a sequence. -<span class="lineNum"> 4757 </span> : * @param first An iterator. -<span class="lineNum"> 4758 </span> : * @param last Another iterator. -<span class="lineNum"> 4759 </span> : * @return Nothing. -<span class="lineNum"> 4760 </span> : * -<span class="lineNum"> 4761 </span> : * Sorts the elements in the range @p [first,last) in ascending order, -<span class="lineNum"> 4762 </span> : * such that @p *(i+1)<*i is false for each iterator @p i in the range -<span class="lineNum"> 4763 </span> : * @p [first,last-1). -<span class="lineNum"> 4764 </span> : * -<span class="lineNum"> 4765 </span> : * The relative ordering of equivalent elements is not preserved, use -<span class="lineNum"> 4766 </span> : * @p stable_sort() if this is needed. -<span class="lineNum"> 4767 </span> : */ -<span class="lineNum"> 4768 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 4769 </span> : inline void -<span class="lineNum"> 4770 </span><span class="lineCov"> 8 : sort(_RandomAccessIterator __first, _RandomAccessIterator __last)</span> -<span class="lineNum"> 4771 </span> : { -<span class="lineNum"> 4772 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4773 </span> : _ValueType; -<span class="lineNum"> 4774 </span> : -<span class="lineNum"> 4775 </span> : // concept requirements -<span class="lineNum"> 4776 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4777 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4778 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 4779 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4780 </span> : -<span class="lineNum"> 4781 </span><span class="lineCov"> 8 : if (__first != __last)</span> -<span class="lineNum"> 4782 </span> : { -<span class="lineNum"> 4783 </span><span class="lineCov"> 8 : std::__introsort_loop(__first, __last,</span> -<span class="lineNum"> 4784 </span> : std::__lg(__last - __first) * 2); -<span class="lineNum"> 4785 </span><span class="lineCov"> 8 : std::__final_insertion_sort(__first, __last);</span> -<span class="lineNum"> 4786 </span> : } -<span class="lineNum"> 4787 </span><span class="lineCov"> 8 : }</span> -<span class="lineNum"> 4788 </span> : -<span class="lineNum"> 4789 </span> : /** -<span class="lineNum"> 4790 </span> : * @brief Sort the elements of a sequence using a predicate for comparison. -<span class="lineNum"> 4791 </span> : * @param first An iterator. -<span class="lineNum"> 4792 </span> : * @param last Another iterator. -<span class="lineNum"> 4793 </span> : * @param comp A comparison functor. -<span class="lineNum"> 4794 </span> : * @return Nothing. -<span class="lineNum"> 4795 </span> : * -<span class="lineNum"> 4796 </span> : * Sorts the elements in the range @p [first,last) in ascending order, -<span class="lineNum"> 4797 </span> : * such that @p comp(*(i+1),*i) is false for every iterator @p i in the -<span class="lineNum"> 4798 </span> : * range @p [first,last-1). -<span class="lineNum"> 4799 </span> : * -<span class="lineNum"> 4800 </span> : * The relative ordering of equivalent elements is not preserved, use -<span class="lineNum"> 4801 </span> : * @p stable_sort() if this is needed. -<span class="lineNum"> 4802 </span> : */ -<span class="lineNum"> 4803 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 4804 </span> : inline void -<span class="lineNum"> 4805 </span> : sort(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 4806 </span><span class="lineCov"> 3938 : _Compare __comp)</span> -<span class="lineNum"> 4807 </span> : { -<span class="lineNum"> 4808 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4809 </span> : _ValueType; -<span class="lineNum"> 4810 </span> : -<span class="lineNum"> 4811 </span> : // concept requirements -<span class="lineNum"> 4812 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4813 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4814 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, _ValueType, -<span class="lineNum"> 4815 </span> : _ValueType>) -<span class="lineNum"> 4816 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4817 </span> : -<span class="lineNum"> 4818 </span><span class="lineCov"> 3938 : if (__first != __last)</span> -<span class="lineNum"> 4819 </span> : { -<span class="lineNum"> 4820 </span><span class="lineCov"> 3938 : std::__introsort_loop(__first, __last,</span> -<span class="lineNum"> 4821 </span> : std::__lg(__last - __first) * 2, __comp); -<span class="lineNum"> 4822 </span><span class="lineCov"> 3938 : std::__final_insertion_sort(__first, __last, __comp);</span> -<span class="lineNum"> 4823 </span> : } -<span class="lineNum"> 4824 </span><span class="lineCov"> 3938 : }</span> -<span class="lineNum"> 4825 </span> : -<span class="lineNum"> 4826 </span> : /** -<span class="lineNum"> 4827 </span> : * @brief Merges two sorted ranges. -<span class="lineNum"> 4828 </span> : * @param first1 An iterator. -<span class="lineNum"> 4829 </span> : * @param first2 Another iterator. -<span class="lineNum"> 4830 </span> : * @param last1 Another iterator. -<span class="lineNum"> 4831 </span> : * @param last2 Another iterator. -<span class="lineNum"> 4832 </span> : * @param result An iterator pointing to the end of the merged range. -<span class="lineNum"> 4833 </span> : * @return An iterator pointing to the first element "not less -<span class="lineNum"> 4834 </span> : * than" @a val. -<span class="lineNum"> 4835 </span> : * -<span class="lineNum"> 4836 </span> : * Merges the ranges [first1,last1) and [first2,last2) into the sorted range -<span class="lineNum"> 4837 </span> : * [result, result + (last1-first1) + (last2-first2)). Both input ranges -<span class="lineNum"> 4838 </span> : * must be sorted, and the output range must not overlap with either of -<span class="lineNum"> 4839 </span> : * the input ranges. The sort is @e stable, that is, for equivalent -<span class="lineNum"> 4840 </span> : * elements in the two ranges, elements from the first range will always -<span class="lineNum"> 4841 </span> : * come before elements from the second. -<span class="lineNum"> 4842 </span> : */ -<span class="lineNum"> 4843 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 4844 </span> : typename _OutputIterator> -<span class="lineNum"> 4845 </span> : _OutputIterator -<span class="lineNum"> 4846 </span> : merge(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 4847 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 4848 </span> : _OutputIterator __result) -<span class="lineNum"> 4849 </span> : { -<span class="lineNum"> 4850 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 4851 </span> : _ValueType1; -<span class="lineNum"> 4852 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 4853 </span> : _ValueType2; -<span class="lineNum"> 4854 </span> : -<span class="lineNum"> 4855 </span> : // concept requirements -<span class="lineNum"> 4856 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 4857 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 4858 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4859 </span> : _ValueType1>) -<span class="lineNum"> 4860 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4861 </span> : _ValueType2>) -<span class="lineNum"> 4862 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 4863 </span> : __glibcxx_requires_sorted_set(__first1, __last1, __first2); -<span class="lineNum"> 4864 </span> : __glibcxx_requires_sorted_set(__first2, __last2, __first1); -<span class="lineNum"> 4865 </span> : -<span class="lineNum"> 4866 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 4867 </span> : { -<span class="lineNum"> 4868 </span> : if (*__first2 < *__first1) -<span class="lineNum"> 4869 </span> : { -<span class="lineNum"> 4870 </span> : *__result = *__first2; -<span class="lineNum"> 4871 </span> : ++__first2; -<span class="lineNum"> 4872 </span> : } -<span class="lineNum"> 4873 </span> : else -<span class="lineNum"> 4874 </span> : { -<span class="lineNum"> 4875 </span> : *__result = *__first1; -<span class="lineNum"> 4876 </span> : ++__first1; -<span class="lineNum"> 4877 </span> : } -<span class="lineNum"> 4878 </span> : ++__result; -<span class="lineNum"> 4879 </span> : } -<span class="lineNum"> 4880 </span> : return std::copy(__first2, __last2, std::copy(__first1, __last1, -<span class="lineNum"> 4881 </span> : __result)); -<span class="lineNum"> 4882 </span> : } -<span class="lineNum"> 4883 </span> : -<span class="lineNum"> 4884 </span> : /** -<span class="lineNum"> 4885 </span> : * @brief Merges two sorted ranges. -<span class="lineNum"> 4886 </span> : * @param first1 An iterator. -<span class="lineNum"> 4887 </span> : * @param first2 Another iterator. -<span class="lineNum"> 4888 </span> : * @param last1 Another iterator. -<span class="lineNum"> 4889 </span> : * @param last2 Another iterator. -<span class="lineNum"> 4890 </span> : * @param result An iterator pointing to the end of the merged range. -<span class="lineNum"> 4891 </span> : * @param comp A functor to use for comparisons. -<span class="lineNum"> 4892 </span> : * @return An iterator pointing to the first element "not less -<span class="lineNum"> 4893 </span> : * than" @a val. -<span class="lineNum"> 4894 </span> : * -<span class="lineNum"> 4895 </span> : * Merges the ranges [first1,last1) and [first2,last2) into the sorted range -<span class="lineNum"> 4896 </span> : * [result, result + (last1-first1) + (last2-first2)). Both input ranges -<span class="lineNum"> 4897 </span> : * must be sorted, and the output range must not overlap with either of -<span class="lineNum"> 4898 </span> : * the input ranges. The sort is @e stable, that is, for equivalent -<span class="lineNum"> 4899 </span> : * elements in the two ranges, elements from the first range will always -<span class="lineNum"> 4900 </span> : * come before elements from the second. -<span class="lineNum"> 4901 </span> : * -<span class="lineNum"> 4902 </span> : * The comparison function should have the same effects on ordering as -<span class="lineNum"> 4903 </span> : * the function used for the initial sort. -<span class="lineNum"> 4904 </span> : */ -<span class="lineNum"> 4905 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 4906 </span> : typename _OutputIterator, typename _Compare> -<span class="lineNum"> 4907 </span> : _OutputIterator -<span class="lineNum"> 4908 </span> : merge(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 4909 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 4910 </span> : _OutputIterator __result, _Compare __comp) -<span class="lineNum"> 4911 </span> : { -<span class="lineNum"> 4912 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 4913 </span> : _ValueType1; -<span class="lineNum"> 4914 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 4915 </span> : _ValueType2; -<span class="lineNum"> 4916 </span> : -<span class="lineNum"> 4917 </span> : // concept requirements -<span class="lineNum"> 4918 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 4919 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 4920 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4921 </span> : _ValueType1>) -<span class="lineNum"> 4922 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 4923 </span> : _ValueType2>) -<span class="lineNum"> 4924 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 4925 </span> : _ValueType2, _ValueType1>) -<span class="lineNum"> 4926 </span> : __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); -<span class="lineNum"> 4927 </span> : __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); -<span class="lineNum"> 4928 </span> : -<span class="lineNum"> 4929 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 4930 </span> : { -<span class="lineNum"> 4931 </span> : if (__comp(*__first2, *__first1)) -<span class="lineNum"> 4932 </span> : { -<span class="lineNum"> 4933 </span> : *__result = *__first2; -<span class="lineNum"> 4934 </span> : ++__first2; -<span class="lineNum"> 4935 </span> : } -<span class="lineNum"> 4936 </span> : else -<span class="lineNum"> 4937 </span> : { -<span class="lineNum"> 4938 </span> : *__result = *__first1; -<span class="lineNum"> 4939 </span> : ++__first1; -<span class="lineNum"> 4940 </span> : } -<span class="lineNum"> 4941 </span> : ++__result; -<span class="lineNum"> 4942 </span> : } -<span class="lineNum"> 4943 </span> : return std::copy(__first2, __last2, std::copy(__first1, __last1, -<span class="lineNum"> 4944 </span> : __result)); -<span class="lineNum"> 4945 </span> : } -<span class="lineNum"> 4946 </span> : -<span class="lineNum"> 4947 </span> : -<span class="lineNum"> 4948 </span> : /** -<span class="lineNum"> 4949 </span> : * @brief Sort the elements of a sequence, preserving the relative order -<span class="lineNum"> 4950 </span> : * of equivalent elements. -<span class="lineNum"> 4951 </span> : * @param first An iterator. -<span class="lineNum"> 4952 </span> : * @param last Another iterator. -<span class="lineNum"> 4953 </span> : * @return Nothing. -<span class="lineNum"> 4954 </span> : * -<span class="lineNum"> 4955 </span> : * Sorts the elements in the range @p [first,last) in ascending order, -<span class="lineNum"> 4956 </span> : * such that @p *(i+1)<*i is false for each iterator @p i in the range -<span class="lineNum"> 4957 </span> : * @p [first,last-1). -<span class="lineNum"> 4958 </span> : * -<span class="lineNum"> 4959 </span> : * The relative ordering of equivalent elements is preserved, so any two -<span class="lineNum"> 4960 </span> : * elements @p x and @p y in the range @p [first,last) such that -<span class="lineNum"> 4961 </span> : * @p x<y is false and @p y<x is false will have the same relative -<span class="lineNum"> 4962 </span> : * ordering after calling @p stable_sort(). -<span class="lineNum"> 4963 </span> : */ -<span class="lineNum"> 4964 </span> : template<typename _RandomAccessIterator> -<span class="lineNum"> 4965 </span> : inline void -<span class="lineNum"> 4966 </span> : stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) -<span class="lineNum"> 4967 </span> : { -<span class="lineNum"> 4968 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 4969 </span> : _ValueType; -<span class="lineNum"> 4970 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 4971 </span> : _DistanceType; -<span class="lineNum"> 4972 </span> : -<span class="lineNum"> 4973 </span> : // concept requirements -<span class="lineNum"> 4974 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 4975 </span> : _RandomAccessIterator>) -<span class="lineNum"> 4976 </span> : __glibcxx_function_requires(_LessThanComparableConcept<_ValueType>) -<span class="lineNum"> 4977 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 4978 </span> : -<span class="lineNum"> 4979 </span> : _Temporary_buffer<_RandomAccessIterator, _ValueType> __buf(__first, -<span class="lineNum"> 4980 </span> : __last); -<span class="lineNum"> 4981 </span> : if (__buf.begin() == 0) -<span class="lineNum"> 4982 </span> : std::__inplace_stable_sort(__first, __last); -<span class="lineNum"> 4983 </span> : else -<span class="lineNum"> 4984 </span> : std::__stable_sort_adaptive(__first, __last, __buf.begin(), -<span class="lineNum"> 4985 </span> : _DistanceType(__buf.size())); -<span class="lineNum"> 4986 </span> : } -<span class="lineNum"> 4987 </span> : -<span class="lineNum"> 4988 </span> : /** -<span class="lineNum"> 4989 </span> : * @brief Sort the elements of a sequence using a predicate for comparison, -<span class="lineNum"> 4990 </span> : * preserving the relative order of equivalent elements. -<span class="lineNum"> 4991 </span> : * @param first An iterator. -<span class="lineNum"> 4992 </span> : * @param last Another iterator. -<span class="lineNum"> 4993 </span> : * @param comp A comparison functor. -<span class="lineNum"> 4994 </span> : * @return Nothing. -<span class="lineNum"> 4995 </span> : * -<span class="lineNum"> 4996 </span> : * Sorts the elements in the range @p [first,last) in ascending order, -<span class="lineNum"> 4997 </span> : * such that @p comp(*(i+1),*i) is false for each iterator @p i in the -<span class="lineNum"> 4998 </span> : * range @p [first,last-1). -<span class="lineNum"> 4999 </span> : * -<span class="lineNum"> 5000 </span> : * The relative ordering of equivalent elements is preserved, so any two -<span class="lineNum"> 5001 </span> : * elements @p x and @p y in the range @p [first,last) such that -<span class="lineNum"> 5002 </span> : * @p comp(x,y) is false and @p comp(y,x) is false will have the same -<span class="lineNum"> 5003 </span> : * relative ordering after calling @p stable_sort(). -<span class="lineNum"> 5004 </span> : */ -<span class="lineNum"> 5005 </span> : template<typename _RandomAccessIterator, typename _Compare> -<span class="lineNum"> 5006 </span> : inline void -<span class="lineNum"> 5007 </span> : stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, -<span class="lineNum"> 5008 </span> : _Compare __comp) -<span class="lineNum"> 5009 </span> : { -<span class="lineNum"> 5010 </span> : typedef typename iterator_traits<_RandomAccessIterator>::value_type -<span class="lineNum"> 5011 </span> : _ValueType; -<span class="lineNum"> 5012 </span> : typedef typename iterator_traits<_RandomAccessIterator>::difference_type -<span class="lineNum"> 5013 </span> : _DistanceType; -<span class="lineNum"> 5014 </span> : -<span class="lineNum"> 5015 </span> : // concept requirements -<span class="lineNum"> 5016 </span> : __glibcxx_function_requires(_Mutable_RandomAccessIteratorConcept< -<span class="lineNum"> 5017 </span> : _RandomAccessIterator>) -<span class="lineNum"> 5018 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5019 </span> : _ValueType, -<span class="lineNum"> 5020 </span> : _ValueType>) -<span class="lineNum"> 5021 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 5022 </span> : -<span class="lineNum"> 5023 </span> : _Temporary_buffer<_RandomAccessIterator, _ValueType> __buf(__first, -<span class="lineNum"> 5024 </span> : __last); -<span class="lineNum"> 5025 </span> : if (__buf.begin() == 0) -<span class="lineNum"> 5026 </span> : std::__inplace_stable_sort(__first, __last, __comp); -<span class="lineNum"> 5027 </span> : else -<span class="lineNum"> 5028 </span> : std::__stable_sort_adaptive(__first, __last, __buf.begin(), -<span class="lineNum"> 5029 </span> : _DistanceType(__buf.size()), __comp); -<span class="lineNum"> 5030 </span> : } -<span class="lineNum"> 5031 </span> : -<span class="lineNum"> 5032 </span> : -<span class="lineNum"> 5033 </span> : /** -<span class="lineNum"> 5034 </span> : * @brief Return the union of two sorted ranges. -<span class="lineNum"> 5035 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5036 </span> : * @param last1 End of first range. -<span class="lineNum"> 5037 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5038 </span> : * @param last2 End of second range. -<span class="lineNum"> 5039 </span> : * @return End of the output range. -<span class="lineNum"> 5040 </span> : * @ingroup setoperations -<span class="lineNum"> 5041 </span> : * -<span class="lineNum"> 5042 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5043 </span> : * each range in order to the output range. Iterators increment for each -<span class="lineNum"> 5044 </span> : * range. When the current element of one range is less than the other, -<span class="lineNum"> 5045 </span> : * that element is copied and the iterator advanced. If an element is -<span class="lineNum"> 5046 </span> : * contained in both ranges, the element from the first range is copied and -<span class="lineNum"> 5047 </span> : * both ranges advance. The output range may not overlap either input -<span class="lineNum"> 5048 </span> : * range. -<span class="lineNum"> 5049 </span> : */ -<span class="lineNum"> 5050 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5051 </span> : typename _OutputIterator> -<span class="lineNum"> 5052 </span> : _OutputIterator -<span class="lineNum"> 5053 </span> : set_union(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5054 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5055 </span><span class="lineCov"> 21150 : _OutputIterator __result)</span> -<span class="lineNum"> 5056 </span> : { -<span class="lineNum"> 5057 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5058 </span> : _ValueType1; -<span class="lineNum"> 5059 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5060 </span> : _ValueType2; -<span class="lineNum"> 5061 </span> : -<span class="lineNum"> 5062 </span> : // concept requirements -<span class="lineNum"> 5063 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5064 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5065 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5066 </span> : _ValueType1>) -<span class="lineNum"> 5067 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5068 </span> : _ValueType2>) -<span class="lineNum"> 5069 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) -<span class="lineNum"> 5070 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 5071 </span> : __glibcxx_requires_sorted_set(__first1, __last1, __first2); -<span class="lineNum"> 5072 </span> : __glibcxx_requires_sorted_set(__first2, __last2, __first1); -<span class="lineNum"> 5073 </span> : -<span class="lineNum"> 5074 </span><span class="lineCov"> 42309 : while (__first1 != __last1 && __first2 != __last2)</span> -<span class="lineNum"> 5075 </span> : { -<span class="lineNum"> 5076 </span><span class="lineCov"> 9 : if (*__first1 < *__first2)</span> -<span class="lineNum"> 5077 </span> : { -<span class="lineNum"> 5078 </span><span class="lineCov"> 7 : *__result = *__first1;</span> -<span class="lineNum"> 5079 </span><span class="lineCov"> 7 : ++__first1;</span> -<span class="lineNum"> 5080 </span> : } -<span class="lineNum"> 5081 </span><span class="lineCov"> 2 : else if (*__first2 < *__first1)</span> -<span class="lineNum"> 5082 </span> : { -<span class="lineNum"> 5083 </span><span class="lineCov"> 1 : *__result = *__first2;</span> -<span class="lineNum"> 5084 </span><span class="lineCov"> 1 : ++__first2;</span> -<span class="lineNum"> 5085 </span> : } -<span class="lineNum"> 5086 </span> : else -<span class="lineNum"> 5087 </span> : { -<span class="lineNum"> 5088 </span><span class="lineCov"> 1 : *__result = *__first1;</span> -<span class="lineNum"> 5089 </span><span class="lineCov"> 1 : ++__first1;</span> -<span class="lineNum"> 5090 </span><span class="lineCov"> 1 : ++__first2;</span> -<span class="lineNum"> 5091 </span> : } -<span class="lineNum"> 5092 </span><span class="lineCov"> 9 : ++__result;</span> -<span class="lineNum"> 5093 </span> : } -<span class="lineNum"> 5094 </span> : return std::copy(__first2, __last2, std::copy(__first1, __last1, -<span class="lineNum"> 5095 </span><span class="lineCov"> 21150 : __result));</span> -<span class="lineNum"> 5096 </span> : } -<span class="lineNum"> 5097 </span> : -<span class="lineNum"> 5098 </span> : /** -<span class="lineNum"> 5099 </span> : * @brief Return the union of two sorted ranges using a comparison functor. -<span class="lineNum"> 5100 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5101 </span> : * @param last1 End of first range. -<span class="lineNum"> 5102 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5103 </span> : * @param last2 End of second range. -<span class="lineNum"> 5104 </span> : * @param comp The comparison functor. -<span class="lineNum"> 5105 </span> : * @return End of the output range. -<span class="lineNum"> 5106 </span> : * @ingroup setoperations -<span class="lineNum"> 5107 </span> : * -<span class="lineNum"> 5108 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5109 </span> : * each range in order to the output range. Iterators increment for each -<span class="lineNum"> 5110 </span> : * range. When the current element of one range is less than the other -<span class="lineNum"> 5111 </span> : * according to @a comp, that element is copied and the iterator advanced. -<span class="lineNum"> 5112 </span> : * If an equivalent element according to @a comp is contained in both -<span class="lineNum"> 5113 </span> : * ranges, the element from the first range is copied and both ranges -<span class="lineNum"> 5114 </span> : * advance. The output range may not overlap either input range. -<span class="lineNum"> 5115 </span> : */ -<span class="lineNum"> 5116 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5117 </span> : typename _OutputIterator, typename _Compare> -<span class="lineNum"> 5118 </span> : _OutputIterator -<span class="lineNum"> 5119 </span> : set_union(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5120 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5121 </span> : _OutputIterator __result, _Compare __comp) -<span class="lineNum"> 5122 </span> : { -<span class="lineNum"> 5123 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5124 </span> : _ValueType1; -<span class="lineNum"> 5125 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5126 </span> : _ValueType2; -<span class="lineNum"> 5127 </span> : -<span class="lineNum"> 5128 </span> : // concept requirements -<span class="lineNum"> 5129 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5130 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5131 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5132 </span> : _ValueType1>) -<span class="lineNum"> 5133 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5134 </span> : _ValueType2>) -<span class="lineNum"> 5135 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5136 </span> : _ValueType1, _ValueType2>) -<span class="lineNum"> 5137 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5138 </span> : _ValueType2, _ValueType1>) -<span class="lineNum"> 5139 </span> : __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); -<span class="lineNum"> 5140 </span> : __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); -<span class="lineNum"> 5141 </span> : -<span class="lineNum"> 5142 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 5143 </span> : { -<span class="lineNum"> 5144 </span> : if (__comp(*__first1, *__first2)) -<span class="lineNum"> 5145 </span> : { -<span class="lineNum"> 5146 </span> : *__result = *__first1; -<span class="lineNum"> 5147 </span> : ++__first1; -<span class="lineNum"> 5148 </span> : } -<span class="lineNum"> 5149 </span> : else if (__comp(*__first2, *__first1)) -<span class="lineNum"> 5150 </span> : { -<span class="lineNum"> 5151 </span> : *__result = *__first2; -<span class="lineNum"> 5152 </span> : ++__first2; -<span class="lineNum"> 5153 </span> : } -<span class="lineNum"> 5154 </span> : else -<span class="lineNum"> 5155 </span> : { -<span class="lineNum"> 5156 </span> : *__result = *__first1; -<span class="lineNum"> 5157 </span> : ++__first1; -<span class="lineNum"> 5158 </span> : ++__first2; -<span class="lineNum"> 5159 </span> : } -<span class="lineNum"> 5160 </span> : ++__result; -<span class="lineNum"> 5161 </span> : } -<span class="lineNum"> 5162 </span> : return std::copy(__first2, __last2, std::copy(__first1, __last1, -<span class="lineNum"> 5163 </span> : __result)); -<span class="lineNum"> 5164 </span> : } -<span class="lineNum"> 5165 </span> : -<span class="lineNum"> 5166 </span> : /** -<span class="lineNum"> 5167 </span> : * @brief Return the intersection of two sorted ranges. -<span class="lineNum"> 5168 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5169 </span> : * @param last1 End of first range. -<span class="lineNum"> 5170 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5171 </span> : * @param last2 End of second range. -<span class="lineNum"> 5172 </span> : * @return End of the output range. -<span class="lineNum"> 5173 </span> : * @ingroup setoperations -<span class="lineNum"> 5174 </span> : * -<span class="lineNum"> 5175 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5176 </span> : * both ranges in order to the output range. Iterators increment for each -<span class="lineNum"> 5177 </span> : * range. When the current element of one range is less than the other, -<span class="lineNum"> 5178 </span> : * that iterator advances. If an element is contained in both ranges, the -<span class="lineNum"> 5179 </span> : * element from the first range is copied and both ranges advance. The -<span class="lineNum"> 5180 </span> : * output range may not overlap either input range. -<span class="lineNum"> 5181 </span> : */ -<span class="lineNum"> 5182 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5183 </span> : typename _OutputIterator> -<span class="lineNum"> 5184 </span> : _OutputIterator -<span class="lineNum"> 5185 </span> : set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5186 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5187 </span><span class="lineCov"> 2 : _OutputIterator __result)</span> -<span class="lineNum"> 5188 </span> : { -<span class="lineNum"> 5189 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5190 </span> : _ValueType1; -<span class="lineNum"> 5191 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5192 </span> : _ValueType2; -<span class="lineNum"> 5193 </span> : -<span class="lineNum"> 5194 </span> : // concept requirements -<span class="lineNum"> 5195 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5196 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5197 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5198 </span> : _ValueType1>) -<span class="lineNum"> 5199 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) -<span class="lineNum"> 5200 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 5201 </span> : __glibcxx_requires_sorted_set(__first1, __last1, __first2); -<span class="lineNum"> 5202 </span> : __glibcxx_requires_sorted_set(__first2, __last2, __first1); -<span class="lineNum"> 5203 </span> : -<span class="lineNum"> 5204 </span><span class="lineCov"> 8 : while (__first1 != __last1 && __first2 != __last2)</span> -<span class="lineNum"> 5205 </span><span class="lineCov"> 4 : if (*__first1 < *__first2)</span> -<span class="lineNum"> 5206 </span><span class="lineCov"> 1 : ++__first1;</span> -<span class="lineNum"> 5207 </span><span class="lineCov"> 3 : else if (*__first2 < *__first1)</span> -<span class="lineNum"> 5208 </span><span class="lineCov"> 1 : ++__first2;</span> -<span class="lineNum"> 5209 </span> : else -<span class="lineNum"> 5210 </span> : { -<span class="lineNum"> 5211 </span><span class="lineCov"> 2 : *__result = *__first1;</span> -<span class="lineNum"> 5212 </span><span class="lineCov"> 2 : ++__first1;</span> -<span class="lineNum"> 5213 </span><span class="lineCov"> 2 : ++__first2;</span> -<span class="lineNum"> 5214 </span><span class="lineCov"> 2 : ++__result;</span> -<span class="lineNum"> 5215 </span> : } -<span class="lineNum"> 5216 </span><span class="lineCov"> 2 : return __result;</span> -<span class="lineNum"> 5217 </span> : } -<span class="lineNum"> 5218 </span> : -<span class="lineNum"> 5219 </span> : /** -<span class="lineNum"> 5220 </span> : * @brief Return the intersection of two sorted ranges using comparison -<span class="lineNum"> 5221 </span> : * functor. -<span class="lineNum"> 5222 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5223 </span> : * @param last1 End of first range. -<span class="lineNum"> 5224 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5225 </span> : * @param last2 End of second range. -<span class="lineNum"> 5226 </span> : * @param comp The comparison functor. -<span class="lineNum"> 5227 </span> : * @return End of the output range. -<span class="lineNum"> 5228 </span> : * @ingroup setoperations -<span class="lineNum"> 5229 </span> : * -<span class="lineNum"> 5230 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5231 </span> : * both ranges in order to the output range. Iterators increment for each -<span class="lineNum"> 5232 </span> : * range. When the current element of one range is less than the other -<span class="lineNum"> 5233 </span> : * according to @a comp, that iterator advances. If an element is -<span class="lineNum"> 5234 </span> : * contained in both ranges according to @a comp, the element from the -<span class="lineNum"> 5235 </span> : * first range is copied and both ranges advance. The output range may not -<span class="lineNum"> 5236 </span> : * overlap either input range. -<span class="lineNum"> 5237 </span> : */ -<span class="lineNum"> 5238 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5239 </span> : typename _OutputIterator, typename _Compare> -<span class="lineNum"> 5240 </span> : _OutputIterator -<span class="lineNum"> 5241 </span> : set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5242 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5243 </span> : _OutputIterator __result, _Compare __comp) -<span class="lineNum"> 5244 </span> : { -<span class="lineNum"> 5245 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5246 </span> : _ValueType1; -<span class="lineNum"> 5247 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5248 </span> : _ValueType2; -<span class="lineNum"> 5249 </span> : -<span class="lineNum"> 5250 </span> : // concept requirements -<span class="lineNum"> 5251 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5252 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5253 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5254 </span> : _ValueType1>) -<span class="lineNum"> 5255 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5256 </span> : _ValueType1, _ValueType2>) -<span class="lineNum"> 5257 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5258 </span> : _ValueType2, _ValueType1>) -<span class="lineNum"> 5259 </span> : __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); -<span class="lineNum"> 5260 </span> : __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); -<span class="lineNum"> 5261 </span> : -<span class="lineNum"> 5262 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 5263 </span> : if (__comp(*__first1, *__first2)) -<span class="lineNum"> 5264 </span> : ++__first1; -<span class="lineNum"> 5265 </span> : else if (__comp(*__first2, *__first1)) -<span class="lineNum"> 5266 </span> : ++__first2; -<span class="lineNum"> 5267 </span> : else -<span class="lineNum"> 5268 </span> : { -<span class="lineNum"> 5269 </span> : *__result = *__first1; -<span class="lineNum"> 5270 </span> : ++__first1; -<span class="lineNum"> 5271 </span> : ++__first2; -<span class="lineNum"> 5272 </span> : ++__result; -<span class="lineNum"> 5273 </span> : } -<span class="lineNum"> 5274 </span> : return __result; -<span class="lineNum"> 5275 </span> : } -<span class="lineNum"> 5276 </span> : -<span class="lineNum"> 5277 </span> : /** -<span class="lineNum"> 5278 </span> : * @brief Return the difference of two sorted ranges. -<span class="lineNum"> 5279 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5280 </span> : * @param last1 End of first range. -<span class="lineNum"> 5281 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5282 </span> : * @param last2 End of second range. -<span class="lineNum"> 5283 </span> : * @return End of the output range. -<span class="lineNum"> 5284 </span> : * @ingroup setoperations -<span class="lineNum"> 5285 </span> : * -<span class="lineNum"> 5286 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5287 </span> : * the first range but not the second in order to the output range. -<span class="lineNum"> 5288 </span> : * Iterators increment for each range. When the current element of the -<span class="lineNum"> 5289 </span> : * first range is less than the second, that element is copied and the -<span class="lineNum"> 5290 </span> : * iterator advances. If the current element of the second range is less, -<span class="lineNum"> 5291 </span> : * the iterator advances, but no element is copied. If an element is -<span class="lineNum"> 5292 </span> : * contained in both ranges, no elements are copied and both ranges -<span class="lineNum"> 5293 </span> : * advance. The output range may not overlap either input range. -<span class="lineNum"> 5294 </span> : */ -<span class="lineNum"> 5295 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5296 </span> : typename _OutputIterator> -<span class="lineNum"> 5297 </span> : _OutputIterator -<span class="lineNum"> 5298 </span> : set_difference(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5299 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5300 </span><span class="lineCov"> 10 : _OutputIterator __result)</span> -<span class="lineNum"> 5301 </span> : { -<span class="lineNum"> 5302 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5303 </span> : _ValueType1; -<span class="lineNum"> 5304 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5305 </span> : _ValueType2; -<span class="lineNum"> 5306 </span> : -<span class="lineNum"> 5307 </span> : // concept requirements -<span class="lineNum"> 5308 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5309 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5310 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5311 </span> : _ValueType1>) -<span class="lineNum"> 5312 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) -<span class="lineNum"> 5313 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 5314 </span> : __glibcxx_requires_sorted_set(__first1, __last1, __first2); -<span class="lineNum"> 5315 </span> : __glibcxx_requires_sorted_set(__first2, __last2, __first1); -<span class="lineNum"> 5316 </span> : -<span class="lineNum"> 5317 </span><span class="lineCov"> 22 : while (__first1 != __last1 && __first2 != __last2)</span> -<span class="lineNum"> 5318 </span><span class="lineCov"> 2 : if (*__first1 < *__first2)</span> -<span class="lineNum"> 5319 </span> : { -<span class="lineNum"> 5320 </span><span class="lineCov"> 1 : *__result = *__first1;</span> -<span class="lineNum"> 5321 </span><span class="lineCov"> 1 : ++__first1;</span> -<span class="lineNum"> 5322 </span><span class="lineCov"> 1 : ++__result;</span> -<span class="lineNum"> 5323 </span> : } -<span class="lineNum"> 5324 </span><span class="lineCov"> 1 : else if (*__first2 < *__first1)</span> -<span class="lineNum"> 5325 </span><span class="lineNoCov"> 0 : ++__first2;</span> -<span class="lineNum"> 5326 </span> : else -<span class="lineNum"> 5327 </span> : { -<span class="lineNum"> 5328 </span><span class="lineCov"> 1 : ++__first1;</span> -<span class="lineNum"> 5329 </span><span class="lineCov"> 1 : ++__first2;</span> -<span class="lineNum"> 5330 </span> : } -<span class="lineNum"> 5331 </span><span class="lineCov"> 10 : return std::copy(__first1, __last1, __result);</span> -<span class="lineNum"> 5332 </span> : } -<span class="lineNum"> 5333 </span> : -<span class="lineNum"> 5334 </span> : /** -<span class="lineNum"> 5335 </span> : * @brief Return the difference of two sorted ranges using comparison -<span class="lineNum"> 5336 </span> : * functor. -<span class="lineNum"> 5337 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5338 </span> : * @param last1 End of first range. -<span class="lineNum"> 5339 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5340 </span> : * @param last2 End of second range. -<span class="lineNum"> 5341 </span> : * @param comp The comparison functor. -<span class="lineNum"> 5342 </span> : * @return End of the output range. -<span class="lineNum"> 5343 </span> : * @ingroup setoperations -<span class="lineNum"> 5344 </span> : * -<span class="lineNum"> 5345 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5346 </span> : * the first range but not the second in order to the output range. -<span class="lineNum"> 5347 </span> : * Iterators increment for each range. When the current element of the -<span class="lineNum"> 5348 </span> : * first range is less than the second according to @a comp, that element -<span class="lineNum"> 5349 </span> : * is copied and the iterator advances. If the current element of the -<span class="lineNum"> 5350 </span> : * second range is less, no element is copied and the iterator advances. -<span class="lineNum"> 5351 </span> : * If an element is contained in both ranges according to @a comp, no -<span class="lineNum"> 5352 </span> : * elements are copied and both ranges advance. The output range may not -<span class="lineNum"> 5353 </span> : * overlap either input range. -<span class="lineNum"> 5354 </span> : */ -<span class="lineNum"> 5355 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5356 </span> : typename _OutputIterator, typename _Compare> -<span class="lineNum"> 5357 </span> : _OutputIterator -<span class="lineNum"> 5358 </span> : set_difference(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5359 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5360 </span> : _OutputIterator __result, _Compare __comp) -<span class="lineNum"> 5361 </span> : { -<span class="lineNum"> 5362 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5363 </span> : _ValueType1; -<span class="lineNum"> 5364 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5365 </span> : _ValueType2; -<span class="lineNum"> 5366 </span> : -<span class="lineNum"> 5367 </span> : // concept requirements -<span class="lineNum"> 5368 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5369 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5370 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5371 </span> : _ValueType1>) -<span class="lineNum"> 5372 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5373 </span> : _ValueType1, _ValueType2>) -<span class="lineNum"> 5374 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5375 </span> : _ValueType2, _ValueType1>) -<span class="lineNum"> 5376 </span> : __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); -<span class="lineNum"> 5377 </span> : __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); -<span class="lineNum"> 5378 </span> : -<span class="lineNum"> 5379 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 5380 </span> : if (__comp(*__first1, *__first2)) -<span class="lineNum"> 5381 </span> : { -<span class="lineNum"> 5382 </span> : *__result = *__first1; -<span class="lineNum"> 5383 </span> : ++__first1; -<span class="lineNum"> 5384 </span> : ++__result; -<span class="lineNum"> 5385 </span> : } -<span class="lineNum"> 5386 </span> : else if (__comp(*__first2, *__first1)) -<span class="lineNum"> 5387 </span> : ++__first2; -<span class="lineNum"> 5388 </span> : else -<span class="lineNum"> 5389 </span> : { -<span class="lineNum"> 5390 </span> : ++__first1; -<span class="lineNum"> 5391 </span> : ++__first2; -<span class="lineNum"> 5392 </span> : } -<span class="lineNum"> 5393 </span> : return std::copy(__first1, __last1, __result); -<span class="lineNum"> 5394 </span> : } -<span class="lineNum"> 5395 </span> : -<span class="lineNum"> 5396 </span> : /** -<span class="lineNum"> 5397 </span> : * @brief Return the symmetric difference of two sorted ranges. -<span class="lineNum"> 5398 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5399 </span> : * @param last1 End of first range. -<span class="lineNum"> 5400 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5401 </span> : * @param last2 End of second range. -<span class="lineNum"> 5402 </span> : * @return End of the output range. -<span class="lineNum"> 5403 </span> : * @ingroup setoperations -<span class="lineNum"> 5404 </span> : * -<span class="lineNum"> 5405 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5406 </span> : * one range but not the other in order to the output range. Iterators -<span class="lineNum"> 5407 </span> : * increment for each range. When the current element of one range is less -<span class="lineNum"> 5408 </span> : * than the other, that element is copied and the iterator advances. If an -<span class="lineNum"> 5409 </span> : * element is contained in both ranges, no elements are copied and both -<span class="lineNum"> 5410 </span> : * ranges advance. The output range may not overlap either input range. -<span class="lineNum"> 5411 </span> : */ -<span class="lineNum"> 5412 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5413 </span> : typename _OutputIterator> -<span class="lineNum"> 5414 </span> : _OutputIterator -<span class="lineNum"> 5415 </span> : set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5416 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5417 </span> : _OutputIterator __result) -<span class="lineNum"> 5418 </span> : { -<span class="lineNum"> 5419 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5420 </span> : _ValueType1; -<span class="lineNum"> 5421 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5422 </span> : _ValueType2; -<span class="lineNum"> 5423 </span> : -<span class="lineNum"> 5424 </span> : // concept requirements -<span class="lineNum"> 5425 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5426 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5427 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5428 </span> : _ValueType1>) -<span class="lineNum"> 5429 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5430 </span> : _ValueType2>) -<span class="lineNum"> 5431 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType1, _ValueType2>) -<span class="lineNum"> 5432 </span> : __glibcxx_function_requires(_LessThanOpConcept<_ValueType2, _ValueType1>) -<span class="lineNum"> 5433 </span> : __glibcxx_requires_sorted_set(__first1, __last1, __first2); -<span class="lineNum"> 5434 </span> : __glibcxx_requires_sorted_set(__first2, __last2, __first1); -<span class="lineNum"> 5435 </span> : -<span class="lineNum"> 5436 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 5437 </span> : if (*__first1 < *__first2) -<span class="lineNum"> 5438 </span> : { -<span class="lineNum"> 5439 </span> : *__result = *__first1; -<span class="lineNum"> 5440 </span> : ++__first1; -<span class="lineNum"> 5441 </span> : ++__result; -<span class="lineNum"> 5442 </span> : } -<span class="lineNum"> 5443 </span> : else if (*__first2 < *__first1) -<span class="lineNum"> 5444 </span> : { -<span class="lineNum"> 5445 </span> : *__result = *__first2; -<span class="lineNum"> 5446 </span> : ++__first2; -<span class="lineNum"> 5447 </span> : ++__result; -<span class="lineNum"> 5448 </span> : } -<span class="lineNum"> 5449 </span> : else -<span class="lineNum"> 5450 </span> : { -<span class="lineNum"> 5451 </span> : ++__first1; -<span class="lineNum"> 5452 </span> : ++__first2; -<span class="lineNum"> 5453 </span> : } -<span class="lineNum"> 5454 </span> : return std::copy(__first2, __last2, std::copy(__first1, -<span class="lineNum"> 5455 </span> : __last1, __result)); -<span class="lineNum"> 5456 </span> : } -<span class="lineNum"> 5457 </span> : -<span class="lineNum"> 5458 </span> : /** -<span class="lineNum"> 5459 </span> : * @brief Return the symmetric difference of two sorted ranges using -<span class="lineNum"> 5460 </span> : * comparison functor. -<span class="lineNum"> 5461 </span> : * @param first1 Start of first range. -<span class="lineNum"> 5462 </span> : * @param last1 End of first range. -<span class="lineNum"> 5463 </span> : * @param first2 Start of second range. -<span class="lineNum"> 5464 </span> : * @param last2 End of second range. -<span class="lineNum"> 5465 </span> : * @param comp The comparison functor. -<span class="lineNum"> 5466 </span> : * @return End of the output range. -<span class="lineNum"> 5467 </span> : * @ingroup setoperations -<span class="lineNum"> 5468 </span> : * -<span class="lineNum"> 5469 </span> : * This operation iterates over both ranges, copying elements present in -<span class="lineNum"> 5470 </span> : * one range but not the other in order to the output range. Iterators -<span class="lineNum"> 5471 </span> : * increment for each range. When the current element of one range is less -<span class="lineNum"> 5472 </span> : * than the other according to @a comp, that element is copied and the -<span class="lineNum"> 5473 </span> : * iterator advances. If an element is contained in both ranges according -<span class="lineNum"> 5474 </span> : * to @a comp, no elements are copied and both ranges advance. The output -<span class="lineNum"> 5475 </span> : * range may not overlap either input range. -<span class="lineNum"> 5476 </span> : */ -<span class="lineNum"> 5477 </span> : template<typename _InputIterator1, typename _InputIterator2, -<span class="lineNum"> 5478 </span> : typename _OutputIterator, typename _Compare> -<span class="lineNum"> 5479 </span> : _OutputIterator -<span class="lineNum"> 5480 </span> : set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, -<span class="lineNum"> 5481 </span> : _InputIterator2 __first2, _InputIterator2 __last2, -<span class="lineNum"> 5482 </span> : _OutputIterator __result, -<span class="lineNum"> 5483 </span> : _Compare __comp) -<span class="lineNum"> 5484 </span> : { -<span class="lineNum"> 5485 </span> : typedef typename iterator_traits<_InputIterator1>::value_type -<span class="lineNum"> 5486 </span> : _ValueType1; -<span class="lineNum"> 5487 </span> : typedef typename iterator_traits<_InputIterator2>::value_type -<span class="lineNum"> 5488 </span> : _ValueType2; -<span class="lineNum"> 5489 </span> : -<span class="lineNum"> 5490 </span> : // concept requirements -<span class="lineNum"> 5491 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>) -<span class="lineNum"> 5492 </span> : __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>) -<span class="lineNum"> 5493 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5494 </span> : _ValueType1>) -<span class="lineNum"> 5495 </span> : __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator, -<span class="lineNum"> 5496 </span> : _ValueType2>) -<span class="lineNum"> 5497 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5498 </span> : _ValueType1, _ValueType2>) -<span class="lineNum"> 5499 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5500 </span> : _ValueType2, _ValueType1>) -<span class="lineNum"> 5501 </span> : __glibcxx_requires_sorted_set_pred(__first1, __last1, __first2, __comp); -<span class="lineNum"> 5502 </span> : __glibcxx_requires_sorted_set_pred(__first2, __last2, __first1, __comp); -<span class="lineNum"> 5503 </span> : -<span class="lineNum"> 5504 </span> : while (__first1 != __last1 && __first2 != __last2) -<span class="lineNum"> 5505 </span> : if (__comp(*__first1, *__first2)) -<span class="lineNum"> 5506 </span> : { -<span class="lineNum"> 5507 </span> : *__result = *__first1; -<span class="lineNum"> 5508 </span> : ++__first1; -<span class="lineNum"> 5509 </span> : ++__result; -<span class="lineNum"> 5510 </span> : } -<span class="lineNum"> 5511 </span> : else if (__comp(*__first2, *__first1)) -<span class="lineNum"> 5512 </span> : { -<span class="lineNum"> 5513 </span> : *__result = *__first2; -<span class="lineNum"> 5514 </span> : ++__first2; -<span class="lineNum"> 5515 </span> : ++__result; -<span class="lineNum"> 5516 </span> : } -<span class="lineNum"> 5517 </span> : else -<span class="lineNum"> 5518 </span> : { -<span class="lineNum"> 5519 </span> : ++__first1; -<span class="lineNum"> 5520 </span> : ++__first2; -<span class="lineNum"> 5521 </span> : } -<span class="lineNum"> 5522 </span> : return std::copy(__first2, __last2, -<span class="lineNum"> 5523 </span> : std::copy(__first1, __last1, __result)); -<span class="lineNum"> 5524 </span> : } -<span class="lineNum"> 5525 </span> : -<span class="lineNum"> 5526 </span> : -<span class="lineNum"> 5527 </span> : /** -<span class="lineNum"> 5528 </span> : * @brief Return the minimum element in a range. -<span class="lineNum"> 5529 </span> : * @param first Start of range. -<span class="lineNum"> 5530 </span> : * @param last End of range. -<span class="lineNum"> 5531 </span> : * @return Iterator referencing the first instance of the smallest value. -<span class="lineNum"> 5532 </span> : */ -<span class="lineNum"> 5533 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 5534 </span> : _ForwardIterator -<span class="lineNum"> 5535 </span> : min_element(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 5536 </span> : { -<span class="lineNum"> 5537 </span> : // concept requirements -<span class="lineNum"> 5538 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 5539 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 5540 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 5541 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 5542 </span> : -<span class="lineNum"> 5543 </span> : if (__first == __last) -<span class="lineNum"> 5544 </span> : return __first; -<span class="lineNum"> 5545 </span> : _ForwardIterator __result = __first; -<span class="lineNum"> 5546 </span> : while (++__first != __last) -<span class="lineNum"> 5547 </span> : if (*__first < *__result) -<span class="lineNum"> 5548 </span> : __result = __first; -<span class="lineNum"> 5549 </span> : return __result; -<span class="lineNum"> 5550 </span> : } -<span class="lineNum"> 5551 </span> : -<span class="lineNum"> 5552 </span> : /** -<span class="lineNum"> 5553 </span> : * @brief Return the minimum element in a range using comparison functor. -<span class="lineNum"> 5554 </span> : * @param first Start of range. -<span class="lineNum"> 5555 </span> : * @param last End of range. -<span class="lineNum"> 5556 </span> : * @param comp Comparison functor. -<span class="lineNum"> 5557 </span> : * @return Iterator referencing the first instance of the smallest value -<span class="lineNum"> 5558 </span> : * according to comp. -<span class="lineNum"> 5559 </span> : */ -<span class="lineNum"> 5560 </span> : template<typename _ForwardIterator, typename _Compare> -<span class="lineNum"> 5561 </span> : _ForwardIterator -<span class="lineNum"> 5562 </span> : min_element(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 5563 </span> : _Compare __comp) -<span class="lineNum"> 5564 </span> : { -<span class="lineNum"> 5565 </span> : // concept requirements -<span class="lineNum"> 5566 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 5567 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5568 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 5569 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 5570 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 5571 </span> : -<span class="lineNum"> 5572 </span> : if (__first == __last) -<span class="lineNum"> 5573 </span> : return __first; -<span class="lineNum"> 5574 </span> : _ForwardIterator __result = __first; -<span class="lineNum"> 5575 </span> : while (++__first != __last) -<span class="lineNum"> 5576 </span> : if (__comp(*__first, *__result)) -<span class="lineNum"> 5577 </span> : __result = __first; -<span class="lineNum"> 5578 </span> : return __result; -<span class="lineNum"> 5579 </span> : } -<span class="lineNum"> 5580 </span> : -<span class="lineNum"> 5581 </span> : /** -<span class="lineNum"> 5582 </span> : * @brief Return the maximum element in a range. -<span class="lineNum"> 5583 </span> : * @param first Start of range. -<span class="lineNum"> 5584 </span> : * @param last End of range. -<span class="lineNum"> 5585 </span> : * @return Iterator referencing the first instance of the largest value. -<span class="lineNum"> 5586 </span> : */ -<span class="lineNum"> 5587 </span> : template<typename _ForwardIterator> -<span class="lineNum"> 5588 </span> : _ForwardIterator -<span class="lineNum"> 5589 </span> : max_element(_ForwardIterator __first, _ForwardIterator __last) -<span class="lineNum"> 5590 </span> : { -<span class="lineNum"> 5591 </span> : // concept requirements -<span class="lineNum"> 5592 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 5593 </span> : __glibcxx_function_requires(_LessThanComparableConcept< -<span class="lineNum"> 5594 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 5595 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 5596 </span> : -<span class="lineNum"> 5597 </span> : if (__first == __last) -<span class="lineNum"> 5598 </span> : return __first; -<span class="lineNum"> 5599 </span> : _ForwardIterator __result = __first; -<span class="lineNum"> 5600 </span> : while (++__first != __last) -<span class="lineNum"> 5601 </span> : if (*__result < *__first) -<span class="lineNum"> 5602 </span> : __result = __first; -<span class="lineNum"> 5603 </span> : return __result; -<span class="lineNum"> 5604 </span> : } -<span class="lineNum"> 5605 </span> : -<span class="lineNum"> 5606 </span> : /** -<span class="lineNum"> 5607 </span> : * @brief Return the maximum element in a range using comparison functor. -<span class="lineNum"> 5608 </span> : * @param first Start of range. -<span class="lineNum"> 5609 </span> : * @param last End of range. -<span class="lineNum"> 5610 </span> : * @param comp Comparison functor. -<span class="lineNum"> 5611 </span> : * @return Iterator referencing the first instance of the largest value -<span class="lineNum"> 5612 </span> : * according to comp. -<span class="lineNum"> 5613 </span> : */ -<span class="lineNum"> 5614 </span> : template<typename _ForwardIterator, typename _Compare> -<span class="lineNum"> 5615 </span> : _ForwardIterator -<span class="lineNum"> 5616 </span> : max_element(_ForwardIterator __first, _ForwardIterator __last, -<span class="lineNum"> 5617 </span> : _Compare __comp) -<span class="lineNum"> 5618 </span> : { -<span class="lineNum"> 5619 </span> : // concept requirements -<span class="lineNum"> 5620 </span> : __glibcxx_function_requires(_ForwardIteratorConcept<_ForwardIterator>) -<span class="lineNum"> 5621 </span> : __glibcxx_function_requires(_BinaryPredicateConcept<_Compare, -<span class="lineNum"> 5622 </span> : typename iterator_traits<_ForwardIterator>::value_type, -<span class="lineNum"> 5623 </span> : typename iterator_traits<_ForwardIterator>::value_type>) -<span class="lineNum"> 5624 </span> : __glibcxx_requires_valid_range(__first, __last); -<span class="lineNum"> 5625 </span> : -<span class="lineNum"> 5626 </span> : if (__first == __last) return __first; -<span class="lineNum"> 5627 </span> : _ForwardIterator __result = __first; -<span class="lineNum"> 5628 </span> : while (++__first != __last) -<span class="lineNum"> 5629 </span> : if (__comp(*__result, *__first)) -<span class="lineNum"> 5630 </span> : __result = __first; -<span class="lineNum"> 5631 </span> : return __result; -<span class="lineNum"> 5632 </span> : } -<span class="lineNum"> 5633 </span> : -<span class="lineNum"> 5634 </span> : _GLIBCXX_END_NESTED_NAMESPACE -<span class="lineNum"> 5635 </span> : -<span class="lineNum"> 5636 </span> : #endif /* _STL_ALGO_H */ -</pre> - </td> - </tr> - </table> - <br> - - <table width="100%" border=0 cellspacing=0 cellpadding=0> - <tr><td class="ruler"><img src="../../../../../glass.png" width=3 height=3 alt=""></td></tr> - <tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LTP GCOV extension version 1.6</a></td></tr> - </table> - <br> - -</body> -</html> |