55 #ifndef _GLIBCXX_NUMERIC
56 #define _GLIBCXX_NUMERIC 1
58 #pragma GCC system_header
64 #ifdef _GLIBCXX_PARALLEL
76 #if __cplusplus >= 201402L
79 namespace std _GLIBCXX_VISIBILITY(default)
81 _GLIBCXX_BEGIN_NAMESPACE_VERSION
86 template<
typename _Tp>
88 enable_if_t<__and_<is_integral<_Tp>, is_signed<_Tp>>::value, _Tp>
89 __abs_integral(_Tp __val)
90 {
return __val < 0 ? -__val : __val; }
92 template<
typename _Tp>
94 enable_if_t<__and_<is_integral<_Tp>, is_unsigned<_Tp>>::value, _Tp>
95 __abs_integral(_Tp __val)
98 void __abs_integral(
bool) =
delete;
100 template<
typename _Mn,
typename _Nn>
101 constexpr common_type_t<_Mn, _Nn>
102 __gcd(_Mn __m, _Nn __n)
104 return __m == 0 ? __detail::__abs_integral(__n)
105 : __n == 0 ? __detail::__abs_integral(__m)
106 : __detail::__gcd(__n, __m % __n);
110 template<
typename _Mn,
typename _Nn>
111 constexpr common_type_t<_Mn, _Nn>
114 return (__m != 0 && __n != 0)
115 ? (__detail::__abs_integral(__m) / __detail::__gcd(__m, __n))
116 * __detail::__abs_integral(__n)
121 #if __cplusplus >= 201703L
123 #define __cpp_lib_gcd_lcm 201606
125 #define __cpp_lib_gcd 201606
126 #define __cpp_lib_lcm 201606
129 template<
typename _Mn,
typename _Nn>
130 constexpr common_type_t<_Mn, _Nn>
131 gcd(_Mn __m, _Nn __n)
133 static_assert(is_integral_v<_Mn>,
"gcd arguments are integers");
134 static_assert(is_integral_v<_Nn>,
"gcd arguments are integers");
135 static_assert(!is_same_v<remove_cv_t<_Mn>,
bool>,
136 "gcd arguments are not bools");
137 static_assert(!is_same_v<remove_cv_t<_Nn>,
bool>,
138 "gcd arguments are not bools");
139 return __detail::__gcd(__m, __n);
143 template<
typename _Mn,
typename _Nn>
144 constexpr common_type_t<_Mn, _Nn>
145 lcm(_Mn __m, _Nn __n)
147 static_assert(is_integral_v<_Mn>,
"lcm arguments are integers");
148 static_assert(is_integral_v<_Nn>,
"lcm arguments are integers");
149 static_assert(!is_same_v<remove_cv_t<_Mn>,
bool>,
150 "lcm arguments are not bools");
151 static_assert(!is_same_v<remove_cv_t<_Nn>,
bool>,
152 "lcm arguments are not bools");
158 _GLIBCXX_END_NAMESPACE_VERSION
163 #if __cplusplus > 201703L
166 namespace std _GLIBCXX_VISIBILITY(default)
168 _GLIBCXX_BEGIN_NAMESPACE_VERSION
170 # define __cpp_lib_interpolate 201902L
172 template<
typename _Tp>
174 enable_if_t<__and_v<is_arithmetic<_Tp>, is_same<remove_cv_t<_Tp>, _Tp>,
175 __not_<is_same<_Tp, bool>>>,
177 midpoint(_Tp __a, _Tp __b) noexcept
179 if constexpr (is_integral_v<_Tp>)
181 using _Up = make_unsigned_t<_Tp>;
192 return __a + __k * _Tp(_Up(__M - __m) / 2);
198 const _Tp __abs_a = __a < 0 ? -__a : __a;
199 const _Tp __abs_b = __b < 0 ? -__b : __b;
200 if (__abs_a <= __hi && __abs_b <= __hi) [[likely]]
201 return (__a + __b) / 2;
206 return __a/2 + __b/2;
210 template<
typename _Tp>
211 constexpr enable_if_t<is_object_v<_Tp>, _Tp*>
212 midpoint(_Tp* __a, _Tp* __b) noexcept
214 static_assert(
sizeof(_Tp) != 0,
"type must be complete" );
215 return __a + (__b - __a) / 2;
217 _GLIBCXX_END_NAMESPACE_VERSION
222 #if __cplusplus > 201402L
225 namespace std _GLIBCXX_VISIBILITY(default)
227 _GLIBCXX_BEGIN_NAMESPACE_VERSION
229 #if __cplusplus > 201703L
230 #define __cpp_lib_constexpr_numeric 201911L
255 template<
typename _InputIterator,
typename _Tp,
typename _BinaryOperation>
258 reduce(_InputIterator __first, _InputIterator __last, _Tp __init,
259 _BinaryOperation __binary_op)
261 using value_type =
typename iterator_traits<_InputIterator>::value_type;
262 static_assert(is_invocable_r_v<_Tp, _BinaryOperation&, _Tp&, _Tp&>);
263 static_assert(is_convertible_v<value_type, _Tp>);
264 if constexpr (__is_random_access_iter<_InputIterator>::value)
266 while ((__last - __first) >= 4)
268 _Tp __v1 = __binary_op(__first[0], __first[1]);
269 _Tp __v2 = __binary_op(__first[2], __first[3]);
270 _Tp __v3 = __binary_op(__v1, __v2);
271 __init = __binary_op(__init, __v3);
275 for (; __first != __last; ++__first)
276 __init = __binary_op(__init, *__first);
291 template<
typename _InputIterator,
typename _Tp>
294 reduce(_InputIterator __first, _InputIterator __last, _Tp __init)
295 {
return std::reduce(__first, __last,
std::move(__init), plus<>()); }
308 template<
typename _InputIterator>
310 inline typename iterator_traits<_InputIterator>::value_type
311 reduce(_InputIterator __first, _InputIterator __last)
313 using value_type =
typename iterator_traits<_InputIterator>::value_type;
314 return std::reduce(__first, __last, value_type{}, plus<>());
335 template<
typename _InputIterator1,
typename _InputIterator2,
typename _Tp,
336 typename _BinaryOperation1,
typename _BinaryOperation2>
339 transform_reduce(_InputIterator1 __first1, _InputIterator1 __last1,
340 _InputIterator2 __first2, _Tp __init,
341 _BinaryOperation1 __binary_op1,
342 _BinaryOperation2 __binary_op2)
344 if constexpr (__and_v<__is_random_access_iter<_InputIterator1>,
345 __is_random_access_iter<_InputIterator2>>)
347 while ((__last1 - __first1) >= 4)
349 _Tp __v1 = __binary_op1(__binary_op2(__first1[0], __first2[0]),
350 __binary_op2(__first1[1], __first2[1]));
351 _Tp __v2 = __binary_op1(__binary_op2(__first1[2], __first2[2]),
352 __binary_op2(__first1[3], __first2[3]));
353 _Tp __v3 = __binary_op1(__v1, __v2);
354 __init = __binary_op1(__init, __v3);
359 for (; __first1 != __last1; ++__first1, (void) ++__first2)
360 __init = __binary_op1(__init, __binary_op2(*__first1, *__first2));
379 template<
typename _InputIterator1,
typename _InputIterator2,
typename _Tp>
382 transform_reduce(_InputIterator1 __first1, _InputIterator1 __last1,
383 _InputIterator2 __first2, _Tp __init)
385 return std::transform_reduce(__first1, __last1, __first2,
387 plus<>(), multiplies<>());
404 template<
typename _InputIterator,
typename _Tp,
405 typename _BinaryOperation,
typename _UnaryOperation>
408 transform_reduce(_InputIterator __first, _InputIterator __last, _Tp __init,
409 _BinaryOperation __binary_op, _UnaryOperation __unary_op)
411 if constexpr (__is_random_access_iter<_InputIterator>::value)
413 while ((__last - __first) >= 4)
415 _Tp __v1 = __binary_op(__unary_op(__first[0]),
416 __unary_op(__first[1]));
417 _Tp __v2 = __binary_op(__unary_op(__first[2]),
418 __unary_op(__first[3]));
419 _Tp __v3 = __binary_op(__v1, __v2);
420 __init = __binary_op(__init, __v3);
424 for (; __first != __last; ++__first)
425 __init = __binary_op(__init, __unary_op(*__first));
447 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp,
448 typename _BinaryOperation>
451 exclusive_scan(_InputIterator __first, _InputIterator __last,
452 _OutputIterator __result, _Tp __init,
453 _BinaryOperation __binary_op)
455 while (__first != __last)
458 __init = __binary_op(__init, *__first);
482 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp>
484 inline _OutputIterator
485 exclusive_scan(_InputIterator __first, _InputIterator __last,
486 _OutputIterator __result, _Tp __init)
488 return std::exclusive_scan(__first, __last, __result,
std::move(__init),
510 template<
typename _InputIterator,
typename _OutputIterator,
511 typename _BinaryOperation,
typename _Tp>
514 inclusive_scan(_InputIterator __first, _InputIterator __last,
515 _OutputIterator __result, _BinaryOperation __binary_op,
518 for (; __first != __last; ++__first)
519 *__result++ = __init = __binary_op(__init, *__first);
539 template<
typename _InputIterator,
typename _OutputIterator,
540 typename _BinaryOperation>
543 inclusive_scan(_InputIterator __first, _InputIterator __last,
544 _OutputIterator __result, _BinaryOperation __binary_op)
546 if (__first != __last)
548 auto __init = *__first;
549 *__result++ = __init;
551 if (__first != __last)
552 __result = std::inclusive_scan(__first, __last, __result,
573 template<
typename _InputIterator,
typename _OutputIterator>
575 inline _OutputIterator
576 inclusive_scan(_InputIterator __first, _InputIterator __last,
577 _OutputIterator __result)
578 {
return std::inclusive_scan(__first, __last, __result, plus<>()); }
600 template<
typename _InputIterator,
typename _OutputIterator,
typename _Tp,
601 typename _BinaryOperation,
typename _UnaryOperation>
604 transform_exclusive_scan(_InputIterator __first, _InputIterator __last,
605 _OutputIterator __result, _Tp __init,
606 _BinaryOperation __binary_op,
607 _UnaryOperation __unary_op)
609 while (__first != __last)
612 __init = __binary_op(__init, __unary_op(*__first));
639 template<
typename _InputIterator,
typename _OutputIterator,
640 typename _BinaryOperation,
typename _UnaryOperation,
typename _Tp>
643 transform_inclusive_scan(_InputIterator __first, _InputIterator __last,
644 _OutputIterator __result,
645 _BinaryOperation __binary_op,
646 _UnaryOperation __unary_op,
649 for (; __first != __last; ++__first)
650 *__result++ = __init = __binary_op(__init, __unary_op(*__first));
673 template<
typename _InputIterator,
typename _OutputIterator,
674 typename _BinaryOperation,
typename _UnaryOperation>
677 transform_inclusive_scan(_InputIterator __first, _InputIterator __last,
678 _OutputIterator __result,
679 _BinaryOperation __binary_op,
680 _UnaryOperation __unary_op)
682 if (__first != __last)
684 auto __init = __unary_op(*__first);
685 *__result++ = __init;
687 if (__first != __last)
688 __result = std::transform_inclusive_scan(__first, __last, __result,
689 __binary_op, __unary_op,
697 _GLIBCXX_END_NAMESPACE_VERSION
701 # if _PSTL_EXECUTION_POLICIES_DEFINED
703 # include <pstl/glue_numeric_impl.h>
706 # include <pstl/glue_numeric_defs.h>
707 # define _PSTL_NUMERIC_FORWARD_DECLARED 1
711 # define __cpp_lib_parallel_algorithm 201603L
static constexpr _Tp min() noexcept
constexpr common_type_t< _Mn, _Nn > __lcm(_Mn __m, _Nn __n)
Least common multiple.
Parallel STL function calls corresponding to stl_numeric.h. The functions defined here mainly do case...
static constexpr _Tp max() noexcept
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.