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.
284 lines
9.1 KiB
284 lines
9.1 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 pair.h
|
||
|
|
* \brief A type encapsulating a heterogeneous pair of elements
|
||
|
|
*/
|
||
|
|
|
||
|
|
#pragma once
|
||
|
|
|
||
|
|
#include <thrust/detail/config.h>
|
||
|
|
#include <utility>
|
||
|
|
|
||
|
|
namespace thrust
|
||
|
|
{
|
||
|
|
|
||
|
|
/*! \addtogroup utility
|
||
|
|
* \{
|
||
|
|
*/
|
||
|
|
|
||
|
|
/*! \addtogroup pair
|
||
|
|
* \{
|
||
|
|
*/
|
||
|
|
|
||
|
|
/*! \p pair is a generic data structure encapsulating a heterogeneous
|
||
|
|
* pair of values.
|
||
|
|
*
|
||
|
|
* \tparam T1 The type of \p pair's first object type. There are no
|
||
|
|
* requirements on the type of \p T1. <tt>T1</tt>'s type is
|
||
|
|
* provided by <tt>pair::first_type</tt>.
|
||
|
|
*
|
||
|
|
* \tparam T2 The type of \p pair's second object type. There are no
|
||
|
|
* requirements on the type of \p T2. <tt>T2</tt>'s type is
|
||
|
|
* provided by <tt>pair::second_type</tt>.
|
||
|
|
*/
|
||
|
|
template <typename T1, typename T2>
|
||
|
|
struct pair
|
||
|
|
{
|
||
|
|
/*! \p first_type is the type of \p pair's first object type.
|
||
|
|
*/
|
||
|
|
typedef T1 first_type;
|
||
|
|
|
||
|
|
/*! \p second_type is the type of \p pair's second object type.
|
||
|
|
*/
|
||
|
|
typedef T2 second_type;
|
||
|
|
|
||
|
|
/*! The \p pair's first object.
|
||
|
|
*/
|
||
|
|
first_type first;
|
||
|
|
|
||
|
|
/*! The \p pair's second object.
|
||
|
|
*/
|
||
|
|
second_type second;
|
||
|
|
|
||
|
|
/*! \p pair's default constructor constructs \p first
|
||
|
|
* and \p second using \c first_type & \c second_type's
|
||
|
|
* default constructors, respectively.
|
||
|
|
*/
|
||
|
|
__host__ __device__ pair(void);
|
||
|
|
|
||
|
|
/*! This constructor accepts two objects to copy into this \p pair.
|
||
|
|
*
|
||
|
|
* \param x The object to copy into \p first.
|
||
|
|
* \param y The object to copy into \p second.
|
||
|
|
*/
|
||
|
|
inline __host__ __device__
|
||
|
|
pair(const T1 &x, const T2 &y);
|
||
|
|
|
||
|
|
/*! This copy constructor copies from a \p pair whose types are
|
||
|
|
* convertible to this \p pair's \c first_type and \c second_type,
|
||
|
|
* respectively.
|
||
|
|
*
|
||
|
|
* \param p The \p pair to copy from.
|
||
|
|
*
|
||
|
|
* \tparam U1 is convertible to \c first_type.
|
||
|
|
* \tparam U2 is convertible to \c second_type.
|
||
|
|
*/
|
||
|
|
template <typename U1, typename U2>
|
||
|
|
inline __host__ __device__
|
||
|
|
pair(const pair<U1,U2> &p);
|
||
|
|
|
||
|
|
/*! This copy constructor copies from a <tt>std::pair</tt> whose types are
|
||
|
|
* convertible to this \p pair's \c first_type and \c second_type,
|
||
|
|
* respectively.
|
||
|
|
*
|
||
|
|
* \param p The <tt>std::pair</tt> to copy from.
|
||
|
|
*
|
||
|
|
* \tparam U1 is convertible to \c first_type.
|
||
|
|
* \tparam U2 is convertible to \c second_type.
|
||
|
|
*/
|
||
|
|
template <typename U1, typename U2>
|
||
|
|
inline __host__ __device__
|
||
|
|
pair(const std::pair<U1,U2> &p);
|
||
|
|
|
||
|
|
/*! \p swap swaps the elements of two <tt>pair</tt>s.
|
||
|
|
*
|
||
|
|
* \param p The other <tt>pair</tt> with which to swap.
|
||
|
|
*/
|
||
|
|
inline __host__ __device__
|
||
|
|
void swap(pair &p);
|
||
|
|
}; // end pair
|
||
|
|
|
||
|
|
|
||
|
|
/*! This operator tests two \p pairs for equality.
|
||
|
|
*
|
||
|
|
* \param x The first \p pair to compare.
|
||
|
|
* \param y The second \p pair to compare.
|
||
|
|
* \return \c true if and only if <tt>x.first == y.first && x.second == y.second</tt>.
|
||
|
|
*
|
||
|
|
* \tparam T1 is a model of <a href="http://www.sgi.com/tech/stl/EqualityComparable.html">Equality Comparable</a>.
|
||
|
|
* \tparam T2 is a model of <a href="http://www.sgi.com/tech/stl/EqualityComparable.html">Equality Comparable</a>.
|
||
|
|
*/
|
||
|
|
template <typename T1, typename T2>
|
||
|
|
inline __host__ __device__
|
||
|
|
bool operator==(const pair<T1,T2> &x, const pair<T1,T2> &y);
|
||
|
|
|
||
|
|
|
||
|
|
/*! This operator tests two pairs for ascending ordering.
|
||
|
|
*
|
||
|
|
* \param x The first \p pair to compare.
|
||
|
|
* \param y The second \p pair to compare.
|
||
|
|
* \return \c true if and only if <tt>x.first < y.first || (!(y.first < x.first) && x.second < y.second)</tt>.
|
||
|
|
*
|
||
|
|
* \tparam T1 is a model of <a href="http://www.sgi.com/tech/stl/LessThanComparable.html">LessThan Comparable</a>.
|
||
|
|
* \tparam T2 is a model of <a href="http://www.sgi.com/tech/stl/LessThanComparable.html">LessThan Comparable</a>.
|
||
|
|
*/
|
||
|
|
template <typename T1, typename T2>
|
||
|
|
inline __host__ __device__
|
||
|
|
bool operator<(const pair<T1,T2> &x, const pair<T1,T2> &y);
|
||
|
|
|
||
|
|
|
||
|
|
/*! This operator tests two pairs for inequality.
|
||
|
|
*
|
||
|
|
* \param x The first \p pair to compare.
|
||
|
|
* \param y The second \p pair to compare.
|
||
|
|
* \return \c true if and only if <tt>!(x == y)</tt>.
|
||
|
|
*
|
||
|
|
* \tparam T1 is a model of <a href="http://www.sgi.com/tech/stl/EqualityComparable.html">Equality Comparable</a>.
|
||
|
|
* \tparam T2 is a model of <a href="http://www.sgi.com/tech/stl/EqualityComparable.html">Equality Comparable</a>.
|
||
|
|
*/
|
||
|
|
template <typename T1, typename T2>
|
||
|
|
inline __host__ __device__
|
||
|
|
bool operator!=(const pair<T1,T2> &x, const pair<T1,T2> &y);
|
||
|
|
|
||
|
|
|
||
|
|
/*! This operator tests two pairs for descending ordering.
|
||
|
|
*
|
||
|
|
* \param x The first \p pair to compare.
|
||
|
|
* \param y The second \p pair to compare.
|
||
|
|
* \return \c true if and only if <tt>y < x</tt>.
|
||
|
|
*
|
||
|
|
* \tparam T1 is a model of <a href="http://www.sgi.com/tech/stl/LessThanComparable.html">LessThan Comparable</a>.
|
||
|
|
* \tparam T2 is a model of <a href="http://www.sgi.com/tech/stl/LessThanComparable.html">LessThan Comparable</a>.
|
||
|
|
*/
|
||
|
|
template <typename T1, typename T2>
|
||
|
|
inline __host__ __device__
|
||
|
|
bool operator>(const pair<T1,T2> &x, const pair<T1,T2> &y);
|
||
|
|
|
||
|
|
|
||
|
|
/*! This operator tests two pairs for ascending ordering or equivalence.
|
||
|
|
*
|
||
|
|
* \param x The first \p pair to compare.
|
||
|
|
* \param y The second \p pair to compare.
|
||
|
|
* \return \c true if and only if <tt>!(y < x)</tt>.
|
||
|
|
*
|
||
|
|
* \tparam T1 is a model of <a href="http://www.sgi.com/tech/stl/LessThanComparable.html">LessThan Comparable</a>.
|
||
|
|
* \tparam T2 is a model of <a href="http://www.sgi.com/tech/stl/LessThanComparable.html">LessThan Comparable</a>.
|
||
|
|
*/
|
||
|
|
template <typename T1, typename T2>
|
||
|
|
inline __host__ __device__
|
||
|
|
bool operator<=(const pair<T1,T2> &x, const pair<T1,T2> &y);
|
||
|
|
|
||
|
|
|
||
|
|
/*! This operator tests two pairs for descending ordering or equivalence.
|
||
|
|
*
|
||
|
|
* \param x The first \p pair to compare.
|
||
|
|
* \param y The second \p pair to compare.
|
||
|
|
* \return \c true if and only if <tt>!(x < y)</tt>.
|
||
|
|
*
|
||
|
|
* \tparam T1 is a model of <a href="http://www.sgi.com/tech/stl/LessThanComparable.html">LessThan Comparable</a>.
|
||
|
|
* \tparam T2 is a model of <a href="http://www.sgi.com/tech/stl/LessThanComparable.html">LessThan Comparable</a>.
|
||
|
|
*/
|
||
|
|
template <typename T1, typename T2>
|
||
|
|
inline __host__ __device__
|
||
|
|
bool operator>=(const pair<T1,T2> &x, const pair<T1,T2> &y);
|
||
|
|
|
||
|
|
|
||
|
|
/*! \p swap swaps the contents of two <tt>pair</tt>s.
|
||
|
|
*
|
||
|
|
* \param x The first \p pair to swap.
|
||
|
|
* \param y The second \p pair to swap.
|
||
|
|
*/
|
||
|
|
template <typename T1, typename T2>
|
||
|
|
inline __host__ __device__
|
||
|
|
void swap(pair<T1,T2> &x, pair<T1,T2> &y);
|
||
|
|
|
||
|
|
|
||
|
|
/*! This convenience function creates a \p pair from two objects.
|
||
|
|
*
|
||
|
|
* \param x The first object to copy from.
|
||
|
|
* \param y The second object to copy from.
|
||
|
|
* \return A newly-constructed \p pair copied from \p a and \p b.
|
||
|
|
*
|
||
|
|
* \tparam T1 There are no requirements on the type of \p T1.
|
||
|
|
* \tparam T2 There are no requirements on the type of \p T2.
|
||
|
|
*/
|
||
|
|
template <typename T1, typename T2>
|
||
|
|
inline __host__ __device__
|
||
|
|
pair<T1,T2> make_pair(T1 x, T2 y);
|
||
|
|
|
||
|
|
|
||
|
|
/*! This convenience metafunction is included for compatibility with
|
||
|
|
* \p tuple. It returns either the type of a \p pair's
|
||
|
|
* \c first_type or \c second_type in its nested type, \c type.
|
||
|
|
*
|
||
|
|
* \tparam N This parameter selects the member of interest.
|
||
|
|
* \tparam T A \c pair type of interest.
|
||
|
|
*/
|
||
|
|
template<int N, typename T> struct tuple_element;
|
||
|
|
|
||
|
|
|
||
|
|
/*! This convenience metafunction is included for compatibility with
|
||
|
|
* \p tuple. It returns \c 2, the number of elements of a \p pair,
|
||
|
|
* in its nested data member, \c value.
|
||
|
|
*
|
||
|
|
* \tparam Pair A \c pair type of interest.
|
||
|
|
*/
|
||
|
|
template<typename Pair> struct tuple_size;
|
||
|
|
|
||
|
|
|
||
|
|
/*! This convenience function returns a reference to either the first or
|
||
|
|
* second member of a \p pair.
|
||
|
|
*
|
||
|
|
* \param p The \p pair of interest.
|
||
|
|
* \return \c p.first or \c p.second, depending on the template
|
||
|
|
* parameter.
|
||
|
|
*
|
||
|
|
* \tparam N This parameter selects the member of interest.
|
||
|
|
*/
|
||
|
|
// XXX comment out these prototypes as a WAR to a problem on MSVC 2005
|
||
|
|
//template<unsigned int N, typename T1, typename T2>
|
||
|
|
// inline __host__ __device__
|
||
|
|
// typename tuple_element<N, pair<T1,T2> >::type &
|
||
|
|
// get(pair<T1,T2> &p);
|
||
|
|
|
||
|
|
|
||
|
|
/*! This convenience function returns a const reference to either the
|
||
|
|
* first or second member of a \p pair.
|
||
|
|
*
|
||
|
|
* \param p The \p pair of interest.
|
||
|
|
* \return \c p.first or \c p.second, depending on the template
|
||
|
|
* parameter.
|
||
|
|
*
|
||
|
|
* \tparam i This parameter selects the member of interest.
|
||
|
|
*/
|
||
|
|
// XXX comment out these prototypes as a WAR to a problem on MSVC 2005
|
||
|
|
//template<int N, typename T1, typename T2>
|
||
|
|
// inline __host__ __device__
|
||
|
|
// const typename tuple_element<N, pair<T1,T2> >::type &
|
||
|
|
// get(const pair<T1,T2> &p);
|
||
|
|
|
||
|
|
/*! \} // pair
|
||
|
|
*/
|
||
|
|
|
||
|
|
/*! \} // utility
|
||
|
|
*/
|
||
|
|
|
||
|
|
} // end thrust
|
||
|
|
|
||
|
|
#include <thrust/detail/pair.inl>
|
||
|
|
|