Searched refs:forward (Results 1 - 25 of 347) sorted by relevance

1234567891011>>

/freebsd-current/contrib/llvm-project/libcxx/include/__compare/
H A Dcompare_strong_order_fallback.h17 #include <__utility/forward.h>
34 noexcept(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
35 -> decltype(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) { function in class:__compare_strong_order_fallback::__fn::std
36 return std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal
43 : std::forward<_T
[all...]
H A Dcompare_weak_order_fallback.h17 #include <__utility/forward.h>
34 noexcept(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
35 -> decltype(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) { function in class:__compare_weak_order_fallback::__fn::std
36 return std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent
43 : std::forward<_T
[all...]
H A Dcompare_partial_order_fallback.h17 #include <__utility/forward.h>
34 noexcept(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))
35 -> decltype(std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))) { function in class:__compare_partial_order_fallback::__fn::std
36 return std::partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u));
42 std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent
43 : std::forward<_T
[all...]
H A Dcompare_three_way.h15 #include <__utility/forward.h>
29 noexcept(noexcept(std::forward<_T1>(__t) <=> std::forward<_T2>(__u))) {
30 return std::forward<_T1>(__t) <=> std::forward<_T2>(__u);
H A Dweak_order.h17 #include <__utility/forward.h>
36 noexcept(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
37 -> decltype(weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
38 return weak_ordering(weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
71 noexcept(weak_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
72 -> decltype(weak_ordering(compare_three_way()(std::forward<_T
[all...]
H A Dpartial_order.h18 #include <__utility/forward.h>
36 noexcept(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
37 -> decltype(partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
38 return partial_ordering(partial_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)));
45 noexcept(partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))))
46 -> decltype(partial_ordering(compare_three_way()(std::forward<_T
[all...]
/freebsd-current/contrib/llvm-project/libcxx/include/__functional/
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)...))) { function in class:__compose_op::std
33 return std::invoke(std::forward<_Fn1>(__f1), std::invoke(std::forward<_Fn2>(__f2), std::forward<_Arg
45 -> decltype(__compose_t<decay_t<_Fn1>, decay_t<_Fn2>>(std::forward<_Fn1>(__f1), std::forward<_Fn2>(__f2))) { function in class:std
[all...]
H A Dranges_operations.h18 #include <__utility/forward.h>
34 noexcept(noexcept(bool(std::forward<_Tp>(__t) == std::forward<_Up>(__u)))) {
35 return std::forward<_Tp>(__t) == std::forward<_Up>(__u);
45 noexcept(noexcept(bool(!(std::forward<_Tp>(__t) == std::forward<_Up>(__u))))) {
46 return !(std::forward<_Tp>(__t) == std::forward<_Up>(__u));
56 noexcept(noexcept(bool(std::forward<_T
[all...]
H A Dbind_back.h17 #include <__utility/forward.h>
36 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))...)) { function in class:__bind_back_op::std
42 return std::invoke(std::forward<_Fn>(__f),
43 std::forward<_Args>(__args)...,
44 std::get<_Ip>(std::forward<_BoundArg
60 std::forward<_Fn>(__f), std::forward_as_tuple(std::forward<_Args>(__args)...))) { function in class:std
[all...]
H A Dinvoke.h15 #include <__utility/forward.h>
28 return std::__invoke(std::forward<_Fn>(__f), std::forward<_Args>(__args)...);
39 static_cast<void>(std::invoke(std::forward<_Fn>(__f), std::forward<_Args>(__args)...));
47 return std::invoke(std::forward<_Fn>(__f), std::forward<_Args>(__args)...);
H A Doperations.h18 #include <__utility/forward.h>
54 noexcept(noexcept(std::forward<_T1>(__t) + std::forward<_T2>(__u)))
55 -> decltype(std::forward<_T1>(__t) + std::forward<_T2>(__u)) { function in class:plus::std
56 return std::forward<_T1>(__t) + std::forward<_T2>(__u);
80 noexcept(noexcept(std::forward<_T1>(__t) - std::forward<_T2>(__u)))
81 -> decltype(std::forward<_T function in class:minus::std
107 -> decltype(std::forward<_T1>(__t) * std::forward<_T2>(__u)) { function in class:multiplies::std
133 -> decltype(std::forward<_T1>(__t) / std::forward<_T2>(__u)) { function in class:divides::std
159 -> decltype(std::forward<_T1>(__t) % std::forward<_T2>(__u)) { function in class:modulus::std
210 -> decltype(std::forward<_T1>(__t) & std::forward<_T2>(__u)) { function in class:bit_and::std
228 noexcept(noexcept(~std::forward<_Tp>(__x))) -> decltype(~std::forward<_Tp>(__x)) { function in struct:bit_not
254 -> decltype(std::forward<_T1>(__t) | std::forward<_T2>(__u)) { function in class:bit_or::std
280 -> decltype(std::forward<_T1>(__t) ^ std::forward<_T2>(__u)) { function in class:bit_xor::std
369 -> decltype(std::forward<_T1>(__t) < std::forward<_T2>(__u)) { function in class:less::std
447 -> decltype(std::forward<_T1>(__t) > std::forward<_T2>(__u)) { function in class:greater::std
475 -> decltype(std::forward<_T1>(__t) && std::forward<_T2>(__u)) { function in class:logical_and::std
524 -> decltype(std::forward<_T1>(__t) || std::forward<_T2>(__u)) { function in class:logical_or::std
[all...]
H A Dbind_front.h21 #include <__utility/forward.h>
34 noexcept(noexcept(std::invoke(std::forward<_Args>(__args)...)))
35 -> decltype(std::invoke(std::forward<_Args>(__args)...)) {
36 return std::invoke(std::forward<_Args>(__args)...);
49 return __bind_front_t<decay_t<_Fn>, decay_t<_Args>...>(std::forward<_Fn>(__f), std::forward<_Args>(__args)...);
/freebsd-current/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/assocs/
H A Dtst.invalidref.d41 forward = 0;
46 /!forward/
48 forward = 1;
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSmallVectorExtras.h26 map_range(std::forward<ContainerTy>(C), std::forward<FuncTy>(F)));
31 map_range(std::forward<ContainerTy>(C), std::forward<FuncTy>(F)));
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));
46 swap(std::forward<T>(lhs), std::forward<T>(rhs));
53 -> decltype(size(std::forward<RangeT>(range))) {
54 return size(std::forward<RangeT>(range));
63 -> decltype(adl_detail::begin_impl(std::forward<RangeT>(range))) {
64 return adl_detail::begin_impl(std::forward<Range
[all...]
/freebsd-current/contrib/llvm-project/libcxx/include/__algorithm/
H A Dpstl_frontend_dispatch.h14 #include <__utility/forward.h>
26 typename __select_backend<policy>::type{}, std::forward<decltype(__args)>(__args)...)) { \
27 return std::name<policy>(typename __select_backend<policy>::type{}, std::forward<decltype(__args)>(__args)...); \
34 return __specialized_impl(std::forward<_Args>(__args)...);
36 return __generic_impl(std::forward<_Args>(__args)...);
/freebsd-current/contrib/llvm-project/clang/include/clang/AST/
H A DNonTrivialTypeVisitor.h24 std::forward<Ts>(Args)...);
32 return asDerived().visitARCStrong(FT, std::forward<Ts>(Args)...);
34 return asDerived().visitStruct(FT, std::forward<Ts>(Args)...);
36 return asDerived().visitTrivial(FT, std::forward<Ts>(Args)...);
38 return asDerived().visitCXXDestructor(FT, std::forward<Ts>(Args)...);
40 return asDerived().visitARCWeak(FT, std::forward<Ts>(Args)...);
54 std::forward<Ts>(Args)...);
62 return asDerived().visitARCStrong(FT, std::forward<Ts>(Args)...);
64 return asDerived().visitARCWeak(FT, std::forward<Ts>(Args)...);
66 return asDerived().visitStruct(FT, std::forward<T
[all...]
/freebsd-current/contrib/llvm-project/libcxx/include/__concepts/
H A Dinvocable.h14 #include <__utility/forward.h>
28 std::invoke(std::forward<_Fn>(__fn), std::forward<_Args>(__args)...); // not required to be equality preserving
H A Dboolean_testable.h14 #include <__utility/forward.h>
31 { !std::forward<_Tp>(__t) } -> __boolean_testable_impl;
H A Dswappable.h22 #include <__utility/forward.h>
51 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u));
77 noexcept(noexcept(swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) {
78 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u));
111 ranges::swap(std::forward<_Tp>(__t), std::forward<_Tp>(__t));
112 ranges::swap(std::forward<_U
[all...]
/freebsd-current/contrib/llvm-project/libcxx/modules/std/
H A Dforward_list.inc11 // [forward.list], class template forward_list
19 // [forward.list.erasure], erasure
/freebsd-current/contrib/llvm-project/libcxx/include/__ranges/
H A Dall.h26 #include <__utility/forward.h>
43 noexcept(noexcept(_LIBCPP_AUTO_CAST(std::forward<_Tp>(__t))))
44 -> decltype(_LIBCPP_AUTO_CAST(std::forward<_Tp>(__t))) {
45 return _LIBCPP_AUTO_CAST(std::forward<_Tp>(__t));
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::owning_view{std::forward<_T
[all...]
/freebsd-current/contrib/unbound/testdata/stat_values.tdir/
H A Dstat_values_cachedb.conf31 forward-zone:
33 forward-addr: "127.0.0.1@@TOPORT@"
34 forward-zone:
36 forward-addr: "127.0.0.1@@EXPIREDPORT@"
/freebsd-current/contrib/llvm-project/libcxx/include/__iterator/
H A Diter_move.h19 #include <__utility/forward.h>
43 iter_move(std::forward<_Tp>(__t));
65 noexcept(noexcept(iter_move(std::forward<_Ip>(__i)))) {
66 return iter_move(std::forward<_Ip>(__i));
73 noexcept(noexcept(std::move(*std::forward<_Ip>(__i)))) -> decltype(std::move(*std::forward<_Ip>(__i))) {
74 return std::move(*std::forward<_Ip>(__i));
80 noexcept(noexcept(*std::forward<_Ip>(__i))) -> decltype(*std::forward<_Ip>(__i)) { function in struct:ranges::__iter_move::__fn
81 return *std::forward<_I
[all...]
H A Diter_swap.h22 #include <__utility/forward.h>
47 iter_swap(std::forward<_T1>(__x), std::forward<_T2>(__y));
60 noexcept(noexcept(iter_swap(std::forward<_T1>(__x), std::forward<_T2>(__y)))) {
61 (void)iter_swap(std::forward<_T1>(__x), std::forward<_T2>(__y));
68 noexcept(noexcept(ranges::swap(*std::forward<_T1>(__x), *std::forward<_T2>(__y)))) {
69 ranges::swap(*std::forward<_T
[all...]

Completed in 271 milliseconds

1234567891011>>