// { dg-do compile }
// Copyright (C) 2007-2015 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// .
#include
namespace std
{
// 25.1, non-modifying sequence operations:
template
_Funct
for_each(_IIter, _IIter, _Funct);
template
_IIter
find(_IIter, _IIter, const _Tp&);
template
_IIter
find_if(_IIter, _IIter, _Predicate);
#if __cplusplus >= 201103L
template
bool
all_of(_IIter, _IIter, _Predicate);
template
bool
any_of(_IIter, _IIter, _Predicate);
template
bool
none_of(_IIter, _IIter, _Predicate);
template
_IIter
find_if_not(_IIter, _IIter, _Predicate);
template
bool
is_partitioned(_IIter, _IIter, _Predicate);
template
_FIter
partition_point(_FIter, _FIter, _Predicate);
#endif
template
_FIter1
find_end(_FIter1, _FIter1, _FIter2, _FIter2);
template
_FIter1
find_end(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
template
_FIter1
find_first_of(_FIter1, _FIter1, _FIter2, _FIter2);
template
_FIter1
find_first_of(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
template
_FIter
adjacent_find(_FIter, _FIter);
template
_FIter
adjacent_find(_FIter, _FIter, _BinaryPredicate);
template
typename iterator_traits<_IIter>::difference_type
count(_IIter, _IIter, const _Tp&);
template
typename iterator_traits<_IIter>::difference_type
count_if(_IIter, _IIter, _Predicate);
template
pair<_IIter1, _IIter2>
mismatch(_IIter1, _IIter1, _IIter2);
template
pair<_IIter1, _IIter2>
mismatch(_IIter1, _IIter1, _IIter2, _BinaryPredicate);
template
bool
equal(_IIter1, _IIter1, _IIter2);
template
bool
equal(_IIter1, _IIter1, _IIter2, _BinaryPredicate);
template
_FIter1
search(_FIter1, _FIter1, _FIter2, _FIter2);
template
_FIter1
search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate);
template
_FIter
search_n(_FIter, _FIter, _Size, const _Tp&);
template
_FIter
search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate);
// 25.2, modifying sequence operations:
// 25.2.1, copy:
template
_OIter
copy(_IIter, _IIter, _OIter);
template
_BIter2
copy_backward (_BIter1, _BIter1, _BIter2);
// 25.2.2, swap:
#if __cplusplus < 201103L
template
void
swap(_Tp&, _Tp& b);
template
void
swap(_Tp (&)[_Nm], _Tp (&)[_Nm]);
#else
// C++11 swap() has complicated SFINAE constraints, test signatures like so:
void (*swap_scalars)(int&, int&) = &swap;
void (*swap_arrays)(int(&)[5], int(&)[5]) = &swap;
#endif
template
_FIter2
swap_ranges(_FIter1 first1, _FIter1, _FIter2);
template
void
iter_swap(_FIter1, _FIter2 b);
template
_OIter
transform(_IIter, _IIter, _OIter, _UnaryOperation op);
template
_OIter
transform(_IIter1, _IIter1, _IIter2, _OIter, _BinaryOperation);
template
void
replace(_FIter, _FIter, const _Tp&, const _Tp&);
template
void
replace_if(_FIter, _FIter, _Predicate, const _Tp&);
template
_OIter
replace_copy(_IIter, _IIter, _OIter, const _Tp&, const _Tp&);
template
_OIter
replace_copy_if(_Iter, _Iter, _OIter, _Predicate, const _Tp&);
template
void
fill(_FIter, _FIter, const _Tp&);
template
void
fill_n(_OIter, _Size n, const _Tp&);
template
void
generate(_FIter, _FIter, _Generator);
template
void
generate_n(_OIter, _Size, _Generator);
template
_FIter
remove(_FIter, _FIter, const _Tp&);
template
_FIter
remove_if(_FIter, _FIter, _Predicate);
template
_OIter
remove_copy(_IIter, _IIter, _OIter, const _Tp&);
template
_OIter
remove_copy_if(_IIter, _IIter, _OIter, _Predicate);
#if __cplusplus >= 201103L
template
_OIter
copy_if(_IIter, _IIter, _OIter, _Predicate);
template
_OIter
copy_n(_IIter, _Size, _OIter);
template
pair<_OIter1, _OIter2>
partition_copy(_IIter, _IIter, _OIter1, _OIter2, _Predicate);
#endif
template
_FIter
unique(_FIter, _FIter);
template
_FIter
unique(_FIter, _FIter, _BinaryPredicate);
template
_OIter
unique_copy(_IIter, _IIter, _OIter);
template
_OIter
unique_copy(_IIter, _IIter, _OIter, _BinaryPredicate);
template
void
reverse(_BIter, _BIter);
template
_OIter
reverse_copy(_BIter, _BIter, _OIter);
template
void
rotate(_FIter, _FIter, _FIter);
template
_OIter
rotate_copy (_FIter, _FIter, _FIter, _OIter);
template
void
random_shuffle(_RAIter, _RAIter);
template
void
random_shuffle(_RAIter, _RAIter, _Generator&);
// 25.2.12, partitions:
template
_BIter
partition(_BIter, _BIter, _Predicate);
template
_BIter
stable_partition(_BIter, _BIter, _Predicate);
// 25.3, sorting and related operations:
// 25.3.1, sorting:
template
void
sort(_RAIter, _RAIter);
template
void
sort(_RAIter, _RAIter, _Compare);
template
void
stable_sort(_RAIter, _RAIter);
template
void
stable_sort(_RAIter, _RAIter, _Compare);
template
void
partial_sort(_RAIter, _RAIter, _RAIter);
template
void
partial_sort(_RAIter, _RAIter, _RAIter, _Compare);
template
_RAIter
partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter);
template
_RAIter
partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter, _Compare);
template
void
nth_element(_RAIter, _RAIter, _RAIter);
template
void
nth_element(_RAIter, _RAIter, _RAIter, _Compare);
// 25.3.3, binary search:
template
_FIter
lower_bound(_FIter, _FIter, const _Tp&);
template
_FIter
lower_bound(_FIter, _FIter, const _Tp&, _Compare);
template
_FIter
upper_bound(_FIter, _FIter, const _Tp&);
template
_FIter
upper_bound(_FIter, _FIter, const _Tp&, _Compare);
template
pair<_FIter, _FIter>
equal_range(_FIter, _FIter, const _Tp&);
template
pair<_FIter, _FIter>
equal_range(_FIter, _FIter, const _Tp&, _Compare);
template
bool
binary_search(_FIter, _FIter, const _Tp&);
template
bool
binary_search(_FIter, _FIter, const _Tp&, _Compare);
// 25.3.4, merge:
template
_OIter
merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
template
_OIter
merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
template
void
inplace_merge(_BIter, _BIter, _BIter);
template
void
inplace_merge(_BIter, _BIter, _BIter, _Compare);
// 25.3.5, set operations:
template
bool
includes(_IIter1, _IIter1, _IIter2, _IIter2);
template
bool
includes(_IIter1, _IIter1, _IIter2, _IIter2, _Compare);
template
_OIter
set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
template
_OIter
set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
template
_OIter
set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
template
_OIter
set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
template
_OIter
set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
template
_OIter
set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare);
template
_OIter
set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter);
template
_OIter
set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2,
_OIter, _Compare);
// 25.3.6, heap operations:
template
void
push_heap(_RAIter, _RAIter);
template
void
push_heap(_RAIter, _RAIter, _Compare);
template
void
pop_heap(_RAIter, _RAIter);
template
void
pop_heap(_RAIter, _RAIter, _Compare);
template
void
make_heap(_RAIter, _RAIter);
template
void
make_heap(_RAIter, _RAIter, _Compare);
template
void
sort_heap(_RAIter, _RAIter);
template
void
sort_heap(_RAIter, _RAIter, _Compare);
#if __cplusplus >= 201103L
template
bool
is_heap(_RAIter, _RAIter);
template
bool
is_heap(_RAIter, _RAIter, _Compare);
template
_RAIter
is_heap_until(_RAIter, _RAIter);
template
_RAIter
is_heap_until(_RAIter, _RAIter, _Compare);
template
bool
is_sorted(_FIter, _FIter);
template
bool
is_sorted(_FIter, _FIter, _Compare);
template
_FIter
is_sorted_until(_FIter, _FIter);
template
_FIter
is_sorted_until(_FIter, _FIter, _Compare);
#endif
// 25.3.7, minimum and maximum:
template
_GLIBCXX14_CONSTEXPR
const _Tp&
min(const _Tp&, const _Tp&);
template
_GLIBCXX14_CONSTEXPR
const _Tp&
min(const _Tp&, const _Tp&, _Compare);
template
_GLIBCXX14_CONSTEXPR
const _Tp&
max(const _Tp&, const _Tp&);
template
_GLIBCXX14_CONSTEXPR
const _Tp&
max(const _Tp&, const _Tp&, _Compare);
template
_GLIBCXX14_CONSTEXPR
_FIter
min_element(_FIter, _FIter);
template
_GLIBCXX14_CONSTEXPR
_FIter
min_element(_FIter, _FIter, _Compare);
template
_GLIBCXX14_CONSTEXPR
_FIter
max_element(_FIter, _FIter);
template
_GLIBCXX14_CONSTEXPR
_FIter
max_element(_FIter, _FIter, _Compare);
#if __cplusplus >= 201103L
template
_GLIBCXX14_CONSTEXPR
pair
minmax(const _Tp&, const _Tp&);
template
_GLIBCXX14_CONSTEXPR
pair
minmax(const _Tp&, const _Tp&, _Compare);
template
_GLIBCXX14_CONSTEXPR
pair<_FIter, _FIter>
minmax_element(_FIter, _FIter);
template
_GLIBCXX14_CONSTEXPR
pair<_FIter, _FIter>
minmax_element(_FIter, _FIter, _Compare);
template
_GLIBCXX14_CONSTEXPR
_Tp
min(initializer_list<_Tp>);
template
_GLIBCXX14_CONSTEXPR
_Tp
min(initializer_list<_Tp>, _Compare);
template
_GLIBCXX14_CONSTEXPR
_Tp
max(initializer_list<_Tp>);
template
_GLIBCXX14_CONSTEXPR
_Tp
max(initializer_list<_Tp>, _Compare);
template
_GLIBCXX14_CONSTEXPR
pair<_Tp, _Tp>
minmax(initializer_list<_Tp>);
template
_GLIBCXX14_CONSTEXPR
pair<_Tp, _Tp>
minmax(initializer_list<_Tp>, _Compare);
#endif
template
bool
lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2);
template
bool
lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2, _Compare);
// 25.3.9, permutations
template
bool
next_permutation(_BIter, _BIter);
template
bool
next_permutation(_BIter, _BIter, _Compare);
template
bool
prev_permutation(_BIter, _BIter);
template
bool
prev_permutation(_BIter, _BIter, _Compare);
}