| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | ranges_unique_copy.h | 55 if constexpr (forward_iterator<_InIter>) { in __get_algo_tag()
73 (forward_iterator<_InIter> ||
92 (forward_iterator<iterator_t<_Range>> ||
|
| H A D | ranges_find_end.h | 40 template <forward_iterator _Iter1,
42 forward_iterator _Iter2,
|
| H A D | ranges_contains_subrange.h | 40 template <forward_iterator _Iter1,
42 forward_iterator _Iter2,
|
| H A D | ranges_is_permutation.h | 52 forward_iterator _Iter1,
54 forward_iterator _Iter2,
|
| H A D | ranges_find_last.h | 86 template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity>
113 template <forward_iterator _Iter,
143 template <forward_iterator _Iter,
|
| H A D | ranges_search.h | 72 template <forward_iterator _Iter1,
74 forward_iterator _Iter2,
|
| H A D | ranges_mismatch.h | 47 if constexpr (forward_iterator<_I1> && forward_iterator<_I2>) { in __go()
|
| H A D | ranges_iterator_concept.h | 40 else if constexpr (forward_iterator<_Iter>) in __get_iterator_concept()
|
| H A D | ranges_ends_with.h | 133 requires(forward_iterator<_Iter1> || sized_sentinel_for<_Sent1, _Iter1>) &&
134 (forward_iterator<_Iter2> || sized_sentinel_for<_Sent2, _Iter2>) &&
|
| H A D | ranges_is_sorted.h | 36 template <forward_iterator _Iter,
|
| H A D | ranges_max_element.h | 37 template <forward_iterator _Ip,
|
| H A D | ranges_lower_bound.h | 41 template <forward_iterator _Iter,
|
| H A D | ranges_sample.h | 42 requires(forward_iterator<_Iter> || random_access_iterator<_OutIter>) && indirectly_copyable<_Iter, _OutIter> && in operator()
|
| H A D | ranges_minmax_element.h | 45 template <forward_iterator _Ip,
|
| H A D | ranges_upper_bound.h | 35 template <forward_iterator _Iter,
|
| H A D | ranges_binary_search.h | 37 template <forward_iterator _Iter,
|
| H A D | ranges_equal_range.h | 44 template <forward_iterator _Iter,
|
| H A D | ranges_min_element.h | 51 template <forward_iterator _Ip,
|
| H A D | ranges_partition_point.h | 63 template <forward_iterator _Iter,
|
| H A D | ranges_is_sorted_until.h | 52 template <forward_iterator _Iter,
|
| H A D | ranges_adjacent_find.h | 52 template <forward_iterator _Iter,
|
| /freebsd/contrib/llvm-project/libcxx/include/__iterator/ |
| H A D | permutable.h | 27 forward_iterator<_Iterator> && indirectly_movable_storable<_Iterator, _Iterator> &&
|
| /freebsd/contrib/llvm-project/libcxx/include/__memory/ |
| H A D | concepts.h | 52 __nothrow_input_iterator<_Ip> && forward_iterator<_Ip> && __nothrow_sentinel_for<_Ip, _Ip>;
|
| /freebsd/contrib/llvm-project/libcxx/include/ |
| H A D | algorithm | 48 template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
56 template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
105 template<forward_iterator I, sentinel_for<I> S, class T, class Proj = identity>
114 template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
122 template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
235 template<forward_iterator I, sentinel_for<I> S, class Proj = identity,
245 template<forward_iterator I1, sentinel_for<I1> S1,
246 forward_iterator I2, sentinel_for<I2> S2,
501 requires (forward_iterator<I1> || sized_sentinel_for<S1, I1>) &&
502 (forward_iterator<I2> || sized_sentinel_for<S2, I2>) &&
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__ranges/ |
| H A D | empty.h | 40 { ranges::begin(__t) } -> forward_iterator;
|