/usr/include/boost/compute/algorithm
Edit: /usr/include/boost/compute/algorithm/is_permutation.hpp (2744B)
//---------------------------------------------------------------------------//
// Copyright (c) 2014 Roshan
//
// Distributed under the Boost Software License, Version 1.0
// See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt
//
// See http://boostorg.github.com/compute for more information.
//---------------------------------------------------------------------------//
#ifndef BOOST_COMPUTE_ALGORITHM_IS_PERMUTATION_HPP
#define BOOST_COMPUTE_ALGORITHM_IS_PERMUTATION_HPP
#include
#include
#include
#include
#include
#include
#include
#include
#include
namespace boost {
namespace compute {
///
/// \brief Permutation checking algorithm
///
/// Checks if the range [first1, last1) can be permuted into the
/// range [first2, last2)
/// \return True, if it can be permuted. False, otherwise.
///
/// \param first1 Iterator pointing to start of first range
/// \param last1 Iterator pointing to end of first range
/// \param first2 Iterator pointing to start of second range
/// \param last2 Iterator pointing to end of second range
/// \param queue Queue on which to execute
///
/// Space complexity: \Omega(distance(\p first1, \p last1) + distance(\p first2, \p last2))
template
inline bool is_permutation(InputIterator1 first1,
InputIterator1 last1,
InputIterator2 first2,
InputIterator2 last2,
command_queue &queue = system::default_queue())
{
BOOST_STATIC_ASSERT(is_device_iterator::value);
BOOST_STATIC_ASSERT(is_device_iterator::value);
typedef typename std::iterator_traits::value_type value_type1;
typedef typename std::iterator_traits::value_type value_type2;
size_t count1 = detail::iterator_range_size(first1, last1);
size_t count2 = detail::iterator_range_size(first2, last2);
if(count1 != count2) return false;
vector temp1(first1, last1, queue);
vector temp2(first2, last2, queue);
sort(temp1.begin(), temp1.end(), queue);
sort(temp2.begin(), temp2.end(), queue);
return equal(temp1.begin(), temp1.end(),
temp2.begin(), queue);
}
} // end compute namespace
} // end boost namespace
#endif // BOOST_COMPUTE_ALGORITHM_IS_PERMUTATION_HPP