37 lines
1.2 KiB
Plaintext
37 lines
1.2 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_FILL_N_HPP
|
||
|
#define BOOST_COMPUTE_ALGORITHM_FILL_N_HPP
|
||
|
|
||
|
#include <boost/compute/system.hpp>
|
||
|
#include <boost/compute/command_queue.hpp>
|
||
|
#include <boost/compute/algorithm/fill.hpp>
|
||
|
|
||
|
namespace boost {
|
||
|
namespace compute {
|
||
|
|
||
|
/// Fills the range [\p first, \p first + count) with \p value.
|
||
|
///
|
||
|
/// \see fill()
|
||
|
template<class BufferIterator, class Size, class T>
|
||
|
inline void fill_n(BufferIterator first,
|
||
|
Size count,
|
||
|
const T &value,
|
||
|
command_queue &queue = system::default_queue())
|
||
|
{
|
||
|
::boost::compute::fill(first, first + count, value, queue);
|
||
|
}
|
||
|
|
||
|
} // end compute namespace
|
||
|
} // end boost namespace
|
||
|
|
||
|
#endif // BOOST_COMPUTE_ALGORITHM_FILL_N_HPP
|