2013-08-08 09:54:33 +00:00
|
|
|
/*=============================================================================
|
|
|
|
|
Copyright (c) 2011-2013 Bolero MURAKAMI
|
|
|
|
|
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_FILL_HPP
|
|
|
|
|
#define SPROUT_ALGORITHM_FILL_HPP
|
|
|
|
|
|
|
|
|
|
#include <sprout/config.hpp>
|
2013-10-16 04:04:49 +00:00
|
|
|
|
|
|
|
|
namespace sprout {
|
|
|
|
|
//
|
|
|
|
|
// 25.3.6 Fill
|
|
|
|
|
//
|
|
|
|
|
template<typename ForwrdIterator, typename T>
|
|
|
|
|
inline SPROUT_CXX14_CONSTEXPR void
|
|
|
|
|
fill(ForwrdIterator first, ForwrdIterator last, T const& value) {
|
|
|
|
|
while (first != last) {
|
|
|
|
|
*first++ = value;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
} // namespace sprout
|
|
|
|
|
|
2011-09-01 02:48:32 +00:00
|
|
|
#include <sprout/algorithm/fixed/fill.hpp>
|
2011-09-03 13:26:26 +00:00
|
|
|
#include <sprout/algorithm/fit/fill.hpp>
|
2011-09-01 02:48:32 +00:00
|
|
|
|
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_FILL_HPP
|
