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/fill.hpp (10030B)

//---------------------------------------------------------------------------//
// 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_FILL_HPP
#define BOOST_COMPUTE_ALGORITHM_FILL_HPP

#include <iterator>

#include <boost/static_assert.hpp>
#include <boost/mpl/int.hpp>
#include <boost/mpl/vector.hpp>
#include <boost/mpl/contains.hpp>
#include <boost/utility/enable_if.hpp>

#include <boost/compute/cl.hpp>
#include <boost/compute/system.hpp>
#include <boost/compute/command_queue.hpp>
#include <boost/compute/algorithm/copy.hpp>
#include <boost/compute/async/future.hpp>
#include <boost/compute/iterator/constant_iterator.hpp>
#include <boost/compute/iterator/discard_iterator.hpp>
#include <boost/compute/detail/is_buffer_iterator.hpp>
#include <boost/compute/detail/iterator_range_size.hpp>
#include <boost/compute/type_traits/is_device_iterator.hpp>

namespace boost {
namespace compute {
namespace detail {

namespace mpl = boost::mpl;

// fills the range [first, first + count) with value using copy()
template<class BufferIterator, class T>
inline void fill_with_copy(BufferIterator first,
                           size_t count,
                           const T &value,
                           command_queue &queue)
{
    ::boost::compute::copy(
        ::boost::compute::make_constant_iterator(value, 0),
        ::boost::compute::make_constant_iterator(value, count),
        first,
        queue
    );
}

// fills the range [first, first + count) with value using copy_async()
template<class BufferIterator, class T>
inline future<void> fill_async_with_copy(BufferIterator first,
                                         size_t count,
                                         const T &value,
                                         command_queue &queue)
{
    return ::boost::compute::copy_async(
               ::boost::compute::make_constant_iterator(value, 0),
               ::boost::compute::make_constant_iterator(value, count),
               first,
               queue
           );
}

#if defined(BOOST_COMPUTE_CL_VERSION_1_2)

// meta-function returing true if Iterator points to a range of values
// that can be filled using clEnqueueFillBuffer(). to meet this criteria
// it must have a buffer accessible through iter.get_buffer() and the
// size of its value_type must by in {1, 2, 4, 8, 16, 32, 64, 128}.
template<class Iterator>
struct is_valid_fill_buffer_iterator :
    public mpl::and_<
        is_buffer_iterator<Iterator>,
        mpl::contains<
            mpl::vector<
                mpl::int_<1>,
                mpl::int_<2>,
                mpl::int_<4>,
                mpl::int_<8>,
                mpl::int_<16>,
                mpl::int_<32>,
                mpl::int_<64>,
                mpl::int_<128>
            >,
            mpl::int_<
                sizeof(typename std::iterator_traits<Iterator>::value_type)
            >
        >
    >::type { };

template<>
struct is_valid_fill_buffer_iterator<discard_iterator> : public boost::false_type {};

// specialization which uses clEnqueueFillBuffer for buffer iterators
template<class BufferIterator, class T>
inline void
dispatch_fill(BufferIterator first,
              size_t count,
              const T &value,
              command_queue &queue,
              typename boost::enable_if<
                 is_valid_fill_buffer_iterator<BufferIterator>
              >::type* = 0)
{
    typedef typename std::iterator_traits<BufferIterator>::value_type value_type;

if(count == 0){
        // nothing to do
        return;
    }

// check if the device supports OpenCL 1.2 (required for enqueue_fill_buffer)
    if(!queue.check_device_version(1, 2)){
        return fill_with_copy(first, count, value, queue);
    }

value_type pattern = static_cast<value_type>(value);
    size_t offset = static_cast<size_t>(first.get_index());

if(count == 1){
        // use clEnqueueWriteBuffer() directly when writing a single value
        // to the device buffer. this is potentially more efficient and also
        // works around a bug in the intel opencl driver.
        queue.enqueue_write_buffer(
            first.get_buffer(),
            offset * sizeof(value_type),
            sizeof(value_type),
            &pattern
        );
    }
    else {
        queue.enqueue_fill_buffer(
            first.get_buffer(),
            &pattern,
            sizeof(value_type),
            offset * sizeof(value_type),
            count * sizeof(value_type)
        );
    }
}

// check if the device supports OpenCL 1.2 (required for enqueue_fill_buffer)
    if(!queue.check_device_version(1, 2)){
        return fill_async_with_copy(first, count, value, queue);
    }

value_type pattern = static_cast<value_type>(value);
    size_t offset = static_cast<size_t>(first.get_index());

event event_ =
        queue.enqueue_fill_buffer(first.get_buffer(),
                                  &pattern,
                                  sizeof(value_type),
                                  offset * sizeof(value_type),
                                  count * sizeof(value_type));

return future<void>(event_);
}

#ifdef BOOST_COMPUTE_CL_VERSION_2_0
// specializations for svm_ptr<T>
template<class T>
inline void dispatch_fill(svm_ptr<T> first,
                          size_t count,
                          const T &value,
                          command_queue &queue)
{
    if(count == 0){
        return;
    }

queue.enqueue_svm_fill(
        first.get(), &value, sizeof(T), count * sizeof(T)
    );
}

template<class T>
inline future<void> dispatch_fill_async(svm_ptr<T> first,
                                        size_t count,
                                        const T &value,
                                        command_queue &queue)
{
    if(count == 0){
        return future<void>();
    }

event event_ = queue.enqueue_svm_fill(
        first.get(), &value, sizeof(T), count * sizeof(T)
    );

return future<void>(event_);
}
#endif // BOOST_COMPUTE_CL_VERSION_2_0

// default implementations
template<class BufferIterator, class T>
inline void
dispatch_fill(BufferIterator first,
              size_t count,
              const T &value,
              command_queue &queue,
              typename boost::disable_if<
                  is_valid_fill_buffer_iterator<BufferIterator>
              >::type* = 0)
{
    fill_with_copy(first, count, value, queue);
}

template<class BufferIterator, class T>
inline future<void>
dispatch_fill_async(BufferIterator first,
                    size_t count,
                    const T &value,
                    command_queue &queue,
                    typename boost::disable_if<
                        is_valid_fill_buffer_iterator<BufferIterator>
                    >::type* = 0)
{
    return fill_async_with_copy(first, count, value, queue);
}
#else
template<class BufferIterator, class T>
inline void dispatch_fill(BufferIterator first,
                          size_t count,
                          const T &value,
                          command_queue &queue)
{
    fill_with_copy(first, count, value, queue);
}

template<class BufferIterator, class T>
inline future<void> dispatch_fill_async(BufferIterator first,
                                        size_t count,
                                        const T &value,
                                        command_queue &queue)
{
    return fill_async_with_copy(first, count, value, queue);
}
#endif // !defined(BOOST_COMPUTE_CL_VERSION_1_2)

} // end detail namespace

/// Fills the range [\p first, \p last) with \p value.
///
/// \param first first element in the range to fill
/// \param last last element in the range to fill
/// \param value value to copy to each element
/// \param queue command queue to perform the operation
///
/// For example, to fill a vector on the device with sevens:
/// \code
/// // vector on the device
/// boost::compute::vector<int> vec(10, context);
///
/// // fill vector with sevens
/// boost::compute::fill(vec.begin(), vec.end(), 7, queue);
/// \endcode
///
/// Space complexity: \Omega(1)
///
/// \see boost::compute::fill_n()
template<class BufferIterator, class T>
inline void fill(BufferIterator first,
                 BufferIterator last,
                 const T &value,
                 command_queue &queue = system::default_queue())
{
    BOOST_STATIC_ASSERT(is_device_iterator<BufferIterator>::value);
    size_t count = detail::iterator_range_size(first, last);
    if(count == 0){
        return;
    }

detail::dispatch_fill(first, count, value, queue);
}

template<class BufferIterator, class T>
inline future<void> fill_async(BufferIterator first,
                               BufferIterator last,
                               const T &value,
                               command_queue &queue = system::default_queue())
{
    BOOST_STATIC_ASSERT(detail::is_buffer_iterator<BufferIterator>::value);
    size_t count = detail::iterator_range_size(first, last);
    if(count == 0){
        return future<void>();
    }

return detail::dispatch_fill_async(first, count, value, queue);
}

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

#endif // BOOST_COMPUTE_ALGORITHM_FILL_HPP

cmd: