/usr/include/thrust/uninitialized_copy.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 293 294 295 296 297 298 299 300 | /*
* 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 uninitialized_copy.h
* \brief Copy construction into a range of uninitialized elements from a source range
*/
#pragma once
#include <thrust/detail/config.h>
#include <thrust/detail/execution_policy.h>
namespace thrust
{
/*! \addtogroup copying
* \{
*/
/*! In \c thrust, the function \c thrust::device_new allocates memory for
* an object and then creates an object at that location by calling a constructor.
* Occasionally, however, it is useful to separate those two operations.
* If each iterator in the range <tt>[result, result + (last - first))</tt> points
* to uninitialized memory, then \p uninitialized_copy creates a copy of
* <tt>[first, last)</tt> in that range. That is, for each iterator \c i in
* the input, \p uninitialized_copy creates a copy of \c *i in the location pointed
* to by the corresponding iterator in the output range by \p ForwardIterator's
* \c value_type's copy constructor with *i as its argument.
*
* The algorithm's execution is parallelized as determined by \p exec.
*
* \param exec The execution policy to use for parallelization.
* \param first The first element of the input range to copy from.
* \param last The last element of the input range to copy from.
* \param result The first element of the output range to copy to.
* \return An iterator pointing to the last element of the output range.
*
* \tparam DerivedPolicy The name of the derived execution policy.
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
* \p ForwardIterator is mutable, and \p ForwardIterator's \c value_type has a constructor that takes
* a single argument whose type is \p InputIterator's \c value_type.
*
* \pre \p first may equal \p result, but the range <tt>[first, last)</tt> and the range <tt>[result, result + (last - first))</tt> shall not overlap otherwise.
*
* The following code snippet demonstrates how to use \p uninitialized_copy to initialize
* a range of uninitialized memory using the \p thrust::device execution policy for
* parallelization:
*
* \code
* #include <thrust/uninitialized_copy.h>
* #include <thrust/device_malloc.h>
* #include <thrust/device_vector.h>
* #include <thrust/execution_policy.h>
*
* struct Int
* {
* __host__ __device__
* Int(int x) : val(x) {}
* int val;
* };
* ...
* const int N = 137;
*
* Int val(46);
* thrust::device_vector<Int> input(N, val);
* thrust::device_ptr<Int> array = thrust::device_malloc<Int>(N);
* thrust::uninitialized_copy(thrust::device, input.begin(), input.end(), array);
*
* // Int x = array[i];
* // x.val == 46 for all 0 <= i < N
* \endcode
*
* \see http://www.sgi.com/tech/stl/uninitialized_copy.html
* \see \c copy
* \see \c uninitialized_fill
* \see \c device_new
* \see \c device_malloc
*/
template<typename DerivedPolicy, typename InputIterator, typename ForwardIterator>
ForwardIterator uninitialized_copy(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
InputIterator first,
InputIterator last,
ForwardIterator result);
/*! In \c thrust, the function \c thrust::device_new allocates memory for
* an object and then creates an object at that location by calling a constructor.
* Occasionally, however, it is useful to separate those two operations.
* If each iterator in the range <tt>[result, result + (last - first))</tt> points
* to uninitialized memory, then \p uninitialized_copy creates a copy of
* <tt>[first, last)</tt> in that range. That is, for each iterator \c i in
* the input, \p uninitialized_copy creates a copy of \c *i in the location pointed
* to by the corresponding iterator in the output range by \p ForwardIterator's
* \c value_type's copy constructor with *i as its argument.
*
* \param first The first element of the input range to copy from.
* \param last The last element of the input range to copy from.
* \param result The first element of the output range to copy to.
* \return An iterator pointing to the last element of the output range.
*
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
* \p ForwardIterator is mutable, and \p ForwardIterator's \c value_type has a constructor that takes
* a single argument whose type is \p InputIterator's \c value_type.
*
* \pre \p first may equal \p result, but the range <tt>[first, last)</tt> and the range <tt>[result, result + (last - first))</tt> shall not overlap otherwise.
*
* The following code snippet demonstrates how to use \p uninitialized_copy to initialize
* a range of uninitialized memory.
*
* \code
* #include <thrust/uninitialized_copy.h>
* #include <thrust/device_malloc.h>
* #include <thrust/device_vector.h>
*
* struct Int
* {
* __host__ __device__
* Int(int x) : val(x) {}
* int val;
* };
* ...
* const int N = 137;
*
* Int val(46);
* thrust::device_vector<Int> input(N, val);
* thrust::device_ptr<Int> array = thrust::device_malloc<Int>(N);
* thrust::uninitialized_copy(input.begin(), input.end(), array);
*
* // Int x = array[i];
* // x.val == 46 for all 0 <= i < N
* \endcode
*
* \see http://www.sgi.com/tech/stl/uninitialized_copy.html
* \see \c copy
* \see \c uninitialized_fill
* \see \c device_new
* \see \c device_malloc
*/
template<typename InputIterator, typename ForwardIterator>
ForwardIterator uninitialized_copy(InputIterator first,
InputIterator last,
ForwardIterator result);
/*! In \c thrust, the function \c thrust::device_new allocates memory for
* an object and then creates an object at that location by calling a constructor.
* Occasionally, however, it is useful to separate those two operations.
* If each iterator in the range <tt>[result, result + n)</tt> points
* to uninitialized memory, then \p uninitialized_copy_n creates a copy of
* <tt>[first, first + n)</tt> in that range. That is, for each iterator \c i in
* the input, \p uninitialized_copy_n creates a copy of \c *i in the location pointed
* to by the corresponding iterator in the output range by \p InputIterator's
* \c value_type's copy constructor with *i as its argument.
*
* The algorithm's execution is parallelized as determined by \p exec.
*
* \param exec The execution policy to use for parallelization.
* \param first The first element of the input range to copy from.
* \param n The number of elements to copy.
* \param result The first element of the output range to copy to.
* \return An iterator pointing to the last element of the output range.
*
* \tparam DerivedPolicy The name of the derived execution policy.
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
* \tparam Size is an integral type.
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
* \p ForwardIterator is mutable, and \p ForwardIterator's \c value_type has a constructor that takes
* a single argument whose type is \p InputIterator's \c value_type.
*
* \pre \p first may equal \p result, but the range <tt>[first, first + n)</tt> and the range <tt>[result, result + n)</tt> shall not overlap otherwise.
*
* The following code snippet demonstrates how to use \p uninitialized_copy to initialize
* a range of uninitialized memory using the \p thrust::device execution policy for
* parallelization:
*
* \code
* #include <thrust/uninitialized_copy.h>
* #include <thrust/device_malloc.h>
* #include <thrust/device_vector.h>
* #include <thrust/execution_policy.h>
*
* struct Int
* {
* __host__ __device__
* Int(int x) : val(x) {}
* int val;
* };
* ...
* const int N = 137;
*
* Int val(46);
* thrust::device_vector<Int> input(N, val);
* thrust::device_ptr<Int> array = thrust::device_malloc<Int>(N);
* thrust::uninitialized_copy_n(thrust::device, input.begin(), N, array);
*
* // Int x = array[i];
* // x.val == 46 for all 0 <= i < N
* \endcode
*
* \see http://www.sgi.com/tech/stl/uninitialized_copy.html
* \see \c uninitialized_copy
* \see \c copy
* \see \c uninitialized_fill
* \see \c device_new
* \see \c device_malloc
*/
template<typename DerivedPolicy, typename InputIterator, typename Size, typename ForwardIterator>
ForwardIterator uninitialized_copy_n(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
InputIterator first,
Size n,
ForwardIterator result);
/*! In \c thrust, the function \c thrust::device_new allocates memory for
* an object and then creates an object at that location by calling a constructor.
* Occasionally, however, it is useful to separate those two operations.
* If each iterator in the range <tt>[result, result + n)</tt> points
* to uninitialized memory, then \p uninitialized_copy_n creates a copy of
* <tt>[first, first + n)</tt> in that range. That is, for each iterator \c i in
* the input, \p uninitialized_copy_n creates a copy of \c *i in the location pointed
* to by the corresponding iterator in the output range by \p InputIterator's
* \c value_type's copy constructor with *i as its argument.
*
* \param first The first element of the input range to copy from.
* \param n The number of elements to copy.
* \param result The first element of the output range to copy to.
* \return An iterator pointing to the last element of the output range.
*
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
* \tparam Size is an integral type.
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator</a>,
* \p ForwardIterator is mutable, and \p ForwardIterator's \c value_type has a constructor that takes
* a single argument whose type is \p InputIterator's \c value_type.
*
* \pre \p first may equal \p result, but the range <tt>[first, first + n)</tt> and the range <tt>[result, result + n)</tt> shall not overlap otherwise.
*
* The following code snippet demonstrates how to use \p uninitialized_copy to initialize
* a range of uninitialized memory.
*
* \code
* #include <thrust/uninitialized_copy.h>
* #include <thrust/device_malloc.h>
* #include <thrust/device_vector.h>
*
* struct Int
* {
* __host__ __device__
* Int(int x) : val(x) {}
* int val;
* };
* ...
* const int N = 137;
*
* Int val(46);
* thrust::device_vector<Int> input(N, val);
* thrust::device_ptr<Int> array = thrust::device_malloc<Int>(N);
* thrust::uninitialized_copy_n(input.begin(), N, array);
*
* // Int x = array[i];
* // x.val == 46 for all 0 <= i < N
* \endcode
*
* \see http://www.sgi.com/tech/stl/uninitialized_copy.html
* \see \c uninitialized_copy
* \see \c copy
* \see \c uninitialized_fill
* \see \c device_new
* \see \c device_malloc
*/
template<typename InputIterator, typename Size, typename ForwardIterator>
ForwardIterator uninitialized_copy_n(InputIterator first,
Size n,
ForwardIterator result);
/*! \} // copying
*/
} // end thrust
#include <thrust/detail/uninitialized_copy.inl>
|