Searched refs:ranges (Results 1 - 25 of 306) sorted by relevance

1234567891011>>

/freebsd-current/contrib/llvm-project/libcxx/modules/std/
H A Dalgorithm.inc11 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
[all...]
H A Dranges.inc11 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
[all...]
H A Dspan.inc17 namespace ranges {
18 using std::ranges::enable_borrowed_range;
19 using std::ranges::enable_view;
20 } // namespace ranges
H A Dmemory.inc63 namespace ranges {
64 using std::ranges::uninitialized_default_construct;
65 using std::ranges::uninitialized_default_construct_n;
66 } // namespace ranges
71 namespace ranges {
72 using std::ranges::uninitialized_value_construct;
73 using std::ranges::uninitialized_value_construct_n;
74 } // namespace ranges
79 namespace ranges {
80 using std::ranges
[all...]
/freebsd-current/contrib/llvm-project/libcxx/include/__ranges/
H A Dviews.h23 namespace ranges { namespace
27 } // namespace ranges
29 namespace views = ranges::views;
H A Dempty.h29 namespace ranges { namespace
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 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr bool operator()(_Tp&& __t) const noexcept(noexcept(ranges::size(__t))) {
51 return ranges::size(__t) == 0;
56 noexcept(noexcept(bool(ranges::begin(__t) == ranges::end(__t)))) {
57 return ranges
[all...]
H A Dcontainer_compatible_range.h27 ranges::input_range<_Range> && convertible_to<ranges::range_reference_t<_Range>, _Tp>;
H A Downing_view.h37 namespace ranges { namespace
57 _LIBCPP_HIDE_FROM_ABI constexpr iterator_t<_Rp> begin() { return ranges::begin(__r_); }
58 _LIBCPP_HIDE_FROM_ABI constexpr sentinel_t<_Rp> end() { return ranges::end(__r_); }
62 return ranges::begin(__r_);
67 return ranges::end(__r_);
71 requires requires { ranges::empty(__r_); }
73 return ranges::empty(__r_);
76 requires requires { ranges::empty(__r_); }
78 return ranges::empty(__r_);
84 return ranges
[all...]
H A Dall.h36 namespace ranges::views {
41 requires ranges::view<decay_t<_Tp>>
49 requires(!ranges::view<decay_t<_Tp>>) && requires(_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__t)}; }
51 noexcept(noexcept(ranges::ref_view{std::forward<_Tp>(__t)})) {
52 return ranges::ref_view{std::forward<_Tp>(__t)};
57 !ranges::view<decay_t<_Tp>> && !requires(_Tp&& __t) { ranges::ref_view{std::forward<_Tp>(__t)}; } &&
58 requires(_Tp&& __t) { ranges::owning_view{std::forward<_Tp>(__t)}; })
60 noexcept(noexcept(ranges
[all...]
H A Dsize.h35 namespace ranges { namespace
38 } // namespace ranges
42 namespace ranges { namespace
64 { ranges::begin(__t) } -> forward_iterator;
65 { ranges::end(__t) } -> sized_sentinel_for<decltype(ranges::begin(std::declval<_Tp>()))>;
98 noexcept(noexcept(std::__to_unsigned_like(ranges::end(__t) - ranges::begin(__t))))
99 -> decltype(std::__to_unsigned_like(ranges::end(__t) - ranges
113 namespace ranges { namespace
[all...]
H A Drend.h37 namespace ranges { namespace
41 ranges::rbegin(__t);
42 { _LIBCPP_AUTO_CAST(__t.rend()) } -> sentinel_for<decltype(ranges::rbegin(__t))>;
51 ranges::rbegin(__t);
52 { _LIBCPP_AUTO_CAST(rend(__t)) } -> sentinel_for<decltype(ranges::rbegin(__t))>;
57 { ranges::begin(__t) } -> same_as<decltype(ranges::end(__t))>;
58 { ranges::begin(__t) } -> bidirectional_iterator;
80 noexcept(noexcept(ranges::begin(__t))) {
81 return std::make_reverse_iterator(ranges
95 namespace ranges { namespace
[all...]
H A Denable_borrowed_range.h14 // separate header is used to avoid including the entire <ranges> header in
27 namespace ranges { namespace
29 // [range.range], ranges
34 } // namespace ranges
H A Ddata.h37 namespace ranges { namespace
49 { ranges::begin(__t) } -> contiguous_iterator;
60 noexcept(noexcept(std::to_address(ranges::begin(__t)))) {
61 return std::to_address(ranges::begin(__t));
69 } // namespace ranges
73 namespace ranges { namespace
79 noexcept(noexcept(ranges::data(static_cast<const remove_reference_t<_Tp>&>(__t))))
80 -> decltype(ranges::data(static_cast<const remove_reference_t<_Tp>&>(__t))) {
81 return ranges::data(static_cast<const remove_reference_t<_Tp>&>(__t));
87 noexcept(noexcept(ranges
[all...]
H A Dview_interface.h36 namespace ranges { namespace
56 return ranges::begin(__derived()) == ranges::end(__derived());
63 return ranges::begin(__derived()) == ranges::end(__derived());
68 requires requires(_D2& __t) { ranges::empty(__t); }
70 return !ranges::empty(__derived());
75 requires requires(const _D2& __t) { ranges::empty(__t); }
77 return !ranges::empty(__derived());
84 return std::to_address(ranges
[all...]
/freebsd-current/contrib/llvm-project/libcxx/include/__iterator/
H A Dranges_iterator_traits.h27 template <ranges::input_range _Range>
28 using __range_key_type = __remove_const_t<typename ranges::range_value_t<_Range>::first_type>;
30 template <ranges::input_range _Range>
31 using __range_mapped_type = typename ranges::range_value_t<_Range>::second_type;
33 template <ranges::input_range _Range>
35 pair<add_const_t<typename ranges::range_value_t<_Range>::first_type>,
36 typename ranges::range_value_t<_Range>::second_type>;
/freebsd-current/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_reverse.h29 namespace ranges { namespace
39 auto __end = ranges::next(__first, __last);
43 ranges::iter_swap(__first, __end);
48 auto __end = ranges::next(__first, __last);
55 ranges::iter_swap(__first, __end);
65 return (*this)(ranges::begin(__range), ranges::end(__range));
73 } // namespace ranges
H A Dranges_is_sorted.h33 namespace ranges { namespace
39 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
42 return ranges::__is_sorted_until_impl(std::move(__first), __last, __comp, __proj) == __last;
47 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
50 auto __last = ranges::end(__range);
51 return ranges::__is_sorted_until_impl(ranges::begin(__range), __last, __comp, __proj) == __last;
59 } // namespace ranges
H A Dranges_contains.h35 namespace ranges { namespace
39 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
42 return ranges::find(std::move(__first), __last, __value, std::ref(__proj)) != __last;
46 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
49 return ranges::find(ranges::begin(__range), ranges::end(__range), __value, std::ref(__proj)) !=
50 ranges::end(__range);
58 } // namespace ranges
H A Dranges_search.h35 namespace ranges { namespace
48 auto __size2 = ranges::distance(__first2, __last2);
53 auto __size1 = ranges::distance(__first1, __last1);
55 ranges::advance(__first1, __last1);
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
[all...]
H A Dranges_minmax_element.h38 namespace ranges { namespace
48 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
49 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_element_result<_Ip>
57 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
58 _LIBCPP_NODISCARD_EXT _LIBCPP_HIDE_FROM_ABI constexpr ranges::minmax_element_result<borrowed_iterator_t<_Rp>>
60 auto __ret = std::__minmax_element_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
70 } // namespace ranges
H A Dranges_min_element.h34 namespace ranges { namespace
36 // TODO(ranges): `ranges::min_element` can now simply delegate to `std::__min_element`.
54 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
57 return ranges::__min_element_impl(__first, __last, __comp, __proj);
62 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
65 return ranges::__min_element_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
73 } // namespace ranges
[all...]
H A Dranges_max_element.h34 namespace ranges { namespace
40 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
44 return ranges::__min_element_impl(__first, __last, __comp_lhs_rhs_swapped, __proj);
49 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
53 return ranges::__min_element_impl(ranges::begin(__r), ranges::end(__r), __comp_lhs_rhs_swapped, __proj);
61 } // namespace ranges
H A Dranges_replace.h34 namespace ranges { namespace
39 indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type1*>
43 return ranges::__replace_if_impl(std::move(__first), std::move(__last), __pred, __new_value, __proj);
48 indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type1*>
52 return ranges::__replace_if_impl(ranges::begin(__range), ranges::end(__range), __pred, __new_value, __proj);
60 } // namespace ranges
H A Dranges_remove.h35 namespace ranges { namespace
39 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
43 return ranges::__remove_if_impl(std::move(__first), std::move(__last), __pred, __proj);
48 indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type*>
52 return ranges::__remove_if_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
60 } // namespace ranges
/freebsd-current/contrib/elftoolchain/libdwarf/
H A Ddwarf_ranges.c33 Dwarf_Ranges **ranges, Dwarf_Signed *ret_cnt, Dwarf_Unsigned *ret_byte_cnt,
46 *ranges = rl->rl_rgarray;
56 dwarf_get_ranges(Dwarf_Debug dbg, Dwarf_Off offset, Dwarf_Ranges **ranges, argument
60 if (dbg == NULL || ranges == NULL || ret_cnt == NULL) {
71 ranges, ret_cnt, ret_byte_cnt, error));
76 Dwarf_Ranges **ranges, Dwarf_Signed *ret_cnt, Dwarf_Unsigned *ret_byte_cnt,
80 if (dbg == NULL || die == NULL || ranges == NULL || ret_cnt == NULL) {
85 return (_dwarf_get_ranges(dbg, die->die_cu, offset, ranges, ret_cnt,
32 _dwarf_get_ranges(Dwarf_Debug dbg, Dwarf_CU cu, Dwarf_Off off, Dwarf_Ranges **ranges, Dwarf_Signed *ret_cnt, Dwarf_Unsigned *ret_byte_cnt, Dwarf_Error *error) argument
75 dwarf_get_ranges_a(Dwarf_Debug dbg, Dwarf_Off offset, Dwarf_Die die, Dwarf_Ranges **ranges, Dwarf_Signed *ret_cnt, Dwarf_Unsigned *ret_byte_cnt, Dwarf_Error *error) argument

Completed in 282 milliseconds

1234567891011>>