Sprout/sprout/algorithm/fit/fill_n.hpp

46 lines
1.4 KiB
C++
Raw Normal View History

2011-09-03 13:26:26 +00:00
#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>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/fill_n.hpp>
#include <sprout/algorithm/fit/result_of.hpp>
#include <sprout/sub_array.hpp>
2012-04-01 13:15:09 +00:00
#include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT
2011-09-03 13:26:26 +00:00
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(
2011-09-03 13:26:26 +00:00
Container const& cont,
Size n,
T const& value,
typename sprout::container_traits<Container>::difference_type offset
2011-09-03 13:26:26 +00:00
)
{
return sprout::sub_copy(
sprout::get_internal(sprout::fixed::fill_n(cont, n, value)),
2011-09-03 13:26:26 +00:00
offset,
2012-04-01 13:15:09 +00:00
offset + NS_SSCRISK_CEL_OR_SPROUT::min(n, sprout::size(cont))
2011-09-03 13:26:26 +00:00
);
}
} // namespace detail
//
// fill_n
//
template<typename Container, typename Size, typename T>
inline SPROUT_CONSTEXPR typename sprout::fit::result_of::algorithm<Container>::type fill_n(
2011-09-03 13:26:26 +00:00
Container const& cont,
Size n,
T const& value
)
{
return sprout::fit::detail::fill_n_impl(cont, n, value, sprout::internal_begin_offset(cont));
2011-09-03 13:26:26 +00:00
}
} // namespace fit
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIT_FILL_N_HPP