mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-12 14:54:10 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix reverse_iterator

Browse source 
support STL container: some algorithms
This commit is contained in:
bolero-MURAKAMI 2013-01-20 08:53:20 +09:00
parent a9cd556f8e
commit 9a593cbb81
30 changed files with 634 additions and 78 deletions
Download patch file Download diff file Expand all files Collapse all files

14
sprout/algorithm/fixed/fill_n.hpp
View file

@ -5,8 +5,10 @@
#include <sprout/index_tuple.hpp>
#include <sprout/container/traits.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/iterator/value_iterator.hpp>
#include <sprout/algorithm/fixed/result_of.hpp>
#include <sprout/algorithm/fixed/fill.hpp>
#include <sprout/pit.hpp>
namespace sprout {
namespace fixed {
@ -32,9 +34,9 @@ namespace sprout {
>::type
fill_n(Container const& cont, Size n, T const& value) {
return sprout::remake<Container>(
cont,
n,
sprout::value_iterator<T const&>(value, n), sprout::value_iterator<T const&>(value, 0)
cont, n,
sprout::value_iterator<T const&>(value, n),
sprout::value_iterator<T const&>(value, 0)
);
}
} // namespace detail
@ -46,6 +48,12 @@ namespace sprout {
fill_n(Container const& cont, Size n, T const& value) {
return sprout::fixed::detail::fill_n(cont, n, value);
}
template<typename Container, typename Size, typename T>
inline SPROUT_CONSTEXPR typename sprout::fixed::result_of::algorithm<Container>::type
fill_n(Size n, T const& value) {
return sprout::fixed::fill_n(sprout::pit<Container>(), n, value);
}
} // namespace fixed
using sprout::fixed::fill_n;