//---------------------------------------------------------------------------// // 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_GENERATE_HPP #define BOOST_COMPUTE_ALGORITHM_GENERATE_HPP #include <boost/compute/system.hpp> #include <boost/compute/command_queue.hpp> #include <boost/compute/algorithm/copy.hpp> #include <boost/compute/iterator/function_input_iterator.hpp> #include <boost/compute/detail/iterator_range_size.hpp> namespace boost { namespace compute { /// Stores the result of \p generator for each element in the range /// [\p first, \p last). template<class OutputIterator, class Generator> inline void generate(OutputIterator first, OutputIterator last, Generator generator, command_queue &queue = system::default_queue()) { size_t count = detail::iterator_range_size(first, last); if(count == 0){ return; } ::boost::compute::copy( ::boost::compute::make_function_input_iterator(generator, first.get_index()), ::boost::compute::make_function_input_iterator(generator, last.get_index()), first, queue ); } } // end compute namespace } // end boost namespace #endif // BOOST_COMPUTE_ALGORITHM_GENERATE_HPP