2010-05-12 03:42:16 +08:00
|
|
|
// -*- C++ -*-
|
|
|
|
//===---------------------------- numeric ---------------------------------===//
|
|
|
|
//
|
2019-01-19 18:56:40 +08:00
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
2010-05-12 03:42:16 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef _LIBCPP_NUMERIC
|
|
|
|
#define _LIBCPP_NUMERIC
|
|
|
|
|
|
|
|
/*
|
|
|
|
numeric synopsis
|
|
|
|
|
|
|
|
namespace std
|
|
|
|
{
|
|
|
|
|
|
|
|
template <class InputIterator, class T>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr T // constexpr since C++20
|
2010-05-12 03:42:16 +08:00
|
|
|
accumulate(InputIterator first, InputIterator last, T init);
|
|
|
|
|
|
|
|
template <class InputIterator, class T, class BinaryOperation>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr T // constexpr since C++20
|
2010-05-12 03:42:16 +08:00
|
|
|
accumulate(InputIterator first, InputIterator last, T init, BinaryOperation binary_op);
|
|
|
|
|
2017-06-14 12:48:45 +08:00
|
|
|
template<class InputIterator>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr typename iterator_traits<InputIterator>::value_type // constexpr since C++20
|
2017-06-14 12:48:45 +08:00
|
|
|
reduce(InputIterator first, InputIterator last); // C++17
|
|
|
|
|
|
|
|
template<class InputIterator, class T>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr T // constexpr since C++20
|
2017-06-14 12:48:45 +08:00
|
|
|
reduce(InputIterator first, InputIterator last, T init); // C++17
|
|
|
|
|
|
|
|
template<class InputIterator, class T, class BinaryOperation>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr T // constexpr since C++20
|
2017-06-14 12:48:45 +08:00
|
|
|
reduce(InputIterator first, InputIterator last, T init, BinaryOperation binary_op); // C++17
|
|
|
|
|
2010-05-12 03:42:16 +08:00
|
|
|
template <class InputIterator1, class InputIterator2, class T>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr T // constexpr since C++20
|
2010-05-12 03:42:16 +08:00
|
|
|
inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, T init);
|
|
|
|
|
|
|
|
template <class InputIterator1, class InputIterator2, class T, class BinaryOperation1, class BinaryOperation2>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr T // constexpr since C++20
|
2010-05-12 03:42:16 +08:00
|
|
|
inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
|
|
|
|
T init, BinaryOperation1 binary_op1, BinaryOperation2 binary_op2);
|
|
|
|
|
2017-06-14 12:48:45 +08:00
|
|
|
|
|
|
|
template<class InputIterator1, class InputIterator2, class T>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr T // constexpr since C++20
|
2017-06-14 12:48:45 +08:00
|
|
|
transform_reduce(InputIterator1 first1, InputIterator1 last1,
|
|
|
|
InputIterator2 first2, T init); // C++17
|
2018-01-05 09:31:55 +08:00
|
|
|
|
2017-06-14 12:48:45 +08:00
|
|
|
template<class InputIterator1, class InputIterator2, class T, class BinaryOperation1, class BinaryOperation2>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr T // constexpr since C++20
|
2017-06-14 12:48:45 +08:00
|
|
|
transform_reduce(InputIterator1 first1, InputIterator1 last1,
|
|
|
|
InputIterator2 first2, T init,
|
|
|
|
BinaryOperation1 binary_op1, BinaryOperation2 binary_op2); // C++17
|
|
|
|
|
|
|
|
template<class InputIterator, class T, class BinaryOperation, class UnaryOperation>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr T // constexpr since C++20
|
2017-06-14 12:48:45 +08:00
|
|
|
transform_reduce(InputIterator first, InputIterator last, T init,
|
|
|
|
BinaryOperation binary_op, UnaryOperation unary_op); // C++17
|
|
|
|
|
2010-05-12 03:42:16 +08:00
|
|
|
template <class InputIterator, class OutputIterator>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr OutputIterator // constexpr since C++20
|
2010-05-12 03:42:16 +08:00
|
|
|
partial_sum(InputIterator first, InputIterator last, OutputIterator result);
|
|
|
|
|
|
|
|
template <class InputIterator, class OutputIterator, class BinaryOperation>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr OutputIterator // constexpr since C++20
|
2010-05-12 03:42:16 +08:00
|
|
|
partial_sum(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation binary_op);
|
|
|
|
|
2017-06-10 10:22:13 +08:00
|
|
|
template<class InputIterator, class OutputIterator, class T>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr OutputIterator // constexpr since C++20
|
2017-06-10 10:22:13 +08:00
|
|
|
exclusive_scan(InputIterator first, InputIterator last,
|
|
|
|
OutputIterator result, T init); // C++17
|
2018-01-05 09:31:55 +08:00
|
|
|
|
2017-06-10 10:22:13 +08:00
|
|
|
template<class InputIterator, class OutputIterator, class T, class BinaryOperation>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr OutputIterator // constexpr since C++20
|
2018-01-05 09:31:55 +08:00
|
|
|
exclusive_scan(InputIterator first, InputIterator last,
|
2017-06-10 10:22:13 +08:00
|
|
|
OutputIterator result, T init, BinaryOperation binary_op); // C++17
|
|
|
|
|
2017-06-23 13:12:42 +08:00
|
|
|
template<class InputIterator, class OutputIterator>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr OutputIterator // constexpr since C++20
|
2017-06-23 13:12:42 +08:00
|
|
|
inclusive_scan(InputIterator first, InputIterator last, OutputIterator result); // C++17
|
|
|
|
|
|
|
|
template<class InputIterator, class OutputIterator, class BinaryOperation>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr OutputIterator // constexpr since C++20
|
2017-06-23 13:12:42 +08:00
|
|
|
inclusive_scan(InputIterator first, InputIterator last,
|
|
|
|
OutputIterator result, BinaryOperation binary_op); // C++17
|
|
|
|
|
|
|
|
template<class InputIterator, class OutputIterator, class BinaryOperation, class T>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr OutputIterator // constexpr since C++20
|
2017-06-23 13:12:42 +08:00
|
|
|
inclusive_scan(InputIterator first, InputIterator last,
|
|
|
|
OutputIterator result, BinaryOperation binary_op, T init); // C++17
|
|
|
|
|
2017-06-10 10:22:13 +08:00
|
|
|
template<class InputIterator, class OutputIterator, class T,
|
|
|
|
class BinaryOperation, class UnaryOperation>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr OutputIterator // constexpr since C++20
|
2017-06-10 10:22:13 +08:00
|
|
|
transform_exclusive_scan(InputIterator first, InputIterator last,
|
|
|
|
OutputIterator result, T init,
|
|
|
|
BinaryOperation binary_op, UnaryOperation unary_op); // C++17
|
|
|
|
|
2017-06-23 13:12:42 +08:00
|
|
|
template<class InputIterator, class OutputIterator,
|
|
|
|
class BinaryOperation, class UnaryOperation>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr OutputIterator // constexpr since C++20
|
2018-08-04 06:36:53 +08:00
|
|
|
transform_inclusive_scan(InputIterator first, InputIterator last,
|
2017-06-23 13:12:42 +08:00
|
|
|
OutputIterator result,
|
|
|
|
BinaryOperation binary_op, UnaryOperation unary_op); // C++17
|
2018-01-05 09:31:55 +08:00
|
|
|
|
2017-06-23 13:12:42 +08:00
|
|
|
template<class InputIterator, class OutputIterator,
|
|
|
|
class BinaryOperation, class UnaryOperation, class T>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr OutputIterator // constexpr since C++20
|
2018-08-04 06:36:53 +08:00
|
|
|
transform_inclusive_scan(InputIterator first, InputIterator last,
|
2017-06-23 13:12:42 +08:00
|
|
|
OutputIterator result,
|
|
|
|
BinaryOperation binary_op, UnaryOperation unary_op,
|
|
|
|
T init); // C++17
|
|
|
|
|
2010-05-12 03:42:16 +08:00
|
|
|
template <class InputIterator, class OutputIterator>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr OutputIterator // constexpr since C++20
|
2010-05-12 03:42:16 +08:00
|
|
|
adjacent_difference(InputIterator first, InputIterator last, OutputIterator result);
|
|
|
|
|
|
|
|
template <class InputIterator, class OutputIterator, class BinaryOperation>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr OutputIterator // constexpr since C++20
|
2010-05-12 03:42:16 +08:00
|
|
|
adjacent_difference(InputIterator first, InputIterator last, OutputIterator result, BinaryOperation binary_op);
|
|
|
|
|
2010-05-27 02:53:44 +08:00
|
|
|
template <class ForwardIterator, class T>
|
2020-11-28 21:50:53 +08:00
|
|
|
constexpr void // constexpr since C++20
|
|
|
|
iota(ForwardIterator first, ForwardIterator last, T value);
|
2010-05-27 02:53:44 +08:00
|
|
|
|
2016-07-26 22:29:45 +08:00
|
|
|
template <class M, class N>
|
|
|
|
constexpr common_type_t<M,N> gcd(M m, N n); // C++17
|
|
|
|
|
|
|
|
template <class M, class N>
|
|
|
|
constexpr common_type_t<M,N> lcm(M m, N n); // C++17
|
|
|
|
|
2020-11-28 21:50:53 +08:00
|
|
|
template<class T>
|
|
|
|
constexpr T midpoint(T a, T b) noexcept; // C++20
|
|
|
|
|
|
|
|
template<class T>
|
|
|
|
constexpr T* midpoint(T* a, T* b); // C++20
|
2019-03-15 00:25:55 +08:00
|
|
|
|
2010-05-12 03:42:16 +08:00
|
|
|
} // std
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <__config>
|
|
|
|
#include <iterator>
|
2017-02-08 08:14:13 +08:00
|
|
|
#include <limits> // for numeric_limits
|
2017-06-10 10:22:13 +08:00
|
|
|
#include <functional>
|
2019-04-25 20:11:43 +08:00
|
|
|
#include <cmath> // for isnormal
|
2018-09-13 03:41:40 +08:00
|
|
|
#include <version>
|
2010-05-12 03:42:16 +08:00
|
|
|
|
2011-10-18 04:05:10 +08:00
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
2010-05-12 03:42:16 +08:00
|
|
|
#pragma GCC system_header
|
2011-10-18 04:05:10 +08:00
|
|
|
#endif
|
2010-05-12 03:42:16 +08:00
|
|
|
|
2017-06-01 06:07:49 +08:00
|
|
|
_LIBCPP_PUSH_MACROS
|
|
|
|
#include <__undef_macros>
|
|
|
|
|
2010-05-12 03:42:16 +08:00
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
|
|
|
|
template <class _InputIterator, class _Tp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2010-05-12 03:42:16 +08:00
|
|
|
_Tp
|
|
|
|
accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
|
|
|
|
{
|
|
|
|
for (; __first != __last; ++__first)
|
2020-11-28 03:05:03 +08:00
|
|
|
#if _LIBCPP_STD_VER > 17
|
|
|
|
__init = _VSTD::move(__init) + *__first;
|
|
|
|
#else
|
2010-05-12 03:42:16 +08:00
|
|
|
__init = __init + *__first;
|
2020-11-28 03:05:03 +08:00
|
|
|
#endif
|
2010-05-12 03:42:16 +08:00
|
|
|
return __init;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _InputIterator, class _Tp, class _BinaryOperation>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2010-05-12 03:42:16 +08:00
|
|
|
_Tp
|
|
|
|
accumulate(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOperation __binary_op)
|
|
|
|
{
|
|
|
|
for (; __first != __last; ++__first)
|
2020-11-28 03:05:03 +08:00
|
|
|
#if _LIBCPP_STD_VER > 17
|
|
|
|
__init = __binary_op(_VSTD::move(__init), *__first);
|
|
|
|
#else
|
2010-05-12 03:42:16 +08:00
|
|
|
__init = __binary_op(__init, *__first);
|
2020-11-28 03:05:03 +08:00
|
|
|
#endif
|
2010-05-12 03:42:16 +08:00
|
|
|
return __init;
|
|
|
|
}
|
|
|
|
|
2017-06-14 12:48:45 +08:00
|
|
|
#if _LIBCPP_STD_VER > 14
|
|
|
|
template <class _InputIterator, class _Tp, class _BinaryOp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2017-06-14 12:48:45 +08:00
|
|
|
_Tp
|
|
|
|
reduce(_InputIterator __first, _InputIterator __last, _Tp __init, _BinaryOp __b)
|
|
|
|
{
|
|
|
|
for (; __first != __last; ++__first)
|
|
|
|
__init = __b(__init, *__first);
|
|
|
|
return __init;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _InputIterator, class _Tp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2017-06-14 12:48:45 +08:00
|
|
|
_Tp
|
|
|
|
reduce(_InputIterator __first, _InputIterator __last, _Tp __init)
|
|
|
|
{
|
|
|
|
return _VSTD::reduce(__first, __last, __init, _VSTD::plus<>());
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _InputIterator>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2017-06-14 12:48:45 +08:00
|
|
|
typename iterator_traits<_InputIterator>::value_type
|
|
|
|
reduce(_InputIterator __first, _InputIterator __last)
|
|
|
|
{
|
2018-01-05 09:31:55 +08:00
|
|
|
return _VSTD::reduce(__first, __last,
|
2017-06-14 12:48:45 +08:00
|
|
|
typename iterator_traits<_InputIterator>::value_type{});
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2010-05-12 03:42:16 +08:00
|
|
|
template <class _InputIterator1, class _InputIterator2, class _Tp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2010-05-12 03:42:16 +08:00
|
|
|
_Tp
|
|
|
|
inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init)
|
|
|
|
{
|
2014-10-28 03:28:20 +08:00
|
|
|
for (; __first1 != __last1; ++__first1, (void) ++__first2)
|
2020-11-28 03:05:03 +08:00
|
|
|
#if _LIBCPP_STD_VER > 17
|
|
|
|
__init = _VSTD::move(__init) + *__first1 * *__first2;
|
|
|
|
#else
|
2010-05-12 03:42:16 +08:00
|
|
|
__init = __init + *__first1 * *__first2;
|
2020-11-28 03:05:03 +08:00
|
|
|
#endif
|
2010-05-12 03:42:16 +08:00
|
|
|
return __init;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _InputIterator1, class _InputIterator2, class _Tp, class _BinaryOperation1, class _BinaryOperation2>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2010-05-12 03:42:16 +08:00
|
|
|
_Tp
|
|
|
|
inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2,
|
|
|
|
_Tp __init, _BinaryOperation1 __binary_op1, _BinaryOperation2 __binary_op2)
|
|
|
|
{
|
2014-10-28 03:28:20 +08:00
|
|
|
for (; __first1 != __last1; ++__first1, (void) ++__first2)
|
2020-11-28 03:05:03 +08:00
|
|
|
#if _LIBCPP_STD_VER > 17
|
|
|
|
__init = __binary_op1(_VSTD::move(__init), __binary_op2(*__first1, *__first2));
|
|
|
|
#else
|
2010-05-12 03:42:16 +08:00
|
|
|
__init = __binary_op1(__init, __binary_op2(*__first1, *__first2));
|
2020-11-28 03:05:03 +08:00
|
|
|
#endif
|
2010-05-12 03:42:16 +08:00
|
|
|
return __init;
|
|
|
|
}
|
|
|
|
|
2017-06-14 12:48:45 +08:00
|
|
|
#if _LIBCPP_STD_VER > 14
|
|
|
|
template <class _InputIterator, class _Tp, class _BinaryOp, class _UnaryOp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2017-06-14 12:48:45 +08:00
|
|
|
_Tp
|
2018-01-05 09:31:55 +08:00
|
|
|
transform_reduce(_InputIterator __first, _InputIterator __last,
|
2017-06-14 12:48:45 +08:00
|
|
|
_Tp __init, _BinaryOp __b, _UnaryOp __u)
|
|
|
|
{
|
|
|
|
for (; __first != __last; ++__first)
|
|
|
|
__init = __b(__init, __u(*__first));
|
|
|
|
return __init;
|
|
|
|
}
|
|
|
|
|
2018-01-05 09:31:55 +08:00
|
|
|
template <class _InputIterator1, class _InputIterator2,
|
2017-06-14 12:48:45 +08:00
|
|
|
class _Tp, class _BinaryOp1, class _BinaryOp2>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2017-06-14 12:48:45 +08:00
|
|
|
_Tp
|
|
|
|
transform_reduce(_InputIterator1 __first1, _InputIterator1 __last1,
|
|
|
|
_InputIterator2 __first2, _Tp __init, _BinaryOp1 __b1, _BinaryOp2 __b2)
|
|
|
|
{
|
|
|
|
for (; __first1 != __last1; ++__first1, (void) ++__first2)
|
|
|
|
__init = __b1(__init, __b2(*__first1, *__first2));
|
|
|
|
return __init;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _InputIterator1, class _InputIterator2, class _Tp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2017-06-14 12:48:45 +08:00
|
|
|
_Tp
|
2018-01-05 09:31:55 +08:00
|
|
|
transform_reduce(_InputIterator1 __first1, _InputIterator1 __last1,
|
2017-06-14 12:48:45 +08:00
|
|
|
_InputIterator2 __first2, _Tp __init)
|
|
|
|
{
|
2018-01-05 09:31:57 +08:00
|
|
|
return _VSTD::transform_reduce(__first1, __last1, __first2, _VSTD::move(__init),
|
2017-06-14 12:48:45 +08:00
|
|
|
_VSTD::plus<>(), _VSTD::multiplies<>());
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2010-05-12 03:42:16 +08:00
|
|
|
template <class _InputIterator, class _OutputIterator>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2010-05-12 03:42:16 +08:00
|
|
|
_OutputIterator
|
|
|
|
partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
|
|
|
|
{
|
|
|
|
if (__first != __last)
|
|
|
|
{
|
|
|
|
typename iterator_traits<_InputIterator>::value_type __t(*__first);
|
|
|
|
*__result = __t;
|
2014-10-28 03:28:20 +08:00
|
|
|
for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
|
2010-05-12 03:42:16 +08:00
|
|
|
{
|
2020-11-28 03:05:03 +08:00
|
|
|
#if _LIBCPP_STD_VER > 17
|
|
|
|
__t = _VSTD::move(__t) + *__first;
|
|
|
|
#else
|
2010-05-12 03:42:16 +08:00
|
|
|
__t = __t + *__first;
|
2020-11-28 03:05:03 +08:00
|
|
|
#endif
|
2010-05-12 03:42:16 +08:00
|
|
|
*__result = __t;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return __result;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _InputIterator, class _OutputIterator, class _BinaryOperation>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2010-05-12 03:42:16 +08:00
|
|
|
_OutputIterator
|
|
|
|
partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result,
|
|
|
|
_BinaryOperation __binary_op)
|
|
|
|
{
|
|
|
|
if (__first != __last)
|
|
|
|
{
|
|
|
|
typename iterator_traits<_InputIterator>::value_type __t(*__first);
|
|
|
|
*__result = __t;
|
2014-10-28 03:28:20 +08:00
|
|
|
for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
|
2010-05-12 03:42:16 +08:00
|
|
|
{
|
2020-11-28 03:05:03 +08:00
|
|
|
#if _LIBCPP_STD_VER > 17
|
|
|
|
__t = __binary_op(_VSTD::move(__t), *__first);
|
|
|
|
#else
|
2010-05-12 03:42:16 +08:00
|
|
|
__t = __binary_op(__t, *__first);
|
2020-11-28 03:05:03 +08:00
|
|
|
#endif
|
2010-05-12 03:42:16 +08:00
|
|
|
*__result = __t;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return __result;
|
|
|
|
}
|
|
|
|
|
2017-06-10 10:22:13 +08:00
|
|
|
#if _LIBCPP_STD_VER > 14
|
|
|
|
template <class _InputIterator, class _OutputIterator, class _Tp, class _BinaryOp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2017-06-10 10:22:13 +08:00
|
|
|
_OutputIterator
|
2018-01-05 09:31:55 +08:00
|
|
|
exclusive_scan(_InputIterator __first, _InputIterator __last,
|
2017-06-10 10:22:13 +08:00
|
|
|
_OutputIterator __result, _Tp __init, _BinaryOp __b)
|
|
|
|
{
|
|
|
|
if (__first != __last)
|
|
|
|
{
|
2020-11-25 01:29:08 +08:00
|
|
|
_Tp __tmp(__b(__init, *__first));
|
|
|
|
while (true)
|
2017-06-10 10:22:13 +08:00
|
|
|
{
|
2020-11-25 01:29:08 +08:00
|
|
|
*__result = _VSTD::move(__init);
|
2017-06-10 10:22:13 +08:00
|
|
|
++__result;
|
2020-11-25 01:29:08 +08:00
|
|
|
++__first;
|
|
|
|
if (__first == __last)
|
|
|
|
break;
|
|
|
|
__init = _VSTD::move(__tmp);
|
|
|
|
__tmp = __b(__init, *__first);
|
|
|
|
}
|
2017-06-10 10:22:13 +08:00
|
|
|
}
|
|
|
|
return __result;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _InputIterator, class _OutputIterator, class _Tp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2017-06-10 10:22:13 +08:00
|
|
|
_OutputIterator
|
2018-01-05 09:31:55 +08:00
|
|
|
exclusive_scan(_InputIterator __first, _InputIterator __last,
|
2017-06-10 10:22:13 +08:00
|
|
|
_OutputIterator __result, _Tp __init)
|
|
|
|
{
|
|
|
|
return _VSTD::exclusive_scan(__first, __last, __result, __init, _VSTD::plus<>());
|
|
|
|
}
|
|
|
|
|
2017-06-23 13:12:42 +08:00
|
|
|
template <class _InputIterator, class _OutputIterator, class _Tp, class _BinaryOp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2018-01-05 09:31:55 +08:00
|
|
|
_OutputIterator inclusive_scan(_InputIterator __first, _InputIterator __last,
|
2017-06-23 13:12:42 +08:00
|
|
|
_OutputIterator __result, _BinaryOp __b, _Tp __init)
|
|
|
|
{
|
|
|
|
for (; __first != __last; ++__first, (void) ++__result) {
|
|
|
|
__init = __b(__init, *__first);
|
|
|
|
*__result = __init;
|
2020-11-25 01:26:05 +08:00
|
|
|
}
|
2017-06-23 13:12:42 +08:00
|
|
|
return __result;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _InputIterator, class _OutputIterator, class _BinaryOp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2018-01-05 09:31:55 +08:00
|
|
|
_OutputIterator inclusive_scan(_InputIterator __first, _InputIterator __last,
|
2017-06-23 13:12:42 +08:00
|
|
|
_OutputIterator __result, _BinaryOp __b)
|
|
|
|
{
|
|
|
|
if (__first != __last) {
|
[libc++] Consistently replace `std::` qualification with `_VSTD::` or nothing. NFCI.
I used a lot of `git grep` to find places where `std::` was being used
outside of comments and assert-messages. There were three outcomes:
- Qualified function calls, e.g. `std::move` becomes `_VSTD::move`.
This is the most common case.
- Typenames that don't need qualification, e.g. `std::allocator` becomes `allocator`.
Leaving these as `_VSTD::allocator` would also be fine, but I decided
that removing the qualification is more consistent with existing practice.
- Names that specifically need un-versioned `std::` qualification,
or that I wasn't sure about. For example, I didn't touch any code in
<atomic>, <math.h>, <new>, or any ext/ or experimental/ headers;
and I didn't touch any instances of `std::type_info`.
In some deduction guides, we were accidentally using `class Alloc = typename std::allocator<T>`,
despite `std::allocator<T>`'s type-ness not being template-dependent.
Because `std::allocator` is a qualified name, this did parse as we intended;
but what we meant was simply `class Alloc = allocator<T>`.
Differential Revision: https://reviews.llvm.org/D92250
2020-11-28 00:02:06 +08:00
|
|
|
typename iterator_traits<_InputIterator>::value_type __init = *__first;
|
2017-06-23 13:12:42 +08:00
|
|
|
*__result++ = __init;
|
|
|
|
if (++__first != __last)
|
|
|
|
return _VSTD::inclusive_scan(__first, __last, __result, __b, __init);
|
2020-11-25 01:26:05 +08:00
|
|
|
}
|
2017-06-23 13:12:42 +08:00
|
|
|
|
|
|
|
return __result;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _InputIterator, class _OutputIterator>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2018-01-05 09:31:55 +08:00
|
|
|
_OutputIterator inclusive_scan(_InputIterator __first, _InputIterator __last,
|
2017-06-23 13:12:42 +08:00
|
|
|
_OutputIterator __result)
|
|
|
|
{
|
[libc++] Consistently replace `std::` qualification with `_VSTD::` or nothing. NFCI.
I used a lot of `git grep` to find places where `std::` was being used
outside of comments and assert-messages. There were three outcomes:
- Qualified function calls, e.g. `std::move` becomes `_VSTD::move`.
This is the most common case.
- Typenames that don't need qualification, e.g. `std::allocator` becomes `allocator`.
Leaving these as `_VSTD::allocator` would also be fine, but I decided
that removing the qualification is more consistent with existing practice.
- Names that specifically need un-versioned `std::` qualification,
or that I wasn't sure about. For example, I didn't touch any code in
<atomic>, <math.h>, <new>, or any ext/ or experimental/ headers;
and I didn't touch any instances of `std::type_info`.
In some deduction guides, we were accidentally using `class Alloc = typename std::allocator<T>`,
despite `std::allocator<T>`'s type-ness not being template-dependent.
Because `std::allocator` is a qualified name, this did parse as we intended;
but what we meant was simply `class Alloc = allocator<T>`.
Differential Revision: https://reviews.llvm.org/D92250
2020-11-28 00:02:06 +08:00
|
|
|
return _VSTD::inclusive_scan(__first, __last, __result, _VSTD::plus<>());
|
2017-06-23 13:12:42 +08:00
|
|
|
}
|
|
|
|
|
2018-01-05 09:31:55 +08:00
|
|
|
template <class _InputIterator, class _OutputIterator, class _Tp,
|
2017-06-10 10:22:13 +08:00
|
|
|
class _BinaryOp, class _UnaryOp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2017-06-10 10:22:13 +08:00
|
|
|
_OutputIterator
|
2018-01-05 09:31:55 +08:00
|
|
|
transform_exclusive_scan(_InputIterator __first, _InputIterator __last,
|
2017-06-10 10:22:13 +08:00
|
|
|
_OutputIterator __result, _Tp __init,
|
|
|
|
_BinaryOp __b, _UnaryOp __u)
|
|
|
|
{
|
|
|
|
if (__first != __last)
|
|
|
|
{
|
|
|
|
_Tp __saved = __init;
|
|
|
|
do
|
|
|
|
{
|
|
|
|
__init = __b(__init, __u(*__first));
|
|
|
|
*__result = __saved;
|
|
|
|
__saved = __init;
|
|
|
|
++__result;
|
|
|
|
} while (++__first != __last);
|
|
|
|
}
|
|
|
|
return __result;
|
|
|
|
}
|
2017-06-23 13:12:42 +08:00
|
|
|
|
|
|
|
template <class _InputIterator, class _OutputIterator, class _Tp, class _BinaryOp, class _UnaryOp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
|
|
_OutputIterator
|
|
|
|
transform_inclusive_scan(_InputIterator __first, _InputIterator __last,
|
2017-06-23 13:12:42 +08:00
|
|
|
_OutputIterator __result, _BinaryOp __b, _UnaryOp __u, _Tp __init)
|
|
|
|
{
|
|
|
|
for (; __first != __last; ++__first, (void) ++__result) {
|
|
|
|
__init = __b(__init, __u(*__first));
|
|
|
|
*__result = __init;
|
|
|
|
}
|
|
|
|
|
|
|
|
return __result;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _InputIterator, class _OutputIterator, class _BinaryOp, class _UnaryOp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
|
|
_OutputIterator
|
|
|
|
transform_inclusive_scan(_InputIterator __first, _InputIterator __last,
|
2017-06-23 13:12:42 +08:00
|
|
|
_OutputIterator __result, _BinaryOp __b, _UnaryOp __u)
|
|
|
|
{
|
|
|
|
if (__first != __last) {
|
[libc++] Consistently replace `std::` qualification with `_VSTD::` or nothing. NFCI.
I used a lot of `git grep` to find places where `std::` was being used
outside of comments and assert-messages. There were three outcomes:
- Qualified function calls, e.g. `std::move` becomes `_VSTD::move`.
This is the most common case.
- Typenames that don't need qualification, e.g. `std::allocator` becomes `allocator`.
Leaving these as `_VSTD::allocator` would also be fine, but I decided
that removing the qualification is more consistent with existing practice.
- Names that specifically need un-versioned `std::` qualification,
or that I wasn't sure about. For example, I didn't touch any code in
<atomic>, <math.h>, <new>, or any ext/ or experimental/ headers;
and I didn't touch any instances of `std::type_info`.
In some deduction guides, we were accidentally using `class Alloc = typename std::allocator<T>`,
despite `std::allocator<T>`'s type-ness not being template-dependent.
Because `std::allocator` is a qualified name, this did parse as we intended;
but what we meant was simply `class Alloc = allocator<T>`.
Differential Revision: https://reviews.llvm.org/D92250
2020-11-28 00:02:06 +08:00
|
|
|
typename iterator_traits<_InputIterator>::value_type __init = __u(*__first);
|
2017-06-23 13:12:42 +08:00
|
|
|
*__result++ = __init;
|
|
|
|
if (++__first != __last)
|
|
|
|
return _VSTD::transform_inclusive_scan(__first, __last, __result, __b, __u, __init);
|
2020-11-25 01:26:05 +08:00
|
|
|
}
|
2018-01-05 09:31:55 +08:00
|
|
|
|
2017-06-23 13:12:42 +08:00
|
|
|
return __result;
|
|
|
|
}
|
2017-06-10 10:22:13 +08:00
|
|
|
#endif
|
|
|
|
|
2010-05-12 03:42:16 +08:00
|
|
|
template <class _InputIterator, class _OutputIterator>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2010-05-12 03:42:16 +08:00
|
|
|
_OutputIterator
|
|
|
|
adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
|
|
|
|
{
|
|
|
|
if (__first != __last)
|
|
|
|
{
|
2020-11-28 03:05:03 +08:00
|
|
|
typename iterator_traits<_InputIterator>::value_type __acc(*__first);
|
|
|
|
*__result = __acc;
|
2014-10-28 03:28:20 +08:00
|
|
|
for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
|
2010-05-12 03:42:16 +08:00
|
|
|
{
|
2020-11-28 03:05:03 +08:00
|
|
|
typename iterator_traits<_InputIterator>::value_type __val(*__first);
|
|
|
|
#if _LIBCPP_STD_VER > 17
|
|
|
|
*__result = __val - _VSTD::move(__acc);
|
|
|
|
#else
|
|
|
|
*__result = __val - __acc;
|
|
|
|
#endif
|
|
|
|
__acc = _VSTD::move(__val);
|
2010-05-12 03:42:16 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return __result;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <class _InputIterator, class _OutputIterator, class _BinaryOperation>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2010-05-12 03:42:16 +08:00
|
|
|
_OutputIterator
|
|
|
|
adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result,
|
|
|
|
_BinaryOperation __binary_op)
|
|
|
|
{
|
|
|
|
if (__first != __last)
|
|
|
|
{
|
2020-11-28 03:05:03 +08:00
|
|
|
typename iterator_traits<_InputIterator>::value_type __acc(*__first);
|
|
|
|
*__result = __acc;
|
2014-10-28 03:28:20 +08:00
|
|
|
for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result)
|
2010-05-12 03:42:16 +08:00
|
|
|
{
|
2020-11-28 03:05:03 +08:00
|
|
|
typename iterator_traits<_InputIterator>::value_type __val(*__first);
|
|
|
|
#if _LIBCPP_STD_VER > 17
|
|
|
|
*__result = __binary_op(__val, _VSTD::move(__acc));
|
|
|
|
#else
|
|
|
|
*__result = __binary_op(__val, __acc);
|
|
|
|
#endif
|
|
|
|
__acc = _VSTD::move(__val);
|
2010-05-12 03:42:16 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return __result;
|
|
|
|
}
|
|
|
|
|
2010-05-27 02:53:44 +08:00
|
|
|
template <class _ForwardIterator, class _Tp>
|
2020-11-28 21:50:53 +08:00
|
|
|
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
2010-05-27 02:53:44 +08:00
|
|
|
void
|
2011-10-23 04:59:45 +08:00
|
|
|
iota(_ForwardIterator __first, _ForwardIterator __last, _Tp __value_)
|
2010-05-27 02:53:44 +08:00
|
|
|
{
|
2014-10-28 03:28:20 +08:00
|
|
|
for (; __first != __last; ++__first, (void) ++__value_)
|
2011-10-23 04:59:45 +08:00
|
|
|
*__first = __value_;
|
2010-05-27 02:53:44 +08:00
|
|
|
}
|
|
|
|
|
2016-07-26 22:29:45 +08:00
|
|
|
|
|
|
|
#if _LIBCPP_STD_VER > 14
|
2019-06-19 02:13:54 +08:00
|
|
|
template <typename _Result, typename _Source, bool _IsSigned = is_signed<_Source>::value> struct __ct_abs;
|
2016-07-26 22:29:45 +08:00
|
|
|
|
2017-02-11 04:49:08 +08:00
|
|
|
template <typename _Result, typename _Source>
|
2019-06-19 02:13:54 +08:00
|
|
|
struct __ct_abs<_Result, _Source, true> {
|
2016-07-26 22:29:45 +08:00
|
|
|
_LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
|
2017-02-11 04:49:08 +08:00
|
|
|
_Result operator()(_Source __t) const noexcept
|
|
|
|
{
|
2020-11-25 01:26:05 +08:00
|
|
|
if (__t >= 0) return __t;
|
|
|
|
if (__t == numeric_limits<_Source>::min()) return -static_cast<_Result>(__t);
|
|
|
|
return -__t;
|
2017-02-11 04:49:08 +08:00
|
|
|
}
|
2016-07-26 22:29:45 +08:00
|
|
|
};
|
|
|
|
|
2017-02-11 04:49:08 +08:00
|
|
|
template <typename _Result, typename _Source>
|
2019-06-19 02:13:54 +08:00
|
|
|
struct __ct_abs<_Result, _Source, false> {
|
2016-07-26 22:29:45 +08:00
|
|
|
_LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
|
2017-02-11 04:49:08 +08:00
|
|
|
_Result operator()(_Source __t) const noexcept { return __t; }
|
2016-07-26 22:29:45 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
template<class _Tp>
|
2017-05-09 08:00:00 +08:00
|
|
|
_LIBCPP_CONSTEXPR _LIBCPP_HIDDEN
|
2016-07-26 22:29:45 +08:00
|
|
|
_Tp __gcd(_Tp __m, _Tp __n)
|
|
|
|
{
|
2017-02-11 04:49:08 +08:00
|
|
|
static_assert((!is_signed<_Tp>::value), "");
|
2017-05-09 08:00:00 +08:00
|
|
|
return __n == 0 ? __m : _VSTD::__gcd<_Tp>(__n, __m % __n);
|
2016-07-26 22:29:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template<class _Tp, class _Up>
|
|
|
|
_LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
|
|
|
|
common_type_t<_Tp,_Up>
|
|
|
|
gcd(_Tp __m, _Up __n)
|
|
|
|
{
|
|
|
|
static_assert((is_integral<_Tp>::value && is_integral<_Up>::value), "Arguments to gcd must be integer types");
|
2016-11-15 02:22:19 +08:00
|
|
|
static_assert((!is_same<typename remove_cv<_Tp>::type, bool>::value), "First argument to gcd cannot be bool" );
|
|
|
|
static_assert((!is_same<typename remove_cv<_Up>::type, bool>::value), "Second argument to gcd cannot be bool" );
|
2016-07-26 22:29:45 +08:00
|
|
|
using _Rp = common_type_t<_Tp,_Up>;
|
|
|
|
using _Wp = make_unsigned_t<_Rp>;
|
2017-05-09 08:00:00 +08:00
|
|
|
return static_cast<_Rp>(_VSTD::__gcd(
|
2019-06-19 02:13:54 +08:00
|
|
|
static_cast<_Wp>(__ct_abs<_Rp, _Tp>()(__m)),
|
|
|
|
static_cast<_Wp>(__ct_abs<_Rp, _Up>()(__n))));
|
2016-07-26 22:29:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
template<class _Tp, class _Up>
|
|
|
|
_LIBCPP_CONSTEXPR _LIBCPP_INLINE_VISIBILITY
|
|
|
|
common_type_t<_Tp,_Up>
|
|
|
|
lcm(_Tp __m, _Up __n)
|
|
|
|
{
|
|
|
|
static_assert((is_integral<_Tp>::value && is_integral<_Up>::value), "Arguments to lcm must be integer types");
|
2016-11-15 02:22:19 +08:00
|
|
|
static_assert((!is_same<typename remove_cv<_Tp>::type, bool>::value), "First argument to lcm cannot be bool" );
|
|
|
|
static_assert((!is_same<typename remove_cv<_Up>::type, bool>::value), "Second argument to lcm cannot be bool" );
|
2016-07-26 22:29:45 +08:00
|
|
|
if (__m == 0 || __n == 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
using _Rp = common_type_t<_Tp,_Up>;
|
2019-06-19 02:13:54 +08:00
|
|
|
_Rp __val1 = __ct_abs<_Rp, _Tp>()(__m) / _VSTD::gcd(__m, __n);
|
|
|
|
_Rp __val2 = __ct_abs<_Rp, _Up>()(__n);
|
2016-07-26 22:29:45 +08:00
|
|
|
_LIBCPP_ASSERT((numeric_limits<_Rp>::max() / __val1 > __val2), "Overflow in lcm");
|
|
|
|
return __val1 * __val2;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* _LIBCPP_STD_VER > 14 */
|
|
|
|
|
2019-03-15 00:25:55 +08:00
|
|
|
#if _LIBCPP_STD_VER > 17
|
|
|
|
template <class _Tp>
|
|
|
|
_LIBCPP_INLINE_VISIBILITY constexpr
|
2019-05-29 23:17:55 +08:00
|
|
|
enable_if_t<is_integral_v<_Tp> && !is_same_v<bool, _Tp> && !is_null_pointer_v<_Tp>, _Tp>
|
2019-03-15 00:25:55 +08:00
|
|
|
midpoint(_Tp __a, _Tp __b) noexcept
|
|
|
|
_LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK
|
|
|
|
{
|
[libc++] Consistently replace `std::` qualification with `_VSTD::` or nothing. NFCI.
I used a lot of `git grep` to find places where `std::` was being used
outside of comments and assert-messages. There were three outcomes:
- Qualified function calls, e.g. `std::move` becomes `_VSTD::move`.
This is the most common case.
- Typenames that don't need qualification, e.g. `std::allocator` becomes `allocator`.
Leaving these as `_VSTD::allocator` would also be fine, but I decided
that removing the qualification is more consistent with existing practice.
- Names that specifically need un-versioned `std::` qualification,
or that I wasn't sure about. For example, I didn't touch any code in
<atomic>, <math.h>, <new>, or any ext/ or experimental/ headers;
and I didn't touch any instances of `std::type_info`.
In some deduction guides, we were accidentally using `class Alloc = typename std::allocator<T>`,
despite `std::allocator<T>`'s type-ness not being template-dependent.
Because `std::allocator` is a qualified name, this did parse as we intended;
but what we meant was simply `class Alloc = allocator<T>`.
Differential Revision: https://reviews.llvm.org/D92250
2020-11-28 00:02:06 +08:00
|
|
|
using _Up = make_unsigned_t<_Tp>;
|
|
|
|
constexpr _Up __bitshift = numeric_limits<_Up>::digits - 1;
|
2019-03-15 00:25:55 +08:00
|
|
|
|
2019-11-05 11:00:23 +08:00
|
|
|
_Up __diff = _Up(__b) - _Up(__a);
|
|
|
|
_Up __sign_bit = __b < __a;
|
|
|
|
|
|
|
|
_Up __half_diff = (__diff / 2) + (__sign_bit << __bitshift) + (__sign_bit & __diff);
|
|
|
|
|
|
|
|
return __a + __half_diff;
|
2019-03-15 00:25:55 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template <class _TPtr>
|
|
|
|
_LIBCPP_INLINE_VISIBILITY constexpr
|
2019-05-30 00:01:36 +08:00
|
|
|
enable_if_t<is_pointer_v<_TPtr>
|
|
|
|
&& is_object_v<remove_pointer_t<_TPtr>>
|
|
|
|
&& ! is_void_v<remove_pointer_t<_TPtr>>
|
2019-05-29 23:17:55 +08:00
|
|
|
&& (sizeof(remove_pointer_t<_TPtr>) > 0), _TPtr>
|
2019-03-15 00:25:55 +08:00
|
|
|
midpoint(_TPtr __a, _TPtr __b) noexcept
|
|
|
|
{
|
|
|
|
return __a + _VSTD::midpoint(ptrdiff_t(0), __b - __a);
|
|
|
|
}
|
2019-04-25 20:11:43 +08:00
|
|
|
|
|
|
|
|
|
|
|
template <typename _Tp>
|
2019-05-08 00:07:24 +08:00
|
|
|
constexpr int __sign(_Tp __val) {
|
2019-04-25 20:11:43 +08:00
|
|
|
return (_Tp(0) < __val) - (__val < _Tp(0));
|
|
|
|
}
|
|
|
|
|
2019-06-19 02:13:54 +08:00
|
|
|
template <typename _Fp>
|
|
|
|
constexpr _Fp __fp_abs(_Fp __f) { return __f >= 0 ? __f : -__f; }
|
|
|
|
|
2019-04-25 20:11:43 +08:00
|
|
|
template <class _Fp>
|
|
|
|
_LIBCPP_INLINE_VISIBILITY constexpr
|
|
|
|
enable_if_t<is_floating_point_v<_Fp>, _Fp>
|
|
|
|
midpoint(_Fp __a, _Fp __b) noexcept
|
|
|
|
{
|
2021-04-18 05:03:20 +08:00
|
|
|
constexpr _Fp __lo = numeric_limits<_Fp>::min()*2;
|
|
|
|
constexpr _Fp __hi = numeric_limits<_Fp>::max()/2;
|
2019-06-19 02:13:54 +08:00
|
|
|
return __fp_abs(__a) <= __hi && __fp_abs(__b) <= __hi ? // typical case: overflow is impossible
|
|
|
|
(__a + __b)/2 : // always correctly rounded
|
|
|
|
__fp_abs(__a) < __lo ? __a + __b/2 : // not safe to halve a
|
2019-12-21 17:22:12 +08:00
|
|
|
__fp_abs(__b) < __lo ? __a/2 + __b : // not safe to halve b
|
2019-06-19 02:13:54 +08:00
|
|
|
__a/2 + __b/2; // otherwise correctly rounded
|
2019-04-25 20:11:43 +08:00
|
|
|
}
|
2019-06-19 02:13:54 +08:00
|
|
|
|
2019-04-25 20:11:43 +08:00
|
|
|
#endif // _LIBCPP_STD_VER > 17
|
2019-03-15 00:25:55 +08:00
|
|
|
|
2010-05-12 03:42:16 +08:00
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
|
2017-06-01 06:07:49 +08:00
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
|
2019-08-06 02:29:14 +08:00
|
|
|
#if defined(_LIBCPP_HAS_PARALLEL_ALGORITHMS) && _LIBCPP_STD_VER >= 17
|
2019-08-07 05:11:24 +08:00
|
|
|
# include <__pstl_numeric>
|
2019-08-06 02:29:14 +08:00
|
|
|
#endif
|
|
|
|
|
2021-04-21 00:03:32 +08:00
|
|
|
#endif // _LIBCPP_NUMERIC
|