/freebsd/contrib/llvm-project/libcxx/include/__functional/ |
H A D | operations.h | 56 return std::forward<_T1>(__t) + std::forward<_T2>(__u); 82 return std::forward<_T1>(__t) - std::forward<_T2>(__u); 108 return std::forward<_T1>(__t) * std::forward<_T2>(__u); 134 return std::forward<_T1>(__t) / std::forward<_T2>(__u); 160 return std::forward<_T1>(__t) % std::forward<_T2>(__u); 211 return std::forward<_T1>(__t) & std::forward<_T2>(__u); 255 return std::forward<_T1>(__t) | std::forward<_T2>(__u); 281 return std::forward<_T1>(__t) ^ std::forward<_T2>(__u); 309 return std::forward<_T1>(__t) == std::forward<_T2>(__u); 370 return std::forward<_T1>(__t) < std::forward<_T2>(__u); [all …]
|
H A D | ranges_operations.h | 34 noexcept(noexcept(bool(std::forward<_Tp>(__t) == std::forward<_Up>(__u)))) { in operator() 35 return std::forward<_Tp>(__t) == std::forward<_Up>(__u); in operator() 45 noexcept(noexcept(bool(!(std::forward<_Tp>(__t) == std::forward<_Up>(__u))))) { in operator() 46 return !(std::forward<_Tp>(__t) == std::forward<_Up>(__u)); in operator() 56 noexcept(noexcept(bool(std::forward<_Tp>(__t) < std::forward<_Up>(__u)))) { in operator() 57 return std::forward<_Tp>(__t) < std::forward<_Up>(__u); in operator() 67 noexcept(noexcept(bool(!(std::forward<_Up>(__u) < std::forward<_Tp>(__t))))) { in operator() 68 return !(std::forward<_Up>(__u) < std::forward<_Tp>(__t)); in operator() 78 noexcept(noexcept(bool(std::forward<_Up>(__u) < std::forward<_Tp>(__t)))) { in operator() 79 return std::forward<_Up>(__u) < std::forward<_Tp>(__t); in operator() [all …]
|
H A D | compose.h | 30 …std::invoke(std::forward<_Fn1>(__f1), std::invoke(std::forward<_Fn2>(__f2), std::forward<_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<_A… 44 …noexcept(__compose_t<decay_t<_Fn1>, decay_t<_Fn2>>(std::forward<_Fn1>(__f1), std::forward<_Fn2>(__… 45 …-> decltype(__compose_t<decay_t<_Fn1>, decay_t<_Fn2>>(std::forward<_Fn1>(__f1), std::forward<_Fn2>… 46 …return __compose_t<decay_t<_Fn1>, decay_t<_Fn2>>(std::forward<_Fn1>(__f1), std::forward<_Fn2>(__f2…
|
H A D | bind_back.h | 36 noexcept(noexcept(std::invoke(std::forward<_Fn>(__f), 37 std::forward<_Args>(__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)...)))) 60 std::forward<_Fn>(__f), std::forward_as_tuple(std::forward<_Args>(__args)...))) { [all …]
|
H A D | perfect_forward.h | 45 : __bound_args_(std::forward<_Args>(__bound_args)...) {} 55 noexcept(_Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...))) 56 -> decltype(_Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...)) { 57 return _Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...); 65 noexcept(_Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...))) 66 -> decltype(_Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...)) { 67 return _Op()(std::get<_Idx>(__bound_args_)..., std::forward<_Args>(__args)...); 75 noexcept(_Op()(std::get<_Idx>(std::move(__bound_args_))..., std::forward<_Args>(__args)...))) 77 return _Op()(std::get<_Idx>(std::move(__bound_args_))..., std::forward<_Args>(__args)...); 85 noexcept(_Op()(std::get<_Idx>(std::move(__bound_args_))..., std::forward<_Args>(__args)...))) [all …]
|
H A D | invoke.h | 28 return std::__invoke(std::forward<_Fn>(__f), std::forward<_Args>(__args)...); in invoke() 39 static_cast<void>(std::invoke(std::forward<_Fn>(__f), std::forward<_Args>(__args)...)); in invoke_r() 47 return std::invoke(std::forward<_Fn>(__f), std::forward<_Args>(__args)...); in invoke_r()
|
/freebsd/contrib/llvm-project/libcxx/include/__compare/ |
H A D | compare_partial_order_fallback.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))) { 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<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less 44 : std::forward<_Up>(__u) < std::forward<_Tp>(__t) 49 : std::forward<_Up>(__u) < std::forward<_Tp>(__t) 52 return std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? partial_ordering::equivalent 53 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less 54 : std::forward<_Up>(__u) < std::forward<_Tp>(__t) [all …]
|
H A D | compare_strong_order_fallback.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))) { 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<_Tp>(__t) < std::forward<_Up>(__u) 46 -> decltype(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal 47 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) 50 return std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? strong_ordering::equal 51 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) 59 -> decltype(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<1>())) { [all …]
|
H A D | compare_weak_order_fallback.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))) { 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<_Tp>(__t) < std::forward<_Up>(__u) 46 -> decltype(std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent 47 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) 50 return std::forward<_Tp>(__t) == std::forward<_Up>(__u) ? weak_ordering::equivalent 51 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) 59 -> decltype(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<1>())) { [all …]
|
H A D | partial_order.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))))) 47 return partial_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u))); 53 noexcept(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))) 54 … -> decltype(partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) { 55 return partial_ordering(std::weak_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))); 60 noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>()))) 61 -> decltype(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())) { [all …]
|
H A D | weak_order.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))))) 73 return weak_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u))); 79 noexcept(weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))) 80 … -> decltype(weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) { 81 return weak_ordering(std::strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))); 86 noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<3>()))) 87 -> decltype(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<3>())) { [all …]
|
H A D | strong_order.h | 42 noexcept(strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))))) 43 -> decltype(strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) { 44 return strong_ordering(strong_order(std::forward<_Tp>(__t), std::forward<_Up>(__u))); 114 … noexcept(strong_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u))))) 115 …-> decltype(strong_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) { 116 return strong_ordering(compare_three_way()(std::forward<_Tp>(__t), std::forward<_Up>(__u))); 121 noexcept(noexcept(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>()))) 122 -> decltype(__go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>())) { 123 return __go(std::forward<_Tp>(__t), std::forward<_Up>(__u), __priority_tag<2>());
|
/freebsd/contrib/llvm-project/clang/include/clang/AST/ |
H A D | NonTrivialTypeVisitor.h | 24 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() 40 return asDerived().visitARCWeak(FT, std::forward<Ts>(Args)...); in visitWithKind() 54 std::forward<Ts>(Args)...); in visit() 64 return asDerived().visitARCWeak(FT, std::forward<Ts>(Args)...); in visitWithKind() 66 return asDerived().visitStruct(FT, std::forward<Ts>(Args)...); in visitWithKind() 68 return asDerived().visitTrivial(FT, std::forward<Ts>(Args)...); in visitWithKind() 89 asDerived().preVisit(PCK, FT, std::forward<Ts>(Args)...); in visitWithKind() [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | ADL.h | 28 -> 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)); in swap_impl() 53 -> decltype(size(std::forward<RangeT>(range))) { 54 return size(std::forward<RangeT>(range)); 64 return adl_detail::begin_impl(std::forward<RangeT>(range)); 72 return adl_detail::end_impl(std::forward<RangeT>(range)); 80 adl_detail::swap_impl(std::forward<T>(lhs), std::forward<T>(rhs)); in adl_swap() [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__concepts/ |
H A D | swappable.h | 51 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in requires() 77 noexcept(noexcept(swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)))) { in operator() 78 swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in operator() 111 ranges::swap(std::forward<_Tp>(__t), std::forward<_Tp>(__t)); in requires() 112 ranges::swap(std::forward<_Up>(__u), std::forward<_Up>(__u)); in requires() 113 ranges::swap(std::forward<_Tp>(__t), std::forward<_Up>(__u)); in requires() 114 ranges::swap(std::forward<_Up>(__u), std::forward<_Tp>(__t)); in requires()
|
/freebsd/contrib/llvm-project/libcxx/include/__ranges/ |
H A D | to.h | 58 requires { __c.push_back(std::forward<_Ref>(__ref)); } || in requires() 59 requires { __c.insert(__c.end(), std::forward<_Ref>(__ref)); }); in requires() 100 return _Container(std::forward<_Range>(__range), std::forward<_Args>(__args)...); in to() 105 return _Container(from_range, std::forward<_Range>(__range), std::forward<_Args>(__args)...); in to() 116 _Container __result(std::forward<_Args>(__args)...); in to() 135 std::forward<_Args>(__args)...); in to() 197 return ranges::to<_DeduceExpr>(std::forward<_Range>(__range), std::forward<_Args>(__args)...); in to() 212 /**/ ranges::to<_Container>(std::forward<_Range>(__range), std::forward<_Tail>(__tail)...); in to() 214 { return ranges::to<_Container>(std::forward<_Range>(__range), std::forward<_Tail>(__tail)...); }; in to() 228 /**/ ranges::to<_DeducedExpr>(std::forward<_Range>(__range), std::forward<_Tail>(__tail)...); in to() [all …]
|
H A D | all.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>(… in requires() 51 noexcept(noexcept(ranges::ref_view{std::forward<_Tp>(__t)})) { in operator() 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<_Tp>(__t)})) { in operator() 61 return ranges::owning_view{std::forward<_Tp>(__t)};
|
H A D | drop_view.h | 214 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)); 258 auto __clamped = std::min<_Dist>(__dist, std::forward<_Np>(__n)); 282 noexcept(noexcept(_LIBCPP_AUTO_CAST(std::forward<_Range>(__range)))) 283 -> decltype( _LIBCPP_AUTO_CAST(std::forward<_Range>(__range))) 284 { return _LIBCPP_AUTO_CAST(std::forward<_Range>(__range)); } 301 noexcept(noexcept(drop_view(std::forward<_Range>(__range), std::forward<_Np>(__n)))) 302 -> decltype(drop_view(std::forward<_Range>(__range), std::forward<_Np>(__n))) { 303 return drop_view(std::forward<_Range>(__range), std::forward<_Np>(__n)); [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__iterator/ |
H A D | iter_swap.h | 47 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 D | iter_move.h | 43 iter_move(std::forward<_Tp>(__t)); in requires() 65 noexcept(noexcept(iter_move(std::forward<_Ip>(__i)))) { in decltype() 66 return iter_move(std::forward<_Ip>(__i)); in decltype() 73 …noexcept(noexcept(std::move(*std::forward<_Ip>(__i)))) -> decltype(std::move(*std::forward<_Ip>(__… 74 return std::move(*std::forward<_Ip>(__i)); 80 noexcept(noexcept(*std::forward<_Ip>(__i))) -> decltype(*std::forward<_Ip>(__i)) { 81 return *std::forward<_Ip>(__i);
|
/freebsd/contrib/llvm-project/libcxx/include/__format/ |
H A D | format_arg.h | 105 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__monostate_); in decltype() 107 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__boolean_); in decltype() 109 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__char_type_); in decltype() 111 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__int_); in decltype() 116 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__i128_); in decltype() 121 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__unsigned_); in decltype() 126 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__u128_); in decltype() 131 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__float_); in decltype() 133 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__double_); in decltype() 141 return std::invoke(std::forward<_Visitor>(__vis), __arg.__value_.__ptr_); in decltype() [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__expected/ |
H A D | expected.h | 121 : __v(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {} 135 : __v(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {} 249 : __val_(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {} 254 : __unex_(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {} 531 : __base(__tag, std::forward<_Func>(__f), std::forward<_Args>(__args)...) {} 536 : __base(__tag, std::forward<_Func>(__f), std::forward<_Args>(__args)...) {} 905 return std::forward<_Up>(__error); 914 return std::forward<_Up>(__error); 1195 : __unex_(std::invoke(std::forward<_Func>(__f), std::forward<_Args>(__args)...)) {} 1450 : __base(__tag, std::forward<_Func>(__f), std::forward<_Args>(__args)...) {} [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__memory/ |
H A D | uses_allocator_construction.h | 47 return std::forward_as_tuple(std::forward<_Args>(__args)...); in __uses_allocator_construction_args() 53 return std::forward_as_tuple(std::forward<_Args>(__args)..., __alloc); in __uses_allocator_construction_args() 68 __alloc, std::forward<decltype(__args1)>(__args1)...); in __uses_allocator_construction_args() 70 std::forward<_Tuple1>(__x)), in __uses_allocator_construction_args() 74 __alloc, std::forward<decltype(__args2)>(__args2)...); in __uses_allocator_construction_args() 76 std::forward<_Tuple2>(__y))); in __uses_allocator_construction_args() 90 std::forward_as_tuple(std::forward<_Up>(__u)), in __uses_allocator_construction_args() 91 std::forward_as_tuple(std::forward<_Vp>(__v))); in __uses_allocator_construction_args() 141 std::forward_as_tuple(std::get<0>(std::forward<_PairLike>(__p))), in __uses_allocator_construction_args() 142 std::forward_as_tuple(std::get<1>(std::forward<_PairLike>(__p)))); in __uses_allocator_construction_args() [all …]
|
/freebsd/contrib/googletest/googlemock/include/gmock/ |
H A D | gmock-nice-strict.h | 171 explicit NiceMock(A&& arg) : MockClass(std::forward<A>(arg)) { in NiceMock() 178 : MockClass(std::forward<TArg1>(arg1), std::forward<TArg2>(arg2), in NiceMock() 179 std::forward<An>(args)...) { in NiceMock() 213 explicit NaggyMock(A&& arg) : MockClass(std::forward<A>(arg)) { in NaggyMock() 220 : MockClass(std::forward<TArg1>(arg1), std::forward<TArg2>(arg2), in NaggyMock() 221 std::forward<An>(args)...) { in NaggyMock() 255 explicit StrictMock(A&& arg) : MockClass(std::forward<A>(arg)) { in StrictMock() 262 : MockClass(std::forward<TArg1>(arg1), std::forward<TArg2>(arg2), in StrictMock() 263 std::forward<An>(args)...) { in StrictMock()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | FormatAdapters.h | 21 explicit FormatAdapter(T &&Item) : Item(std::forward<T>(Item)) {} in FormatAdapter() 34 : FormatAdapter<T>(std::forward<T>(Item)), Where(Where), Amount(Amount), in AlignAdapter() 38 auto Adapter = detail::build_format_adapter(std::forward<T>(this->Item)); in format() 49 : FormatAdapter<T>(std::forward<T>(Item)), Left(Left), Right(Right) {} in PadAdapter() 52 auto Adapter = detail::build_format_adapter(std::forward<T>(this->Item)); in format() 64 : FormatAdapter<T>(std::forward<T>(Item)), Count(Count) {} in RepeatAdapter() 67 auto Adapter = detail::build_format_adapter(std::forward<T>(this->Item)); in format() 88 return detail::AlignAdapter<T>(std::forward<T>(Item), Where, Amount, Fill); 93 return detail::PadAdapter<T>(std::forward<T>(Item), Left, Right); in fmt_pad() 98 return detail::RepeatAdapter<T>(std::forward<T>(Item), Count); in fmt_repeat()
|