Home
last modified time | relevance | path

Searched refs:forward (Results 1 – 25 of 754) sorted by relevance

12345678910>>...31

/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Doperations.h55 noexcept(noexcept(std::forward<_T1>(__t) + std::forward<_T2>(__u))) //
56 -> decltype(std::forward<_T1>(__t) + std::forward<_T2>(__u)) {
57 return std::forward<_T1>(__t) + std::forward<_T2>(__u);
81 noexcept(noexcept(std::forward<_T1>(__t) - std::forward<_T2>(__u))) //
82 -> decltype(std::forward<_T1>(__t) - std::forward<_T2>(__u)) {
83 return std::forward<_T1>(__t) - std::forward<_T2>(__u);
107 noexcept(noexcept(std::forward<_T1>(__t) * std::forward<_T2>(__u))) //
108 -> decltype(std::forward<_T1>(__t) * std::forward<_T2>(__u)) {
109 return std::forward<_T1>(__t) * std::forward<_T2>(__u);
133 noexcept(noexcept(std::forward<_T1>(__t) / std::forward<_T2>(__u))) //
[all …]
H A Dranges_operations.h33 noexcept(noexcept(bool(std::forward<_Tp>(__t) == std::forward<_Up>(__u)))) { in operator()
34 return std::forward<_Tp>(__t) == std::forward<_Up>(__u); in operator()
44 noexcept(noexcept(bool(!(std::forward<_Tp>(__t) == std::forward<_Up>(__u))))) { in operator()
45 return !(std::forward<_Tp>(__t) == std::forward<_Up>(__u)); in operator()
55 noexcept(noexcept(bool(std::forward<_Tp>(__t) < std::forward<_Up>(__u)))) { in operator()
56 return std::forward<_Tp>(__t) < std::forward<_Up>(__u); in operator()
66 noexcept(noexcept(bool(!(std::forward<_Up>(__u) < std::forward<_Tp>(__t))))) { in operator()
67 return !(std::forward<_Up>(__u) < std::forward<_Tp>(__t)); in operator()
77 noexcept(noexcept(bool(std::forward<_Up>(__u) < std::forward<_Tp>(__t)))) { in operator()
78 return std::forward<_Up>(__u) < std::forward<_Tp>(__t); in operator()
[all …]
H A Dcompose.h17 #include <__utility/forward.h>
30 std::invoke(std::forward<_Fn1>(__f1), std::invoke(std::forward<_Fn2>(__f2), std::forward<_Args>(__args)...))))
31 -> decltype(std::invoke(std::forward<_Fn1>(__f1),
32 std::invoke(std::forward<_Fn2>(__f2), std::forward<_Args>(__args)...))) {
33 return std::invoke(std::forward<_Fn1>(__f1), std::invoke(std::forward<_Fn2>(__f2), std::forward<_Arg
[all...]
H A Dbind_back.h36 noexcept(noexcept(std::invoke(std::forward<_Fn>(__f),
37 std::forward<_Args>(__args)...,
38 std::get<_Ip>(std::forward<_BoundArgs>(__bound_args))...)))
39 -> decltype(std::invoke(std::forward<_Fn>(__f),
40 std::forward<_Args>(__args)...,
41 std::get<_Ip>(std::forward<_BoundArgs>(__bound_args))...)) {
42 return std::invoke(std::forward<_Fn>(__f),
43 std::forward<_Args>(__args)...,
44 std::get<_Ip>(std::forward<_BoundArgs>(__bound_args))...);
58 std::forward<_Fn>(__f), std::forward_as_tuple(std::forward<_Args>(__args)...))))
[all …]
H A Dperfect_forward.h46 : __bound_args_(std::forward<_Args>(__bound_args)...) {}
56 noexcept(_Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...)))
57 -> decltype(_Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...)) {
58 return _Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...);
66 noexcept(_Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...)))
67 -> decltype(_Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...)) {
68 return _Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...);
76 noexcept(_Op()(std::get<_Idx>(std::move(__bound_args_))..., std::forward<_Args>(__args)...)))
77 … -> decltype(_Op()(std::get<_Idx>(std::move(__bound_args_))..., std::forward<_Args>(__args)...)) {
78 return _Op()(std::get<_Idx>(std::move(__bound_args_))..., std::forward<_Args>(__args)...);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__compare/
H A Dcompare_partial_order_fallback.h35 noexcept(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
36 -> decltype(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
37 return std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 { std::forward<_Tp>(__t) == std::forward<_Up>(__u) } -> __boolean_testable; in requires()
43 { std::forward<_Tp>(__t) < std::forward<_Up>(__u) } -> __boolean_testable; in requires()
44 { std::forward<_Up>(__u) < std::forward<_Tp>(__t) } -> __boolean_testable; in requires()
47 noexcept(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent in __go()
48 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less in __go()
49 : std::forward<_Up>(__u) < std::forward<_Tp>(__t) ? partial_ordering::greater in __go()
51 return std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent in __go()
[all …]
H A Dcompare_strong_order_fallback.h35 noexcept(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
36 -> decltype(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
37 return std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 { std::forward<_Tp>(__t) == std::forward<_Up>(__u) } -> __boolean_testable; in requires()
43 { std::forward<_Tp>(__t) < std::forward<_Up>(__u) } -> __boolean_testable; in requires()
46 noexcept(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal in __go()
47 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? strong_ordering::less in __go()
49 return std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal in __go()
50 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) in __go()
57 noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<1>())))
[all …]
H A Dcompare_weak_order_fallback.h35 noexcept(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
36 -> decltype(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) {
37 return std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 { std::forward<_Tp>(__t) == std::forward<_Up>(__u) } -> __boolean_testable; in requires()
43 { std::forward<_Tp>(__t) < std::forward<_Up>(__u) } -> __boolean_testable; in requires()
46 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent in __go()
47 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) in __go()
50 return std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent in __go()
51 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) in __go()
58 noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<1>())))
[all …]
H A Dpartial_order.h38 noexcept(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
39 -> decltype(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
40 return partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
47 … noexcept(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
48 …-> decltype(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u))))…
49 return partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
55 noexcept(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
56 … -> decltype(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
57 return partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
62 noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())))
[all …]
H A Dweak_order.h40 noexcept(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
41 -> decltype(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
42 return weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
75 noexcept(weak_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
76 … -> decltype(weak_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
77 return weak_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
83 noexcept(weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
84 … -> decltype(weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
85 return weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
90 noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<3>())))
[all …]
H A Dstrong_order.h47 noexcept(strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
48 -> decltype(strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
49 return strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
119 … noexcept(strong_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
120 …-> decltype(strong_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
121 return strong_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
126 noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())))
127 -> decltype(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())) {
128 return __go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>());
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DADL.h28 -> decltype(begin(std::forward<RangeT>(range))) {
29 return begin(std::forward<RangeT>(range));
36 -> decltype(end(std::forward<RangeT>(range))) {
37 return end(std::forward<RangeT>(range));
44 -> decltype(rbegin(std::forward<RangeT>(range))) {
45 return rbegin(std::forward<RangeT>(range));
52 -> decltype(rend(std::forward<RangeT>(range))) {
53 return rend(std::forward<RangeT>(range));
62 swap(std::forward<T>(lhs), std::forward<T>(rhs)); in swap_impl()
69 -> decltype(size(std::forward<RangeT>(range))) {
[all …]
H A DSmallVectorExtras.h25 return to_vector<Size>(make_filter_range(std::forward<ContainerTy>(C), in filter_to_vector()
26 std::forward<PredicateFn>(Pred))); in filter_to_vector()
32 return to_vector(make_filter_range(std::forward<ContainerTy>(C), in filter_to_vector()
33 std::forward<PredicateFn>(Pred))); in filter_to_vector()
40 map_range(std::forward<ContainerTy>(C), std::forward<FuncTy>(F))); in map_to_vector()
47 map_range(std::forward<ContainerTy>(C), std::forward<FuncTy>(F))); in map_to_vector()
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DNonTrivialTypeVisitor.h24 std::forward<Ts>(Args)...); in visit()
32 return asDerived().visitARCStrong(FT, std::forward<Ts>(Args)...); in visitWithKind()
34 return asDerived().visitStruct(FT, std::forward<Ts>(Args)...); in visitWithKind()
36 return asDerived().visitTrivial(FT, std::forward<Ts>(Args)...); in visitWithKind()
38 return asDerived().visitCXXDestructor(FT, std::forward<Ts>(Args)...); in visitWithKind()
40 return asDerived().visitARCWeak(FT, std::forward<Ts>(Args)...); in visitWithKind()
54 std::forward<Ts>(Args)...); in visit()
62 return asDerived().visitARCStrong(FT, std::forward<Ts>(Args)...); in visitWithKind()
64 return asDerived().visitARCWeak(FT, std::forward<Ts>(Args)...); in visitWithKind()
66 return asDerived().visitStruct(FT, std::forward<Ts>(Args)...); in visitWithKind()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__format/
H A Dformat_arg.h107 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__monostate_); in decltype()
109 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__boolean_); in decltype()
111 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__char_type_); in decltype()
113 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__int_); in decltype()
115 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__long_long_); in decltype()
118 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__i128_); in decltype()
123 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__unsigned_); in decltype()
125 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__unsigned_long_long_); in decltype()
128 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__u128_); in decltype()
133 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__float_); in decltype()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Dto.h58 requires { __c.emplace_back(std::forward<_Ref>(__ref)); } || in requires()
59 requires { __c.push_back(std::forward<_Ref>(__ref)); } || in requires()
60 requires { __c.emplace(__c.end(), std::forward<_Ref>(__ref)); } || in requires()
61 requires { __c.insert(__c.end(), std::forward<_Ref>(__ref)); }); in requires()
93 return _Container(std::forward<_Range>(__range), std::forward<_Args>(__args)...); in to()
98 return _Container(from_range, std::forward<_Range>(__range), std::forward<_Args>(__args)...); in to()
103 … return _Container(ranges::begin(__range), ranges::end(__range), std::forward<_Args>(__args)...); in to()
109 _Container __result(std::forward<_Args>(__args)...); in to()
117 __result.emplace_back(std::forward<_Ref>(__ref)); in to()
119 __result.push_back(std::forward<_Ref>(__ref)); in to()
[all …]
H A Dall.h43 …noexcept(_LIBCPP_AUTO_CAST(std::forward<_Tp>(__t)))) -> decltype(_LIBCPP_AUTO_CAST(std::forward<_T…
44 return _LIBCPP_AUTO_CAST(std::forward<_Tp>(__t));
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)};
H A Ddrop_view.h214 noexcept(noexcept(_LIBCPP_AUTO_CAST(std::forward<_Range>(__range))))
215 -> decltype(_LIBCPP_AUTO_CAST(std::forward<_Range>(__range))) {
216 return _LIBCPP_AUTO_CAST(std::forward<_Range>(__range));
228 …ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)), ranges::e…
231 … ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
234 …ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)), ranges::e…
245 … _RawRange(ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
248 … std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))))))
251 ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
254 … std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))))) {
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__concepts/
H A Dswappable.h50 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in requires()
76 noexcept(noexcept(swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) { in operator()
77 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in operator()
110 ranges::swap(std::forward<_Tp>(__t), std::forward<_Tp>(__t)); in requires()
111 ranges::swap(std::forward<_Up>(__u), std::forward<_Up>(__u)); in requires()
112 ranges::swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in requires()
113 ranges::swap(std::forward<_Up>(__u), std::forward<_Tp>(__t)); in requires()
/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Diter_swap.h47 iter_swap(std::forward<_T1>(__x), std::forward<_T2>(__y)); in requires()
60 noexcept(noexcept(iter_swap(std::forward<_T1>(__x), std::forward<_T2>(__y)))) { in operator()
61 (void)iter_swap(std::forward<_T1>(__x), std::forward<_T2>(__y)); in operator()
68 noexcept(noexcept(ranges::swap(*std::forward<_T1>(__x), *std::forward<_T2>(__y)))) { in operator()
69 ranges::swap(*std::forward<_T1>(__x), *std::forward<_T2>(__y)); in operator()
80 noexcept(*std::forward<_T1>(__x) = std::declval<iter_value_t<_T2>>())) { in operator()
83 *std::forward<_T1>(__x) = std::move(__old); in operator()
H A Diter_move.h44 iter_move(std::forward<_Tp>(__t)); in requires()
66 noexcept(noexcept(iter_move(std::forward<_Ip>(__i)))) { in decltype()
67 return iter_move(std::forward<_Ip>(__i)); in decltype()
74 …noexcept(noexcept(std::move(*std::forward<_Ip>(__i)))) -> decltype(std::move(*std::forward<_Ip>(__…
75 return std::move(*std::forward<_Ip>(__i));
81 noexcept(noexcept(*std::forward<_Ip>(__i))) -> decltype(*std::forward<_Ip>(__i)) {
82 return *std::forward<_Ip>(__i);
/freebsd/contrib/llvm-project/libcxx/include/__memory/
H A Duses_allocator_construction.h78 __alloc, std::forward<decltype(__args1)>(__args1)...);
80 std::forward<_Tuple1>(__x)),
84 __alloc, std::forward<decltype(__args2)>(__args2)...);
86 std::forward<_Tuple2>(__y)));
99 std::forward_as_tuple(std::forward<_Up>(__u)),
100 std::forward_as_tuple(std::forward<_Vp>(__v)));
141 std::forward_as_tuple(std::get<0>(std::forward<_PairLike>(__p))),
142 std::forward_as_tuple(std::get<1>(std::forward<_PairLike>(__p))));
164 …_LIBCPP_HIDDEN constexpr operator _PairMutable() const { return __do_construct(std::forward<_Type>…
176 return std::forward_as_tuple(std::forward<_Args>(__args)...);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__expected/
H A Dexpected.h79 throw bad_expected_access<_Err>(std::forward<_Arg>(__arg));
111 : __v(std::forward<_Args>(__args)...) {}
116 : __v(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {}
125 : __v(std::forward<_Args>(__args)...) {}
130 : __v(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {}
235 : __val_(std::forward<_Args>(__args)...) {}
239 : __unex_(std::forward<_Args>(__args)...) {}
244 : __val_(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {}
249 : __unex_(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {}
270 : __union_(in_place, __tag, std::forward<_Args>(__args)...), __has_val_(true) {}
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/
H A Dglue_algorithm_impl.h
/freebsd/contrib/llvm-project/libc/src/__support/CPP/type_traits/
H A Dinvoke.h33 return cpp::forward<T>(fun)(cpp::forward<Args>(args)...); in decltype()
47 return (cpp::forward<T>(t1).*fun)(cpp::forward<Args>(args)...);
50 return (*cpp::forward<T>(t1).*fun)(cpp::forward<Args>(args)...);
61 cpp::forward<Function>(fun), cpp::forward<Args>(args)...);

12345678910>>...31