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/reverse_copy.hpp (2678B)

//---------------------------------------------------------------------------//
// 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_REVERSE_COPY_HPP
#define BOOST_COMPUTE_ALGORITHM_REVERSE_COPY_HPP

#include <iterator>

#include <boost/static_assert.hpp>

#include <boost/compute/system.hpp>
#include <boost/compute/command_queue.hpp>
#include <boost/compute/algorithm/copy.hpp>
#include <boost/compute/algorithm/reverse.hpp>
#include <boost/compute/type_traits/is_device_iterator.hpp>

namespace boost {
namespace compute {
namespace detail {

template<class Iterator, class OutputIterator>
struct reverse_copy_kernel : public meta_kernel
{
    reverse_copy_kernel(Iterator first, Iterator last, OutputIterator result)
        : meta_kernel("reverse_copy")
    {
        // store size of the range
        m_size = detail::iterator_range_size(first, last);
        add_set_arg<const cl_uint>("size", static_cast<const cl_uint>(m_size));

*this <<
            decl<cl_uint>("i") << " = get_global_id(0);\n" <<
            decl<cl_uint>("j") << " = size - get_global_id(0) - 1;\n" <<
            result[var<cl_uint>("j")] << "=" << first[var<cl_uint>("i")] << ";\n";
    }

void exec(command_queue &queue)
    {
        exec_1d(queue, 0, m_size);
    }

size_t m_size;
};

} // end detail namespace

/// Copies the elements in the range [\p first, \p last) in reversed
/// order to the range beginning at \p result.
///
/// Space complexity: \Omega(1)
///
/// \see reverse()
template<class InputIterator, class OutputIterator>
inline OutputIterator
reverse_copy(InputIterator first,
             InputIterator last,
             OutputIterator result,
             command_queue &queue = system::default_queue())
{
    BOOST_STATIC_ASSERT(is_device_iterator<InputIterator>::value);
    BOOST_STATIC_ASSERT(is_device_iterator<OutputIterator>::value);

typedef typename std::iterator_traits<OutputIterator>::difference_type difference_type;

difference_type count = std::distance(first, last);

detail::reverse_copy_kernel<InputIterator, OutputIterator>
        kernel(first, last, result);

// run kernel
    kernel.exec(queue);

// return iterator to the end of result
    return result + count;
}

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

#endif // BOOST_COMPUTE_ALGORITHM_REVERSE_COPY_HPP

//---------------------------------------------------------------------------// // 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_REVERSE_COPY_HPP #define BOOST_COMPUTE_ALGORITHM_REVERSE_COPY_HPP #include #include #include #include #include #include #include namespace boost { namespace compute { namespace detail { template struct reverse_copy_kernel : public meta_kernel { reverse_copy_kernel(Iterator first, Iterator last, OutputIterator result) : meta_kernel("reverse_copy") { // store size of the range m_size = detail::iterator_range_size(first, last); add_set_arg("size", static_cast(m_size)); *this << decl("i") << " = get_global_id(0);\n" << decl("j") << " = size - get_global_id(0) - 1;\n" << result[var("j")] << "=" << first[var("i")] << ";\n"; } void exec(command_queue &queue) { exec_1d(queue, 0, m_size); } size_t m_size; }; } // end detail namespace /// Copies the elements in the range [\p first, \p last) in reversed /// order to the range beginning at \p result. /// /// Space complexity: \Omega(1) /// /// \see reverse() template inline OutputIterator reverse_copy(InputIterator first, InputIterator last, OutputIterator result, 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::difference_type difference_type; difference_type count = std::distance(first, last); detail::reverse_copy_kernel kernel(first, last, result); // run kernel kernel.exec(queue); // return iterator to the end of result return result + count; } } // end compute namespace } // end boost namespace #endif // BOOST_COMPUTE_ALGORITHM_REVERSE_COPY_HPP