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/reduce_by_key.hpp (5933B)

//---------------------------------------------------------------------------//
// Copyright (c) 2015 Jakub Szuppe <j.szuppe@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_REDUCE_BY_KEY_HPP
#define BOOST_COMPUTE_ALGORITHM_REDUCE_BY_KEY_HPP

#include <iterator>
#include <utility>

#include <boost/static_assert.hpp>

#include <boost/compute/command_queue.hpp>
#include <boost/compute/device.hpp>
#include <boost/compute/functional.hpp>
#include <boost/compute/system.hpp>
#include <boost/compute/algorithm/detail/reduce_by_key.hpp>
#include <boost/compute/type_traits/is_device_iterator.hpp>

namespace boost {
namespace compute {

/// The \c reduce_by_key() algorithm performs reduction for each contiguous
/// subsequence of values determinate by equivalent keys.
///
/// Returns a pair of iterators at the end of the ranges [\p keys_result, keys_result_last)
/// and [\p values_result, \p values_result_last).
///
/// If no function is specified, \c plus will be used.
/// If no predicate is specified, \c equal_to will be used.
///
/// \param keys_first the first key
/// \param keys_last the last key
/// \param values_first the first input value
/// \param keys_result iterator pointing to the key output
/// \param values_result iterator pointing to the reduced value output
/// \param function binary reduction function
/// \param predicate binary predicate which returns true only if two keys are equal
/// \param queue command queue to perform the operation
///
/// The \c reduce_by_key() algorithm assumes that the binary reduction function
/// is associative. When used with non-associative functions the result may
/// be non-deterministic and vary in precision. Notably this affects the
/// \c plus<float>() function as floating-point addition is not associative
/// and may produce slightly different results than a serial algorithm.
///
/// For example, to calculate the sum of the values for each key:
///
/// \snippet test/test_reduce_by_key.cpp reduce_by_key_int
///
/// Space complexity on GPUs: \Omega(2n)<br>
/// Space complexity on CPUs: \Omega(1)
///
/// \see reduce()
template<class InputKeyIterator, class InputValueIterator,
         class OutputKeyIterator, class OutputValueIterator,
         class BinaryFunction, class BinaryPredicate>
inline std::pair<OutputKeyIterator, OutputValueIterator>
reduce_by_key(InputKeyIterator keys_first,
              InputKeyIterator keys_last,
              InputValueIterator values_first,
              OutputKeyIterator keys_result,
              OutputValueIterator values_result,
              BinaryFunction function,
              BinaryPredicate predicate,
              command_queue &queue = system::default_queue())
{
    BOOST_STATIC_ASSERT(is_device_iterator<InputKeyIterator>::value);
    BOOST_STATIC_ASSERT(is_device_iterator<InputValueIterator>::value);
    BOOST_STATIC_ASSERT(is_device_iterator<OutputKeyIterator>::value);
    BOOST_STATIC_ASSERT(is_device_iterator<OutputValueIterator>::value);

return detail::dispatch_reduce_by_key(keys_first, keys_last, values_first,
                                          keys_result, values_result,
                                          function, predicate,
                                          queue);
}

/// \overload
template<class InputKeyIterator, class InputValueIterator,
         class OutputKeyIterator, class OutputValueIterator,
         class BinaryFunction>
inline std::pair<OutputKeyIterator, OutputValueIterator>
reduce_by_key(InputKeyIterator keys_first,
              InputKeyIterator keys_last,
              InputValueIterator values_first,
              OutputKeyIterator keys_result,
              OutputValueIterator values_result,
              BinaryFunction function,
              command_queue &queue = system::default_queue())
{
    BOOST_STATIC_ASSERT(is_device_iterator<InputKeyIterator>::value);
    BOOST_STATIC_ASSERT(is_device_iterator<InputValueIterator>::value);
    BOOST_STATIC_ASSERT(is_device_iterator<OutputKeyIterator>::value);
    BOOST_STATIC_ASSERT(is_device_iterator<OutputValueIterator>::value);
    typedef typename std::iterator_traits<InputKeyIterator>::value_type key_type;

return reduce_by_key(keys_first, keys_last, values_first,
                         keys_result, values_result,
                         function, equal_to<key_type>(),
                         queue);
}

/// \overload
template<class InputKeyIterator, class InputValueIterator,
         class OutputKeyIterator, class OutputValueIterator>
inline std::pair<OutputKeyIterator, OutputValueIterator>
reduce_by_key(InputKeyIterator keys_first,
              InputKeyIterator keys_last,
              InputValueIterator values_first,
              OutputKeyIterator keys_result,
              OutputValueIterator values_result,
              command_queue &queue = system::default_queue())
{
    BOOST_STATIC_ASSERT(is_device_iterator<InputKeyIterator>::value);
    BOOST_STATIC_ASSERT(is_device_iterator<InputValueIterator>::value);
    BOOST_STATIC_ASSERT(is_device_iterator<OutputKeyIterator>::value);
    BOOST_STATIC_ASSERT(is_device_iterator<OutputValueIterator>::value);
    typedef typename std::iterator_traits<InputKeyIterator>::value_type key_type;
    typedef typename std::iterator_traits<InputValueIterator>::value_type value_type;

return reduce_by_key(keys_first, keys_last, values_first,
                         keys_result, values_result,
                         plus<value_type>(), equal_to<key_type>(),
                         queue);
}

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

#endif // BOOST_COMPUTE_ALGORITHM_REDUCE_BY_KEY_HPP

cmd: