/usr/include/thrust/mismatch.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 | /*
* 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 mismatch.h
* \brief Search for differences between ranges
*/
#pragma once
#include <thrust/detail/config.h>
#include <thrust/detail/execution_policy.h>
#include <thrust/pair.h>
namespace thrust
{
/*! \addtogroup algorithms
*/
/*! \addtogroup searching
* \ingroup algorithms
* \{
*/
/*! \p mismatch finds the first position where the two ranges <tt>[first1, last1)</tt>
* and <tt>[first2, first2 + (last1 - first1))</tt> differ. The two versions of
* \p mismatch use different tests for whether elements differ.
*
* This version of \p mismatch finds the first iterator \c i in <tt>[first1, last1)</tt>
* such that <tt>*i == *(first2 + (i - first1))</tt> is \c false. The return value is a
* \c pair whose first element is \c i and whose second element is <tt>*(first2 + (i - first1))</tt>.
* If no such iterator \c i exists, the return value is a \c pair whose first element
* is \c last1 and whose second element is <tt>*(first2 + (last1 - first1))</tt>.
*
* The algorithm's execution is parallelized as determined by \p exec.
*
* \param exec The execution policy to use for parallelization.
* \param first1 The beginning of the first sequence.
* \param last1 The end of the first sequence.
* \param first2 The beginning of the second sequence.
* \return The first position where the sequences differ.
*
* \tparam DerivedPolicy The name of the derived execution policy.
* \tparam InputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>
* and \p InputIterator1's \c value_type is equality comparable to \p InputIterator2's \c value_type.
* \tparam InputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
*
* \code
* #include <thrust/mismatch.h>
* #include <thrust/device_vector.h>
* #include <thrust/execution_policy.h>
* ...
* thrust::device_vector<int> vec1(4);
* thrust::device_vector<int> vec2(4);
*
* vec1[0] = 0; vec2[0] = 0;
* vec1[1] = 5; vec2[1] = 5;
* vec1[2] = 3; vec2[2] = 8;
* vec1[3] = 7; vec2[3] = 7;
*
* typedef thrust::device_vector<int>::iterator Iterator;
* thrust::pair<Iterator,Iterator> result;
*
* result = thrust::mismatch(thrust::device, vec1.begin(), vec1.end(), vec2.begin());
*
* // result.first is vec1.begin() + 2
* // result.second is vec2.begin() + 2
* \endcode
*
* \see find
* \see find_if
*/
template<typename DerivedPolicy, typename InputIterator1, typename InputIterator2>
thrust::pair<InputIterator1, InputIterator2> mismatch(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
InputIterator1 first1,
InputIterator1 last1,
InputIterator2 first2);
/*! \p mismatch finds the first position where the two ranges <tt>[first1, last1)</tt>
* and <tt>[first2, first2 + (last1 - first1))</tt> differ. The two versions of
* \p mismatch use different tests for whether elements differ.
*
* This version of \p mismatch finds the first iterator \c i in <tt>[first1, last1)</tt>
* such that <tt>*i == *(first2 + (i - first1))</tt> is \c false. The return value is a
* \c pair whose first element is \c i and whose second element is <tt>*(first2 + (i - first1))</tt>.
* If no such iterator \c i exists, the return value is a \c pair whose first element
* is \c last1 and whose second element is <tt>*(first2 + (last1 - first1))</tt>.
*
* \param first1 The beginning of the first sequence.
* \param last1 The end of the first sequence.
* \param first2 The beginning of the second sequence.
* \return The first position where the sequences differ.
*
* \tparam InputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>
* and \p InputIterator1's \c value_type is equality comparable to \p InputIterator2's \c value_type.
* \tparam InputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
*
* \code
* #include <thrust/mismatch.h>
* #include <thrust/device_vector.h>
* ...
* thrust::device_vector<int> vec1(4);
* thrust::device_vector<int> vec2(4);
*
* vec1[0] = 0; vec2[0] = 0;
* vec1[1] = 5; vec2[1] = 5;
* vec1[2] = 3; vec2[2] = 8;
* vec1[3] = 7; vec2[3] = 7;
*
* typedef thrust::device_vector<int>::iterator Iterator;
* thrust::pair<Iterator,Iterator> result;
*
* result = thrust::mismatch(vec1.begin(), vec1.end(), vec2.begin());
*
* // result.first is vec1.begin() + 2
* // result.second is vec2.begin() + 2
* \endcode
*
* \see find
* \see find_if
*/
template <typename InputIterator1, typename InputIterator2>
thrust::pair<InputIterator1, InputIterator2> mismatch(InputIterator1 first1,
InputIterator1 last1,
InputIterator2 first2);
/*! \p mismatch finds the first position where the two ranges <tt>[first1, last1)</tt>
* and <tt>[first2, first2 + (last1 - first1))</tt> differ. The two versions of
* \p mismatch use different tests for whether elements differ.
*
* This version of \p mismatch finds the first iterator \c i in <tt>[first1, last1)</tt>
* such that <tt>pred(\*i, \*(first2 + (i - first1))</tt> is \c false. The return value is a
* \c pair whose first element is \c i and whose second element is <tt>*(first2 + (i - first1))</tt>.
* If no such iterator \c i exists, the return value is a \c pair whose first element is
* \c last1 and whose second element is <tt>*(first2 + (last1 - first1))</tt>.
*
* The algorithm's execution is parallelized as determined by \p exec.
*
* \param exec The execution policy to use for parallelization.
* \param first1 The beginning of the first sequence.
* \param last1 The end of the first sequence.
* \param first2 The beginning of the second sequence.
* \param pred The binary predicate to compare elements.
* \return The first position where the sequences differ.
*
* \tparam DerivedPolicy The name of the derived execution policy.
* \tparam InputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
* \tparam InputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
* \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">Input Iterator</a>.
*
* \code
* #include <thrust/mismatch.h>
* #include <thrust/device_vector.h>
* #include <thrust/execution_policy.h>
* ...
* thrust::device_vector<int> vec1(4);
* thrust::device_vector<int> vec2(4);
*
* vec1[0] = 0; vec2[0] = 0;
* vec1[1] = 5; vec2[1] = 5;
* vec1[2] = 3; vec2[2] = 8;
* vec1[3] = 7; vec2[3] = 7;
*
* typedef thrust::device_vector<int>::iterator Iterator;
* thrust::pair<Iterator,Iterator> result;
*
* result = thrust::mismatch(thrust::device, vec1.begin(), vec1.end(), vec2.begin(), thrust::equal_to<int>());
*
* // result.first is vec1.begin() + 2
* // result.second is vec2.begin() + 2
* \endcode
*
* \see find
* \see find_if
*/
template<typename DerivedPolicy, typename InputIterator1, typename InputIterator2, typename BinaryPredicate>
thrust::pair<InputIterator1, InputIterator2> mismatch(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
InputIterator1 first1,
InputIterator1 last1,
InputIterator2 first2,
BinaryPredicate pred);
/*! \p mismatch finds the first position where the two ranges <tt>[first1, last1)</tt>
* and <tt>[first2, first2 + (last1 - first1))</tt> differ. The two versions of
* \p mismatch use different tests for whether elements differ.
*
* This version of \p mismatch finds the first iterator \c i in <tt>[first1, last1)</tt>
* such that <tt>pred(\*i, \*(first2 + (i - first1))</tt> is \c false. The return value is a
* \c pair whose first element is \c i and whose second element is <tt>*(first2 + (i - first1))</tt>.
* If no such iterator \c i exists, the return value is a \c pair whose first element is
* \c last1 and whose second element is <tt>*(first2 + (last1 - first1))</tt>.
*
* \param first1 The beginning of the first sequence.
* \param last1 The end of the first sequence.
* \param first2 The beginning of the second sequence.
* \param pred The binary predicate to compare elements.
* \return The first position where the sequences differ.
*
* \tparam InputIterator1 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
* \tparam InputIterator2 is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
* \tparam Predicate is a model of <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">Input Iterator</a>.
*
* \code
* #include <thrust/mismatch.h>
* #include <thrust/device_vector.h>
* ...
* thrust::device_vector<int> vec1(4);
* thrust::device_vector<int> vec2(4);
*
* vec1[0] = 0; vec2[0] = 0;
* vec1[1] = 5; vec2[1] = 5;
* vec1[2] = 3; vec2[2] = 8;
* vec1[3] = 7; vec2[3] = 7;
*
* typedef thrust::device_vector<int>::iterator Iterator;
* thrust::pair<Iterator,Iterator> result;
*
* result = thrust::mismatch(vec1.begin(), vec1.end(), vec2.begin(), thrust::equal_to<int>());
*
* // result.first is vec1.begin() + 2
* // result.second is vec2.begin() + 2
* \endcode
*
* \see find
* \see find_if
*/
template <typename InputIterator1, typename InputIterator2, typename BinaryPredicate>
thrust::pair<InputIterator1, InputIterator2> mismatch(InputIterator1 first1,
InputIterator1 last1,
InputIterator2 first2,
BinaryPredicate pred);
/*! \} // end searching
*/
} // end namespace thrust
#include <thrust/detail/mismatch.inl>
|