/usr/include/thrust/adjacent_difference.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 | /*
* 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 adjacent_difference.h
* \brief Compute difference between consecutive elements of a range
*/
#pragma once
#include <thrust/detail/config.h>
#include <thrust/detail/execution_policy.h>
namespace thrust
{
/*! \addtogroup transformations Transformations
* \{
*/
/*! \p adjacent_difference calculates the differences of adjacent elements in the
* range <tt>[first, last)</tt>. That is, <tt>\*first</tt> is assigned to
* <tt>\*result</tt>, and, for each iterator \p i in the range
* <tt>[first + 1, last)</tt>, the difference of <tt>\*i</tt> and <tt>*(i - 1)</tt>
* is assigned to <tt>\*(result + (i - first))</tt>.
*
* This version of \p adjacent_difference uses <tt>operator-</tt> to calculate
* differences.
*
* 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 input range.
* \param last The end of the input range.
* \param result The beginning of the output range.
* \return The iterator <tt>result + (last - first)</tt>
*
* \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>,
* and \c x and \c y are objects of \p InputIterator's \c value_type, then \c x - \c is defined,
* and \p InputIterator's \c value_type is convertible to a type in \p OutputIterator's set of \c value_types,
* and the return type of <tt>x - y</tt> is convertible to a type in \p OutputIterator's set of \c value_types.
* \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
*
* \remark Note that \p result is permitted to be the same iterator as \p first. This is
* useful for computing differences "in place".
*
* The following code snippet demonstrates how to use \p adjacent_difference to compute
* the difference between adjacent elements of a range using the \p thrust::device execution policy:
*
* \code
* #include <thrust/adjacent_difference.h>
* #include <thrust/device_vector.h>
* #include <thrust/execution_policy.h>
* ...
* int h_data[8] = {1, 2, 1, 2, 1, 2, 1, 2};
* thrust::device_vector<int> d_data(h_data, h_data + 8);
* thrust::device_vector<int> d_result(8);
*
* thrust::adjacent_difference(thrust::device, d_data.begin(), d_data.end(), d_result.begin());
*
* // d_result is now [1, 1, -1, 1, -1, 1, -1, 1]
* \endcode
*
* \see http://www.sgi.com/tech/stl/adjacent_difference.html
* \see inclusive_scan
*/
template<typename DerivedPolicy, typename InputIterator, typename OutputIterator>
OutputIterator adjacent_difference(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
InputIterator first, InputIterator last,
OutputIterator result);
/*! \p adjacent_difference calculates the differences of adjacent elements in the
* range <tt>[first, last)</tt>. That is, <tt>*first</tt> is assigned to
* <tt>\*result</tt>, and, for each iterator \p i in the range
* <tt>[first + 1, last)</tt>, <tt>binary_op(\*i, \*(i - 1))</tt> is assigned to
* <tt>\*(result + (i - first))</tt>.
*
* This version of \p adjacent_difference uses the binary function \p binary_op to
* calculate differences.
*
* 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 input range.
* \param last The end of the input range.
* \param result The beginning of the output range.
* \param binary_op The binary function used to compute differences.
* \return The iterator <tt>result + (last - first)</tt>
*
* \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>,
* and \p InputIterator's \c value_type is convertible to \p BinaryFunction's \c first_argument_type and \c second_argument_type,
* and \p InputIterator's \c value_type is convertible to a type in \p OutputIterator's set of \c value_types.
* \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
* \tparam BinaryFunction's \c result_type is convertible to a type in \p OutputIterator's set of \c value_types.
*
* \remark Note that \p result is permitted to be the same iterator as \p first. This is
* useful for computing differences "in place".
*
* The following code snippet demonstrates how to use \p adjacent_difference to compute
* the sum between adjacent elements of a range using the \p thrust::device execution policy:
*
* \code
* #include <thrust/adjacent_difference.h>
* #include <thrust/functional.h>
* #include <thrust/device_vector.h>
* #include <thrust/execution_policy.h>
* ...
* int h_data[8] = {1, 2, 1, 2, 1, 2, 1, 2};
* thrust::device_vector<int> d_data(h_data, h_data + 8);
* thrust::device_vector<int> d_result(8);
*
* thrust::adjacent_difference(thrust::device, d_data.begin(), d_data.end(), d_result.begin(), thrust::plus<int>());
*
* // d_data is now [1, 3, 3, 3, 3, 3, 3, 3]
* \endcode
*
* \see http://www.sgi.com/tech/stl/adjacent_difference.html
* \see inclusive_scan
*/
template<typename DerivedPolicy, typename InputIterator, typename OutputIterator, typename BinaryFunction>
OutputIterator adjacent_difference(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
InputIterator first, InputIterator last,
OutputIterator result,
BinaryFunction binary_op);
/*! \p adjacent_difference calculates the differences of adjacent elements in the
* range <tt>[first, last)</tt>. That is, <tt>\*first</tt> is assigned to
* <tt>\*result</tt>, and, for each iterator \p i in the range
* <tt>[first + 1, last)</tt>, the difference of <tt>\*i</tt> and <tt>*(i - 1)</tt>
* is assigned to <tt>\*(result + (i - first))</tt>.
*
* This version of \p adjacent_difference uses <tt>operator-</tt> to calculate
* differences.
*
* \param first The beginning of the input range.
* \param last The end of the input range.
* \param result The beginning of the output range.
* \return The iterator <tt>result + (last - first)</tt>
*
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
* and \c x and \c y are objects of \p InputIterator's \c value_type, then \c x - \c is defined,
* and \p InputIterator's \c value_type is convertible to a type in \p OutputIterator's set of \c value_types,
* and the return type of <tt>x - y</tt> is convertible to a type in \p OutputIterator's set of \c value_types.
* \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
*
* \remark Note that \p result is permitted to be the same iterator as \p first. This is
* useful for computing differences "in place".
*
* The following code snippet demonstrates how to use \p adjacent_difference to compute
* the difference between adjacent elements of a range.
*
* \code
* #include <thrust/adjacent_difference.h>
* #include <thrust/device_vector.h>
* ...
* int h_data[8] = {1, 2, 1, 2, 1, 2, 1, 2};
* thrust::device_vector<int> d_data(h_data, h_data + 8);
* thrust::device_vector<int> d_result(8);
*
* thrust::adjacent_difference(d_data.begin(), d_data.end(), d_result.begin());
*
* // d_result is now [1, 1, -1, 1, -1, 1, -1, 1]
* \endcode
*
* \see http://www.sgi.com/tech/stl/adjacent_difference.html
* \see inclusive_scan
*/
template <typename InputIterator, typename OutputIterator>
OutputIterator adjacent_difference(InputIterator first, InputIterator last,
OutputIterator result);
/*! \p adjacent_difference calculates the differences of adjacent elements in the
* range <tt>[first, last)</tt>. That is, <tt>*first</tt> is assigned to
* <tt>\*result</tt>, and, for each iterator \p i in the range
* <tt>[first + 1, last)</tt>, <tt>binary_op(\*i, \*(i - 1))</tt> is assigned to
* <tt>\*(result + (i - first))</tt>.
*
* This version of \p adjacent_difference uses the binary function \p binary_op to
* calculate differences.
*
* \param first The beginning of the input range.
* \param last The end of the input range.
* \param result The beginning of the output range.
* \param binary_op The binary function used to compute differences.
* \return The iterator <tt>result + (last - first)</tt>
*
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
* and \p InputIterator's \c value_type is convertible to \p BinaryFunction's \c first_argument_type and \c second_argument_type,
* and \p InputIterator's \c value_type is convertible to a type in \p OutputIterator's set of \c value_types.
* \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
* \tparam BinaryFunction's \c result_type is convertible to a type in \p OutputIterator's set of \c value_types.
*
* \remark Note that \p result is permitted to be the same iterator as \p first. This is
* useful for computing differences "in place".
*
* The following code snippet demonstrates how to use \p adjacent_difference to compute
* the sum between adjacent elements of a range.
*
* \code
* #include <thrust/adjacent_difference.h>
* #include <thrust/functional.h>
* #include <thrust/device_vector.h>
* ...
* int h_data[8] = {1, 2, 1, 2, 1, 2, 1, 2};
* thrust::device_vector<int> d_data(h_data, h_data + 8);
* thrust::device_vector<int> d_result(8);
*
* thrust::adjacent_difference(d_data.begin(), d_data.end(), d_result.begin(), thrust::plus<int>());
*
* // d_data is now [1, 3, 3, 3, 3, 3, 3, 3]
* \endcode
*
* \see http://www.sgi.com/tech/stl/adjacent_difference.html
* \see inclusive_scan
*/
template <typename InputIterator, typename OutputIterator, typename BinaryFunction>
OutputIterator adjacent_difference(InputIterator first, InputIterator last,
OutputIterator result,
BinaryFunction binary_op);
/*! \}
*/
} // end namespace thrust
#include <thrust/detail/adjacent_difference.inl>
|