CCCL (CUDA C++ Core Libraries) provides: - CUB: device/block/warp-level GPU primitives (reduce, scan, sort, topk) - Thrust: high-level parallel algorithms (transform_reduce, sort, scan) - libcudacxx: CUDA C++ standard library (atomics, barriers, memory) - cudax: experimental features (memory resources, allocators) - Tuning policies: per-SM hardware-specific algorithm parameters Competition optimization vectors mapped to CCCL: - Output TPS (83% weight): warp_reduce, block_reduce, device_topk - Input TPS (14% weight): device_scan, block_load, prefetch - Cache TPS (3% weight): prefix caching strategy patterns - Memory (0.9 util): pooled/cached/buddy allocators Source: https://github.com/NVIDIA/cccl (shallow clone, HEAD only) License: Apache-2.0
302 lines
10 KiB
C++
302 lines
10 KiB
C++
// SPDX-FileCopyrightText: Copyright (c) 2008-2013, NVIDIA Corporation. All rights reserved.
|
|
// SPDX-License-Identifier: Apache-2.0
|
|
|
|
/*! \file logical.h
|
|
* \brief Logical operations on ranges
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <thrust/detail/config.h>
|
|
|
|
#if defined(_CCCL_IMPLICIT_SYSTEM_HEADER_GCC)
|
|
# pragma GCC system_header
|
|
#elif defined(_CCCL_IMPLICIT_SYSTEM_HEADER_CLANG)
|
|
# pragma clang system_header
|
|
#elif defined(_CCCL_IMPLICIT_SYSTEM_HEADER_MSVC)
|
|
# pragma system_header
|
|
#endif // no system header
|
|
#include <thrust/detail/execution_policy.h>
|
|
|
|
THRUST_NAMESPACE_BEGIN
|
|
|
|
/*! \addtogroup reductions
|
|
* \{
|
|
* \addtogroup logical
|
|
* \ingroup reductions
|
|
* \{
|
|
*/
|
|
|
|
/*! \p all_of determines whether all elements in a range satisfy a predicate.
|
|
* Specifically, \p all_of returns \c true if <tt>pred(*i)</tt> is \c true
|
|
* for every iterator \c i in the range <tt>[first, last)</tt> and
|
|
* \c false otherwise.
|
|
*
|
|
* The algorithm's execution is parallelized as determined by \p exec.
|
|
*
|
|
* \param exec The execution policy to use for parallelization.
|
|
* \param first The beginning of the sequence.
|
|
* \param last The end of the sequence.
|
|
* \param pred A predicate used to test range elements.
|
|
* \return \c true, if all elements satisfy the predicate; \c false, otherwise.
|
|
*
|
|
* \tparam DerivedPolicy The name of the derived execution policy.
|
|
* \tparam InputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/input_iterator">Input
|
|
* Iterator</a>, \tparam Predicate must be a model of <a
|
|
* href="https://en.cppreference.com/w/cpp/concepts/predicate">Predicate</a>.
|
|
*
|
|
* \code
|
|
* #include <thrust/logical.h>
|
|
* #include <thrust/functional.h>
|
|
* #include <thrust/execution_policy.h>
|
|
* ...
|
|
* bool A[3] = {true, true, false};
|
|
*
|
|
* thrust::all_of(thrust::host, A, A + 2, ::cuda::std::identity{}); // returns true
|
|
* thrust::all_of(thrust::host, A, A + 3, ::cuda::std::identity{}); // returns false
|
|
*
|
|
* // empty range
|
|
* thrust::all_of(thrust::host, A, A, ::cuda::std::identity{}); // returns true
|
|
*
|
|
* \endcode
|
|
*
|
|
* \see any_of
|
|
* \see none_of
|
|
* \see transform_reduce
|
|
*
|
|
* \verbatim embed:rst:leading-asterisk
|
|
* .. versionadded:: 2.2.0
|
|
* \endverbatim
|
|
*/
|
|
template <typename DerivedPolicy, typename InputIterator, typename Predicate>
|
|
_CCCL_HOST_DEVICE bool
|
|
all_of(const thrust::detail::execution_policy_base<DerivedPolicy>& exec,
|
|
InputIterator first,
|
|
InputIterator last,
|
|
Predicate pred);
|
|
|
|
/*! \p all_of determines whether all elements in a range satisfy a predicate.
|
|
* Specifically, \p all_of returns \c true if <tt>pred(*i)</tt> is \c true
|
|
* for every iterator \c i in the range <tt>[first, last)</tt> and
|
|
* \c false otherwise.
|
|
*
|
|
* \param first The beginning of the sequence.
|
|
* \param last The end of the sequence.
|
|
* \param pred A predicate used to test range elements.
|
|
* \return \c true, if all elements satisfy the predicate; \c false, otherwise.
|
|
*
|
|
* \tparam InputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/input_iterator">Input
|
|
* Iterator</a>, \tparam Predicate must be a model of <a
|
|
* href="https://en.cppreference.com/w/cpp/concepts/predicate">Predicate</a>.
|
|
*
|
|
* \code
|
|
* #include <thrust/logical.h>
|
|
* #include <thrust/functional.h>
|
|
* ...
|
|
* bool A[3] = {true, true, false};
|
|
*
|
|
* thrust::all_of(A, A + 2, ::cuda::std::identity{}); // returns true
|
|
* thrust::all_of(A, A + 3, ::cuda::std::identity{}); // returns false
|
|
*
|
|
* // empty range
|
|
* thrust::all_of(A, A, ::cuda::std::identity{}); // returns true
|
|
*
|
|
* \endcode
|
|
*
|
|
* \see any_of
|
|
* \see none_of
|
|
* \see transform_reduce
|
|
*
|
|
* \verbatim embed:rst:leading-asterisk
|
|
* .. versionadded:: 2.2.0
|
|
* \endverbatim
|
|
*/
|
|
template <typename InputIterator, typename Predicate>
|
|
bool all_of(InputIterator first, InputIterator last, Predicate pred);
|
|
|
|
/*! \p any_of determines whether any element in a range satisfies a predicate.
|
|
* Specifically, \p any_of returns \c true if <tt>pred(*i)</tt> is \c true
|
|
* for any iterator \c i in the range <tt>[first, last)</tt> and
|
|
* \c false otherwise.
|
|
*
|
|
* The algorithm's execution is parallelized as determined by \p exec.
|
|
*
|
|
* \param exec The execution policy to use for parallelization.
|
|
* \param first The beginning of the sequence.
|
|
* \param last The end of the sequence.
|
|
* \param pred A predicate used to test range elements.
|
|
* \return \c true, if any element satisfies the predicate; \c false, otherwise.
|
|
*
|
|
* \tparam DerivedPolicy The name of the derived execution policy.
|
|
* \tparam InputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/input_iterator">Input
|
|
* Iterator</a>, \tparam Predicate must be a model of <a
|
|
* href="https://en.cppreference.com/w/cpp/concepts/predicate">Predicate</a>.
|
|
*
|
|
* \code
|
|
* #include <thrust/logical.h>
|
|
* #include <thrust/functional.h>
|
|
* #include <thrust/execution_policy.h>
|
|
* ...
|
|
* bool A[3] = {true, true, false};
|
|
*
|
|
* thrust::any_of(thrust::host, A, A + 2, ::cuda::std::identity{}); // returns true
|
|
* thrust::any_of(thrust::host, A, A + 3, ::cuda::std::identity{}); // returns true
|
|
*
|
|
* thrust::any_of(thrust::host, A + 2, A + 3, ::cuda::std::identity{}); // returns false
|
|
*
|
|
* // empty range
|
|
* thrust::any_of(thrust::host, A, A, ::cuda::std::identity{}); // returns false
|
|
* \endcode
|
|
*
|
|
* \see all_of
|
|
* \see none_of
|
|
* \see transform_reduce
|
|
*
|
|
* \verbatim embed:rst:leading-asterisk
|
|
* .. versionadded:: 2.2.0
|
|
* \endverbatim
|
|
*/
|
|
template <typename DerivedPolicy, typename InputIterator, typename Predicate>
|
|
_CCCL_HOST_DEVICE bool
|
|
any_of(const thrust::detail::execution_policy_base<DerivedPolicy>& exec,
|
|
InputIterator first,
|
|
InputIterator last,
|
|
Predicate pred);
|
|
|
|
/*! \p any_of determines whether any element in a range satisfies a predicate.
|
|
* Specifically, \p any_of returns \c true if <tt>pred(*i)</tt> is \c true
|
|
* for any iterator \c i in the range <tt>[first, last)</tt> and
|
|
* \c false otherwise.
|
|
*
|
|
* \param first The beginning of the sequence.
|
|
* \param last The end of the sequence.
|
|
* \param pred A predicate used to test range elements.
|
|
* \return \c true, if any element satisfies the predicate; \c false, otherwise.
|
|
*
|
|
* \tparam InputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/input_iterator">Input
|
|
* Iterator</a>, \tparam Predicate must be a model of <a
|
|
* href="https://en.cppreference.com/w/cpp/concepts/predicate">Predicate</a>.
|
|
*
|
|
* \code
|
|
* #include <thrust/logical.h>
|
|
* #include <thrust/functional.h>
|
|
* ...
|
|
* bool A[3] = {true, true, false};
|
|
*
|
|
* thrust::any_of(A, A + 2, ::cuda::std::identity{}); // returns true
|
|
* thrust::any_of(A, A + 3, ::cuda::std::identity{}); // returns true
|
|
*
|
|
* thrust::any_of(A + 2, A + 3, ::cuda::std::identity{}); // returns false
|
|
*
|
|
* // empty range
|
|
* thrust::any_of(A, A, ::cuda::std::identity{}); // returns false
|
|
* \endcode
|
|
*
|
|
* \see all_of
|
|
* \see none_of
|
|
* \see transform_reduce
|
|
*
|
|
* \verbatim embed:rst:leading-asterisk
|
|
* .. versionadded:: 2.2.0
|
|
* \endverbatim
|
|
*/
|
|
template <typename InputIterator, typename Predicate>
|
|
bool any_of(InputIterator first, InputIterator last, Predicate pred);
|
|
|
|
/*! \p none_of determines whether no element in a range satisfies a predicate.
|
|
* Specifically, \p none_of returns \c true if there is no iterator \c i in
|
|
* the range <tt>[first, last)</tt> such that <tt>pred(*i)</tt> is \c true,
|
|
* and \c false otherwise.
|
|
*
|
|
* The algorithm's execution is parallelized as determined by \p exec.
|
|
*
|
|
* \param exec The execution policy to use for parallelization.
|
|
* \param first The beginning of the sequence.
|
|
* \param last The end of the sequence.
|
|
* \param pred A predicate used to test range elements.
|
|
* \return \c true, if no element satisfies the predicate; \c false, otherwise.
|
|
*
|
|
* \tparam DerivedPolicy The name of the derived execution policy.
|
|
* \tparam InputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/input_iterator">Input
|
|
* Iterator</a>, \tparam Predicate must be a model of <a
|
|
* href="https://en.cppreference.com/w/cpp/concepts/predicate">Predicate</a>.
|
|
*
|
|
* \code
|
|
* #include <thrust/logical.h>
|
|
* #include <thrust/functional.h>
|
|
* #include <thrust/execution_policy.h>
|
|
* ...
|
|
* bool A[3] = {true, true, false};
|
|
*
|
|
* thrust::none_of(thrust::host, A, A + 2, ::cuda::std::identity{}); // returns false
|
|
* thrust::none_of(thrust::host, A, A + 3, ::cuda::std::identity{}); // returns false
|
|
*
|
|
* thrust::none_of(thrust::host, A + 2, A + 3, ::cuda::std::identity{}); // returns true
|
|
*
|
|
* // empty range
|
|
* thrust::none_of(thrust::host, A, A, ::cuda::std::identity{}); // returns true
|
|
* \endcode
|
|
*
|
|
* \see all_of
|
|
* \see any_of
|
|
* \see transform_reduce
|
|
*
|
|
* \verbatim embed:rst:leading-asterisk
|
|
* .. versionadded:: 2.2.0
|
|
* \endverbatim
|
|
*/
|
|
template <typename DerivedPolicy, typename InputIterator, typename Predicate>
|
|
_CCCL_HOST_DEVICE bool
|
|
none_of(const thrust::detail::execution_policy_base<DerivedPolicy>& exec,
|
|
InputIterator first,
|
|
InputIterator last,
|
|
Predicate pred);
|
|
|
|
/*! \p none_of determines whether no element in a range satisfies a predicate.
|
|
* Specifically, \p none_of returns \c true if there is no iterator \c i in
|
|
* the range <tt>[first, last)</tt> such that <tt>pred(*i)</tt> is \c true,
|
|
* and \c false otherwise.
|
|
*
|
|
* \param first The beginning of the sequence.
|
|
* \param last The end of the sequence.
|
|
* \param pred A predicate used to test range elements.
|
|
* \return \c true, if no element satisfies the predicate; \c false, otherwise.
|
|
*
|
|
* \tparam InputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/input_iterator">Input
|
|
* Iterator</a>, \tparam Predicate must be a model of <a
|
|
* href="https://en.cppreference.com/w/cpp/concepts/predicate">Predicate</a>.
|
|
*
|
|
* \code
|
|
* #include <thrust/logical.h>
|
|
* #include <thrust/functional.h>
|
|
* ...
|
|
* bool A[3] = {true, true, false};
|
|
*
|
|
* thrust::none_of(A, A + 2, ::cuda::std::identity{}); // returns false
|
|
* thrust::none_of(A, A + 3, ::cuda::std::identity{}); // returns false
|
|
*
|
|
* thrust::none_of(A + 2, A + 3, ::cuda::std::identity{}); // returns true
|
|
*
|
|
* // empty range
|
|
* thrust::none_of(A, A, ::cuda::std::identity{}); // returns true
|
|
* \endcode
|
|
*
|
|
* \see all_of
|
|
* \see any_of
|
|
* \see transform_reduce
|
|
*
|
|
* \verbatim embed:rst:leading-asterisk
|
|
* .. versionadded:: 2.2.0
|
|
* \endverbatim
|
|
*/
|
|
template <typename InputIterator, typename Predicate>
|
|
bool none_of(InputIterator first, InputIterator last, Predicate pred);
|
|
|
|
/*! \} // end logical
|
|
* \} // end reductions
|
|
*/
|
|
|
|
THRUST_NAMESPACE_END
|
|
|
|
#include <thrust/detail/logical.inl>
|