range/algorithm/fill_n.hpp

0001 //  Copyright Neil Groves 2009. Use, modification and
0002 //  distribution is subject to the Boost Software License, Version
0003 //  1.0. (See accompanying file LICENSE_1_0.txt or copy at
0004 //  http://www.boost.org/LICENSE_1_0.txt)
0005 //
0006 //
0007 // For more information, see http://www.boost.org/libs/range/
0008 //
0009 #ifndef BOOST_RANGE_ALGORITHM_FILL_N_HPP_INCLUDED
0010 #define BOOST_RANGE_ALGORITHM_FILL_N_HPP_INCLUDED
0011
0012 #include <boost/assert.hpp>
0013 #include <boost/concept_check.hpp>
0014 #include <boost/range/begin.hpp>
0015 #include <boost/range/end.hpp>
0016 #include <boost/range/concepts.hpp>
0017 #include <algorithm>
0018
0019 namespace boost
0020 {
0021     namespace range
0022     {
0023
0024 /// \brief template function fill_n
0025 ///
0026 /// range-based version of the fill_n std algorithm
0027 ///
0028 /// \pre ForwardRange is a model of the ForwardRangeConcept
0029 /// \pre n <= std::distance(boost::begin(rng), boost::end(rng))
0030 template< class ForwardRange, class Size, class Value >
0031 inline ForwardRange& fill_n(ForwardRange& rng, Size n, const Value& val)
0032 {
0033     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
0034     BOOST_ASSERT( static_cast<Size>(std::distance(boost::begin(rng), boost::end(rng))) >= n );
0035     std::fill_n(boost::begin(rng), n, val);
0036     return rng;
0037 }
0038
0039 /// \overload
0040 template< class ForwardRange, class Size, class Value >
0041 inline const ForwardRange& fill_n(const ForwardRange& rng, Size n, const Value& val)
0042 {
0043     BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
0044     BOOST_ASSERT( static_cast<Size>(std::distance(boost::begin(rng), boost::end(rng))) >= n );
0045     std::fill_n(boost::begin(rng), n, val);
0046     return rng;
0047 }
0048
0049     } // namespace range
0050     using range::fill_n;
0051 } // namespace boost
0052
0053 #endif // include guard