1 // Core algorithmic facilities -*- C++ -*-
3 // Copyright (C) 2001-2017 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
28 * Hewlett-Packard Company
30 * Permission to use, copy, modify, distribute and sell this software
31 * and its documentation for any purpose is hereby granted without fee,
32 * provided that the above copyright notice appear in all copies and
33 * that both that copyright notice and this permission notice appear
34 * in supporting documentation. Hewlett-Packard Company makes no
35 * representations about the suitability of this software for any
36 * purpose. It is provided "as is" without express or implied warranty.
39 * Copyright (c) 1996-1998
40 * Silicon Graphics Computer Systems, Inc.
42 * Permission to use, copy, modify, distribute and sell this software
43 * and its documentation for any purpose is hereby granted without fee,
44 * provided that the above copyright notice appear in all copies and
45 * that both that copyright notice and this permission notice appear
46 * in supporting documentation. Silicon Graphics makes no
47 * representations about the suitability of this software for any
48 * purpose. It is provided "as is" without express or implied warranty.
51 /** @file bits/stl_algobase.h
52 * This is an internal header file, included by other library headers.
53 * Do not attempt to use it directly. @headername{algorithm}
56 #ifndef _STL_ALGOBASE_H
57 #define _STL_ALGOBASE_H 1
59 #include <bits/c++config.h>
60 #include <bits/functexcept.h>
61 #include <bits/cpp_type_traits.h>
62 #include <ext/type_traits.h>
63 #include <ext/numeric_traits.h>
64 #include <bits/stl_pair.h>
65 #include <bits/stl_iterator_base_types.h>
66 #include <bits/stl_iterator_base_funcs.h>
67 #include <bits/stl_iterator.h>
68 #include <bits/concept_check.h>
69 #include <debug/debug.h>
70 #include <bits/move.h> // For std::swap
71 #include <bits/predefined_ops.h>
73 namespace std
_GLIBCXX_VISIBILITY(default)
75 _GLIBCXX_BEGIN_NAMESPACE_VERSION
77 #if __cplusplus < 201103L
78 // See http://gcc.gnu.org/ml/libstdc++/2004-08/msg00167.html: in a
79 // nutshell, we are partially implementing the resolution of DR 187,
80 // when it's safe, i.e., the value_types are equal.
81 template<bool _BoolType
>
84 template<typename _ForwardIterator1
, typename _ForwardIterator2
>
86 iter_swap(_ForwardIterator1 __a
, _ForwardIterator2 __b
)
88 typedef typename iterator_traits
<_ForwardIterator1
>::value_type
90 _ValueType1 __tmp
= *__a
;
97 struct __iter_swap
<true>
99 template<typename _ForwardIterator1
, typename _ForwardIterator2
>
101 iter_swap(_ForwardIterator1 __a
, _ForwardIterator2 __b
)
109 * @brief Swaps the contents of two iterators.
110 * @ingroup mutating_algorithms
111 * @param __a An iterator.
112 * @param __b Another iterator.
115 * This function swaps the values pointed to by two iterators, not the
116 * iterators themselves.
118 template<typename _ForwardIterator1
, typename _ForwardIterator2
>
120 iter_swap(_ForwardIterator1 __a
, _ForwardIterator2 __b
)
122 // concept requirements
123 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
125 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
128 #if __cplusplus < 201103L
129 typedef typename iterator_traits
<_ForwardIterator1
>::value_type
131 typedef typename iterator_traits
<_ForwardIterator2
>::value_type
134 __glibcxx_function_requires(_ConvertibleConcept
<_ValueType1
,
136 __glibcxx_function_requires(_ConvertibleConcept
<_ValueType2
,
139 typedef typename iterator_traits
<_ForwardIterator1
>::reference
141 typedef typename iterator_traits
<_ForwardIterator2
>::reference
143 std::__iter_swap
<__are_same
<_ValueType1
, _ValueType2
>::__value
144 && __are_same
<_ValueType1
&, _ReferenceType1
>::__value
145 && __are_same
<_ValueType2
&, _ReferenceType2
>::__value
>::
153 * @brief Swap the elements of two sequences.
154 * @ingroup mutating_algorithms
155 * @param __first1 A forward iterator.
156 * @param __last1 A forward iterator.
157 * @param __first2 A forward iterator.
158 * @return An iterator equal to @p first2+(last1-first1).
160 * Swaps each element in the range @p [first1,last1) with the
161 * corresponding element in the range @p [first2,(last1-first1)).
162 * The ranges must not overlap.
164 template<typename _ForwardIterator1
, typename _ForwardIterator2
>
166 swap_ranges(_ForwardIterator1 __first1
, _ForwardIterator1 __last1
,
167 _ForwardIterator2 __first2
)
169 // concept requirements
170 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
172 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
174 __glibcxx_requires_valid_range(__first1
, __last1
);
176 for (; __first1
!= __last1
; ++__first1
, (void)++__first2
)
177 std::iter_swap(__first1
, __first2
);
182 * @brief This does what you think it does.
183 * @ingroup sorting_algorithms
184 * @param __a A thing of arbitrary type.
185 * @param __b Another thing of arbitrary type.
186 * @return The lesser of the parameters.
188 * This is the simple classic generic implementation. It will work on
189 * temporary expressions, since they are only evaluated once, unlike a
190 * preprocessor macro.
192 template<typename _Tp
>
195 min(const _Tp
& __a
, const _Tp
& __b
)
197 // concept requirements
198 __glibcxx_function_requires(_LessThanComparableConcept
<_Tp
>)
199 //return __b < __a ? __b : __a;
206 * @brief This does what you think it does.
207 * @ingroup sorting_algorithms
208 * @param __a A thing of arbitrary type.
209 * @param __b Another thing of arbitrary type.
210 * @return The greater of the parameters.
212 * This is the simple classic generic implementation. It will work on
213 * temporary expressions, since they are only evaluated once, unlike a
214 * preprocessor macro.
216 template<typename _Tp
>
219 max(const _Tp
& __a
, const _Tp
& __b
)
221 // concept requirements
222 __glibcxx_function_requires(_LessThanComparableConcept
<_Tp
>)
223 //return __a < __b ? __b : __a;
230 * @brief This does what you think it does.
231 * @ingroup sorting_algorithms
232 * @param __a A thing of arbitrary type.
233 * @param __b Another thing of arbitrary type.
234 * @param __comp A @link comparison_functors comparison functor@endlink.
235 * @return The lesser of the parameters.
237 * This will work on temporary expressions, since they are only evaluated
238 * once, unlike a preprocessor macro.
240 template<typename _Tp
, typename _Compare
>
243 min(const _Tp
& __a
, const _Tp
& __b
, _Compare __comp
)
245 //return __comp(__b, __a) ? __b : __a;
246 if (__comp(__b
, __a
))
252 * @brief This does what you think it does.
253 * @ingroup sorting_algorithms
254 * @param __a A thing of arbitrary type.
255 * @param __b Another thing of arbitrary type.
256 * @param __comp A @link comparison_functors comparison functor@endlink.
257 * @return The greater of the parameters.
259 * This will work on temporary expressions, since they are only evaluated
260 * once, unlike a preprocessor macro.
262 template<typename _Tp
, typename _Compare
>
265 max(const _Tp
& __a
, const _Tp
& __b
, _Compare __comp
)
267 //return __comp(__a, __b) ? __b : __a;
268 if (__comp(__a
, __b
))
273 // Fallback implementation of the function in bits/stl_iterator.h used to
274 // remove the __normal_iterator wrapper. See copy, fill, ...
275 template<typename _Iterator
>
277 __niter_base(_Iterator __it
)
280 // All of these auxiliary structs serve two purposes. (1) Replace
281 // calls to copy with memmove whenever possible. (Memmove, not memcpy,
282 // because the input and output ranges are permitted to overlap.)
283 // (2) If we're using random access iterators, then write the loop as
284 // a for loop with an explicit count.
286 template<bool, bool, typename
>
289 template<typename _II
, typename _OI
>
291 __copy_m(_II __first
, _II __last
, _OI __result
)
293 for (; __first
!= __last
; ++__result
, (void)++__first
)
294 *__result
= *__first
;
299 #if __cplusplus >= 201103L
300 template<typename _Category
>
301 struct __copy_move
<true, false, _Category
>
303 template<typename _II
, typename _OI
>
305 __copy_m(_II __first
, _II __last
, _OI __result
)
307 for (; __first
!= __last
; ++__result
, (void)++__first
)
308 *__result
= std::move(*__first
);
315 struct __copy_move
<false, false, random_access_iterator_tag
>
317 template<typename _II
, typename _OI
>
319 __copy_m(_II __first
, _II __last
, _OI __result
)
321 typedef typename iterator_traits
<_II
>::difference_type _Distance
;
322 for(_Distance __n
= __last
- __first
; __n
> 0; --__n
)
324 *__result
= *__first
;
332 #if __cplusplus >= 201103L
334 struct __copy_move
<true, false, random_access_iterator_tag
>
336 template<typename _II
, typename _OI
>
338 __copy_m(_II __first
, _II __last
, _OI __result
)
340 typedef typename iterator_traits
<_II
>::difference_type _Distance
;
341 for(_Distance __n
= __last
- __first
; __n
> 0; --__n
)
343 *__result
= std::move(*__first
);
352 template<bool _IsMove
>
353 struct __copy_move
<_IsMove
, true, random_access_iterator_tag
>
355 template<typename _Tp
>
357 __copy_m(const _Tp
* __first
, const _Tp
* __last
, _Tp
* __result
)
359 #if __cplusplus >= 201103L
360 using __assignable
= conditional
<_IsMove
,
361 is_move_assignable
<_Tp
>,
362 is_copy_assignable
<_Tp
>>;
363 // trivial types can have deleted assignment
364 static_assert( __assignable::type::value
, "type is not assignable" );
366 const ptrdiff_t _Num
= __last
- __first
;
368 __builtin_memmove(__result
, __first
, sizeof(_Tp
) * _Num
);
369 return __result
+ _Num
;
373 template<bool _IsMove
, typename _II
, typename _OI
>
375 __copy_move_a(_II __first
, _II __last
, _OI __result
)
377 typedef typename iterator_traits
<_II
>::value_type _ValueTypeI
;
378 typedef typename iterator_traits
<_OI
>::value_type _ValueTypeO
;
379 typedef typename iterator_traits
<_II
>::iterator_category _Category
;
380 const bool __simple
= (__is_trivial(_ValueTypeI
)
381 && __is_pointer
<_II
>::__value
382 && __is_pointer
<_OI
>::__value
383 && __are_same
<_ValueTypeI
, _ValueTypeO
>::__value
);
385 return std::__copy_move
<_IsMove
, __simple
,
386 _Category
>::__copy_m(__first
, __last
, __result
);
389 // Helpers for streambuf iterators (either istream or ostream).
390 // NB: avoid including <iosfwd>, relatively large.
391 template<typename _CharT
>
394 template<typename _CharT
, typename _Traits
>
395 class istreambuf_iterator
;
397 template<typename _CharT
, typename _Traits
>
398 class ostreambuf_iterator
;
400 template<bool _IsMove
, typename _CharT
>
401 typename
__gnu_cxx::__enable_if
<__is_char
<_CharT
>::__value
,
402 ostreambuf_iterator
<_CharT
, char_traits
<_CharT
> > >::__type
403 __copy_move_a2(_CharT
*, _CharT
*,
404 ostreambuf_iterator
<_CharT
, char_traits
<_CharT
> >);
406 template<bool _IsMove
, typename _CharT
>
407 typename
__gnu_cxx::__enable_if
<__is_char
<_CharT
>::__value
,
408 ostreambuf_iterator
<_CharT
, char_traits
<_CharT
> > >::__type
409 __copy_move_a2(const _CharT
*, const _CharT
*,
410 ostreambuf_iterator
<_CharT
, char_traits
<_CharT
> >);
412 template<bool _IsMove
, typename _CharT
>
413 typename
__gnu_cxx::__enable_if
<__is_char
<_CharT
>::__value
,
415 __copy_move_a2(istreambuf_iterator
<_CharT
, char_traits
<_CharT
> >,
416 istreambuf_iterator
<_CharT
, char_traits
<_CharT
> >, _CharT
*);
418 template<bool _IsMove
, typename _II
, typename _OI
>
420 __copy_move_a2(_II __first
, _II __last
, _OI __result
)
422 return _OI(std::__copy_move_a
<_IsMove
>(std::__niter_base(__first
),
423 std::__niter_base(__last
),
424 std::__niter_base(__result
)));
428 * @brief Copies the range [first,last) into result.
429 * @ingroup mutating_algorithms
430 * @param __first An input iterator.
431 * @param __last An input iterator.
432 * @param __result An output iterator.
433 * @return result + (first - last)
435 * This inline function will boil down to a call to @c memmove whenever
436 * possible. Failing that, if random access iterators are passed, then the
437 * loop count will be known (and therefore a candidate for compiler
438 * optimizations such as unrolling). Result may not be contained within
439 * [first,last); the copy_backward function should be used instead.
441 * Note that the end of the output range is permitted to be contained
442 * within [first,last).
444 template<typename _II
, typename _OI
>
446 copy(_II __first
, _II __last
, _OI __result
)
448 // concept requirements
449 __glibcxx_function_requires(_InputIteratorConcept
<_II
>)
450 __glibcxx_function_requires(_OutputIteratorConcept
<_OI
,
451 typename iterator_traits
<_II
>::value_type
>)
452 __glibcxx_requires_valid_range(__first
, __last
);
454 return (std::__copy_move_a2
<__is_move_iterator
<_II
>::__value
>
455 (std::__miter_base(__first
), std::__miter_base(__last
),
459 #if __cplusplus >= 201103L
461 * @brief Moves the range [first,last) into result.
462 * @ingroup mutating_algorithms
463 * @param __first An input iterator.
464 * @param __last An input iterator.
465 * @param __result An output iterator.
466 * @return result + (first - last)
468 * This inline function will boil down to a call to @c memmove whenever
469 * possible. Failing that, if random access iterators are passed, then the
470 * loop count will be known (and therefore a candidate for compiler
471 * optimizations such as unrolling). Result may not be contained within
472 * [first,last); the move_backward function should be used instead.
474 * Note that the end of the output range is permitted to be contained
475 * within [first,last).
477 template<typename _II
, typename _OI
>
479 move(_II __first
, _II __last
, _OI __result
)
481 // concept requirements
482 __glibcxx_function_requires(_InputIteratorConcept
<_II
>)
483 __glibcxx_function_requires(_OutputIteratorConcept
<_OI
,
484 typename iterator_traits
<_II
>::value_type
>)
485 __glibcxx_requires_valid_range(__first
, __last
);
487 return std::__copy_move_a2
<true>(std::__miter_base(__first
),
488 std::__miter_base(__last
), __result
);
491 #define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::move(_Tp, _Up, _Vp)
493 #define _GLIBCXX_MOVE3(_Tp, _Up, _Vp) std::copy(_Tp, _Up, _Vp)
496 template<bool, bool, typename
>
497 struct __copy_move_backward
499 template<typename _BI1
, typename _BI2
>
501 __copy_move_b(_BI1 __first
, _BI1 __last
, _BI2 __result
)
503 while (__first
!= __last
)
504 *--__result
= *--__last
;
509 #if __cplusplus >= 201103L
510 template<typename _Category
>
511 struct __copy_move_backward
<true, false, _Category
>
513 template<typename _BI1
, typename _BI2
>
515 __copy_move_b(_BI1 __first
, _BI1 __last
, _BI2 __result
)
517 while (__first
!= __last
)
518 *--__result
= std::move(*--__last
);
525 struct __copy_move_backward
<false, false, random_access_iterator_tag
>
527 template<typename _BI1
, typename _BI2
>
529 __copy_move_b(_BI1 __first
, _BI1 __last
, _BI2 __result
)
531 typename iterator_traits
<_BI1
>::difference_type __n
;
532 for (__n
= __last
- __first
; __n
> 0; --__n
)
533 *--__result
= *--__last
;
538 #if __cplusplus >= 201103L
540 struct __copy_move_backward
<true, false, random_access_iterator_tag
>
542 template<typename _BI1
, typename _BI2
>
544 __copy_move_b(_BI1 __first
, _BI1 __last
, _BI2 __result
)
546 typename iterator_traits
<_BI1
>::difference_type __n
;
547 for (__n
= __last
- __first
; __n
> 0; --__n
)
548 *--__result
= std::move(*--__last
);
554 template<bool _IsMove
>
555 struct __copy_move_backward
<_IsMove
, true, random_access_iterator_tag
>
557 template<typename _Tp
>
559 __copy_move_b(const _Tp
* __first
, const _Tp
* __last
, _Tp
* __result
)
561 #if __cplusplus >= 201103L
562 using __assignable
= conditional
<_IsMove
,
563 is_move_assignable
<_Tp
>,
564 is_copy_assignable
<_Tp
>>;
565 // trivial types can have deleted assignment
566 static_assert( __assignable::type::value
, "type is not assignable" );
568 const ptrdiff_t _Num
= __last
- __first
;
570 __builtin_memmove(__result
- _Num
, __first
, sizeof(_Tp
) * _Num
);
571 return __result
- _Num
;
575 template<bool _IsMove
, typename _BI1
, typename _BI2
>
577 __copy_move_backward_a(_BI1 __first
, _BI1 __last
, _BI2 __result
)
579 typedef typename iterator_traits
<_BI1
>::value_type _ValueType1
;
580 typedef typename iterator_traits
<_BI2
>::value_type _ValueType2
;
581 typedef typename iterator_traits
<_BI1
>::iterator_category _Category
;
582 const bool __simple
= (__is_trivial(_ValueType1
)
583 && __is_pointer
<_BI1
>::__value
584 && __is_pointer
<_BI2
>::__value
585 && __are_same
<_ValueType1
, _ValueType2
>::__value
);
587 return std::__copy_move_backward
<_IsMove
, __simple
,
588 _Category
>::__copy_move_b(__first
,
593 template<bool _IsMove
, typename _BI1
, typename _BI2
>
595 __copy_move_backward_a2(_BI1 __first
, _BI1 __last
, _BI2 __result
)
597 return _BI2(std::__copy_move_backward_a
<_IsMove
>
598 (std::__niter_base(__first
), std::__niter_base(__last
),
599 std::__niter_base(__result
)));
603 * @brief Copies the range [first,last) into result.
604 * @ingroup mutating_algorithms
605 * @param __first A bidirectional iterator.
606 * @param __last A bidirectional iterator.
607 * @param __result A bidirectional iterator.
608 * @return result - (first - last)
610 * The function has the same effect as copy, but starts at the end of the
611 * range and works its way to the start, returning the start of the result.
612 * This inline function will boil down to a call to @c memmove whenever
613 * possible. Failing that, if random access iterators are passed, then the
614 * loop count will be known (and therefore a candidate for compiler
615 * optimizations such as unrolling).
617 * Result may not be in the range (first,last]. Use copy instead. Note
618 * that the start of the output range may overlap [first,last).
620 template<typename _BI1
, typename _BI2
>
622 copy_backward(_BI1 __first
, _BI1 __last
, _BI2 __result
)
624 // concept requirements
625 __glibcxx_function_requires(_BidirectionalIteratorConcept
<_BI1
>)
626 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept
<_BI2
>)
627 __glibcxx_function_requires(_ConvertibleConcept
<
628 typename iterator_traits
<_BI1
>::value_type
,
629 typename iterator_traits
<_BI2
>::value_type
>)
630 __glibcxx_requires_valid_range(__first
, __last
);
632 return (std::__copy_move_backward_a2
<__is_move_iterator
<_BI1
>::__value
>
633 (std::__miter_base(__first
), std::__miter_base(__last
),
637 #if __cplusplus >= 201103L
639 * @brief Moves the range [first,last) into result.
640 * @ingroup mutating_algorithms
641 * @param __first A bidirectional iterator.
642 * @param __last A bidirectional iterator.
643 * @param __result A bidirectional iterator.
644 * @return result - (first - last)
646 * The function has the same effect as move, but starts at the end of the
647 * range and works its way to the start, returning the start of the result.
648 * This inline function will boil down to a call to @c memmove whenever
649 * possible. Failing that, if random access iterators are passed, then the
650 * loop count will be known (and therefore a candidate for compiler
651 * optimizations such as unrolling).
653 * Result may not be in the range (first,last]. Use move instead. Note
654 * that the start of the output range may overlap [first,last).
656 template<typename _BI1
, typename _BI2
>
658 move_backward(_BI1 __first
, _BI1 __last
, _BI2 __result
)
660 // concept requirements
661 __glibcxx_function_requires(_BidirectionalIteratorConcept
<_BI1
>)
662 __glibcxx_function_requires(_Mutable_BidirectionalIteratorConcept
<_BI2
>)
663 __glibcxx_function_requires(_ConvertibleConcept
<
664 typename iterator_traits
<_BI1
>::value_type
,
665 typename iterator_traits
<_BI2
>::value_type
>)
666 __glibcxx_requires_valid_range(__first
, __last
);
668 return std::__copy_move_backward_a2
<true>(std::__miter_base(__first
),
669 std::__miter_base(__last
),
673 #define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::move_backward(_Tp, _Up, _Vp)
675 #define _GLIBCXX_MOVE_BACKWARD3(_Tp, _Up, _Vp) std::copy_backward(_Tp, _Up, _Vp)
678 template<typename _ForwardIterator
, typename _Tp
>
680 __gnu_cxx::__enable_if
<!__is_scalar
<_Tp
>::__value
, void>::__type
681 __fill_a(_ForwardIterator __first
, _ForwardIterator __last
,
684 for (; __first
!= __last
; ++__first
)
688 template<typename _ForwardIterator
, typename _Tp
>
690 __gnu_cxx::__enable_if
<__is_scalar
<_Tp
>::__value
, void>::__type
691 __fill_a(_ForwardIterator __first
, _ForwardIterator __last
,
694 const _Tp __tmp
= __value
;
695 for (; __first
!= __last
; ++__first
)
699 // Specialization: for char types we can use memset.
700 template<typename _Tp
>
702 __gnu_cxx::__enable_if
<__is_byte
<_Tp
>::__value
, void>::__type
703 __fill_a(_Tp
* __first
, _Tp
* __last
, const _Tp
& __c
)
705 const _Tp __tmp
= __c
;
706 if (const size_t __len
= __last
- __first
)
707 __builtin_memset(__first
, static_cast<unsigned char>(__tmp
), __len
);
711 * @brief Fills the range [first,last) with copies of value.
712 * @ingroup mutating_algorithms
713 * @param __first A forward iterator.
714 * @param __last A forward iterator.
715 * @param __value A reference-to-const of arbitrary type.
718 * This function fills a range with copies of the same value. For char
719 * types filling contiguous areas of memory, this becomes an inline call
720 * to @c memset or @c wmemset.
722 template<typename _ForwardIterator
, typename _Tp
>
724 fill(_ForwardIterator __first
, _ForwardIterator __last
, const _Tp
& __value
)
726 // concept requirements
727 __glibcxx_function_requires(_Mutable_ForwardIteratorConcept
<
729 __glibcxx_requires_valid_range(__first
, __last
);
731 std::__fill_a(std::__niter_base(__first
), std::__niter_base(__last
),
735 template<typename _OutputIterator
, typename _Size
, typename _Tp
>
737 __gnu_cxx::__enable_if
<!__is_scalar
<_Tp
>::__value
, _OutputIterator
>::__type
738 __fill_n_a(_OutputIterator __first
, _Size __n
, const _Tp
& __value
)
740 for (__decltype(__n
+ 0) __niter
= __n
;
741 __niter
> 0; --__niter
, ++__first
)
746 template<typename _OutputIterator
, typename _Size
, typename _Tp
>
748 __gnu_cxx::__enable_if
<__is_scalar
<_Tp
>::__value
, _OutputIterator
>::__type
749 __fill_n_a(_OutputIterator __first
, _Size __n
, const _Tp
& __value
)
751 const _Tp __tmp
= __value
;
752 for (__decltype(__n
+ 0) __niter
= __n
;
753 __niter
> 0; --__niter
, ++__first
)
758 template<typename _Size
, typename _Tp
>
760 __gnu_cxx::__enable_if
<__is_byte
<_Tp
>::__value
, _Tp
*>::__type
761 __fill_n_a(_Tp
* __first
, _Size __n
, const _Tp
& __c
)
763 std::__fill_a(__first
, __first
+ __n
, __c
);
764 return __first
+ __n
;
768 * @brief Fills the range [first,first+n) with copies of value.
769 * @ingroup mutating_algorithms
770 * @param __first An output iterator.
771 * @param __n The count of copies to perform.
772 * @param __value A reference-to-const of arbitrary type.
773 * @return The iterator at first+n.
775 * This function fills a range with copies of the same value. For char
776 * types filling contiguous areas of memory, this becomes an inline call
777 * to @c memset or @ wmemset.
779 * _GLIBCXX_RESOLVE_LIB_DEFECTS
780 * DR 865. More algorithms that throw away information
782 template<typename _OI
, typename _Size
, typename _Tp
>
784 fill_n(_OI __first
, _Size __n
, const _Tp
& __value
)
786 // concept requirements
787 __glibcxx_function_requires(_OutputIteratorConcept
<_OI
, _Tp
>)
789 return _OI(std::__fill_n_a(std::__niter_base(__first
), __n
, __value
));
792 template<bool _BoolType
>
795 template<typename _II1
, typename _II2
>
797 equal(_II1 __first1
, _II1 __last1
, _II2 __first2
)
799 for (; __first1
!= __last1
; ++__first1
, (void)++__first2
)
800 if (!(*__first1
== *__first2
))
809 template<typename _Tp
>
811 equal(const _Tp
* __first1
, const _Tp
* __last1
, const _Tp
* __first2
)
813 if (const size_t __len
= (__last1
- __first1
))
814 return !__builtin_memcmp(__first1
, __first2
, sizeof(_Tp
) * __len
);
819 template<typename _II1
, typename _II2
>
821 __equal_aux(_II1 __first1
, _II1 __last1
, _II2 __first2
)
823 typedef typename iterator_traits
<_II1
>::value_type _ValueType1
;
824 typedef typename iterator_traits
<_II2
>::value_type _ValueType2
;
825 const bool __simple
= ((__is_integer
<_ValueType1
>::__value
826 || __is_pointer
<_ValueType1
>::__value
)
827 && __is_pointer
<_II1
>::__value
828 && __is_pointer
<_II2
>::__value
829 && __are_same
<_ValueType1
, _ValueType2
>::__value
);
831 return std::__equal
<__simple
>::equal(__first1
, __last1
, __first2
);
834 template<typename
, typename
>
837 template<typename _II1
, typename _II2
>
839 __newlast1(_II1
, _II1 __last1
, _II2
, _II2
)
842 template<typename _II
>
844 __cnd2(_II __first
, _II __last
)
845 { return __first
!= __last
; }
849 struct __lc_rai
<random_access_iterator_tag
, random_access_iterator_tag
>
851 template<typename _RAI1
, typename _RAI2
>
853 __newlast1(_RAI1 __first1
, _RAI1 __last1
,
854 _RAI2 __first2
, _RAI2 __last2
)
856 const typename iterator_traits
<_RAI1
>::difference_type
857 __diff1
= __last1
- __first1
;
858 const typename iterator_traits
<_RAI2
>::difference_type
859 __diff2
= __last2
- __first2
;
860 return __diff2
< __diff1
? __first1
+ __diff2
: __last1
;
863 template<typename _RAI
>
869 template<typename _II1
, typename _II2
, typename _Compare
>
871 __lexicographical_compare_impl(_II1 __first1
, _II1 __last1
,
872 _II2 __first2
, _II2 __last2
,
875 typedef typename iterator_traits
<_II1
>::iterator_category _Category1
;
876 typedef typename iterator_traits
<_II2
>::iterator_category _Category2
;
877 typedef std::__lc_rai
<_Category1
, _Category2
> __rai_type
;
879 __last1
= __rai_type::__newlast1(__first1
, __last1
, __first2
, __last2
);
880 for (; __first1
!= __last1
&& __rai_type::__cnd2(__first2
, __last2
);
881 ++__first1
, (void)++__first2
)
883 if (__comp(__first1
, __first2
))
885 if (__comp(__first2
, __first1
))
888 return __first1
== __last1
&& __first2
!= __last2
;
891 template<bool _BoolType
>
892 struct __lexicographical_compare
894 template<typename _II1
, typename _II2
>
895 static bool __lc(_II1
, _II1
, _II2
, _II2
);
898 template<bool _BoolType
>
899 template<typename _II1
, typename _II2
>
901 __lexicographical_compare
<_BoolType
>::
902 __lc(_II1 __first1
, _II1 __last1
, _II2 __first2
, _II2 __last2
)
904 return std::__lexicographical_compare_impl(__first1
, __last1
,
906 __gnu_cxx::__ops::__iter_less_iter());
910 struct __lexicographical_compare
<true>
912 template<typename _Tp
, typename _Up
>
914 __lc(const _Tp
* __first1
, const _Tp
* __last1
,
915 const _Up
* __first2
, const _Up
* __last2
)
917 const size_t __len1
= __last1
- __first1
;
918 const size_t __len2
= __last2
- __first2
;
919 if (const size_t __len
= std::min(__len1
, __len2
))
920 if (int __result
= __builtin_memcmp(__first1
, __first2
, __len
))
922 return __len1
< __len2
;
926 template<typename _II1
, typename _II2
>
928 __lexicographical_compare_aux(_II1 __first1
, _II1 __last1
,
929 _II2 __first2
, _II2 __last2
)
931 typedef typename iterator_traits
<_II1
>::value_type _ValueType1
;
932 typedef typename iterator_traits
<_II2
>::value_type _ValueType2
;
933 const bool __simple
=
934 (__is_byte
<_ValueType1
>::__value
&& __is_byte
<_ValueType2
>::__value
935 && !__gnu_cxx::__numeric_traits
<_ValueType1
>::__is_signed
936 && !__gnu_cxx::__numeric_traits
<_ValueType2
>::__is_signed
937 && __is_pointer
<_II1
>::__value
938 && __is_pointer
<_II2
>::__value
);
940 return std::__lexicographical_compare
<__simple
>::__lc(__first1
, __last1
,
944 template<typename _ForwardIterator
, typename _Tp
, typename _Compare
>
946 __lower_bound(_ForwardIterator __first
, _ForwardIterator __last
,
947 const _Tp
& __val
, _Compare __comp
)
949 typedef typename iterator_traits
<_ForwardIterator
>::difference_type
952 _DistanceType __len
= std::distance(__first
, __last
);
956 _DistanceType __half
= __len
>> 1;
957 _ForwardIterator __middle
= __first
;
958 std::advance(__middle
, __half
);
959 if (__comp(__middle
, __val
))
963 __len
= __len
- __half
- 1;
972 * @brief Finds the first position in which @a val could be inserted
973 * without changing the ordering.
974 * @param __first An iterator.
975 * @param __last Another iterator.
976 * @param __val The search term.
977 * @return An iterator pointing to the first element <em>not less
978 * than</em> @a val, or end() if every element is less than
980 * @ingroup binary_search_algorithms
982 template<typename _ForwardIterator
, typename _Tp
>
983 inline _ForwardIterator
984 lower_bound(_ForwardIterator __first
, _ForwardIterator __last
,
987 // concept requirements
988 __glibcxx_function_requires(_ForwardIteratorConcept
<_ForwardIterator
>)
989 __glibcxx_function_requires(_LessThanOpConcept
<
990 typename iterator_traits
<_ForwardIterator
>::value_type
, _Tp
>)
991 __glibcxx_requires_partitioned_lower(__first
, __last
, __val
);
993 return std::__lower_bound(__first
, __last
, __val
,
994 __gnu_cxx::__ops::__iter_less_val());
997 /// This is a helper function for the sort routines and for random.tcc.
998 // Precondition: __n > 0.
999 inline _GLIBCXX_CONSTEXPR
int
1001 { return sizeof(int) * __CHAR_BIT__
- 1 - __builtin_clz(__n
); }
1003 inline _GLIBCXX_CONSTEXPR
unsigned
1005 { return sizeof(int) * __CHAR_BIT__
- 1 - __builtin_clz(__n
); }
1007 inline _GLIBCXX_CONSTEXPR
long
1009 { return sizeof(long) * __CHAR_BIT__
- 1 - __builtin_clzl(__n
); }
1011 inline _GLIBCXX_CONSTEXPR
unsigned long
1012 __lg(unsigned long __n
)
1013 { return sizeof(long) * __CHAR_BIT__
- 1 - __builtin_clzl(__n
); }
1015 inline _GLIBCXX_CONSTEXPR
long long
1017 { return sizeof(long long) * __CHAR_BIT__
- 1 - __builtin_clzll(__n
); }
1019 inline _GLIBCXX_CONSTEXPR
unsigned long long
1020 __lg(unsigned long long __n
)
1021 { return sizeof(long long) * __CHAR_BIT__
- 1 - __builtin_clzll(__n
); }
1023 _GLIBCXX_BEGIN_NAMESPACE_ALGO
1026 * @brief Tests a range for element-wise equality.
1027 * @ingroup non_mutating_algorithms
1028 * @param __first1 An input iterator.
1029 * @param __last1 An input iterator.
1030 * @param __first2 An input iterator.
1031 * @return A boolean true or false.
1033 * This compares the elements of two ranges using @c == and returns true or
1034 * false depending on whether all of the corresponding elements of the
1037 template<typename _II1
, typename _II2
>
1039 equal(_II1 __first1
, _II1 __last1
, _II2 __first2
)
1041 // concept requirements
1042 __glibcxx_function_requires(_InputIteratorConcept
<_II1
>)
1043 __glibcxx_function_requires(_InputIteratorConcept
<_II2
>)
1044 __glibcxx_function_requires(_EqualOpConcept
<
1045 typename iterator_traits
<_II1
>::value_type
,
1046 typename iterator_traits
<_II2
>::value_type
>)
1047 __glibcxx_requires_valid_range(__first1
, __last1
);
1049 return std::__equal_aux(std::__niter_base(__first1
),
1050 std::__niter_base(__last1
),
1051 std::__niter_base(__first2
));
1055 * @brief Tests a range for element-wise equality.
1056 * @ingroup non_mutating_algorithms
1057 * @param __first1 An input iterator.
1058 * @param __last1 An input iterator.
1059 * @param __first2 An input iterator.
1060 * @param __binary_pred A binary predicate @link functors
1062 * @return A boolean true or false.
1064 * This compares the elements of two ranges using the binary_pred
1065 * parameter, and returns true or
1066 * false depending on whether all of the corresponding elements of the
1069 template<typename _IIter1
, typename _IIter2
, typename _BinaryPredicate
>
1071 equal(_IIter1 __first1
, _IIter1 __last1
,
1072 _IIter2 __first2
, _BinaryPredicate __binary_pred
)
1074 // concept requirements
1075 __glibcxx_function_requires(_InputIteratorConcept
<_IIter1
>)
1076 __glibcxx_function_requires(_InputIteratorConcept
<_IIter2
>)
1077 __glibcxx_requires_valid_range(__first1
, __last1
);
1079 for (; __first1
!= __last1
; ++__first1
, (void)++__first2
)
1080 if (!bool(__binary_pred(*__first1
, *__first2
)))
1085 #if __cplusplus > 201103L
1087 #define __cpp_lib_robust_nonmodifying_seq_ops 201304
1090 * @brief Tests a range for element-wise equality.
1091 * @ingroup non_mutating_algorithms
1092 * @param __first1 An input iterator.
1093 * @param __last1 An input iterator.
1094 * @param __first2 An input iterator.
1095 * @param __last2 An input iterator.
1096 * @return A boolean true or false.
1098 * This compares the elements of two ranges using @c == and returns true or
1099 * false depending on whether all of the corresponding elements of the
1102 template<typename _II1
, typename _II2
>
1104 equal(_II1 __first1
, _II1 __last1
, _II2 __first2
, _II2 __last2
)
1106 // concept requirements
1107 __glibcxx_function_requires(_InputIteratorConcept
<_II1
>)
1108 __glibcxx_function_requires(_InputIteratorConcept
<_II2
>)
1109 __glibcxx_function_requires(_EqualOpConcept
<
1110 typename iterator_traits
<_II1
>::value_type
,
1111 typename iterator_traits
<_II2
>::value_type
>)
1112 __glibcxx_requires_valid_range(__first1
, __last1
);
1113 __glibcxx_requires_valid_range(__first2
, __last2
);
1115 using _RATag
= random_access_iterator_tag
;
1116 using _Cat1
= typename iterator_traits
<_II1
>::iterator_category
;
1117 using _Cat2
= typename iterator_traits
<_II2
>::iterator_category
;
1118 using _RAIters
= __and_
<is_same
<_Cat1
, _RATag
>, is_same
<_Cat2
, _RATag
>>;
1121 auto __d1
= std::distance(__first1
, __last1
);
1122 auto __d2
= std::distance(__first2
, __last2
);
1125 return _GLIBCXX_STD_A::equal(__first1
, __last1
, __first2
);
1128 for (; __first1
!= __last1
&& __first2
!= __last2
;
1129 ++__first1
, (void)++__first2
)
1130 if (!(*__first1
== *__first2
))
1132 return __first1
== __last1
&& __first2
== __last2
;
1136 * @brief Tests a range for element-wise equality.
1137 * @ingroup non_mutating_algorithms
1138 * @param __first1 An input iterator.
1139 * @param __last1 An input iterator.
1140 * @param __first2 An input iterator.
1141 * @param __last2 An input iterator.
1142 * @param __binary_pred A binary predicate @link functors
1144 * @return A boolean true or false.
1146 * This compares the elements of two ranges using the binary_pred
1147 * parameter, and returns true or
1148 * false depending on whether all of the corresponding elements of the
1151 template<typename _IIter1
, typename _IIter2
, typename _BinaryPredicate
>
1153 equal(_IIter1 __first1
, _IIter1 __last1
,
1154 _IIter2 __first2
, _IIter2 __last2
, _BinaryPredicate __binary_pred
)
1156 // concept requirements
1157 __glibcxx_function_requires(_InputIteratorConcept
<_IIter1
>)
1158 __glibcxx_function_requires(_InputIteratorConcept
<_IIter2
>)
1159 __glibcxx_requires_valid_range(__first1
, __last1
);
1160 __glibcxx_requires_valid_range(__first2
, __last2
);
1162 using _RATag
= random_access_iterator_tag
;
1163 using _Cat1
= typename iterator_traits
<_IIter1
>::iterator_category
;
1164 using _Cat2
= typename iterator_traits
<_IIter2
>::iterator_category
;
1165 using _RAIters
= __and_
<is_same
<_Cat1
, _RATag
>, is_same
<_Cat2
, _RATag
>>;
1168 auto __d1
= std::distance(__first1
, __last1
);
1169 auto __d2
= std::distance(__first2
, __last2
);
1172 return _GLIBCXX_STD_A::equal(__first1
, __last1
, __first2
,
1176 for (; __first1
!= __last1
&& __first2
!= __last2
;
1177 ++__first1
, (void)++__first2
)
1178 if (!bool(__binary_pred(*__first1
, *__first2
)))
1180 return __first1
== __last1
&& __first2
== __last2
;
1185 * @brief Performs @b dictionary comparison on ranges.
1186 * @ingroup sorting_algorithms
1187 * @param __first1 An input iterator.
1188 * @param __last1 An input iterator.
1189 * @param __first2 An input iterator.
1190 * @param __last2 An input iterator.
1191 * @return A boolean true or false.
1193 * <em>Returns true if the sequence of elements defined by the range
1194 * [first1,last1) is lexicographically less than the sequence of elements
1195 * defined by the range [first2,last2). Returns false otherwise.</em>
1196 * (Quoted from [25.3.8]/1.) If the iterators are all character pointers,
1197 * then this is an inline call to @c memcmp.
1199 template<typename _II1
, typename _II2
>
1201 lexicographical_compare(_II1 __first1
, _II1 __last1
,
1202 _II2 __first2
, _II2 __last2
)
1204 #ifdef _GLIBCXX_CONCEPT_CHECKS
1205 // concept requirements
1206 typedef typename iterator_traits
<_II1
>::value_type _ValueType1
;
1207 typedef typename iterator_traits
<_II2
>::value_type _ValueType2
;
1209 __glibcxx_function_requires(_InputIteratorConcept
<_II1
>)
1210 __glibcxx_function_requires(_InputIteratorConcept
<_II2
>)
1211 __glibcxx_function_requires(_LessThanOpConcept
<_ValueType1
, _ValueType2
>)
1212 __glibcxx_function_requires(_LessThanOpConcept
<_ValueType2
, _ValueType1
>)
1213 __glibcxx_requires_valid_range(__first1
, __last1
);
1214 __glibcxx_requires_valid_range(__first2
, __last2
);
1216 return std::__lexicographical_compare_aux(std::__niter_base(__first1
),
1217 std::__niter_base(__last1
),
1218 std::__niter_base(__first2
),
1219 std::__niter_base(__last2
));
1223 * @brief Performs @b dictionary comparison on ranges.
1224 * @ingroup sorting_algorithms
1225 * @param __first1 An input iterator.
1226 * @param __last1 An input iterator.
1227 * @param __first2 An input iterator.
1228 * @param __last2 An input iterator.
1229 * @param __comp A @link comparison_functors comparison functor@endlink.
1230 * @return A boolean true or false.
1232 * The same as the four-parameter @c lexicographical_compare, but uses the
1233 * comp parameter instead of @c <.
1235 template<typename _II1
, typename _II2
, typename _Compare
>
1237 lexicographical_compare(_II1 __first1
, _II1 __last1
,
1238 _II2 __first2
, _II2 __last2
, _Compare __comp
)
1240 // concept requirements
1241 __glibcxx_function_requires(_InputIteratorConcept
<_II1
>)
1242 __glibcxx_function_requires(_InputIteratorConcept
<_II2
>)
1243 __glibcxx_requires_valid_range(__first1
, __last1
);
1244 __glibcxx_requires_valid_range(__first2
, __last2
);
1246 return std::__lexicographical_compare_impl
1247 (__first1
, __last1
, __first2
, __last2
,
1248 __gnu_cxx::__ops::__iter_comp_iter(__comp
));
1251 template<typename _InputIterator1
, typename _InputIterator2
,
1252 typename _BinaryPredicate
>
1253 pair
<_InputIterator1
, _InputIterator2
>
1254 __mismatch(_InputIterator1 __first1
, _InputIterator1 __last1
,
1255 _InputIterator2 __first2
, _BinaryPredicate __binary_pred
)
1257 while (__first1
!= __last1
&& __binary_pred(__first1
, __first2
))
1262 return pair
<_InputIterator1
, _InputIterator2
>(__first1
, __first2
);
1266 * @brief Finds the places in ranges which don't match.
1267 * @ingroup non_mutating_algorithms
1268 * @param __first1 An input iterator.
1269 * @param __last1 An input iterator.
1270 * @param __first2 An input iterator.
1271 * @return A pair of iterators pointing to the first mismatch.
1273 * This compares the elements of two ranges using @c == and returns a pair
1274 * of iterators. The first iterator points into the first range, the
1275 * second iterator points into the second range, and the elements pointed
1276 * to by the iterators are not equal.
1278 template<typename _InputIterator1
, typename _InputIterator2
>
1279 inline pair
<_InputIterator1
, _InputIterator2
>
1280 mismatch(_InputIterator1 __first1
, _InputIterator1 __last1
,
1281 _InputIterator2 __first2
)
1283 // concept requirements
1284 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
1285 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
1286 __glibcxx_function_requires(_EqualOpConcept
<
1287 typename iterator_traits
<_InputIterator1
>::value_type
,
1288 typename iterator_traits
<_InputIterator2
>::value_type
>)
1289 __glibcxx_requires_valid_range(__first1
, __last1
);
1291 return _GLIBCXX_STD_A::__mismatch(__first1
, __last1
, __first2
,
1292 __gnu_cxx::__ops::__iter_equal_to_iter());
1296 * @brief Finds the places in ranges which don't match.
1297 * @ingroup non_mutating_algorithms
1298 * @param __first1 An input iterator.
1299 * @param __last1 An input iterator.
1300 * @param __first2 An input iterator.
1301 * @param __binary_pred A binary predicate @link functors
1303 * @return A pair of iterators pointing to the first mismatch.
1305 * This compares the elements of two ranges using the binary_pred
1306 * parameter, and returns a pair
1307 * of iterators. The first iterator points into the first range, the
1308 * second iterator points into the second range, and the elements pointed
1309 * to by the iterators are not equal.
1311 template<typename _InputIterator1
, typename _InputIterator2
,
1312 typename _BinaryPredicate
>
1313 inline pair
<_InputIterator1
, _InputIterator2
>
1314 mismatch(_InputIterator1 __first1
, _InputIterator1 __last1
,
1315 _InputIterator2 __first2
, _BinaryPredicate __binary_pred
)
1317 // concept requirements
1318 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
1319 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
1320 __glibcxx_requires_valid_range(__first1
, __last1
);
1322 return _GLIBCXX_STD_A::__mismatch(__first1
, __last1
, __first2
,
1323 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred
));
1326 #if __cplusplus > 201103L
1328 template<typename _InputIterator1
, typename _InputIterator2
,
1329 typename _BinaryPredicate
>
1330 pair
<_InputIterator1
, _InputIterator2
>
1331 __mismatch(_InputIterator1 __first1
, _InputIterator1 __last1
,
1332 _InputIterator2 __first2
, _InputIterator2 __last2
,
1333 _BinaryPredicate __binary_pred
)
1335 while (__first1
!= __last1
&& __first2
!= __last2
1336 && __binary_pred(__first1
, __first2
))
1341 return pair
<_InputIterator1
, _InputIterator2
>(__first1
, __first2
);
1345 * @brief Finds the places in ranges which don't match.
1346 * @ingroup non_mutating_algorithms
1347 * @param __first1 An input iterator.
1348 * @param __last1 An input iterator.
1349 * @param __first2 An input iterator.
1350 * @param __last2 An input iterator.
1351 * @return A pair of iterators pointing to the first mismatch.
1353 * This compares the elements of two ranges using @c == and returns a pair
1354 * of iterators. The first iterator points into the first range, the
1355 * second iterator points into the second range, and the elements pointed
1356 * to by the iterators are not equal.
1358 template<typename _InputIterator1
, typename _InputIterator2
>
1359 inline pair
<_InputIterator1
, _InputIterator2
>
1360 mismatch(_InputIterator1 __first1
, _InputIterator1 __last1
,
1361 _InputIterator2 __first2
, _InputIterator2 __last2
)
1363 // concept requirements
1364 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
1365 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
1366 __glibcxx_function_requires(_EqualOpConcept
<
1367 typename iterator_traits
<_InputIterator1
>::value_type
,
1368 typename iterator_traits
<_InputIterator2
>::value_type
>)
1369 __glibcxx_requires_valid_range(__first1
, __last1
);
1370 __glibcxx_requires_valid_range(__first2
, __last2
);
1372 return _GLIBCXX_STD_A::__mismatch(__first1
, __last1
, __first2
, __last2
,
1373 __gnu_cxx::__ops::__iter_equal_to_iter());
1377 * @brief Finds the places in ranges which don't match.
1378 * @ingroup non_mutating_algorithms
1379 * @param __first1 An input iterator.
1380 * @param __last1 An input iterator.
1381 * @param __first2 An input iterator.
1382 * @param __last2 An input iterator.
1383 * @param __binary_pred A binary predicate @link functors
1385 * @return A pair of iterators pointing to the first mismatch.
1387 * This compares the elements of two ranges using the binary_pred
1388 * parameter, and returns a pair
1389 * of iterators. The first iterator points into the first range, the
1390 * second iterator points into the second range, and the elements pointed
1391 * to by the iterators are not equal.
1393 template<typename _InputIterator1
, typename _InputIterator2
,
1394 typename _BinaryPredicate
>
1395 inline pair
<_InputIterator1
, _InputIterator2
>
1396 mismatch(_InputIterator1 __first1
, _InputIterator1 __last1
,
1397 _InputIterator2 __first2
, _InputIterator2 __last2
,
1398 _BinaryPredicate __binary_pred
)
1400 // concept requirements
1401 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator1
>)
1402 __glibcxx_function_requires(_InputIteratorConcept
<_InputIterator2
>)
1403 __glibcxx_requires_valid_range(__first1
, __last1
);
1404 __glibcxx_requires_valid_range(__first2
, __last2
);
1406 return _GLIBCXX_STD_A::__mismatch(__first1
, __last1
, __first2
, __last2
,
1407 __gnu_cxx::__ops::__iter_comp_iter(__binary_pred
));
1411 _GLIBCXX_END_NAMESPACE_ALGO
1412 _GLIBCXX_END_NAMESPACE_VERSION
1415 // NB: This file is included within many other C++ includes, as a way
1416 // of getting the base algorithms. So, make sure that parallel bits
1417 // come in too if requested.
1418 #ifdef _GLIBCXX_PARALLEL
1419 # include <parallel/algobase.h>