mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2024-10-07 10:54:01 +00:00
ee6ec2c5f1
Reviewed By: ldionne, #libc Spies: libcxx-commits, miyuki Differential Revision: https://reviews.llvm.org/D150736
101 lines
3.5 KiB
C++
101 lines
3.5 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef _LIBCPP___NUMERIC_PSTL_TRANSFORM_REDUCE_H
|
|
#define _LIBCPP___NUMERIC_PSTL_TRANSFORM_REDUCE_H
|
|
|
|
#include <__algorithm/pstl_backend.h>
|
|
#include <__algorithm/pstl_frontend_dispatch.h>
|
|
#include <__config>
|
|
#include <__functional/operations.h>
|
|
#include <__numeric/transform_reduce.h>
|
|
#include <__type_traits/is_execution_policy.h>
|
|
#include <__utility/move.h>
|
|
#include <__utility/terminate_on_exception.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_INCOMPLETE_PSTL) && _LIBCPP_STD_VER >= 17
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
template <class _ExecutionPolicy,
|
|
class _ForwardIterator1,
|
|
class _ForwardIterator2,
|
|
class _Tp,
|
|
class _BinaryOperation1,
|
|
class _BinaryOperation2,
|
|
class _RawPolicy = __remove_cvref_t<_ExecutionPolicy>,
|
|
enable_if_t<is_execution_policy_v<_RawPolicy>, int> = 0>
|
|
_LIBCPP_HIDE_FROM_ABI _Tp transform_reduce(
|
|
_ExecutionPolicy&&,
|
|
_ForwardIterator1 __first1,
|
|
_ForwardIterator1 __last1,
|
|
_ForwardIterator2 __first2,
|
|
_Tp __init,
|
|
_BinaryOperation1 __reduce,
|
|
_BinaryOperation2 __transform) {
|
|
using _Backend = typename __select_backend<_RawPolicy>::type;
|
|
return std::__pstl_transform_reduce<_RawPolicy>(
|
|
_Backend{},
|
|
std::move(__first1),
|
|
std::move(__last1),
|
|
std::move(__first2),
|
|
std::move(__init),
|
|
std::move(__reduce),
|
|
std::move(__transform));
|
|
}
|
|
|
|
// This overload doesn't get a customization point because it's trivial to detect (through e.g.
|
|
// __is_trivial_plus_operation) when specializing the more general variant, which should always be preferred
|
|
template <class _ExecutionPolicy,
|
|
class _ForwardIterator1,
|
|
class _ForwardIterator2,
|
|
class _Tp,
|
|
enable_if_t<is_execution_policy_v<__remove_cvref_t<_ExecutionPolicy>>, int> = 0>
|
|
_LIBCPP_HIDE_FROM_ABI _Tp transform_reduce(
|
|
_ExecutionPolicy&& __policy,
|
|
_ForwardIterator1 __first1,
|
|
_ForwardIterator1 __last1,
|
|
_ForwardIterator2 __first2,
|
|
_Tp __init) {
|
|
return std::transform_reduce(__policy, __first1, __last1, __first2, __init, plus{}, multiplies{});
|
|
}
|
|
|
|
template <class _ExecutionPolicy,
|
|
class _ForwardIterator,
|
|
class _Tp,
|
|
class _BinaryOperation,
|
|
class _UnaryOperation,
|
|
class _RawPolicy = __remove_cvref_t<_ExecutionPolicy>,
|
|
enable_if_t<is_execution_policy_v<_RawPolicy>, int> = 0>
|
|
_LIBCPP_HIDE_FROM_ABI _Tp transform_reduce(
|
|
_ExecutionPolicy&&,
|
|
_ForwardIterator __first,
|
|
_ForwardIterator __last,
|
|
_Tp __init,
|
|
_BinaryOperation __reduce,
|
|
_UnaryOperation __transform) {
|
|
using _Backend = typename __select_backend<_RawPolicy>::type;
|
|
return std::__pstl_transform_reduce<_RawPolicy>(
|
|
_Backend{},
|
|
std::move(__first),
|
|
std::move(__last),
|
|
std::move(__init),
|
|
std::move(__reduce),
|
|
std::move(__transform));
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // !defined(_LIBCPP_HAS_NO_INCOMPLETE_PSTL) && _LIBCPP_STD_VER >= 17
|
|
|
|
#endif // _LIBCPP___NUMERIC_PSTL_TRANSFORM_REDUCE_H
|