66 lines
1.9 KiB
Plaintext
66 lines
1.9 KiB
Plaintext
//---------------------------------------------------------------------------//
|
|
// 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_FOR_EACH_HPP
|
|
#define BOOST_COMPUTE_ALGORITHM_FOR_EACH_HPP
|
|
|
|
#include <boost/compute/system.hpp>
|
|
#include <boost/compute/command_queue.hpp>
|
|
#include <boost/compute/detail/meta_kernel.hpp>
|
|
#include <boost/compute/detail/iterator_range_size.hpp>
|
|
|
|
namespace boost {
|
|
namespace compute {
|
|
namespace detail {
|
|
|
|
template<class InputIterator, class Function>
|
|
struct for_each_kernel : public meta_kernel
|
|
{
|
|
for_each_kernel(InputIterator first, InputIterator last, Function function)
|
|
: meta_kernel("for_each")
|
|
{
|
|
// store range size
|
|
m_count = detail::iterator_range_size(first, last);
|
|
|
|
// setup kernel source
|
|
*this << function(first[get_global_id(0)]) << ";\n";
|
|
}
|
|
|
|
void exec(command_queue &queue)
|
|
{
|
|
exec_1d(queue, 0, m_count);
|
|
}
|
|
|
|
size_t m_count;
|
|
};
|
|
|
|
} // end detail namespace
|
|
|
|
/// Calls \p function on each element in the range [\p first, \p last).
|
|
///
|
|
/// \see transform()
|
|
template<class InputIterator, class UnaryFunction>
|
|
inline UnaryFunction for_each(InputIterator first,
|
|
InputIterator last,
|
|
UnaryFunction function,
|
|
command_queue &queue = system::default_queue())
|
|
{
|
|
detail::for_each_kernel<InputIterator, UnaryFunction> kernel(first, last, function);
|
|
|
|
kernel.exec(queue);
|
|
|
|
return function;
|
|
}
|
|
|
|
} // end compute namespace
|
|
} // end boost namespace
|
|
|
|
#endif // BOOST_COMPUTE_ALGORITHM_FOR_EACH_HPP
|