/usr/include/thrust/sequence.h is in libthrust-dev 1.7.0-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 | /*
* Copyright 2008-2012 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 sequence.h
* \brief Fills a range with a sequence of numbers
*/
#pragma once
#include <thrust/detail/config.h>
#include <thrust/detail/execution_policy.h>
namespace thrust
{
/*! \addtogroup transformations
* \{
*/
/*! \p sequence fills the range <tt>[first, last)</tt> with a sequence of numbers.
*
* For each iterator \c i in the range <tt>[first, last)</tt>, this version of
* \p sequence performs the assignment <tt>*i = (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 sequence.
* \param last The end of the sequence.
*
* \tparam DerivedPolicy The name of the derived execution policy.
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">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.
*
* The following code snippet demonstrates how to use \p sequence to fill a range
* with a sequence of numbers using the \p thrust::host execution policy for parallelization:
*
* \code
* #include <thrust/sequence.h>
* #include <thrust/execution_policy.h>
* ...
* const int N = 10;
* int A[N];
* thrust::sequence(thrust::host, A, A + 10);
* // A is now {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
* \endcode
*
* \note Unlike the similar C++ STL function \c std::iota, \p sequence offers no
* guarantee on order of execution.
*
* \see http://www.sgi.com/tech/stl/iota.html
*/
template<typename DerivedPolicy, typename ForwardIterator>
void sequence(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
ForwardIterator first,
ForwardIterator last);
/*! \p sequence fills the range <tt>[first, last)</tt> with a sequence of numbers.
*
* For each iterator \c i in the range <tt>[first, last)</tt>, this version of
* \p sequence performs the assignment <tt>*i = (i - first)</tt>.
*
* \param first The beginning of the sequence.
* \param last The end of the sequence.
*
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">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.
*
* The following code snippet demonstrates how to use \p sequence to fill a range
* with a sequence of numbers.
*
* \code
* #include <thrust/sequence.h>
* ...
* const int N = 10;
* int A[N];
* thrust::sequence(A, A + 10);
* // A is now {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
* \endcode
*
* \note Unlike the similar C++ STL function \c std::iota, \p sequence offers no
* guarantee on order of execution.
*
* \see http://www.sgi.com/tech/stl/iota.html
*/
template<typename ForwardIterator>
void sequence(ForwardIterator first,
ForwardIterator last);
/*! \p sequence fills the range <tt>[first, last)</tt> with a sequence of numbers.
*
* For each iterator \c i in the range <tt>[first, last)</tt>, this version of
* \p sequence performs the assignment <tt>*i = init + (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 sequence.
* \param last The end of the sequence.
* \param init The first value of the sequence of numbers.
*
* \tparam DerivedPolicy The name of the derived execution policy.
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">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 T is a model of <a href="http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>,
* and \p T is convertible to \p ForwardIterator's \c value_type.
*
* The following code snippet demonstrates how to use \p sequence to fill a range
* with a sequence of numbers starting from the value 1 using the \p thrust::host execution
* policy for parallelization:
*
* \code
* #include <thrust/sequence.h>
* #include <thrust/execution_policy.h>
* ...
* const int N = 10;
* int A[N];
* thrust::sequence(thrust::host, A, A + 10, 1);
* // A is now {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
* \endcode
*
* \note Unlike the similar C++ STL function \c std::iota, \p sequence offers no
* guarantee on order of execution.
*
* \see http://www.sgi.com/tech/stl/iota.html
*/
template<typename DerivedPolicy, typename ForwardIterator, typename T>
void sequence(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
ForwardIterator first,
ForwardIterator last,
T init);
/*! \p sequence fills the range <tt>[first, last)</tt> with a sequence of numbers.
*
* For each iterator \c i in the range <tt>[first, last)</tt>, this version of
* \p sequence performs the assignment <tt>*i = init + (i - first)</tt>.
*
* \param first The beginning of the sequence.
* \param last The end of the sequence.
* \param init The first value of the sequence of numbers.
*
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">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 T is a model of <a href="http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>,
* and \p T is convertible to \p ForwardIterator's \c value_type.
*
* The following code snippet demonstrates how to use \p sequence to fill a range
* with a sequence of numbers starting from the value 1.
*
* \code
* #include <thrust/sequence.h>
* ...
* const int N = 10;
* int A[N];
* thrust::sequence(A, A + 10, 1);
* // A is now {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
* \endcode
*
* \note Unlike the similar C++ STL function \c std::iota, \p sequence offers no
* guarantee on order of execution.
*
* \see http://www.sgi.com/tech/stl/iota.html
*/
template<typename ForwardIterator, typename T>
void sequence(ForwardIterator first,
ForwardIterator last,
T init);
/*! \p sequence fills the range <tt>[first, last)</tt> with a sequence of numbers.
*
* For each iterator \c i in the range <tt>[first, last)</tt>, this version of
* \p sequence performs the assignment <tt>*i = init + step * (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 sequence.
* \param last The end of the sequence.
* \param init The first value of the sequence of numbers
* \param step The difference between consecutive elements.
*
* \tparam DerivedPolicy The name of the derived execution policy.
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">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 T is a model of <a href="http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>,
* and \p T is convertible to \p ForwardIterator's \c value_type.
*
* The following code snippet demonstrates how to use \p sequence to fill a range
* with a sequence of numbers starting from the value 1 with a step size of 3 using the \p thrust::host
* execution policy for parallelization:
*
* \code
* #include <thrust/sequence.h>
* #include <thrust/execution_policy.h>
* ...
* const int N = 10;
* int A[N];
* thrust::sequence(thrust::host, A, A + 10, 1, 3);
* // A is now {1, 4, 7, 10, 13, 16, 19, 22, 25, 28}
* \endcode
*
* \note Unlike the similar C++ STL function \c std::iota, \p sequence offers no
* guarantee on order of execution.
*
* \see http://www.sgi.com/tech/stl/iota.html
*/
template<typename DerivedPolicy, typename ForwardIterator, typename T>
void sequence(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
ForwardIterator first,
ForwardIterator last,
T init,
T step);
/*! \p sequence fills the range <tt>[first, last)</tt> with a sequence of numbers.
*
* For each iterator \c i in the range <tt>[first, last)</tt>, this version of
* \p sequence performs the assignment <tt>*i = init + step * (i - first)</tt>.
*
* \param first The beginning of the sequence.
* \param last The end of the sequence.
* \param init The first value of the sequence of numbers
* \param step The difference between consecutive elements.
*
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">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 T is a model of <a href="http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>,
* and \p T is convertible to \p ForwardIterator's \c value_type.
*
* The following code snippet demonstrates how to use \p sequence to fill a range
* with a sequence of numbers starting from the value 1 with a step size of 3.
*
* \code
* #include <thrust/sequence.h>
* ...
* const int N = 10;
* int A[N];
* thrust::sequence(A, A + 10, 1, 3);
* // A is now {1, 4, 7, 10, 13, 16, 19, 22, 25, 28}
* \endcode
*
* \note Unlike the similar C++ STL function \c std::iota, \p sequence offers no
* guarantee on order of execution.
*
* \see http://www.sgi.com/tech/stl/iota.html
*/
template<typename ForwardIterator, typename T>
void sequence(ForwardIterator first,
ForwardIterator last,
T init,
T step);
/*! \} // end transformations
*/
} // end namespace thrust
#include <thrust/detail/sequence.inl>
|