Name	Size	Mode	Actions
all_of.hpp	2821	0644	editdlrm
any_of.hpp	2812	0644	editdlrm
copy_if.hpp	5474	0644	editdlrm
copy_n.hpp	1274	0644	editdlrm
find_if_not.hpp	1920	0644	editdlrm
iota.hpp	2135	0644	editdlrm
is_partitioned.hpp	2147	0644	editdlrm
is_permutation.hpp	8096	0644	editdlrm
is_sorted.hpp	11072	0644	editdlrm
none_of.hpp	2799	0644	editdlrm
one_of.hpp	2910	0644	editdlrm
partition_copy.hpp	2967	0644	editdlrm
partition_point.hpp	2095	0644	editdlrm

/* Copyright (c) Marshall Clow 2011-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 copy_n.hpp /// \brief Copy n items from one sequence to another /// \author Marshall Clow #ifndef BOOST_ALGORITHM_COPY_N_HPP #define BOOST_ALGORITHM_COPY_N_HPP #include namespace boost { namespace algorithm { /// \fn copy_n ( InputIterator first, Size n, OutputIterator result ) /// \brief Copies exactly n (n > 0) elements from the range starting at first to /// the range starting at result. /// \return The updated output iterator /// /// \param first The start of the input sequence /// \param n The number of elements to copy /// \param result An output iterator to write the results into /// \note This function is part of the C++2011 standard library. template BOOST_CXX14_CONSTEXPR OutputIterator copy_n ( InputIterator first, Size n, OutputIterator result ) { for ( ; n > 0; --n, ++first, ++result ) *result = *first; return result; } }} // namespace boost and algorithm #endif // BOOST_ALGORITHM_COPY_IF_HPP