Sprout/sprout/algorithm/fit/fill_n.hpp
2013-02-20 01:12:56 +09:00

41 lines
1.4 KiB
C++

#ifndef SPROUT_ALGORITHM_FIT_FILL_N_HPP
#define SPROUT_ALGORITHM_FIT_FILL_N_HPP
#include <sprout/config.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/algorithm/fixed/fill_n.hpp>
#include <sprout/algorithm/fit/result_of.hpp>
#include <sprout/sub_array/sub_array.hpp>
#include <sprout/sub_array/sub.hpp>
#include HDR_ALGORITHM_MIN_MAX_SSCRISK_CEL_OR_SPROUT
namespace sprout {
namespace fit {
namespace detail {
template<typename Container, typename Size, typename T>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Container>::type
fill_n_impl(
Container const& cont, Size n, T const& value,
typename sprout::container_traits<Container>::difference_type offset
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::fixed::fill_n(cont, n, value)),
offset,
offset + NS_SSCRISK_CEL_OR_SPROUT::min(n, sprout::size(cont))
);
}
} // namespace detail
//
// fill_n
//
template<typename Container, typename Size, typename T>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Container>::type
fill_n(Container const& cont, Size n, T const& value) {
return sprout::fit::detail::fill_n_impl(cont, n, value, sprout::internal_begin_offset(cont));
}
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIT_FILL_N_HPP