| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | iterator_operations.h | 50 template <class _Iter> 51 using __value_type = iter_value_t<_Iter>; 53 template <class _Iter> 54 using __iterator_category = ranges::__iterator_concept<_Iter>; 56 template <class _Iter> 57 using __difference_type = iter_difference_t<_Iter>; 74 template <class _Iter> 75 using __value_type = typename iterator_traits<_Iter>::value_type; 77 template <class _Iter> 78 using __iterator_category = typename iterator_traits<_Iter>::iterator_category; [all …]
|
| H A D | unwrap_range.h | 35 template <class _Iter, class _Sent> in __unwrap() 37 _LIBCPP_HIDE_FROM_ABI static constexpr auto __unwrap(_Iter __first, _Sent __sent) in __unwrap() 38 requires random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter> in __unwrap() 44 _LIBCPP_HIDE_FROM_ABI static constexpr auto __unwrap(_Iter __first, _Sent __last) { 49 __rewrap(_Iter __orig_iter, decltype(std::__unwrap_iter(std::move(__orig_iter))) __iter) in __rewrap() 50 requires random_access_iterator<_Iter> && sized_sentinel_for<_Sent, _Iter> in __rewrap() 55 _LIBCPP_HIDE_FROM_ABI static constexpr auto __rewrap(const _Iter&, _Iter __ite in __rewrap() [all...] |
| H A D | unwrap_iter.h | 37 template <class _Iter, bool = __libcpp_is_contiguous_iterator<_Iter>::value> 39 …static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __rewrap(_Iter, _Iter __iter) { return __iter… in __rewrap() 40 static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __unwrap(_Iter __i) _NOEXCEPT { return __i; } in __unwrap() 47 template <class _Iter> 48 struct __unwrap_iter_impl<_Iter, true> { 49 using _ToAddressT = decltype(std::__to_address(std::declval<_Iter>())); 51 …static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Iter __rewrap(_Iter __orig_iter, _ToAddressT __unw… 55 static _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _ToAddressT __unwrap(_Iter __i) _NOEXCEPT { 60 template <class _Iter, 61 class _Impl = __unwrap_iter_impl<_Iter>, [all …]
|
| H A D | ranges_find_last.h | 39 template <class _Iter, class _Sent, class _Pred, class _Proj> 40 _LIBCPP_HIDE_FROM_ABI constexpr subrange<_Iter> 41 __find_last_impl(_Iter __first, _Sent __last, _Pred __pred, _Proj& __proj) { in __find_last_impl() 43 return subrange<_Iter>(__first, __first); in __find_last_impl() 46 if constexpr (bidirectional_iterator<_Iter>) { in __find_last_impl() 50 return subrange<_Iter>(std::move(__it), std::move(__last_it)); in __find_last_impl() 54 return subrange<_Iter>(std::move(__first), std::move(__last_it)); in __find_last_impl() 56 return subrange<_Iter>(__last_it, __last_it); in __find_last_impl() 59 _Iter __found_it; in __find_last_impl() 68 return subrange<_Iter>(std::move(__found_it), std::move(__first)); in __find_last_impl() [all …]
|
| H A D | ranges_iterator_concept.h | 32 using _Iter = __remove_cvref_t<_IterMaybeQualified>; in __get_iterator_concept() 34 if constexpr (contiguous_iterator<_Iter>) in __get_iterator_concept() 36 else if constexpr (random_access_iterator<_Iter>) in __get_iterator_concept() 38 else if constexpr (bidirectional_iterator<_Iter>) in __get_iterator_concept() 40 else if constexpr (forward_iterator<_Iter>) in __get_iterator_concept() 42 else if constexpr (input_iterator<_Iter>) 46 template <class _Iter> 47 using __iterator_concept = decltype(__get_iterator_concept<_Iter>()); 29 using _Iter = __remove_cvref_t<_IterMaybeQualified>; __get_iterator_concept() local
|
| H A D | ranges_for_each.h | 36 template <class _Iter, class _Func> 37 using for_each_result = in_fun_result<_Iter, _Func>; 42 template <class _Iter, class _Sent, class _Proj, class _Func> in __for_each_impl() 43 _LIBCPP_HIDE_FROM_ABI constexpr static for_each_result<_Iter, _Func> in __for_each_impl() 44 __for_each_impl(_Iter __first, _Sent __last, _Func& __func, _Proj& __proj) { in __for_each_impl() 51 template <input_iterator _Iter, 52 sentinel_for<_Iter> _Sent, 54 indirectly_unary_invocable<projected<_Iter, _Proj>> _Func> 55 _LIBCPP_HIDE_FROM_ABI constexpr for_each_result<_Iter, _Func> 56 operator()(_Iter __firs [all...] |
| H A D | ranges_stable_partition.h | 48 template <class _Iter, class _Sent, class _Proj, class _Pred> in __stable_partition_fn_impl() 49 _LIBCPP_HIDE_FROM_ABI static subrange<__remove_cvref_t<_Iter>> in __stable_partition_fn_impl() 50 __stable_partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __stable_partition_fn_impl() 55 std::move(__first), __last_iter, __projected_pred, __iterator_concept<_Iter>()); in __stable_partition_fn_impl() 60 template <bidirectional_iterator _Iter, 61 sentinel_for<_Iter> _Sent, 63 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 64 requires permutable<_Iter> 65 _LIBCPP_HIDE_FROM_ABI subrange<_Iter> operator()(_Iter __firs [all...] |
| H A D | search_n.h | 33 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class… 34 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 pair<_Iter, _Iter> __search_n_forward_impl( in __search_n_forward_impl() 35 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl() 50 _Iter __m = __first; in __search_n_forward_impl() 70 template <class _AlgPolicy, class _Pred, class _Iter, class _Sent, class _SizeT, class _Type, class… 71 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 std::pair<_Iter, _Iter> __search_n_random_acces… in __search_n_random_access_impl() 72 …_Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _… in __search_n_random_access_impl() 73 using difference_type = typename iterator_traits<_Iter>::difference_type; in __search_n_random_access_impl() 111 template <class _Iter, 117 __enable_if_t<__has_random_access_iterator_category<_Iter>::value, int> = 0> [all …]
|
| H A D | equal_range.h | 39 template <class _AlgPolicy, class _Compare, class _Iter, class _Sent, class _Tp, class _Proj> 40 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 pair<_Iter, _Iter> 41 __equal_range(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) { in __equal_range() 43 _Iter __end = _IterOps<_AlgPolicy>::next(__first, __last); in __equal_range() 46 _Iter __mid = _IterOps<_AlgPolicy>::next(__first, __half_len); in __equal_range() 54 _Iter __mp1 = __mid; in __equal_range() 55 … return pair<_Iter, _Iter>(std::__lower_bound<_AlgPolicy>(__first, __mid, __value, __comp, __proj), in __equal_range() 59 return pair<_Iter, _Iter>(__first, __first); in __equal_range()
|
| H A D | ranges_partial_sort.h | 47 template <class _Iter, class _Sent, class _Comp, class _Proj> in __partial_sort_fn_impl() 48 _LIBCPP_HIDE_FROM_ABI constexpr static _Iter in __partial_sort_fn_impl() 49 __partial_sort_fn_impl(_Iter __first, _Iter __middle, _Sent __last, _Comp& __comp, _Proj& __proj) { in __partial_sort_fn_impl() 54 template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity> in operator() 55 requires sortable<_Iter, _Comp, _Proj> 56 _LIBCPP_HIDE_FROM_ABI constexpr _Iter 57 operator()(_Iter __first, _Iter __middl [all...] |
| H A D | ranges_nth_element.h | 45 template <class _Iter, class _Sent, class _Comp, class _Proj> in __nth_element_fn_impl() 46 _LIBCPP_HIDE_FROM_ABI constexpr static _Iter in __nth_element_fn_impl() 47 __nth_element_fn_impl(_Iter __first, _Iter __nth, _Sent __last, _Comp& __comp, _Proj& __proj) { in __nth_element_fn_impl() 56 template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity> in operator() 57 requires sortable<_Iter, _Comp, _Proj> 58 _LIBCPP_HIDE_FROM_ABI constexpr _Iter 59 operator()(_Iter __first, _Iter __nt [all...] |
| H A D | ranges_rotate.h | 39 template <class _Iter, class _Sent> in __rotate_fn_impl() 40 _LIBCPP_HIDE_FROM_ABI constexpr static subrange<_Iter> __rotate_fn_impl(_Iter __first, _Iter __middle, _Sent __last) { in __rotate_fn_impl() 45 template <permutable _Iter, sentinel_for<_Iter> _Sent> in operator() 46 _LIBCPP_HIDE_FROM_ABI constexpr subrange<_Iter> operator()(_Iter __first, _Iter __middle, _Sent __last) const {
|
| H A D | unique.h | 31 template <class _AlgPolicy, class _Iter, class _Sent, class _BinaryPredicate> 32 _LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 std::pair<_Iter, _Iter> 33 __unique(_Iter __first, _Sent __last, _BinaryPredicate&& __pred) { in __unique() 38 _Iter __i = __first; in __unique() 43 return std::pair<_Iter, _Iter>(std::move(__first), std::move(__i)); in __unique() 45 return std::pair<_Iter, _Iter>(__first, __first); in __unique()
|
| H A D | ranges_count_if.h | 36 template <class _Iter, class _Sent, class _Proj, class _Pred> 37 _LIBCPP_HIDE_FROM_ABI constexpr iter_difference_t<_Iter> 38 __count_if_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __count_if_impl() 39 iter_difference_t<_Iter> __counter(0); in __count_if_impl() 49 template <input_iterator _Iter, 50 sentinel_for<_Iter> _Sent, 52 indirect_unary_predicate<projected<_Iter, _Proj>> _Predicate> 53 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr iter_difference_t<_Iter> 54 operator()(_Iter __first, _Sent __last, _Predicate __pred, _Proj __proj = {}) const { in operator()
|
| H A D | ranges_partition.h | 46 template <class _Iter, class _Sent, class _Proj, class _Pred> in __partition_fn_impl() 47 _LIBCPP_HIDE_FROM_ABI static constexpr subrange<__remove_cvref_t<_Iter>> in __partition_fn_impl() 48 __partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __partition_fn_impl() 51 std::move(__first), std::move(__last), __projected_pred, __iterator_concept<_Iter>()); in __partition_fn_impl() 56 template <permutable _Iter, 57 sentinel_for<_Iter> _Sent, 59 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 60 _LIBCPP_HIDE_FROM_ABI constexpr subrange<_Iter> 61 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const {
|
| H A D | ranges_replace_if.h | 35 template <class _Iter, class _Sent, class _Type, class _Proj, class _Pred> in __replace_if_impl() 36 _LIBCPP_HIDE_FROM_ABI constexpr _Iter in __replace_if_impl() 37 __replace_if_impl(_Iter __first, _Sent __last, _Pred& __pred, const _Type& __new_value, _Proj& __proj) { in __replace_if_impl() 47 template <input_iterator _Iter, 48 sentinel_for<_Iter> _Sent, 51 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> in operator() 52 requires indirectly_writable<_Iter, const _Type&> 53 _LIBCPP_HIDE_FROM_ABI constexpr _Iter 54 operator()(_Iter __first, _Sent __last, _Pred __pred, const _Type& __new_value, _Proj __proj = {}) const {
|
| H A D | ranges_remove_if.h | 39 template <class _Iter, class _Sent, class _Proj, class _Pred> 40 _LIBCPP_HIDE_FROM_ABI constexpr subrange<_Iter> 41 __remove_if_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __remove_if_impl() 46 _Iter __i = __new_end; in __remove_if_impl() 58 template <permutable _Iter, 59 sentinel_for<_Iter> _Sent, 61 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 62 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr subrange<_Iter> 63 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
|
| /freebsd/contrib/llvm-project/libcxx/include/__iterator/ |
| H A D | common_iterator.h | 44 template <class _Iter> 46 …constructible_from<iter_value_t<_Iter>, iter_reference_t<_Iter>> && move_constructible<iter_value_… 48 template <input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent> 49 requires(!same_as<_Iter, _Sent> && copyable<_Iter>) 52 _LIBCPP_HIDE_FROM_ABI constexpr const iter_value_t<_Iter>* operator->() const noexcept { 55 iter_value_t<_Iter> __value_; 59 …_LIBCPP_HIDE_FROM_ABI constexpr const iter_value_t<_Iter>& operator*() const noexcept { return __v… 60 iter_value_t<_Iter> __value_; 63 variant<_Iter, _Sent> __hold_; 70 requires default_initializable<_Iter> [all …]
|
| H A D | counted_iterator.h | 47 template <class _Iter> 48 requires requires { typename _Iter::iterator_concept; } 49 struct __counted_iterator_concept<_Iter> { 50 using iterator_concept = typename _Iter::iterator_concept; 56 template <class _Iter> 57 requires requires { typename _Iter::iterator_category; } 58 struct __counted_iterator_category<_Iter> { 59 using iterator_category = typename _Iter::iterator_category; 65 template <indirectly_readable _Iter> 66 struct __counted_iterator_value_type<_Iter> { [all …]
|
| H A D | cpp17_iterator_concepts.h | 68 template <class _Iter> 70 …__cpp17_copy_constructible<_Iter> && __cpp17_copy_assignable<_Iter> && __cpp17_destructible<_Iter>… 71 … (is_signed_v<__iter_diff_t<_Iter>> || is_void_v<__iter_diff_t<_Iter>>) && requires(_Iter __iter) { in requires() 73 { ++__iter } -> same_as<_Iter&>; in requires() 76 template <class _Iter> 78 …__cpp17_iterator<_Iter> && __cpp17_equality_comparable<_Iter> && requires(_Iter __lhs, _Iter __rhs… in requires() 84 { *__lhs } -> same_as<__iter_reference<_Iter>>; in requires() 85 { *std::as_const(__lhs) } -> same_as<__iter_reference<_Iter>>; in requires() 87 { ++__lhs } -> same_as<_Iter&>; in requires() 92 template <class _Iter, class _WriteTo> [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> 64 _Iter __t_; // no longer used as of LWG #2360, not removed due to ABI break 68 …static_assert(__has_bidirectional_iterator_category<_Iter>::value || bidirectional_iterator<_Iter>, 73 _Iter current; 76 using iterator_type = _Iter; [all …]
|
| H A D | move_iterator.h | 48 template <class _Iter, class = void> 51 template <class _Iter> 52 requires requires { typename iterator_traits<_Iter>::iterator_category; } 53 struct __move_iter_category_base<_Iter> { 55 … _If< derived_from<typename iterator_traits<_Iter>::iterator_category, random_access_iterator_tag>, 57 typename iterator_traits<_Iter>::iterator_category >; 60 template <class _Iter, class _Sent> 62 { std::declval<const _Iter&>() == std::declval<_Sent>() } -> convertible_to<bool>; 66 template <class _Iter> 69 : public __move_iter_category_base<_Iter> [all …]
|
| H A D | iterator_traits.h | 64 template <class _Iter> 76 template <class _Iter> 78 …ing type = _If< __is_primary_template<iterator_traits<_Iter> >::value, _Iter, iterator_traits<_Ite… 80 template <class _Iter> 81 using _ITER_TRAITS = typename __iter_traits_cache<_Iter>::type; 84 template <class _Iter> 85 using _Apply = typename _ITER_TRAITS<_Iter>::iterator_concept; 88 template <class _Iter> 89 using _Apply = typename _ITER_TRAITS<_Iter>::iterator_category; 92 template <class _Iter> [all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__ranges/ |
| H A D | subrange.h | 65 template <class _Pair, class _Iter, class _Sent> 67 !range<_Pair> && __pair_like_no_subrange<_Pair> && constructible_from<_Pair, _Iter, _Sent> && 68 …__convertible_to_non_slicing<_Iter, tuple_element_t<0, _Pair>> && convertible_to<_Sent, tuple_elem… 70 template <input_or_output_iterator _Iter, 71 sentinel_for<_Iter> _Sent = _Iter, 72 …subrange_kind _Kind = sized_sentinel_for<_Sent, _Iter> ? subrange_kind::sized : subrange_kin… 73 requires(_Kind == subrange_kind::sized || !sized_sentinel_for<_Sent, _Iter>) 74 class _LIBCPP_TEMPLATE_VIS subrange : public view_interface<subrange<_Iter, _Sent, _Kind>> { 77 …c constexpr bool _StoreSize = (_Kind == subrange_kind::sized && !sized_sentinel_for<_Sent, _Iter>); 84 using _Size = conditional_t<_StoreSize, make_unsigned_t<iter_difference_t<_Iter>>, _Empty>; [all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__fwd/ |
| H A D | subrange.h | 29 template <input_or_output_iterator _Iter, sentinel_for<_Iter> _Sent, subrange_kind _Kind> 30 requires(_Kind == subrange_kind::sized || !sized_sentinel_for<_Sent, _Iter>) 33 template <size_t _Index, class _Iter, class _Sent, subrange_kind _Kind> 34 requires((_Index == 0 && copyable<_Iter>) || _Index == 1) 35 _LIBCPP_HIDE_FROM_ABI constexpr auto get(const subrange<_Iter, _Sent, _Kind>&); 37 template <size_t _Index, class _Iter, class _Sent, subrange_kind _Kind> 39 _LIBCPP_HIDE_FROM_ABI constexpr auto get(subrange<_Iter, _Sent, _Kind>&&);
|