55 #ifndef _GLIBCXX_NUMERIC
56 #define _GLIBCXX_NUMERIC 1
58 #pragma GCC system_header
65 #ifdef _GLIBCXX_PARALLEL
77 #if __cplusplus >= 201402L
80 namespace std _GLIBCXX_VISIBILITY(default)
82 _GLIBCXX_BEGIN_NAMESPACE_VERSION
88 template<
typename _Up,
typename _Tp>
92 static_assert(is_unsigned<_Up>::value,
"result type must be unsigned");
93 static_assert(
sizeof(_Up) >=
sizeof(_Tp),
94 "result type must be at least as wide as the input type");
95 return __val < 0 ? -(_Up)__val : (_Up)__val;
98 template<typename _Up>
void __absu(
bool) = delete;
101 template<typename _Tp>
103 __gcd(_Tp __m, _Tp __n)
105 static_assert(is_unsigned<_Tp>::value,
"type must be unsigned");
106 return __m == 0 ? __n
108 : __detail::__gcd(__n, _Tp(__m % __n));
112 template<
typename _Tp>
114 __lcm(_Tp __m, _Tp __n)
116 return (__m != 0 && __n != 0)
117 ? (__m / __detail::__gcd(__m, __n)) * __n
122 #if __cplusplus >= 201703L
124 #define __cpp_lib_gcd_lcm 201606
126 #define __cpp_lib_gcd 201606
127 #define __cpp_lib_lcm 201606
130 template<
typename _Mn,
typename _Nn>
131 constexpr common_type_t<_Mn, _Nn>
132 gcd(_Mn __m, _Nn __n) noexcept
134 static_assert(is_integral_v<_Mn>,
"std::gcd arguments must be integers");
135 static_assert(is_integral_v<_Nn>,
"std::gcd arguments must be integers");
136 static_assert(_Mn(2) != _Mn(1),
"std::gcd arguments must not be bool");
137 static_assert(_Nn(2) != _Nn(1),
"std::gcd arguments must not be bool");
138 using _Up = make_unsigned_t<common_type_t<_Mn, _Nn>>;
139 return __detail::__gcd(__detail::__absu<_Up>(__m),
140 __detail::__absu<_Up>(__n));
144 template<
typename _Mn,
typename _Nn>
145 constexpr common_type_t<_Mn, _Nn>
146 lcm(_Mn __m, _Nn __n) noexcept
148 static_assert(is_integral_v<_Mn>,
"std::lcm arguments must be integers");
149 static_assert(is_integral_v<_Nn>,
"std::lcm arguments must be integers");
150 static_assert(_Mn(2) == 2,
"std::lcm arguments must not be bool");
151 static_assert(_Nn(2) == 2,
"std::lcm arguments must not be bool");
152 using _Up = make_unsigned_t<common_type_t<_Mn, _Nn>>;
153 return __detail::__lcm(__detail::__absu<_Up>(__m),
154 __detail::__absu<_Up>(__n));
159 _GLIBCXX_END_NAMESPACE_VERSION
164 #if __cplusplus > 201703L
167 namespace std _GLIBCXX_VISIBILITY(default)
169 _GLIBCXX_BEGIN_NAMESPACE_VERSION
171 # define __cpp_lib_interpolate 201902L
173 template<
typename _Tp>
175 enable_if_t<__and_v<is_arithmetic<_Tp>, is_same<remove_cv_t<_Tp>, _Tp>,
176 __not_<is_same<_Tp, bool>>>,
178 midpoint(_Tp __a, _Tp __b) noexcept
180 if constexpr (is_integral_v<_Tp>)
182 using _Up = make_unsigned_t<_Tp>;
193 return __a + __k * _Tp(_Up(__M - __m) / 2);
199 const _Tp __abs_a = __a < 0 ? -__a : __a;
200 const _Tp __abs_b = __b < 0 ? -__b : __b;
201 if (__abs_a <= __hi && __abs_b <= __hi) [[likely]]
202 return (__a + __b) / 2;
207 return __a/2 + __b/2;
211 template<
typename _Tp>
212 constexpr enable_if_t<is_object_v<_Tp>, _Tp*>
213 midpoint(_Tp* __a, _Tp* __b) noexcept
215 static_assert(
sizeof(_Tp) != 0,
"type must be complete" );
216 return __a + (__b - __a) / 2;
218 _GLIBCXX_END_NAMESPACE_VERSION
223 #if __cplusplus > 201402L
226 namespace std _GLIBCXX_VISIBILITY(default)
228 _GLIBCXX_BEGIN_NAMESPACE_VERSION
230 #if __cplusplus > 201703L
231 #define __cpp_lib_constexpr_numeric 201911L
256 template<
typename _InputIterator,
typename _Tp,
typename _BinaryOperation>
259 reduce(_InputIterator __first, _InputIterator __last, _Tp __init,
260 _BinaryOperation __binary_op)
262 using value_type =
typename iterator_traits<_InputIterator>::value_type;
263 static_assert(is_invocable_r_v<_Tp, _BinaryOperation&, _Tp&, _Tp&>);
264 static_assert(is_convertible_v<value_type, _Tp>);
265 if constexpr (__is_random_access_iter<_InputIterator>::value)
267 while ((__last - __first) >= 4)
269 _Tp __v1 = __binary_op(__first[0], __first[1]);
270 _Tp __v2 = __binary_op(__first[2], __first[3]);
271 _Tp __v3 = __binary_op(__v1, __v2);
272 __init = __binary_op(__init, __v3);
276 for (; __first != __last; ++__first)
277 __init = __binary_op(__init, *__first);
292 template<
typename _InputIterator,
typename _Tp>
295 reduce(_InputIterator __first, _InputIterator __last, _Tp __init)
296 {
return std::reduce(__first, __last,
std::move(__init), plus<>()); }
309 template<
typename _InputIterator>
311 inline typename iterator_traits<_InputIterator>::value_type
312 reduce(_InputIterator __first, _InputIterator __last)
314 using value_type =
typename iterator_traits<_InputIterator>::value_type;
315 return std::reduce(__first, __last, value_type{}, plus<>());
336 template<
typename _InputIterator1,
typename _InputIterator2,
typename _Tp,
337 typename _BinaryOperation1,
typename _BinaryOperation2>
340 transform_reduce(_InputIterator1 __first1, _InputIterator1 __last1,
341 _InputIterator2 __first2, _Tp __init,
342 _BinaryOperation1 __binary_op1,
343 _BinaryOperation2 __binary_op2)
345 if constexpr (__and_v<__is_random_access_iter<_InputIterator1>,
346 __is_random_access_iter<_InputIterator2>>)
348 while ((__last1 - __first1) >= 4)
350 _Tp __v1 = __binary_op1(__binary_op2(__first1[0], __first2[0]),
351 __binary_op2(__first1[1], __first2[1]));
352 _Tp __v2 = __binary_op1(__binary_op2(__first1[2], __first2[2]),
353 __binary_op2(__first1[3], __first2[3]));
354 _Tp __v3 = __binary_op1(__v1, __v2);
355 __init = __binary_op1(__init, __v3);
360 for (; __first1 != __last1; ++__first1, (void) ++__first2)
361 __init = __binary_op1(__init, __binary_op2(*__first1, *__first2));
380 template<
typename _InputIterator1,
typename _InputIterator2,
typename _Tp>
383 transform_reduce(_InputIterator1 __first1, _InputIterator1 __last1,
384 _InputIterator2 __first2, _Tp __init)
386 return std::transform_reduce(__first1, __last1, __first2,
388 plus<>(), multiplies<>());
405 template<
typename _InputIterator,
typename _Tp,
406 typename _BinaryOperation,
typename _UnaryOperation>
409 transform_reduce(_InputIterator __first, _InputIterator __last, _Tp __init,
410 _BinaryOperation __binary_op, _UnaryOperation __unary_op)
412 if constexpr (__is_random_access_iter<_InputIterator>::value)
414 while ((__last - __first) >= 4)
416 _Tp __v1 = __binary_op(__unary_op(__first[0]),
417 __unary_op(__first[1]));
418 _Tp __v2 = __binary_op(__unary_op(__first[2]),
419 __unary_op(__first[3]));
420 _Tp __v3 = __binary_op(__v1, __v2);
421 __init = __binary_op(__init, __v3);
425 for (; __first != __last; ++__first)
426 __init = __binary_op(__init, __unary_op(*__first));
448 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp,
449 typename _BinaryOperation>
452 exclusive_scan(_InputIterator __first, _InputIterator __last,
453 _OutputIterator __result, _Tp __init,
454 _BinaryOperation __binary_op)
456 while (__first != __last)
459 __init = __binary_op(__init, *__first);
483 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp>
485 inline _OutputIterator
486 exclusive_scan(_InputIterator __first, _InputIterator __last,
487 _OutputIterator __result, _Tp __init)
489 return std::exclusive_scan(__first, __last, __result,
std::move(__init),
511 template<
typename _InputIterator,
typename _OutputIterator,
512 typename _BinaryOperation,
typename _Tp>
515 inclusive_scan(_InputIterator __first, _InputIterator __last,
516 _OutputIterator __result, _BinaryOperation __binary_op,
519 for (; __first != __last; ++__first)
520 *__result++ = __init = __binary_op(__init, *__first);
540 template<
typename _InputIterator,
typename _OutputIterator,
541 typename _BinaryOperation>
544 inclusive_scan(_InputIterator __first, _InputIterator __last,
545 _OutputIterator __result, _BinaryOperation __binary_op)
547 if (__first != __last)
549 auto __init = *__first;
550 *__result++ = __init;
552 if (__first != __last)
553 __result = std::inclusive_scan(__first, __last, __result,
574 template<
typename _InputIterator,
typename _OutputIterator>
576 inline _OutputIterator
577 inclusive_scan(_InputIterator __first, _InputIterator __last,
578 _OutputIterator __result)
579 {
return std::inclusive_scan(__first, __last, __result, plus<>()); }
601 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp,
602 typename _BinaryOperation,
typename _UnaryOperation>
605 transform_exclusive_scan(_InputIterator __first, _InputIterator __last,
606 _OutputIterator __result, _Tp __init,
607 _BinaryOperation __binary_op,
608 _UnaryOperation __unary_op)
610 while (__first != __last)
613 __init = __binary_op(__init, __unary_op(*__first));
640 template<
typename _InputIterator,
typename _OutputIterator,
641 typename _BinaryOperation,
typename _UnaryOperation,
typename _Tp>
644 transform_inclusive_scan(_InputIterator __first, _InputIterator __last,
645 _OutputIterator __result,
646 _BinaryOperation __binary_op,
647 _UnaryOperation __unary_op,
650 for (; __first != __last; ++__first)
651 *__result++ = __init = __binary_op(__init, __unary_op(*__first));
674 template<
typename _InputIterator,
typename _OutputIterator,
675 typename _BinaryOperation,
typename _UnaryOperation>
678 transform_inclusive_scan(_InputIterator __first, _InputIterator __last,
679 _OutputIterator __result,
680 _BinaryOperation __binary_op,
681 _UnaryOperation __unary_op)
683 if (__first != __last)
685 auto __init = __unary_op(*__first);
686 *__result++ = __init;
688 if (__first != __last)
689 __result = std::transform_inclusive_scan(__first, __last, __result,
690 __binary_op, __unary_op,
698 _GLIBCXX_END_NAMESPACE_VERSION
702 # if _PSTL_EXECUTION_POLICIES_DEFINED
704 # include <pstl/glue_numeric_impl.h>
707 # include <pstl/glue_numeric_defs.h>
708 # define _PSTL_NUMERIC_FORWARD_DECLARED 1
712 # define __cpp_lib_parallel_algorithm 201603L
static constexpr _Tp min() noexcept
static constexpr _Tp max() noexcept
Parallel STL function calls corresponding to stl_numeric.h. The functions defined here mainly do case...
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.