FM / algorithm

/usr/include/boost/compute/algorithm

Name	Size	Mode	Actions
detail/	-	0755	rm
accumulate.hpp	6375	0644	edit dl rm
adjacent_difference.hpp	4416	0644	edit dl rm
adjacent_find.hpp	5313	0644	edit dl rm
all_of.hpp	1427	0644	edit dl rm
any_of.hpp	1544	0644	edit dl rm
binary_search.hpp	1480	0644	edit dl rm
copy.hpp	31483	0644	edit dl rm
copy_if.hpp	2574	0644	edit dl rm
copy_n.hpp	1940	0644	edit dl rm
count.hpp	2103	0644	edit dl rm
count_if.hpp	2388	0644	edit dl rm
equal.hpp	2209	0644	edit dl rm
equal_range.hpp	1636	0644	edit dl rm
exclusive_scan.hpp	4042	0644	edit dl rm
fill.hpp	10030	0644	edit dl rm
fill_n.hpp	1367	0644	edit dl rm
find.hpp	2004	0644	edit dl rm
find_end.hpp	4772	0644	edit dl rm
find_if.hpp	1504	0644	edit dl rm
find_if_not.hpp	1652	0644	edit dl rm
for_each.hpp	2131	0644	edit dl rm
for_each_n.hpp	1423	0644	edit dl rm
gather.hpp	2796	0644	edit dl rm
generate.hpp	1903	0644	edit dl rm
generate_n.hpp	1277	0644	edit dl rm
includes.hpp	5615	0644	edit dl rm
inclusive_scan.hpp	3402	0644	edit dl rm
inner_product.hpp	3849	0644	edit dl rm
inplace_merge.hpp	2047	0644	edit dl rm
iota.hpp	1735	0644	edit dl rm
is_partitioned.hpp	1785	0644	edit dl rm
is_permutation.hpp	2744	0644	edit dl rm
is_sorted.hpp	2436	0644	edit dl rm
lexicographical_compare.hpp	4950	0644	edit dl rm
lower_bound.hpp	1573	0644	edit dl rm
max_element.hpp	2781	0644	edit dl rm
merge.hpp	5037	0644	edit dl rm
minmax_element.hpp	2668	0644	edit dl rm
min_element.hpp	2780	0644	edit dl rm
mismatch.hpp	3409	0644	edit dl rm
next_permutation.hpp	5703	0644	edit dl rm
none_of.hpp	1426	0644	edit dl rm
nth_element.hpp	2868	0644	edit dl rm
partial_sum.hpp	1676	0644	edit dl rm
partition.hpp	1523	0644	edit dl rm
partition_copy.hpp	2592	0644	edit dl rm
partition_point.hpp	1858	0644	edit dl rm
prev_permutation.hpp	5695	0644	edit dl rm
random_shuffle.hpp	3010	0644	edit dl rm
reduce.hpp	11454	0644	edit dl rm
reduce_by_key.hpp	5933	0644	edit dl rm
remove.hpp	2002	0644	edit dl rm
remove_if.hpp	1850	0644	edit dl rm
replace.hpp	2588	0644	edit dl rm
replace_copy.hpp	2230	0644	edit dl rm
reverse.hpp	2438	0644	edit dl rm
reverse_copy.hpp	2678	0644	edit dl rm
rotate.hpp	1813	0644	edit dl rm
rotate_copy.hpp	1529	0644	edit dl rm
scatter.hpp	3435	0644	edit dl rm
scatter_if.hpp	4730	0644	edit dl rm
search.hpp	2967	0644	edit dl rm
search_n.hpp	4428	0644	edit dl rm
set_difference.hpp	6941	0644	edit dl rm
set_intersection.hpp	6646	0644	edit dl rm
set_symmetric_difference.hpp	7533	0644	edit dl rm
set_union.hpp	7384	0644	edit dl rm
sort.hpp	6569	0644	edit dl rm
sort_by_key.hpp	6156	0644	edit dl rm
stable_partition.hpp	2737	0644	edit dl rm
stable_sort.hpp	3809	0644	edit dl rm
stable_sort_by_key.hpp	6071	0644	edit dl rm
swap_ranges.hpp	1870	0644	edit dl rm
transform.hpp	3252	0644	edit dl rm
transform_if.hpp	4737	0644	edit dl rm
transform_reduce.hpp	3683	0644	edit dl rm
unique.hpp	2565	0644	edit dl rm
unique_copy.hpp	6429	0644	edit dl rm
upper_bound.hpp	1561	0644	edit dl rm

Edit: /usr/include/boost/compute/algorithm/sort.hpp (6569B)

//---------------------------------------------------------------------------//
// Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
//
// 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 <iterator>

#include <boost/utility/enable_if.hpp>

#include <boost/compute/system.hpp>
#include <boost/compute/command_queue.hpp>
#include <boost/compute/algorithm/detail/merge_sort_on_cpu.hpp>
#include <boost/compute/algorithm/detail/merge_sort_on_gpu.hpp>
#include <boost/compute/algorithm/detail/radix_sort.hpp>
#include <boost/compute/algorithm/detail/insertion_sort.hpp>
#include <boost/compute/algorithm/reverse.hpp>
#include <boost/compute/container/mapped_view.hpp>
#include <boost/compute/detail/iterator_range_size.hpp>
#include <boost/compute/iterator/buffer_iterator.hpp>
#include <boost/compute/type_traits/is_device_iterator.hpp>

namespace boost {
namespace compute {
namespace detail {

template<class T>
inline void dispatch_gpu_sort(buffer_iterator<T> first,
                              buffer_iterator<T> last,
                              less<T>,
                              command_queue &queue,
                              typename boost::enable_if_c<
                                  is_radix_sortable<T>::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<class T>
inline void dispatch_gpu_sort(buffer_iterator<T> first,
                              buffer_iterator<T> last,
                              greater<T> compare,
                              command_queue &queue,
                              typename boost::enable_if_c<
                                  is_radix_sortable<T>::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<class Iterator, class Compare>
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<class Iterator, class Compare>
inline void dispatch_sort(Iterator first,
                          Iterator last,
                          Compare compare,
                          command_queue &queue,
                          typename boost::enable_if<
                              is_device_iterator<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<class Iterator, class Compare>
inline void dispatch_sort(Iterator first,
                          Iterator last,
                          Compare compare,
                          command_queue &queue,
                          typename boost::disable_if<
                              is_device_iterator<Iterator>
                          >::type* = 0)
{
    typedef typename std::iterator_traits<Iterator>::value_type T;

size_t size = static_cast<size_t>(std::distance(first, last));

// create mapped buffer
    mapped_view<T> 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<float> 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<int> 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<class Iterator, class Compare>
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<class Iterator>
inline void sort(Iterator first,
                 Iterator last,
                 command_queue &queue = system::default_queue())
{
    typedef typename std::iterator_traits<Iterator>::value_type value_type;

::boost::compute::sort(
        first, last, ::boost::compute::less<value_type>(), queue
    );
}

} // end compute namespace
} // end boost namespace

#endif // BOOST_COMPUTE_ALGORITHM_SORT_HPP

cmd: