Sprout/sprout/algorithm/fixed/fill.hpp

52 lines
1.6 KiB
C++
Raw Normal View History

2011-09-01 02:48:32 +00:00
#ifndef SPROUT_ALGORITHM_FIXED_FILL_HPP
#define SPROUT_ALGORITHM_FIXED_FILL_HPP
#include <sprout/config.hpp>
#include <sprout/index_tuple.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
2011-09-03 13:26:26 +00:00
#include <sprout/algorithm/fixed/result_of.hpp>
2011-09-01 02:48:32 +00:00
namespace sprout {
namespace fixed {
namespace detail {
2012-02-28 01:46:39 +00:00
template<typename Container, typename T, sprout::index_t... Indexes>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
fill_impl(
Container const& cont, T const& value,
2011-10-28 12:45:00 +00:00
sprout::index_tuple<Indexes...>,
typename sprout::container_traits<Container>::difference_type offset,
typename sprout::container_traits<Container>::size_type size
2011-09-01 02:48:32 +00:00
)
{
return sprout::remake<Container>(
2011-09-03 13:26:26 +00:00
cont,
sprout::size(cont),
2011-09-01 02:48:32 +00:00
(Indexes >= offset && Indexes < offset + size
? value
: *sprout::next(sprout::internal_begin(cont), Indexes)
2011-09-01 02:48:32 +00:00
)...
2011-09-03 13:26:26 +00:00
);
2011-09-01 02:48:32 +00:00
}
} // namespace detail
//
// fill
//
template<typename Container, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
fill(Container const& cont, T const& value) {
2011-09-01 02:48:32 +00:00
return sprout::fixed::detail::fill_impl(
cont, value,
2012-05-14 02:33:36 +00:00
sprout::index_range<0, sprout::container_traits<Container>::static_size>::make(),
sprout::internal_begin_offset(cont),
2011-09-01 02:48:32 +00:00
sprout::size(cont)
);
}
} // namespace fixed
2011-09-03 13:26:26 +00:00
using sprout::fixed::fill;
2011-09-01 02:48:32 +00:00
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_FIXED_FILL_HPP