1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/*
* Copyright 2008-2013 NVIDIA Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*! \file tabulate.h
* \brief Fills a range with the tabulation of a function
*/
#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 transformations
* \{
*/
/*! \p tabulate fills the range <tt>[first, last)</tt> with the value of a function applied to each
* element's index.
*
* For each iterator \c i in the range <tt>[first, last)</tt>, \p tabulate performs the assignment
* <tt>*i = unary_op(i - first)</tt>.
*
* 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 range.
* \param last The end of the range.
* \param unary_op The unary operation to apply.
*
* \tparam DerivedPolicy The name of the derived execution policy.
* \tparam ForwardIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/forward_iterator">Forward Iterator</a>,
* and \p ForwardIterator is mutable,
* and if \c x and \c y are objects of \c ForwardIterator's \c value_type, then <tt>x + y</tt> is defined,
* and if \c T is \p ForwardIterator's \c value_type, then <tt>T(0)</tt> is defined.
* \tparam UnaryOperation is a model of <a href="https://en.cppreference.com/w/cpp/utility/functional/unary_function">Unary Function</a>
* and \c UnaryFunction's \c result_type is convertible to \c OutputIterator's \c value_type.
*
* The following code snippet demonstrates how to use \p tabulate to generate the first \c n non-positive integers
* using the \p thrust::host execution policy for parallelization:
*
* \code
* #include <thrust/tabulate.h>
* #include <thrust/functional.h>
* #include <thrust/execution_policy.h>
* ...
* const int N = 10;
* int A[N];
* thrust::tabulate(thrust::host, A, A + 10, thrust::negate<int>());
* // A is now {0, -1, -2, -3, -4, -5, -6, -7, -8, -9}
* \endcode
*
* \see thrust::fill
* \see thrust::generate
* \see thrust::sequence
*/
template<typename DerivedPolicy, typename ForwardIterator, typename UnaryOperation>
__host__ __device__
void tabulate(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
ForwardIterator first,
ForwardIterator last,
UnaryOperation unary_op);
/*! \p tabulate fills the range <tt>[first, last)</tt> with the value of a function applied to each
* element's index.
*
* For each iterator \c i in the range <tt>[first, last)</tt>, \p tabulate performs the assignment
* <tt>*i = unary_op(i - first)</tt>.
*
* \param first The beginning of the range.
* \param last The end of the range.
* \param unary_op The unary operation to apply.
*
* \tparam ForwardIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/forward_iterator">Forward Iterator</a>,
* and \p ForwardIterator is mutable,
* and if \c x and \c y are objects of \c ForwardIterator's \c value_type, then <tt>x + y</tt> is defined,
* and if \c T is \p ForwardIterator's \c value_type, then <tt>T(0)</tt> is defined.
* \tparam UnaryOperation is a model of <a href="https://en.cppreference.com/w/cpp/utility/functional/unary_function">Unary Function</a>
* and \c UnaryFunction's \c result_type is convertible to \c OutputIterator's \c value_type.
*
* The following code snippet demonstrates how to use \p tabulate to generate the first \c n non-positive integers:
*
* \code
* #include <thrust/tabulate.h>
* #include <thrust/functional.h>
* ...
* const int N = 10;
* int A[N];
* thrust::tabulate(A, A + 10, thrust::negate<int>());
* // A is now {0, -1, -2, -3, -4, -5, -6, -7, -8, -9}
* \endcode
*
* \see thrust::fill
* \see thrust::generate
* \see thrust::sequence
*/
template<typename ForwardIterator, typename UnaryOperation>
void tabulate(ForwardIterator first,
ForwardIterator last,
UnaryOperation unary_op);
/*! \} // end transformations
*/
THRUST_NAMESPACE_END
#include <thrust/detail/tabulate.inl>
|
