54 lines
1.5 KiB
C++
54 lines
1.5 KiB
C++
/// \file
|
|
// Range v3 library
|
|
//
|
|
// Copyright Eric Niebler 2013-2014
|
|
//
|
|
// Use, modification and distribution is subject to 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)
|
|
//
|
|
// Project home: https://github.com/ericniebler/range-v3
|
|
//
|
|
#ifndef RANGES_V3_ALGORITHM_FILL_N_HPP
|
|
#define RANGES_V3_ALGORITHM_FILL_N_HPP
|
|
|
|
#include <utility>
|
|
#include <range/v3/range_fwd.hpp>
|
|
#include <range/v3/begin_end.hpp>
|
|
#include <range/v3/range_concepts.hpp>
|
|
#include <range/v3/range_traits.hpp>
|
|
#include <range/v3/utility/iterator.hpp>
|
|
#include <range/v3/utility/iterator_concepts.hpp>
|
|
#include <range/v3/utility/static_const.hpp>
|
|
|
|
namespace ranges
|
|
{
|
|
inline namespace v3
|
|
{
|
|
/// \addtogroup group-algorithms
|
|
/// @{
|
|
struct fill_n_fn
|
|
{
|
|
template<typename O, typename V,
|
|
CONCEPT_REQUIRES_(OutputIterator<O, V const &>())>
|
|
O operator()(O begin, difference_type_t<O> n, V const & val) const
|
|
{
|
|
RANGES_EXPECT(n >= 0);
|
|
auto norig = n;
|
|
auto b = uncounted(begin);
|
|
for(; n != 0; ++b, --n)
|
|
*b = val;
|
|
return recounted(begin, b, norig);
|
|
}
|
|
};
|
|
|
|
/// \sa `fill_n_fn`
|
|
/// \ingroup group-algorithms
|
|
RANGES_INLINE_VARIABLE(fill_n_fn, fill_n)
|
|
/// @}
|
|
} // namespace v3
|
|
} // namespace ranges
|
|
|
|
#endif // include guard
|