1*38fd1498Szrj // <algorithm> Forward declarations -*- C++ -*-
2*38fd1498Szrj
3*38fd1498Szrj // Copyright (C) 2007-2018 Free Software Foundation, Inc.
4*38fd1498Szrj //
5*38fd1498Szrj // This file is part of the GNU ISO C++ Library. This library is free
6*38fd1498Szrj // software; you can redistribute it and/or modify it under the
7*38fd1498Szrj // terms of the GNU General Public License as published by the
8*38fd1498Szrj // Free Software Foundation; either version 3, or (at your option)
9*38fd1498Szrj // any later version.
10*38fd1498Szrj
11*38fd1498Szrj // This library is distributed in the hope that it will be useful,
12*38fd1498Szrj // but WITHOUT ANY WARRANTY; without even the implied warranty of
13*38fd1498Szrj // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14*38fd1498Szrj // GNU General Public License for more details.
15*38fd1498Szrj
16*38fd1498Szrj // Under Section 7 of GPL version 3, you are granted additional
17*38fd1498Szrj // permissions described in the GCC Runtime Library Exception, version
18*38fd1498Szrj // 3.1, as published by the Free Software Foundation.
19*38fd1498Szrj
20*38fd1498Szrj // You should have received a copy of the GNU General Public License and
21*38fd1498Szrj // a copy of the GCC Runtime Library Exception along with this program;
22*38fd1498Szrj // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23*38fd1498Szrj // <http://www.gnu.org/licenses/>.
24*38fd1498Szrj
25*38fd1498Szrj /** @file bits/algorithmfwd.h
26*38fd1498Szrj * This is an internal header file, included by other library headers.
27*38fd1498Szrj * Do not attempt to use it directly. @headername{algorithm}
28*38fd1498Szrj */
29*38fd1498Szrj
30*38fd1498Szrj #ifndef _GLIBCXX_ALGORITHMFWD_H
31*38fd1498Szrj #define _GLIBCXX_ALGORITHMFWD_H 1
32*38fd1498Szrj
33*38fd1498Szrj #pragma GCC system_header
34*38fd1498Szrj
35*38fd1498Szrj #include <bits/c++config.h>
36*38fd1498Szrj #include <bits/stl_pair.h>
37*38fd1498Szrj #include <bits/stl_iterator_base_types.h>
38*38fd1498Szrj #if __cplusplus >= 201103L
39*38fd1498Szrj #include <initializer_list>
40*38fd1498Szrj #endif
41*38fd1498Szrj
_GLIBCXX_VISIBILITY(default)42*38fd1498Szrj namespace std _GLIBCXX_VISIBILITY(default)
43*38fd1498Szrj {
44*38fd1498Szrj _GLIBCXX_BEGIN_NAMESPACE_VERSION
45*38fd1498Szrj
46*38fd1498Szrj /*
47*38fd1498Szrj adjacent_find
48*38fd1498Szrj all_of (C++11)
49*38fd1498Szrj any_of (C++11)
50*38fd1498Szrj binary_search
51*38fd1498Szrj clamp (C++17)
52*38fd1498Szrj copy
53*38fd1498Szrj copy_backward
54*38fd1498Szrj copy_if (C++11)
55*38fd1498Szrj copy_n (C++11)
56*38fd1498Szrj count
57*38fd1498Szrj count_if
58*38fd1498Szrj equal
59*38fd1498Szrj equal_range
60*38fd1498Szrj fill
61*38fd1498Szrj fill_n
62*38fd1498Szrj find
63*38fd1498Szrj find_end
64*38fd1498Szrj find_first_of
65*38fd1498Szrj find_if
66*38fd1498Szrj find_if_not (C++11)
67*38fd1498Szrj for_each
68*38fd1498Szrj generate
69*38fd1498Szrj generate_n
70*38fd1498Szrj includes
71*38fd1498Szrj inplace_merge
72*38fd1498Szrj is_heap (C++11)
73*38fd1498Szrj is_heap_until (C++11)
74*38fd1498Szrj is_partitioned (C++11)
75*38fd1498Szrj is_sorted (C++11)
76*38fd1498Szrj is_sorted_until (C++11)
77*38fd1498Szrj iter_swap
78*38fd1498Szrj lexicographical_compare
79*38fd1498Szrj lower_bound
80*38fd1498Szrj make_heap
81*38fd1498Szrj max
82*38fd1498Szrj max_element
83*38fd1498Szrj merge
84*38fd1498Szrj min
85*38fd1498Szrj min_element
86*38fd1498Szrj minmax (C++11)
87*38fd1498Szrj minmax_element (C++11)
88*38fd1498Szrj mismatch
89*38fd1498Szrj next_permutation
90*38fd1498Szrj none_of (C++11)
91*38fd1498Szrj nth_element
92*38fd1498Szrj partial_sort
93*38fd1498Szrj partial_sort_copy
94*38fd1498Szrj partition
95*38fd1498Szrj partition_copy (C++11)
96*38fd1498Szrj partition_point (C++11)
97*38fd1498Szrj pop_heap
98*38fd1498Szrj prev_permutation
99*38fd1498Szrj push_heap
100*38fd1498Szrj random_shuffle
101*38fd1498Szrj remove
102*38fd1498Szrj remove_copy
103*38fd1498Szrj remove_copy_if
104*38fd1498Szrj remove_if
105*38fd1498Szrj replace
106*38fd1498Szrj replace_copy
107*38fd1498Szrj replace_copy_if
108*38fd1498Szrj replace_if
109*38fd1498Szrj reverse
110*38fd1498Szrj reverse_copy
111*38fd1498Szrj rotate
112*38fd1498Szrj rotate_copy
113*38fd1498Szrj search
114*38fd1498Szrj search_n
115*38fd1498Szrj set_difference
116*38fd1498Szrj set_intersection
117*38fd1498Szrj set_symmetric_difference
118*38fd1498Szrj set_union
119*38fd1498Szrj shuffle (C++11)
120*38fd1498Szrj sort
121*38fd1498Szrj sort_heap
122*38fd1498Szrj stable_partition
123*38fd1498Szrj stable_sort
124*38fd1498Szrj swap
125*38fd1498Szrj swap_ranges
126*38fd1498Szrj transform
127*38fd1498Szrj unique
128*38fd1498Szrj unique_copy
129*38fd1498Szrj upper_bound
130*38fd1498Szrj */
131*38fd1498Szrj
132*38fd1498Szrj /**
133*38fd1498Szrj * @defgroup algorithms Algorithms
134*38fd1498Szrj *
135*38fd1498Szrj * Components for performing algorithmic operations. Includes
136*38fd1498Szrj * non-modifying sequence, modifying (mutating) sequence, sorting,
137*38fd1498Szrj * searching, merge, partition, heap, set, minima, maxima, and
138*38fd1498Szrj * permutation operations.
139*38fd1498Szrj */
140*38fd1498Szrj
141*38fd1498Szrj /**
142*38fd1498Szrj * @defgroup mutating_algorithms Mutating
143*38fd1498Szrj * @ingroup algorithms
144*38fd1498Szrj */
145*38fd1498Szrj
146*38fd1498Szrj /**
147*38fd1498Szrj * @defgroup non_mutating_algorithms Non-Mutating
148*38fd1498Szrj * @ingroup algorithms
149*38fd1498Szrj */
150*38fd1498Szrj
151*38fd1498Szrj /**
152*38fd1498Szrj * @defgroup sorting_algorithms Sorting
153*38fd1498Szrj * @ingroup algorithms
154*38fd1498Szrj */
155*38fd1498Szrj
156*38fd1498Szrj /**
157*38fd1498Szrj * @defgroup set_algorithms Set Operation
158*38fd1498Szrj * @ingroup sorting_algorithms
159*38fd1498Szrj *
160*38fd1498Szrj * These algorithms are common set operations performed on sequences
161*38fd1498Szrj * that are already sorted. The number of comparisons will be
162*38fd1498Szrj * linear.
163*38fd1498Szrj */
164*38fd1498Szrj
165*38fd1498Szrj /**
166*38fd1498Szrj * @defgroup binary_search_algorithms Binary Search
167*38fd1498Szrj * @ingroup sorting_algorithms
168*38fd1498Szrj *
169*38fd1498Szrj * These algorithms are variations of a classic binary search, and
170*38fd1498Szrj * all assume that the sequence being searched is already sorted.
171*38fd1498Szrj *
172*38fd1498Szrj * The number of comparisons will be logarithmic (and as few as
173*38fd1498Szrj * possible). The number of steps through the sequence will be
174*38fd1498Szrj * logarithmic for random-access iterators (e.g., pointers), and
175*38fd1498Szrj * linear otherwise.
176*38fd1498Szrj *
177*38fd1498Szrj * The LWG has passed Defect Report 270, which notes: <em>The
178*38fd1498Szrj * proposed resolution reinterprets binary search. Instead of
179*38fd1498Szrj * thinking about searching for a value in a sorted range, we view
180*38fd1498Szrj * that as an important special case of a more general algorithm:
181*38fd1498Szrj * searching for the partition point in a partitioned range. We
182*38fd1498Szrj * also add a guarantee that the old wording did not: we ensure that
183*38fd1498Szrj * the upper bound is no earlier than the lower bound, that the pair
184*38fd1498Szrj * returned by equal_range is a valid range, and that the first part
185*38fd1498Szrj * of that pair is the lower bound.</em>
186*38fd1498Szrj *
187*38fd1498Szrj * The actual effect of the first sentence is that a comparison
188*38fd1498Szrj * functor passed by the user doesn't necessarily need to induce a
189*38fd1498Szrj * strict weak ordering relation. Rather, it partitions the range.
190*38fd1498Szrj */
191*38fd1498Szrj
192*38fd1498Szrj // adjacent_find
193*38fd1498Szrj
194*38fd1498Szrj #if __cplusplus >= 201103L
195*38fd1498Szrj template<typename _IIter, typename _Predicate>
196*38fd1498Szrj bool
197*38fd1498Szrj all_of(_IIter, _IIter, _Predicate);
198*38fd1498Szrj
199*38fd1498Szrj template<typename _IIter, typename _Predicate>
200*38fd1498Szrj bool
201*38fd1498Szrj any_of(_IIter, _IIter, _Predicate);
202*38fd1498Szrj #endif
203*38fd1498Szrj
204*38fd1498Szrj template<typename _FIter, typename _Tp>
205*38fd1498Szrj bool
206*38fd1498Szrj binary_search(_FIter, _FIter, const _Tp&);
207*38fd1498Szrj
208*38fd1498Szrj template<typename _FIter, typename _Tp, typename _Compare>
209*38fd1498Szrj bool
210*38fd1498Szrj binary_search(_FIter, _FIter, const _Tp&, _Compare);
211*38fd1498Szrj
212*38fd1498Szrj #if __cplusplus > 201402L
213*38fd1498Szrj template<typename _Tp>
214*38fd1498Szrj _GLIBCXX14_CONSTEXPR
215*38fd1498Szrj const _Tp&
216*38fd1498Szrj clamp(const _Tp&, const _Tp&, const _Tp&);
217*38fd1498Szrj
218*38fd1498Szrj template<typename _Tp, typename _Compare>
219*38fd1498Szrj _GLIBCXX14_CONSTEXPR
220*38fd1498Szrj const _Tp&
221*38fd1498Szrj clamp(const _Tp&, const _Tp&, const _Tp&, _Compare);
222*38fd1498Szrj #endif
223*38fd1498Szrj
224*38fd1498Szrj template<typename _IIter, typename _OIter>
225*38fd1498Szrj _OIter
226*38fd1498Szrj copy(_IIter, _IIter, _OIter);
227*38fd1498Szrj
228*38fd1498Szrj template<typename _BIter1, typename _BIter2>
229*38fd1498Szrj _BIter2
230*38fd1498Szrj copy_backward(_BIter1, _BIter1, _BIter2);
231*38fd1498Szrj
232*38fd1498Szrj #if __cplusplus >= 201103L
233*38fd1498Szrj template<typename _IIter, typename _OIter, typename _Predicate>
234*38fd1498Szrj _OIter
235*38fd1498Szrj copy_if(_IIter, _IIter, _OIter, _Predicate);
236*38fd1498Szrj
237*38fd1498Szrj template<typename _IIter, typename _Size, typename _OIter>
238*38fd1498Szrj _OIter
239*38fd1498Szrj copy_n(_IIter, _Size, _OIter);
240*38fd1498Szrj #endif
241*38fd1498Szrj
242*38fd1498Szrj // count
243*38fd1498Szrj // count_if
244*38fd1498Szrj
245*38fd1498Szrj template<typename _FIter, typename _Tp>
246*38fd1498Szrj pair<_FIter, _FIter>
247*38fd1498Szrj equal_range(_FIter, _FIter, const _Tp&);
248*38fd1498Szrj
249*38fd1498Szrj template<typename _FIter, typename _Tp, typename _Compare>
250*38fd1498Szrj pair<_FIter, _FIter>
251*38fd1498Szrj equal_range(_FIter, _FIter, const _Tp&, _Compare);
252*38fd1498Szrj
253*38fd1498Szrj template<typename _FIter, typename _Tp>
254*38fd1498Szrj void
255*38fd1498Szrj fill(_FIter, _FIter, const _Tp&);
256*38fd1498Szrj
257*38fd1498Szrj template<typename _OIter, typename _Size, typename _Tp>
258*38fd1498Szrj _OIter
259*38fd1498Szrj fill_n(_OIter, _Size, const _Tp&);
260*38fd1498Szrj
261*38fd1498Szrj // find
262*38fd1498Szrj
263*38fd1498Szrj template<typename _FIter1, typename _FIter2>
264*38fd1498Szrj _FIter1
265*38fd1498Szrj find_end(_FIter1, _FIter1, _FIter2, _FIter2);
266*38fd1498Szrj
267*38fd1498Szrj template<typename _FIter1, typename _FIter2, typename _BinaryPredicate>
268*38fd1498Szrj _FIter1
269*38fd1498Szrj find_end(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
270*38fd1498Szrj
271*38fd1498Szrj // find_first_of
272*38fd1498Szrj // find_if
273*38fd1498Szrj
274*38fd1498Szrj #if __cplusplus >= 201103L
275*38fd1498Szrj template<typename _IIter, typename _Predicate>
276*38fd1498Szrj _IIter
277*38fd1498Szrj find_if_not(_IIter, _IIter, _Predicate);
278*38fd1498Szrj #endif
279*38fd1498Szrj
280*38fd1498Szrj // for_each
281*38fd1498Szrj // generate
282*38fd1498Szrj // generate_n
283*38fd1498Szrj
284*38fd1498Szrj template<typename _IIter1, typename _IIter2>
285*38fd1498Szrj bool
286*38fd1498Szrj includes(_IIter1, _IIter1, _IIter2, _IIter2);
287*38fd1498Szrj
288*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _Compare>
289*38fd1498Szrj bool
290*38fd1498Szrj includes(_IIter1, _IIter1, _IIter2, _IIter2, _Compare);
291*38fd1498Szrj
292*38fd1498Szrj template<typename _BIter>
293*38fd1498Szrj void
294*38fd1498Szrj inplace_merge(_BIter, _BIter, _BIter);
295*38fd1498Szrj
296*38fd1498Szrj template<typename _BIter, typename _Compare>
297*38fd1498Szrj void
298*38fd1498Szrj inplace_merge(_BIter, _BIter, _BIter, _Compare);
299*38fd1498Szrj
300*38fd1498Szrj #if __cplusplus >= 201103L
301*38fd1498Szrj template<typename _RAIter>
302*38fd1498Szrj bool
303*38fd1498Szrj is_heap(_RAIter, _RAIter);
304*38fd1498Szrj
305*38fd1498Szrj template<typename _RAIter, typename _Compare>
306*38fd1498Szrj bool
307*38fd1498Szrj is_heap(_RAIter, _RAIter, _Compare);
308*38fd1498Szrj
309*38fd1498Szrj template<typename _RAIter>
310*38fd1498Szrj _RAIter
311*38fd1498Szrj is_heap_until(_RAIter, _RAIter);
312*38fd1498Szrj
313*38fd1498Szrj template<typename _RAIter, typename _Compare>
314*38fd1498Szrj _RAIter
315*38fd1498Szrj is_heap_until(_RAIter, _RAIter, _Compare);
316*38fd1498Szrj
317*38fd1498Szrj template<typename _IIter, typename _Predicate>
318*38fd1498Szrj bool
319*38fd1498Szrj is_partitioned(_IIter, _IIter, _Predicate);
320*38fd1498Szrj
321*38fd1498Szrj template<typename _FIter1, typename _FIter2>
322*38fd1498Szrj bool
323*38fd1498Szrj is_permutation(_FIter1, _FIter1, _FIter2);
324*38fd1498Szrj
325*38fd1498Szrj template<typename _FIter1, typename _FIter2,
326*38fd1498Szrj typename _BinaryPredicate>
327*38fd1498Szrj bool
328*38fd1498Szrj is_permutation(_FIter1, _FIter1, _FIter2, _BinaryPredicate);
329*38fd1498Szrj
330*38fd1498Szrj template<typename _FIter>
331*38fd1498Szrj bool
332*38fd1498Szrj is_sorted(_FIter, _FIter);
333*38fd1498Szrj
334*38fd1498Szrj template<typename _FIter, typename _Compare>
335*38fd1498Szrj bool
336*38fd1498Szrj is_sorted(_FIter, _FIter, _Compare);
337*38fd1498Szrj
338*38fd1498Szrj template<typename _FIter>
339*38fd1498Szrj _FIter
340*38fd1498Szrj is_sorted_until(_FIter, _FIter);
341*38fd1498Szrj
342*38fd1498Szrj template<typename _FIter, typename _Compare>
343*38fd1498Szrj _FIter
344*38fd1498Szrj is_sorted_until(_FIter, _FIter, _Compare);
345*38fd1498Szrj #endif
346*38fd1498Szrj
347*38fd1498Szrj template<typename _FIter1, typename _FIter2>
348*38fd1498Szrj void
349*38fd1498Szrj iter_swap(_FIter1, _FIter2);
350*38fd1498Szrj
351*38fd1498Szrj template<typename _FIter, typename _Tp>
352*38fd1498Szrj _FIter
353*38fd1498Szrj lower_bound(_FIter, _FIter, const _Tp&);
354*38fd1498Szrj
355*38fd1498Szrj template<typename _FIter, typename _Tp, typename _Compare>
356*38fd1498Szrj _FIter
357*38fd1498Szrj lower_bound(_FIter, _FIter, const _Tp&, _Compare);
358*38fd1498Szrj
359*38fd1498Szrj template<typename _RAIter>
360*38fd1498Szrj void
361*38fd1498Szrj make_heap(_RAIter, _RAIter);
362*38fd1498Szrj
363*38fd1498Szrj template<typename _RAIter, typename _Compare>
364*38fd1498Szrj void
365*38fd1498Szrj make_heap(_RAIter, _RAIter, _Compare);
366*38fd1498Szrj
367*38fd1498Szrj template<typename _Tp>
368*38fd1498Szrj _GLIBCXX14_CONSTEXPR
369*38fd1498Szrj const _Tp&
370*38fd1498Szrj max(const _Tp&, const _Tp&);
371*38fd1498Szrj
372*38fd1498Szrj template<typename _Tp, typename _Compare>
373*38fd1498Szrj _GLIBCXX14_CONSTEXPR
374*38fd1498Szrj const _Tp&
375*38fd1498Szrj max(const _Tp&, const _Tp&, _Compare);
376*38fd1498Szrj
377*38fd1498Szrj // max_element
378*38fd1498Szrj // merge
379*38fd1498Szrj
380*38fd1498Szrj template<typename _Tp>
381*38fd1498Szrj _GLIBCXX14_CONSTEXPR
382*38fd1498Szrj const _Tp&
383*38fd1498Szrj min(const _Tp&, const _Tp&);
384*38fd1498Szrj
385*38fd1498Szrj template<typename _Tp, typename _Compare>
386*38fd1498Szrj _GLIBCXX14_CONSTEXPR
387*38fd1498Szrj const _Tp&
388*38fd1498Szrj min(const _Tp&, const _Tp&, _Compare);
389*38fd1498Szrj
390*38fd1498Szrj // min_element
391*38fd1498Szrj
392*38fd1498Szrj #if __cplusplus >= 201103L
393*38fd1498Szrj template<typename _Tp>
394*38fd1498Szrj _GLIBCXX14_CONSTEXPR
395*38fd1498Szrj pair<const _Tp&, const _Tp&>
396*38fd1498Szrj minmax(const _Tp&, const _Tp&);
397*38fd1498Szrj
398*38fd1498Szrj template<typename _Tp, typename _Compare>
399*38fd1498Szrj _GLIBCXX14_CONSTEXPR
400*38fd1498Szrj pair<const _Tp&, const _Tp&>
401*38fd1498Szrj minmax(const _Tp&, const _Tp&, _Compare);
402*38fd1498Szrj
403*38fd1498Szrj template<typename _FIter>
404*38fd1498Szrj _GLIBCXX14_CONSTEXPR
405*38fd1498Szrj pair<_FIter, _FIter>
406*38fd1498Szrj minmax_element(_FIter, _FIter);
407*38fd1498Szrj
408*38fd1498Szrj template<typename _FIter, typename _Compare>
409*38fd1498Szrj _GLIBCXX14_CONSTEXPR
410*38fd1498Szrj pair<_FIter, _FIter>
411*38fd1498Szrj minmax_element(_FIter, _FIter, _Compare);
412*38fd1498Szrj
413*38fd1498Szrj template<typename _Tp>
414*38fd1498Szrj _GLIBCXX14_CONSTEXPR
415*38fd1498Szrj _Tp
416*38fd1498Szrj min(initializer_list<_Tp>);
417*38fd1498Szrj
418*38fd1498Szrj template<typename _Tp, typename _Compare>
419*38fd1498Szrj _GLIBCXX14_CONSTEXPR
420*38fd1498Szrj _Tp
421*38fd1498Szrj min(initializer_list<_Tp>, _Compare);
422*38fd1498Szrj
423*38fd1498Szrj template<typename _Tp>
424*38fd1498Szrj _GLIBCXX14_CONSTEXPR
425*38fd1498Szrj _Tp
426*38fd1498Szrj max(initializer_list<_Tp>);
427*38fd1498Szrj
428*38fd1498Szrj template<typename _Tp, typename _Compare>
429*38fd1498Szrj _GLIBCXX14_CONSTEXPR
430*38fd1498Szrj _Tp
431*38fd1498Szrj max(initializer_list<_Tp>, _Compare);
432*38fd1498Szrj
433*38fd1498Szrj template<typename _Tp>
434*38fd1498Szrj _GLIBCXX14_CONSTEXPR
435*38fd1498Szrj pair<_Tp, _Tp>
436*38fd1498Szrj minmax(initializer_list<_Tp>);
437*38fd1498Szrj
438*38fd1498Szrj template<typename _Tp, typename _Compare>
439*38fd1498Szrj _GLIBCXX14_CONSTEXPR
440*38fd1498Szrj pair<_Tp, _Tp>
441*38fd1498Szrj minmax(initializer_list<_Tp>, _Compare);
442*38fd1498Szrj #endif
443*38fd1498Szrj
444*38fd1498Szrj // mismatch
445*38fd1498Szrj
446*38fd1498Szrj template<typename _BIter>
447*38fd1498Szrj bool
448*38fd1498Szrj next_permutation(_BIter, _BIter);
449*38fd1498Szrj
450*38fd1498Szrj template<typename _BIter, typename _Compare>
451*38fd1498Szrj bool
452*38fd1498Szrj next_permutation(_BIter, _BIter, _Compare);
453*38fd1498Szrj
454*38fd1498Szrj #if __cplusplus >= 201103L
455*38fd1498Szrj template<typename _IIter, typename _Predicate>
456*38fd1498Szrj bool
457*38fd1498Szrj none_of(_IIter, _IIter, _Predicate);
458*38fd1498Szrj #endif
459*38fd1498Szrj
460*38fd1498Szrj // nth_element
461*38fd1498Szrj // partial_sort
462*38fd1498Szrj
463*38fd1498Szrj template<typename _IIter, typename _RAIter>
464*38fd1498Szrj _RAIter
465*38fd1498Szrj partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter);
466*38fd1498Szrj
467*38fd1498Szrj template<typename _IIter, typename _RAIter, typename _Compare>
468*38fd1498Szrj _RAIter
469*38fd1498Szrj partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter, _Compare);
470*38fd1498Szrj
471*38fd1498Szrj // partition
472*38fd1498Szrj
473*38fd1498Szrj #if __cplusplus >= 201103L
474*38fd1498Szrj template<typename _IIter, typename _OIter1,
475*38fd1498Szrj typename _OIter2, typename _Predicate>
476*38fd1498Szrj pair<_OIter1, _OIter2>
477*38fd1498Szrj partition_copy(_IIter, _IIter, _OIter1, _OIter2, _Predicate);
478*38fd1498Szrj
479*38fd1498Szrj template<typename _FIter, typename _Predicate>
480*38fd1498Szrj _FIter
481*38fd1498Szrj partition_point(_FIter, _FIter, _Predicate);
482*38fd1498Szrj #endif
483*38fd1498Szrj
484*38fd1498Szrj template<typename _RAIter>
485*38fd1498Szrj void
486*38fd1498Szrj pop_heap(_RAIter, _RAIter);
487*38fd1498Szrj
488*38fd1498Szrj template<typename _RAIter, typename _Compare>
489*38fd1498Szrj void
490*38fd1498Szrj pop_heap(_RAIter, _RAIter, _Compare);
491*38fd1498Szrj
492*38fd1498Szrj template<typename _BIter>
493*38fd1498Szrj bool
494*38fd1498Szrj prev_permutation(_BIter, _BIter);
495*38fd1498Szrj
496*38fd1498Szrj template<typename _BIter, typename _Compare>
497*38fd1498Szrj bool
498*38fd1498Szrj prev_permutation(_BIter, _BIter, _Compare);
499*38fd1498Szrj
500*38fd1498Szrj template<typename _RAIter>
501*38fd1498Szrj void
502*38fd1498Szrj push_heap(_RAIter, _RAIter);
503*38fd1498Szrj
504*38fd1498Szrj template<typename _RAIter, typename _Compare>
505*38fd1498Szrj void
506*38fd1498Szrj push_heap(_RAIter, _RAIter, _Compare);
507*38fd1498Szrj
508*38fd1498Szrj // random_shuffle
509*38fd1498Szrj
510*38fd1498Szrj template<typename _FIter, typename _Tp>
511*38fd1498Szrj _FIter
512*38fd1498Szrj remove(_FIter, _FIter, const _Tp&);
513*38fd1498Szrj
514*38fd1498Szrj template<typename _FIter, typename _Predicate>
515*38fd1498Szrj _FIter
516*38fd1498Szrj remove_if(_FIter, _FIter, _Predicate);
517*38fd1498Szrj
518*38fd1498Szrj template<typename _IIter, typename _OIter, typename _Tp>
519*38fd1498Szrj _OIter
520*38fd1498Szrj remove_copy(_IIter, _IIter, _OIter, const _Tp&);
521*38fd1498Szrj
522*38fd1498Szrj template<typename _IIter, typename _OIter, typename _Predicate>
523*38fd1498Szrj _OIter
524*38fd1498Szrj remove_copy_if(_IIter, _IIter, _OIter, _Predicate);
525*38fd1498Szrj
526*38fd1498Szrj // replace
527*38fd1498Szrj
528*38fd1498Szrj template<typename _IIter, typename _OIter, typename _Tp>
529*38fd1498Szrj _OIter
530*38fd1498Szrj replace_copy(_IIter, _IIter, _OIter, const _Tp&, const _Tp&);
531*38fd1498Szrj
532*38fd1498Szrj template<typename _Iter, typename _OIter, typename _Predicate, typename _Tp>
533*38fd1498Szrj _OIter
534*38fd1498Szrj replace_copy_if(_Iter, _Iter, _OIter, _Predicate, const _Tp&);
535*38fd1498Szrj
536*38fd1498Szrj // replace_if
537*38fd1498Szrj
538*38fd1498Szrj template<typename _BIter>
539*38fd1498Szrj void
540*38fd1498Szrj reverse(_BIter, _BIter);
541*38fd1498Szrj
542*38fd1498Szrj template<typename _BIter, typename _OIter>
543*38fd1498Szrj _OIter
544*38fd1498Szrj reverse_copy(_BIter, _BIter, _OIter);
545*38fd1498Szrj
546*38fd1498Szrj inline namespace _V2
547*38fd1498Szrj {
548*38fd1498Szrj template<typename _FIter>
549*38fd1498Szrj _FIter
550*38fd1498Szrj rotate(_FIter, _FIter, _FIter);
551*38fd1498Szrj }
552*38fd1498Szrj
553*38fd1498Szrj template<typename _FIter, typename _OIter>
554*38fd1498Szrj _OIter
555*38fd1498Szrj rotate_copy(_FIter, _FIter, _FIter, _OIter);
556*38fd1498Szrj
557*38fd1498Szrj // search
558*38fd1498Szrj // search_n
559*38fd1498Szrj // set_difference
560*38fd1498Szrj // set_intersection
561*38fd1498Szrj // set_symmetric_difference
562*38fd1498Szrj // set_union
563*38fd1498Szrj
564*38fd1498Szrj #if (__cplusplus >= 201103L) && defined(_GLIBCXX_USE_C99_STDINT_TR1)
565*38fd1498Szrj template<typename _RAIter, typename _UGenerator>
566*38fd1498Szrj void
567*38fd1498Szrj shuffle(_RAIter, _RAIter, _UGenerator&&);
568*38fd1498Szrj #endif
569*38fd1498Szrj
570*38fd1498Szrj template<typename _RAIter>
571*38fd1498Szrj void
572*38fd1498Szrj sort_heap(_RAIter, _RAIter);
573*38fd1498Szrj
574*38fd1498Szrj template<typename _RAIter, typename _Compare>
575*38fd1498Szrj void
576*38fd1498Szrj sort_heap(_RAIter, _RAIter, _Compare);
577*38fd1498Szrj
578*38fd1498Szrj template<typename _BIter, typename _Predicate>
579*38fd1498Szrj _BIter
580*38fd1498Szrj stable_partition(_BIter, _BIter, _Predicate);
581*38fd1498Szrj
582*38fd1498Szrj #if __cplusplus < 201103L
583*38fd1498Szrj // For C++11 swap() is declared in <type_traits>.
584*38fd1498Szrj
585*38fd1498Szrj template<typename _Tp, size_t _Nm>
586*38fd1498Szrj inline void
587*38fd1498Szrj swap(_Tp& __a, _Tp& __b);
588*38fd1498Szrj
589*38fd1498Szrj template<typename _Tp, size_t _Nm>
590*38fd1498Szrj inline void
591*38fd1498Szrj swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]);
592*38fd1498Szrj #endif
593*38fd1498Szrj
594*38fd1498Szrj template<typename _FIter1, typename _FIter2>
595*38fd1498Szrj _FIter2
596*38fd1498Szrj swap_ranges(_FIter1, _FIter1, _FIter2);
597*38fd1498Szrj
598*38fd1498Szrj // transform
599*38fd1498Szrj
600*38fd1498Szrj template<typename _FIter>
601*38fd1498Szrj _FIter
602*38fd1498Szrj unique(_FIter, _FIter);
603*38fd1498Szrj
604*38fd1498Szrj template<typename _FIter, typename _BinaryPredicate>
605*38fd1498Szrj _FIter
606*38fd1498Szrj unique(_FIter, _FIter, _BinaryPredicate);
607*38fd1498Szrj
608*38fd1498Szrj // unique_copy
609*38fd1498Szrj
610*38fd1498Szrj template<typename _FIter, typename _Tp>
611*38fd1498Szrj _FIter
612*38fd1498Szrj upper_bound(_FIter, _FIter, const _Tp&);
613*38fd1498Szrj
614*38fd1498Szrj template<typename _FIter, typename _Tp, typename _Compare>
615*38fd1498Szrj _FIter
616*38fd1498Szrj upper_bound(_FIter, _FIter, const _Tp&, _Compare);
617*38fd1498Szrj
618*38fd1498Szrj _GLIBCXX_BEGIN_NAMESPACE_ALGO
619*38fd1498Szrj
620*38fd1498Szrj template<typename _FIter>
621*38fd1498Szrj _FIter
622*38fd1498Szrj adjacent_find(_FIter, _FIter);
623*38fd1498Szrj
624*38fd1498Szrj template<typename _FIter, typename _BinaryPredicate>
625*38fd1498Szrj _FIter
626*38fd1498Szrj adjacent_find(_FIter, _FIter, _BinaryPredicate);
627*38fd1498Szrj
628*38fd1498Szrj template<typename _IIter, typename _Tp>
629*38fd1498Szrj typename iterator_traits<_IIter>::difference_type
630*38fd1498Szrj count(_IIter, _IIter, const _Tp&);
631*38fd1498Szrj
632*38fd1498Szrj template<typename _IIter, typename _Predicate>
633*38fd1498Szrj typename iterator_traits<_IIter>::difference_type
634*38fd1498Szrj count_if(_IIter, _IIter, _Predicate);
635*38fd1498Szrj
636*38fd1498Szrj template<typename _IIter1, typename _IIter2>
637*38fd1498Szrj bool
638*38fd1498Szrj equal(_IIter1, _IIter1, _IIter2);
639*38fd1498Szrj
640*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _BinaryPredicate>
641*38fd1498Szrj bool
642*38fd1498Szrj equal(_IIter1, _IIter1, _IIter2, _BinaryPredicate);
643*38fd1498Szrj
644*38fd1498Szrj template<typename _IIter, typename _Tp>
645*38fd1498Szrj _IIter
646*38fd1498Szrj find(_IIter, _IIter, const _Tp&);
647*38fd1498Szrj
648*38fd1498Szrj template<typename _FIter1, typename _FIter2>
649*38fd1498Szrj _FIter1
650*38fd1498Szrj find_first_of(_FIter1, _FIter1, _FIter2, _FIter2);
651*38fd1498Szrj
652*38fd1498Szrj template<typename _FIter1, typename _FIter2, typename _BinaryPredicate>
653*38fd1498Szrj _FIter1
654*38fd1498Szrj find_first_of(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
655*38fd1498Szrj
656*38fd1498Szrj template<typename _IIter, typename _Predicate>
657*38fd1498Szrj _IIter
658*38fd1498Szrj find_if(_IIter, _IIter, _Predicate);
659*38fd1498Szrj
660*38fd1498Szrj template<typename _IIter, typename _Funct>
661*38fd1498Szrj _Funct
662*38fd1498Szrj for_each(_IIter, _IIter, _Funct);
663*38fd1498Szrj
664*38fd1498Szrj template<typename _FIter, typename _Generator>
665*38fd1498Szrj void
666*38fd1498Szrj generate(_FIter, _FIter, _Generator);
667*38fd1498Szrj
668*38fd1498Szrj template<typename _OIter, typename _Size, typename _Generator>
669*38fd1498Szrj _OIter
670*38fd1498Szrj generate_n(_OIter, _Size, _Generator);
671*38fd1498Szrj
672*38fd1498Szrj template<typename _IIter1, typename _IIter2>
673*38fd1498Szrj bool
674*38fd1498Szrj lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2);
675*38fd1498Szrj
676*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _Compare>
677*38fd1498Szrj bool
678*38fd1498Szrj lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2, _Compare);
679*38fd1498Szrj
680*38fd1498Szrj template<typename _FIter>
681*38fd1498Szrj _GLIBCXX14_CONSTEXPR
682*38fd1498Szrj _FIter
683*38fd1498Szrj max_element(_FIter, _FIter);
684*38fd1498Szrj
685*38fd1498Szrj template<typename _FIter, typename _Compare>
686*38fd1498Szrj _GLIBCXX14_CONSTEXPR
687*38fd1498Szrj _FIter
688*38fd1498Szrj max_element(_FIter, _FIter, _Compare);
689*38fd1498Szrj
690*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _OIter>
691*38fd1498Szrj _OIter
692*38fd1498Szrj merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
693*38fd1498Szrj
694*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _OIter,
695*38fd1498Szrj typename _Compare>
696*38fd1498Szrj _OIter
697*38fd1498Szrj merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
698*38fd1498Szrj
699*38fd1498Szrj template<typename _FIter>
700*38fd1498Szrj _GLIBCXX14_CONSTEXPR
701*38fd1498Szrj _FIter
702*38fd1498Szrj min_element(_FIter, _FIter);
703*38fd1498Szrj
704*38fd1498Szrj template<typename _FIter, typename _Compare>
705*38fd1498Szrj _GLIBCXX14_CONSTEXPR
706*38fd1498Szrj _FIter
707*38fd1498Szrj min_element(_FIter, _FIter, _Compare);
708*38fd1498Szrj
709*38fd1498Szrj template<typename _IIter1, typename _IIter2>
710*38fd1498Szrj pair<_IIter1, _IIter2>
711*38fd1498Szrj mismatch(_IIter1, _IIter1, _IIter2);
712*38fd1498Szrj
713*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _BinaryPredicate>
714*38fd1498Szrj pair<_IIter1, _IIter2>
715*38fd1498Szrj mismatch(_IIter1, _IIter1, _IIter2, _BinaryPredicate);
716*38fd1498Szrj
717*38fd1498Szrj template<typename _RAIter>
718*38fd1498Szrj void
719*38fd1498Szrj nth_element(_RAIter, _RAIter, _RAIter);
720*38fd1498Szrj
721*38fd1498Szrj template<typename _RAIter, typename _Compare>
722*38fd1498Szrj void
723*38fd1498Szrj nth_element(_RAIter, _RAIter, _RAIter, _Compare);
724*38fd1498Szrj
725*38fd1498Szrj template<typename _RAIter>
726*38fd1498Szrj void
727*38fd1498Szrj partial_sort(_RAIter, _RAIter, _RAIter);
728*38fd1498Szrj
729*38fd1498Szrj template<typename _RAIter, typename _Compare>
730*38fd1498Szrj void
731*38fd1498Szrj partial_sort(_RAIter, _RAIter, _RAIter, _Compare);
732*38fd1498Szrj
733*38fd1498Szrj template<typename _BIter, typename _Predicate>
734*38fd1498Szrj _BIter
735*38fd1498Szrj partition(_BIter, _BIter, _Predicate);
736*38fd1498Szrj
737*38fd1498Szrj template<typename _RAIter>
738*38fd1498Szrj void
739*38fd1498Szrj random_shuffle(_RAIter, _RAIter);
740*38fd1498Szrj
741*38fd1498Szrj template<typename _RAIter, typename _Generator>
742*38fd1498Szrj void
743*38fd1498Szrj random_shuffle(_RAIter, _RAIter,
744*38fd1498Szrj #if __cplusplus >= 201103L
745*38fd1498Szrj _Generator&&);
746*38fd1498Szrj #else
747*38fd1498Szrj _Generator&);
748*38fd1498Szrj #endif
749*38fd1498Szrj
750*38fd1498Szrj template<typename _FIter, typename _Tp>
751*38fd1498Szrj void
752*38fd1498Szrj replace(_FIter, _FIter, const _Tp&, const _Tp&);
753*38fd1498Szrj
754*38fd1498Szrj template<typename _FIter, typename _Predicate, typename _Tp>
755*38fd1498Szrj void
756*38fd1498Szrj replace_if(_FIter, _FIter, _Predicate, const _Tp&);
757*38fd1498Szrj
758*38fd1498Szrj template<typename _FIter1, typename _FIter2>
759*38fd1498Szrj _FIter1
760*38fd1498Szrj search(_FIter1, _FIter1, _FIter2, _FIter2);
761*38fd1498Szrj
762*38fd1498Szrj template<typename _FIter1, typename _FIter2, typename _BinaryPredicate>
763*38fd1498Szrj _FIter1
764*38fd1498Szrj search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
765*38fd1498Szrj
766*38fd1498Szrj template<typename _FIter, typename _Size, typename _Tp>
767*38fd1498Szrj _FIter
768*38fd1498Szrj search_n(_FIter, _FIter, _Size, const _Tp&);
769*38fd1498Szrj
770*38fd1498Szrj template<typename _FIter, typename _Size, typename _Tp,
771*38fd1498Szrj typename _BinaryPredicate>
772*38fd1498Szrj _FIter
773*38fd1498Szrj search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
774*38fd1498Szrj
775*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _OIter>
776*38fd1498Szrj _OIter
777*38fd1498Szrj set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
778*38fd1498Szrj
779*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _OIter,
780*38fd1498Szrj typename _Compare>
781*38fd1498Szrj _OIter
782*38fd1498Szrj set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
783*38fd1498Szrj
784*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _OIter>
785*38fd1498Szrj _OIter
786*38fd1498Szrj set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
787*38fd1498Szrj
788*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _OIter,
789*38fd1498Szrj typename _Compare>
790*38fd1498Szrj _OIter
791*38fd1498Szrj set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
792*38fd1498Szrj
793*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _OIter>
794*38fd1498Szrj _OIter
795*38fd1498Szrj set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
796*38fd1498Szrj
797*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _OIter,
798*38fd1498Szrj typename _Compare>
799*38fd1498Szrj _OIter
800*38fd1498Szrj set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2,
801*38fd1498Szrj _OIter, _Compare);
802*38fd1498Szrj
803*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _OIter>
804*38fd1498Szrj _OIter
805*38fd1498Szrj set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
806*38fd1498Szrj
807*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _OIter,
808*38fd1498Szrj typename _Compare>
809*38fd1498Szrj _OIter
810*38fd1498Szrj set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
811*38fd1498Szrj
812*38fd1498Szrj template<typename _RAIter>
813*38fd1498Szrj void
814*38fd1498Szrj sort(_RAIter, _RAIter);
815*38fd1498Szrj
816*38fd1498Szrj template<typename _RAIter, typename _Compare>
817*38fd1498Szrj void
818*38fd1498Szrj sort(_RAIter, _RAIter, _Compare);
819*38fd1498Szrj
820*38fd1498Szrj template<typename _RAIter>
821*38fd1498Szrj void
822*38fd1498Szrj stable_sort(_RAIter, _RAIter);
823*38fd1498Szrj
824*38fd1498Szrj template<typename _RAIter, typename _Compare>
825*38fd1498Szrj void
826*38fd1498Szrj stable_sort(_RAIter, _RAIter, _Compare);
827*38fd1498Szrj
828*38fd1498Szrj template<typename _IIter, typename _OIter, typename _UnaryOperation>
829*38fd1498Szrj _OIter
830*38fd1498Szrj transform(_IIter, _IIter, _OIter, _UnaryOperation);
831*38fd1498Szrj
832*38fd1498Szrj template<typename _IIter1, typename _IIter2, typename _OIter,
833*38fd1498Szrj typename _BinaryOperation>
834*38fd1498Szrj _OIter
835*38fd1498Szrj transform(_IIter1, _IIter1, _IIter2, _OIter, _BinaryOperation);
836*38fd1498Szrj
837*38fd1498Szrj template<typename _IIter, typename _OIter>
838*38fd1498Szrj _OIter
839*38fd1498Szrj unique_copy(_IIter, _IIter, _OIter);
840*38fd1498Szrj
841*38fd1498Szrj template<typename _IIter, typename _OIter, typename _BinaryPredicate>
842*38fd1498Szrj _OIter
843*38fd1498Szrj unique_copy(_IIter, _IIter, _OIter, _BinaryPredicate);
844*38fd1498Szrj
845*38fd1498Szrj _GLIBCXX_END_NAMESPACE_ALGO
846*38fd1498Szrj _GLIBCXX_END_NAMESPACE_VERSION
847*38fd1498Szrj } // namespace std
848*38fd1498Szrj
849*38fd1498Szrj #ifdef _GLIBCXX_PARALLEL
850*38fd1498Szrj # include <parallel/algorithmfwd.h>
851*38fd1498Szrj #endif
852*38fd1498Szrj
853*38fd1498Szrj #endif
854*38fd1498Szrj
855