|
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556 |
- /// \file
- // Range v3 library
- //
- // Copyright Eric Niebler 2013-present
- //
- // 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/iterator/concepts.hpp>
- #include <range/v3/iterator/operations.hpp>
- #include <range/v3/range/access.hpp>
- #include <range/v3/range/concepts.hpp>
- #include <range/v3/range/traits.hpp>
- #include <range/v3/utility/static_const.hpp>
-
- namespace ranges
- {
- /// \addtogroup group-algorithms
- /// @{
- RANGES_BEGIN_NIEBLOID(fill_n)
-
- /// \brief function template \c equal
- template<typename O, typename V>
- auto RANGES_FUN_NIEBLOID(fill_n)(O first, iter_difference_t<O> n, V const & val)
- ->CPP_ret(O)( //
- requires output_iterator<O, V const &>)
- {
- RANGES_EXPECT(n >= 0);
- auto norig = n;
- auto b = uncounted(first);
- for(; n != 0; ++b, --n)
- *b = val;
- return recounted(first, b, norig);
- }
-
- RANGES_END_NIEBLOID(fill_n)
-
- namespace cpp20
- {
- using ranges::fill_n;
- }
- /// @}
- } // namespace ranges
-
- #endif // include guard
|