/openbsd-current/gnu/llvm/libcxx/include/__algorithm/ |
H A D | unwrap_iter.h | 35 template <class _Iter, bool = __is_cpp17_contiguous_iterator<_Iter>::value> 37 static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __rewrap(_Iter, _Iter __iter) { return __iter; } 38 static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __unwrap(_Iter __i) _NOEXCEPT { return __i; } 44 template <class _Iter> 45 struct __unwrap_iter_impl<_Iter, true> { 46 using _ToAddressT = decltype(std::__to_address(std::declval<_Iter>())); [all...] |
H A D | unwrap_range.h | 32 template <class _Iter, class _Sent> 34 _LIBCPP_HIDE_FROM_ABI static constexpr auto __unwrap(_Iter __first, _Sent __sent) 35 requires random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter> 41 _LIBCPP_HIDE_FROM_ABI static constexpr auto __unwrap(_Iter __first, _Sent __last) { 46 __rewrap(_Iter __orig_iter, decltype(std::__unwrap_iter(__orig_iter)) __iter) 47 requires random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter> 52 _LIBCPP_HIDE_FROM_ABI static constexpr auto __rewrap(const _Iter&, _Iter __ite [all...] |
H A D | ranges_iterator_concept.h | 29 using _Iter = __remove_cvref_t<_IterMaybeQualified>; 31 if constexpr (contiguous_iterator<_Iter>) 33 else if constexpr (random_access_iterator<_Iter>) 35 else if constexpr (bidirectional_iterator<_Iter>) 37 else if constexpr (forward_iterator<_Iter>) 39 else if constexpr (input_iterator<_Iter>) 43 template <class _Iter> 44 using __iterator_concept = decltype(__get_iterator_concept<_Iter>());
|
H A D | iterator_operations.h | 46 template <class _Iter> 47 using __value_type = iter_value_t<_Iter>; 49 template <class _Iter> 50 using __iterator_category = ranges::__iterator_concept<_Iter>; 52 template <class _Iter> 53 using __difference_type = iter_difference_t<_Iter>; 71 template <class _Iter> 72 using __value_type = typename iterator_traits<_Iter>::value_type; 74 template <class _Iter> 75 using __iterator_category = typename iterator_traits<_Iter> [all...] |
H A D | ranges_fill_n.h | 27 template <class _Type, output_iterator<const _Type&> _Iter> 29 _Iter operator()(_Iter __first, iter_difference_t<_Iter> __n, const _Type& __value) const {
|
H A D | ranges_for_each_n.h | 33 template <class _Iter, class _Func> 34 using for_each_n_result = in_fun_result<_Iter, _Func>; 39 template <input_iterator _Iter, 41 indirectly_unary_invocable<projected<_Iter, _Proj>> _Func> 43 for_each_n_result<_Iter, _Func> operator()(_Iter __first, 44 iter_difference_t<_Iter> __count,
|
H A D | unique.h | 28 template <class _AlgPolicy, class _Iter, class _Sent, class _BinaryPredicate> 29 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 std::pair<_Iter, _Iter> 30 __unique(_Iter __first, _Sent __last, _BinaryPredicate&& __pred) { 35 _Iter __i = __first; 40 return std::pair<_Iter, _Iter>(std::move(__first), std::move(__i)); 42 return std::pair<_Iter, _Iter>(__first, __first);
|
H A D | ranges_count_if.h | 33 template <class _Iter, class _Sent, class _Proj, class _Pred> 35 iter_difference_t<_Iter> __count_if_impl(_Iter __first, _Sent __last, 37 iter_difference_t<_Iter> __counter(0); 47 template <input_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity, 48 indirect_unary_predicate<projected<_Iter, _Proj>> _Predicate> 50 iter_difference_t<_Iter> operator()(_Iter __first, _Sent __last, _Predicate __pred, _Proj __proj = {}) const {
|
H A D | ranges_rotate.h | 37 template <class _Iter, class _Sent> 39 static subrange<_Iter> __rotate_fn_impl(_Iter __first, _Iter __middle, _Sent __last) { 45 template <permutable _Iter, sentinel_for<_Iter> _Sent> 47 subrange<_Iter> operator()(_Iter __first, _Iter __middle, _Sent __last) const {
|
H A D | ranges_is_sorted_until.h | 33 template <class _Iter, class _Sent, class _Proj, class _Comp> 35 _Iter __is_sorted_until_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { 49 template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, 51 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less> 53 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
|
H A D | ranges_fill.h | 30 template <class _Type, output_iterator<const _Type&> _Iter, sentinel_for<_Iter> _Sent> 32 _Iter operator()(_Iter __first, _Sent __last, const _Type& __value) const { 33 if constexpr(random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter>) {
|
H A D | ranges_reverse.h | 33 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent> 34 requires permutable<_Iter> 36 _Iter operator()(_Iter __first, _Sent __last) const { 37 if constexpr (random_access_iterator<_Iter>) {
|
H A D | ranges_for_each.h | 33 template <class _Iter, class _Func> 34 using for_each_result = in_fun_result<_Iter, _Func>; 39 template <class _Iter, class _Sent, class _Proj, class _Func> 41 for_each_result<_Iter, _Func> __for_each_impl(_Iter __first, _Sent __last, _Func& __func, _Proj& __proj) { 48 template <input_iterator _Iter, sentinel_for<_Iter> _Sent, 50 indirectly_unary_invocable<projected<_Iter, _Proj>> _Func> 52 for_each_result<_Iter, _Func> operator()(_Iter __firs [all...] |
H A D | ranges_nth_element.h | 42 template <class _Iter, class _Sent, class _Comp, class _Proj> 44 _Iter __nth_element_fn_impl(_Iter __first, _Iter __nth, _Sent __last, _Comp& __comp, _Proj& __proj) { 53 template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity> 54 requires sortable<_Iter, _Comp, _Proj> 56 _Iter operator()(_Iter __first, _Iter __nt [all...] |
H A D | ranges_partial_sort.h | 44 template <class _Iter, class _Sent, class _Comp, class _Proj> 46 _Iter __partial_sort_fn_impl(_Iter __first, _Iter __middle, _Sent __last, _Comp& __comp, _Proj& __proj) { 51 template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity> 52 requires sortable<_Iter, _Comp, _Proj> 54 _Iter operator()(_Iter __first, _Iter __middl [all...] |
H A D | ranges_stable_partition.h | 46 template <class _Iter, class _Sent, class _Proj, class _Pred> 48 subrange<__remove_cvref_t<_Iter>> __stable_partition_fn_impl( 49 _Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { 54 std::move(__first), __last_iter, __projected_pred, __iterator_concept<_Iter>()); 59 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Proj = identity, 60 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 61 requires permutable<_Iter> 63 subrange<_Iter> operator()(_Iter __firs [all...] |
H A D | min_element.h | 27 template <class _Comp, class _Iter, class _Sent, class _Proj> 29 _Iter __min_element(_Iter __first, _Sent __last, _Comp __comp, _Proj& __proj) { 33 _Iter __i = __first; 41 template <class _Comp, class _Iter, class _Sent> 43 _Iter __min_element(_Iter __first, _Sent __last, _Comp __comp) {
|
/openbsd-current/gnu/llvm/libcxx/include/__iterator/ |
H A D | counted_iterator.h | 44 template<class _Iter> 45 requires requires { typename _Iter::iterator_concept; } 46 struct __counted_iterator_concept<_Iter> { 47 using iterator_concept = typename _Iter::iterator_concept; 53 template<class _Iter> 54 requires requires { typename _Iter::iterator_category; } 55 struct __counted_iterator_category<_Iter> { 56 using iterator_category = typename _Iter::iterator_category; 62 template<indirectly_readable _Iter> 63 struct __counted_iterator_value_type<_Iter> { [all...] |
H A D | common_iterator.h | 40 template<class _Iter> 42 constructible_from<iter_value_t<_Iter>, iter_reference_t<_Iter>> && 43 move_constructible<iter_value_t<_Iter>>; 45 template<input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent> 46 requires (!same_as<_Iter, _Sent> && copyable<_Iter>) 49 constexpr const iter_value_t<_Iter>* operator->() const noexcept { 52 iter_value_t<_Iter> __value [all...] |
H A D | reverse_iterator.h | 50 template <class _Iter> 53 : public iterator<typename iterator_traits<_Iter>::iterator_category, 54 typename iterator_traits<_Iter>::value_type, 55 typename iterator_traits<_Iter>::difference_type, 56 typename iterator_traits<_Iter>::pointer, 57 typename iterator_traits<_Iter>::reference> 63 _Iter __t_; // no longer used as of LWG #2360, not removed due to ABI break 67 static_assert(__is_cpp17_bidirectional_iterator<_Iter>::value || bidirectional_iterator<_Iter>, 72 _Iter curren [all...] |
H A D | move_iterator.h | 45 template<class _Iter, class = void> 48 template<class _Iter> 49 requires requires { typename iterator_traits<_Iter>::iterator_category; } 50 struct __move_iter_category_base<_Iter> { 52 derived_from<typename iterator_traits<_Iter>::iterator_category, random_access_iterator_tag>, 54 typename iterator_traits<_Iter>::iterator_category 58 template<class _Iter, class _Sent> 60 { std::declval<const _Iter&>() == std::declval<_Sent>() } -> convertible_to<bool>; 64 template <class _Iter> 67 : public __move_iter_category_base<_Iter> [all...] |
H A D | unreachable_sentinel.h | 25 template<weakly_incrementable _Iter> 27 friend constexpr bool operator==(unreachable_sentinel_t, const _Iter&) noexcept {
|
H A D | sortable.h | 28 template <class _Iter, class _Comp = ranges::less, class _Proj = identity> 30 permutable<_Iter> && 31 indirect_strict_weak_order<_Comp, projected<_Iter, _Proj>>;
|
/openbsd-current/gnu/llvm/libcxx/include/__fwd/ |
H A D | subrange.h | 28 template <input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent, subrange_kind _Kind> 29 requires(_Kind == subrange_kind::sized || !sized_sentinel_for<_Sent, _Iter>)
|
/openbsd-current/gnu/llvm/libcxx/include/__ranges/ |
H A D | subrange.h | 64 template<class _Pair, class _Iter, class _Sent> 67 constructible_from<_Pair, _Iter, _Sent> && 68 __convertible_to_non_slicing<_Iter, tuple_element_t<0, _Pair>> && 71 template<input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent = _Iter, 72 subrange_kind _Kind = sized_sentinel_for<_Sent, _Iter> 75 requires (_Kind == subrange_kind::sized || !sized_sentinel_for<_Sent, _Iter>) 77 : public view_interface<subrange<_Iter, _Sent, _Kind>> 81 static constexpr bool _StoreSize = (_Kind == subrange_kind::sized && !sized_sentinel_for<_Sent, _Iter>); [all...] |