/usr/include/boost/compute/algorithm
Edit: /usr/include/boost/compute/algorithm/sort.hpp (6569B)
//---------------------------------------------------------------------------//
// Copyright (c) 2013 Kyle Lutz
//
// 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_SORT_HPP
#define BOOST_COMPUTE_ALGORITHM_SORT_HPP
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
namespace boost {
namespace compute {
namespace detail {
template
inline void dispatch_gpu_sort(buffer_iterator first,
buffer_iterator last,
less,
command_queue &queue,
typename boost::enable_if_c<
is_radix_sortable::value
>::type* = 0)
{
size_t count = detail::iterator_range_size(first, last);
if(count < 2){
// nothing to do
return;
}
else if(count <= 32){
::boost::compute::detail::serial_insertion_sort(first, last, queue);
}
else {
::boost::compute::detail::radix_sort(first, last, queue);
}
}
template
inline void dispatch_gpu_sort(buffer_iterator first,
buffer_iterator last,
greater compare,
command_queue &queue,
typename boost::enable_if_c<
is_radix_sortable::value
>::type* = 0)
{
size_t count = detail::iterator_range_size(first, last);
if(count < 2){
// nothing to do
return;
}
else if(count <= 32){
::boost::compute::detail::serial_insertion_sort(
first, last, compare, queue
);
}
else {
// radix sorts in descending order
::boost::compute::detail::radix_sort(first, last, false, queue);
}
}
template
inline void dispatch_gpu_sort(Iterator first,
Iterator last,
Compare compare,
command_queue &queue)
{
size_t count = detail::iterator_range_size(first, last);
if(count < 2){
// nothing to do
return;
}
else if(count <= 32){
::boost::compute::detail::serial_insertion_sort(
first, last, compare, queue
);
}
else {
::boost::compute::detail::merge_sort_on_gpu(
first, last, compare, queue
);
}
}
// sort() for device iterators
template
inline void dispatch_sort(Iterator first,
Iterator last,
Compare compare,
command_queue &queue,
typename boost::enable_if<
is_device_iterator
>::type* = 0)
{
if(queue.get_device().type() & device::gpu) {
dispatch_gpu_sort(first, last, compare, queue);
return;
}
::boost::compute::detail::merge_sort_on_cpu(first, last, compare, queue);
}
// sort() for host iterators
template
inline void dispatch_sort(Iterator first,
Iterator last,
Compare compare,
command_queue &queue,
typename boost::disable_if<
is_device_iterator
>::type* = 0)
{
typedef typename std::iterator_traits::value_type T;
size_t size = static_cast(std::distance(first, last));
// create mapped buffer
mapped_view view(
boost::addressof(*first), size, queue.get_context()
);
// sort mapped buffer
dispatch_sort(view.begin(), view.end(), compare, queue);
// return results to host
view.map(queue);
}
} // end detail namespace
/// Sorts the values in the range [\p first, \p last) according to
/// \p compare.
///
/// \param first first element in the range to sort
/// \param last last element in the range to sort
/// \param compare comparison function (by default \c less)
/// \param queue command queue to perform the operation
///
/// For example, to sort a vector on the device:
/// \code
/// // create vector on the device with data
/// float data[] = { 2.f, 4.f, 1.f, 3.f };
/// boost::compute::vector vec(data, data + 4, queue);
///
/// // sort the vector on the device
/// boost::compute::sort(vec.begin(), vec.end(), queue);
/// \endcode
///
/// The sort() algorithm can also be directly used with host iterators. This
/// example will automatically transfer the data to the device, sort it, and
/// then transfer the data back to the host:
/// \code
/// std::vector data = { 9, 3, 2, 5, 1, 4, 6, 7 };
///
/// boost::compute::sort(data.begin(), data.end(), queue);
/// \endcode
///
/// Space complexity: \Omega(n)
///
/// \see is_sorted()
template
inline void sort(Iterator first,
Iterator last,
Compare compare,
command_queue &queue = system::default_queue())
{
::boost::compute::detail::dispatch_sort(first, last, compare, queue);
}
/// \overload
template
inline void sort(Iterator first,
Iterator last,
command_queue &queue = system::default_queue())
{
typedef typename std::iterator_traits::value_type value_type;
::boost::compute::sort(
first, last, ::boost::compute::less(), queue
);
}
} // end compute namespace
} // end boost namespace
#endif // BOOST_COMPUTE_ALGORITHM_SORT_HPP