/* Copyright (c) Marshall Clow 2008-2012. 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) */ /// \file iota.hpp /// \brief Generate an increasing series /// \author Marshall Clow #ifndef BOOST_ALGORITHM_IOTA_HPP #define BOOST_ALGORITHM_IOTA_HPP #include #include #include namespace boost { namespace algorithm { #if __cplusplus >= 201103L // Use the C++11 versions of iota if it is available using std::iota; // Section 26.7.6 #else /// \fn iota ( ForwardIterator first, ForwardIterator last, T value ) /// \brief Generates an increasing sequence of values, and stores them in [first, last) /// /// \param first The start of the input sequence /// \param last One past the end of the input sequence /// \param value The initial value of the sequence to be generated /// \note This function is part of the C++2011 standard library. /// We will use the standard one if it is available, /// otherwise we have our own implementation. template void iota ( ForwardIterator first, ForwardIterator last, T value ) { for ( ; first != last; ++first, ++value ) *first = value; } #endif /// \fn iota ( Range &r, T value ) /// \brief Generates an increasing sequence of values, and stores them in the input Range. /// /// \param r The input range /// \param value The initial value of the sequence to be generated /// template void iota ( Range &r, T value ) { boost::algorithm::iota (boost::begin(r), boost::end(r), value); } /// \fn iota_n ( OutputIterator out, T value, std::size_t n ) /// \brief Generates an increasing sequence of values, and stores them in the input Range. /// /// \param out An output iterator to write the results into /// \param value The initial value of the sequence to be generated /// \param n The number of items to write /// template OutputIterator iota_n ( OutputIterator out, T value, std::size_t n ) { while ( n-- > 0 ) *out++ = value++; return out; } }} #endif // BOOST_ALGORITHM_IOTA_HPP