mirror of https://github.com/GOSTSec/ccminer
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
77 lines
2.3 KiB
77 lines
2.3 KiB
11 years ago
|
/*
|
||
|
|
* 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 distance.h
|
||
|
|
* \brief Computes the size of a range
|
||
|
|
*/
|
||
|
|
|
||
|
|
#pragma once
|
||
|
|
|
||
|
|
#include <thrust/detail/config.h>
|
||
|
|
#include <thrust/iterator/iterator_traits.h>
|
||
|
|
|
||
|
|
namespace thrust
|
||
|
|
{
|
||
|
|
|
||
|
|
|
||
|
|
/*! \addtogroup iterators
|
||
|
|
* \{
|
||
|
|
*/
|
||
|
|
|
||
|
|
/*! \p distance finds the distance between \p first and \p last, i.e. the
|
||
|
|
* number of times that \p first must be incremented until it is equal to
|
||
|
|
* \p last.
|
||
|
|
*
|
||
|
|
* \param first The beginning of an input range of interest.
|
||
|
|
* \param last The end of an input range of interest.
|
||
|
|
* \return The distance between the beginning and end of the input range.
|
||
|
|
*
|
||
|
|
* \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
|
||
|
|
*
|
||
|
|
* \pre If \c InputIterator meets the requirements of random access iterator, \p last shall be reachable from \p first or
|
||
|
|
* \p first shall be reachable from \p last; otherwise, \p last shall be reachable from \p first.
|
||
|
|
*
|
||
|
|
* The following code snippet demonstrates how to use \p distance to compute
|
||
|
|
* the distance to one iterator from another.
|
||
|
|
*
|
||
|
|
* \code
|
||
|
|
* #include <thrust/distance.h>
|
||
|
|
* #include <thrust/device_vector.h>
|
||
|
|
* ...
|
||
|
|
* thrust::device_vector<int> vec(13);
|
||
|
|
* thrust::device_vector<int>::iterator iter1 = vec.begin();
|
||
|
|
* thrust::device_vector<int>::iterator iter2 = iter1 + 7;
|
||
|
|
*
|
||
|
|
* int d = thrust::distance(iter1, iter2);
|
||
|
|
*
|
||
|
|
* // d is 7
|
||
|
|
* \endcode
|
||
|
|
*
|
||
|
|
* \see http://www.sgi.com/tech/stl/distance.html
|
||
|
|
*/
|
||
|
|
template<typename InputIterator>
|
||
|
|
inline typename thrust::iterator_traits<InputIterator>::difference_type
|
||
|
|
distance(InputIterator first, InputIterator last);
|
||
|
|
|
||
|
|
/*! \} // end iterators
|
||
|
|
*/
|
||
|
|
|
||
|
|
} // end thrust
|
||
|
|
|
||
|
|
#include <thrust/detail/distance.inl>
|
||
|
|
|