/freebsd/contrib/llvm-project/libcxx/modules/std/ |
H A D | algorithm.cppm |
|
H A D | algorithm.inc | 11 namespace ranges { 13 using std::ranges::in_found_result; 14 using std::ranges::in_fun_result; 15 using std::ranges::in_in_out_result; 16 using std::ranges::in_in_result; 17 using std::ranges::in_out_out_result; 18 using std::ranges::in_out_result; 20 using std::ranges::in_value_result; 22 using std::ranges::min_max_result; 23 // using std::ranges::out_value_result; [all …]
|
H A D | ranges.cppm |
|
H A D | ranges.inc | 11 namespace ranges { 14 using std::ranges::__cpo::begin; 15 using std::ranges::__cpo::cbegin; 16 using std::ranges::__cpo::cend; 17 using std::ranges::__cpo::crbegin; 18 using std::ranges::__cpo::crend; 19 using std::ranges::__cpo::end; 20 using std::ranges::__cpo::rbegin; 21 using std::ranges::__cpo::rend; 23 using std::ranges::__cpo::cdata; [all …]
|
H A D | memory.cppm |
|
H A D | memory.inc | 61 namespace ranges { 62 using std::ranges::uninitialized_default_construct; 63 using std::ranges::uninitialized_default_construct_n; 64 } // namespace ranges 69 namespace ranges { 70 using std::ranges::uninitialized_value_construct; 71 using std::ranges::uninitialized_value_construct_n; 72 } // namespace ranges 77 namespace ranges { 78 using std::ranges::uninitialized_copy; [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__ranges/ |
H A D | view_interface.h | 37 namespace ranges { 58 return ranges::size(__derived()) == 0; 60 return ranges::begin(__derived()) == ranges::end(__derived()); 69 return ranges::size(__derived()) == 0; 71 return ranges::begin(__derived()) == ranges::end(__derived()); 77 requires requires(_D2& __t) { ranges::empty(__t); } in requires() 79 return !ranges::empty(__derived()); 84 requires requires(const _D2& __t) { ranges::empty(__t); } in requires() 86 return !ranges::empty(__derived()); 93 return std::to_address(ranges::begin(__derived())); in data() [all …]
|
H A D | take_view.h | 58 namespace ranges { 92 return ranges::begin(__base_); in begin() 96 return counted_iterator(ranges::begin(__base_), static_cast<_DifferenceT>(__size)); in begin() 99 return counted_iterator(ranges::begin(__base_), __count_); in begin() 108 return ranges::begin(__base_); in begin() 112 return counted_iterator(ranges::begin(__base_), static_cast<_DifferenceT>(__size)); in begin() 115 return counted_iterator(ranges::begin(__base_), __count_); in begin() 124 return ranges::begin(__base_) + size(); in end() 129 return __sentinel<false>{ranges::end(__base_)}; in end() 138 return ranges::begin(__base_) + size(); in end() [all …]
|
H A D | drop_view.h | 58 namespace ranges { 94 const auto __dist = std::min(ranges::distance(__base_), __count_); in begin() 95 return ranges::begin(__base_) + __dist; in begin() 101 auto __tmp = ranges::next(ranges::begin(__base_), __count_, ranges::end(__base_)); in begin() 110 const auto __dist = std::min(ranges::distance(__base_), __count_); in begin() 111 return ranges::begin(__base_) + __dist; in begin() 117 return ranges::end(__base_); in end() 123 return ranges::end(__base_); in end() 127 const auto __s = ranges::size(__self.__base_); in __size() 228 …ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)), ranges::e… [all …]
|
H A D | rend.h | 37 namespace ranges { 41 ranges::rbegin(__t); in requires() 42 { _LIBCPP_AUTO_CAST(__t.rend()) } -> sentinel_for<decltype(ranges::rbegin(__t))>; in requires() 50 ranges::rbegin(__t); 51 { _LIBCPP_AUTO_CAST(rend(__t)) } -> sentinel_for<decltype(ranges::rbegin(__t))>; 56 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>; 57 { ranges::begin(__t) } -> bidirectional_iterator; 79 noexcept(noexcept(ranges::begin(__t))) { in operator() 80 return std::make_reverse_iterator(ranges::begin(__t)); in operator() 94 namespace ranges { [all …]
|
H A D | size.h | 35 namespace ranges { 42 namespace ranges { 63 { ranges::begin(__t) } -> forward_iterator; 64 { ranges::end(__t) } -> sized_sentinel_for<decltype(ranges::begin(std::declval<_Tp>()))>; 97 noexcept(noexcept(std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t)))) 98 -> decltype(std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t))) { 99 return std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t)); 112 namespace ranges { 116 requires requires(_Tp&& __t) { ranges::size(__t); } in requires() 118 noexcept(noexcept(ranges::size(__t))) { in operator() [all …]
|
H A D | zip_view.h | 53 namespace ranges { 103 return ranges::__tuple_zip_transform( in __tuple_zip_transform() 120 return ranges::__tuple_zip_for_each( in __tuple_zip_for_each() 129 const auto __equals = ranges::__tuple_zip_transform(std::equal_to<>(), __tuple1, __tuple2); in __tuple_any_equals() 159 return __iterator<false>(ranges::__tuple_transform(ranges::begin, __views_)); in requires() 165 return __iterator<true>(ranges::__tuple_transform(ranges::begin, __views_)); in requires() 172 return __sentinel<false>(ranges::__tuple_transform(ranges::end, __views_)); in requires() 176 return __iterator<false>(ranges::__tuple_transform(ranges::end, __views_)); in requires() 184 return __sentinel<true>(ranges::__tuple_transform(ranges::end, __views_)); in requires() 188 return __iterator<true>(ranges::__tuple_transform(ranges::end, __views_)); in requires() [all …]
|
H A D | owning_view.h | 37 namespace ranges { 57 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_Rp> begin() { return ranges::begin(__r_); } in begin() 58 _LIBCPP_HIDE_FROM_ABI constexpr sentinel_t<_Rp> end() { return ranges::end(__r_); } in end() 62 return ranges::begin(__r_); in empty() 67 return ranges::end(__r_); in size() 71 requires requires { ranges::empty(__r_); } in data() 73 return ranges::empty(__r_); in data() 76 requires requires { ranges::empty(__r_); } 78 return ranges::empty(__r_); 84 return ranges [all...] |
H A D | all.h | 36 namespace ranges::views { 41 requires ranges::view<decay_t<_Tp>> 48 …requires(!ranges::view<decay_t<_Tp>>) && requires(_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(… in requires() 50 noexcept(noexcept(ranges::ref_view{std::forward<_Tp>(__t)})) { in operator() 51 return ranges::ref_view{std::forward<_Tp>(__t)}; 56 …!ranges::view<decay_t<_Tp>> && !requires(_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__t)}; } … 57 requires(_Tp&& __t) { ranges::owning_view{std::forward<_Tp>(__t)}; }) 59 noexcept(noexcept(ranges::owning_view{std::forward<_Tp>(__t)})) { in operator() 60 return ranges::owning_view{std::forward<_Tp>(__t)}; 69 template <ranges::viewable_range _Range>
|
H A D | empty.h | 29 namespace ranges { 35 concept __can_invoke_size = !__member_empty<_Tp> && requires(_Tp&& __t) { ranges::size(__t); }; 39 bool(ranges::begin(__t) == ranges::end(__t)); 40 { ranges::begin(__t) } -> forward_iterator; 50 …PP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t) const noexcept(noexcept(ranges::size(__t))) { in operator() 51 return ranges::size(__t) == 0; in operator() 56 noexcept(noexcept(bool(ranges::begin(__t) == ranges::end(__t)))) { in operator() 57 return ranges::begin(__t) == ranges::end(__t); in operator()
|
H A D | access.h | 34 namespace ranges { 41 namespace ranges { 96 namespace ranges { 98 using iterator_t = decltype(ranges::begin(std::declval<_Tp&>())); 103 namespace ranges { 153 namespace ranges { 159 noexcept(noexcept(ranges::begin(static_cast<const remove_reference_t<_Tp>&>(__t)))) 160 -> decltype(ranges::begin(static_cast<const remove_reference_t<_Tp>&>(__t))) { 161 return ranges::begin(static_cast<const remove_reference_t<_Tp>&>(__t)); 167 noexcept(noexcept(ranges::begin(static_cast<const _Tp&&>(__t)))) [all …]
|
H A D | rbegin.h | 36 namespace ranges { 54 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>; 55 { ranges::begin(__t) } -> bidirectional_iterator; 75 …CPP_HIDE_FROM_ABI constexpr auto operator()(_Tp&& __t) const noexcept(noexcept(ranges::end(__t))) { in operator() 76 return std::make_reverse_iterator(ranges::end(__t)); in operator() 90 namespace ranges { 96 noexcept(noexcept(ranges::rbegin(static_cast<const remove_reference_t<_Tp>&>(__t)))) 97 -> decltype(ranges::rbegin(static_cast<const remove_reference_t<_Tp>&>(__t))) { 98 return ranges::rbegin(static_cast<const remove_reference_t<_Tp>&>(__t)); 104 noexcept(noexcept(ranges::rbegin(static_cast<const _Tp&&>(__t)))) [all …]
|
/freebsd/sys/contrib/device-tree/src/arm64/st/ |
H A D | stm32mp25xxai-pinctrl.dtsi | 13 gpio-ranges = <&pinctrl 0 0 16>; 19 gpio-ranges = <&pinctrl 0 16 16>; 25 gpio-ranges = <&pinctrl 0 32 14>; 31 gpio-ranges = <&pinctrl 0 48 16>; 37 gpio-ranges = <&pinctrl 0 64 16>; 43 gpio-ranges = <&pinctrl 0 80 16>; 49 gpio-ranges = <&pinctrl 0 96 16>; 55 gpio-ranges = <&pinctrl 2 114 12>; 61 gpio-ranges = <&pinctrl 0 128 16>; 67 gpio-ranges = <&pinctrl 0 144 16>; [all …]
|
/freebsd/sys/contrib/device-tree/src/arm/st/ |
H A D | stm32mp15xxaa-pinctrl.dtsi | 13 gpio-ranges = <&pinctrl 0 0 16>; 19 gpio-ranges = <&pinctrl 0 16 16>; 25 gpio-ranges = <&pinctrl 0 32 16>; 31 gpio-ranges = <&pinctrl 0 48 16>; 37 gpio-ranges = <&pinctrl 0 64 16>; 43 gpio-ranges = <&pinctrl 0 80 16>; 49 gpio-ranges = <&pinctrl 0 96 16>; 55 gpio-ranges = <&pinctrl 0 112 16>; 61 gpio-ranges = <&pinctrl 0 128 16>; 67 gpio-ranges = <&pinctrl 0 144 16>; [all …]
|
H A D | stm32mp15xxac-pinctrl.dtsi | 13 gpio-ranges = <&pinctrl 0 0 16>; 19 gpio-ranges = <&pinctrl 0 16 16>; 25 gpio-ranges = <&pinctrl 0 32 16>; 31 gpio-ranges = <&pinctrl 0 48 16>; 37 gpio-ranges = <&pinctrl 0 64 16>; 43 gpio-ranges = <&pinctrl 0 80 16>; 49 gpio-ranges = <&pinctrl 0 96 16>; 55 gpio-ranges = <&pinctrl 0 112 16>; 61 gpio-ranges = <&pinctrl 0 128 12>; 71 gpio-ranges = <&pinctrl_z 0 400 8>;
|
/freebsd/sys/contrib/device-tree/src/powerpc/fsl/ |
H A D | cyrus_p5020.dts | 27 ranges; 44 ranges = <0x00000000 0xf 0x00000000 0x01008000>; 48 ranges = <0x0 0xf 0xf4000000 0x200000>; 52 ranges = <0x0 0xf 0xf4200000 0x200000>; 56 ranges = <0x00000000 0xf 0xfe000000 0x1000000>; 76 ranges = <0 0 0xc 0x20000000 0 0x10000000>; 79 ranges = <0 0 0xc 0x30000000 0 0x10000000>; 85 ranges = <0 0 0xf 0xe8000000 0x08000000 92 ranges = <0x02000000 0 0xe0000000 0xc 0x00000000 0x0 0x20000000 95 ranges = <0x02000000 0 0xe0000000 [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | ranges_search.h | 35 namespace ranges { 48 auto __size2 = ranges::distance(__first2, __last2); in __ranges_search_impl() 53 auto __size1 = ranges::distance(__first1, __last1); in __ranges_search_impl() 55 ranges::advance(__first1, __last1); in __ranges_search_impl() 76 class _Pred = ranges::equal_to, 93 class _Pred = ranges::equal_to, 99 auto __first1 = ranges::begin(__range1); 101 auto __size2 = ranges::size(__range2); 105 auto __size1 = ranges::size(__range1); 107 ranges::advance(__first1, ranges::end(__range1)); [all …]
|
H A D | ranges_ends_with.h | 38 namespace ranges { 54 return ranges::starts_with( in __ends_with_fn_impl_bidirectional() 72 auto __n1 = ranges::distance(__first1, __last1); in __ends_with_fn_impl() 73 auto __n2 = ranges::distance(__first2, __last2); in __ends_with_fn_impl() 114 ranges::advance(__first1, __offset); in __ends_with_fn_impl_with_offset() 115 return ranges::equal( in __ends_with_fn_impl_with_offset() 130 class _Pred = ranges::equal_to, 150 class _Pred = ranges::equal_to, 158 auto __n1 = ranges::size(__range1); 159 auto __n2 = ranges::size(__range2); [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__format/ |
H A D | range_default_formatter.h | 40 ranges::input_range<const _Rp> && formattable<ranges::range_reference_t<const _Rp>, _CharT>; 65 template <ranges::input_range _Rp> 70 // 2.1 If same_as<remove_cvref_t<ranges::range_reference_t<R>>, R> is true, 72 if constexpr (same_as<remove_cvref_t<ranges::range_reference_t<_Rp>>, _Rp>) 80 __fmt_pair_like<remove_cvref_t<ranges::range_reference_t<_Rp>>>) 90 template <range_format _Kp, ranges::input_range _Rp, class _CharT> 95 template <ranges::input_range _Rp, class _CharT> 99 range_formatter<remove_cvref_t<ranges::range_reference_t<__maybe_const_r>>, _CharT> __underlying_; 122 template <ranges [all...] |
/freebsd/sys/dev/vnic/ |
H A D | mrml_bridge.c | 160 if (start >= sc->ranges[i].bus && end < in mrmlb_ofw_bus_alloc_res() 161 sc->ranges[i].bus + sc->ranges[i].size) { in mrmlb_ofw_bus_alloc_res() 162 start -= sc->ranges[i].bus; in mrmlb_ofw_bus_alloc_res() 163 start += sc->ranges[i].host; in mrmlb_ofw_bus_alloc_res() 164 end -= sc->ranges[i].bus; in mrmlb_ofw_bus_alloc_res() 165 end += sc->ranges[i].host; in mrmlb_ofw_bus_alloc_res() 205 sc->ranges = malloc(sc->nranges * sizeof(sc->ranges[0]), in mrmlb_ofw_fill_ranges() 211 sc->ranges[i].bus = 0; in mrmlb_ofw_fill_ranges() 213 sc->ranges[i].bus <<= 32; in mrmlb_ofw_fill_ranges() 214 sc->ranges[i].bus |= base_ranges[j++]; in mrmlb_ofw_fill_ranges() [all …]
|