fill_n.hpp 1.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142
  1. //---------------------------------------------------------------------------//
  2. // Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
  3. //
  4. // Distributed under the Boost Software License, Version 1.0
  5. // See accompanying file LICENSE_1_0.txt or copy at
  6. // http://www.boost.org/LICENSE_1_0.txt
  7. //
  8. // See http://boostorg.github.com/compute for more information.
  9. //---------------------------------------------------------------------------//
  10. #ifndef BOOST_COMPUTE_ALGORITHM_FILL_N_HPP
  11. #define BOOST_COMPUTE_ALGORITHM_FILL_N_HPP
  12. #include <boost/static_assert.hpp>
  13. #include <boost/compute/system.hpp>
  14. #include <boost/compute/command_queue.hpp>
  15. #include <boost/compute/algorithm/fill.hpp>
  16. #include <boost/compute/type_traits/is_device_iterator.hpp>
  17. namespace boost {
  18. namespace compute {
  19. /// Fills the range [\p first, \p first + count) with \p value.
  20. ///
  21. /// Space complexity: \Omega(1)
  22. ///
  23. /// \see fill()
  24. template<class BufferIterator, class Size, class T>
  25. inline void fill_n(BufferIterator first,
  26. Size count,
  27. const T &value,
  28. command_queue &queue = system::default_queue())
  29. {
  30. BOOST_STATIC_ASSERT(is_device_iterator<BufferIterator>::value);
  31. ::boost::compute::fill(first, first + count, value, queue);
  32. }
  33. } // end compute namespace
  34. } // end boost namespace
  35. #endif // BOOST_COMPUTE_ALGORITHM_FILL_N_HPP