1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Sprout/sprout/algorithm/fixed/fill.hpp

88 lines
3.1 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
Copyright (c) 2011-2017 Bolero MURAKAMI
2013-08-08 09:54:33 +00:00
https://github.com/bolero-MURAKAMI/Sprout
Distributed under 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)
=============================================================================*/
2011-09-01 02:48:32 +00:00
#ifndef SPROUT_ALGORITHM_FIXED_FILL_HPP
#define SPROUT_ALGORITHM_FIXED_FILL_HPP
#include <sprout/config.hpp>
2013-04-06 04:06:51 +00:00
#include <sprout/index_tuple/metafunction.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/value_iterator.hpp>
#include <sprout/algorithm/fixed/results.hpp>
2013-02-07 14:12:57 +00:00
#include <sprout/pit/pit.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::results::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>(
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
}
template<typename Container, typename T>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_fixed_container<Container>::value,
typename sprout::fixed::results::algorithm<Container>::type
>::type
fill(Container const& cont, T const& value) {
return sprout::fixed::detail::fill_impl(
cont, value,
2013-03-31 06:14:10 +00:00
sprout::container_indexes<Container>::make(),
sprout::internal_begin_offset(cont),
sprout::size(cont)
);
}
template<typename Container, typename T>
inline SPROUT_CONSTEXPR typename std::enable_if<
!sprout::is_fixed_container<Container>::value,
typename sprout::fixed::results::algorithm<Container>::type
>::type
fill(Container const& cont, T const& value) {
return sprout::remake<Container>(
cont, sprout::size(cont),
sprout::value_iterator<T const&>(value, sprout::size(cont)),
sprout::value_iterator<T const&>(value, 0)
);
}
2011-09-01 02:48:32 +00:00
} // namespace detail
//
// fill
//
template<typename Container, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Container>::type
fill(Container const& cont, T const& value) {
return sprout::fixed::detail::fill(cont, value);
2011-09-01 02:48:32 +00:00
}
template<typename Container, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::results::algorithm<Container>::type
fill(T const& value) {
return sprout::fixed::fill(sprout::pit<Container>(), value);
}
2011-09-01 02:48:32 +00:00
} // 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