// purpose. It is provided "as is" without express or implied warranty.
//
+// Copyright 2002 The Trustees of Indiana University.
+
+// Use, modification and distribution is subject to 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)
+
+// Boost.MultiArray Library
+// Authors: Ronald Garcia
+// Jeremy Siek
+// Andrew Lumsdaine
+// See http://www.boost.org/libs/multi_array for documentation.
+
+
#include "boost/iterator.hpp"
namespace boost {
-
+namespace detail {
+namespace multi_array {
//--------------------------------------------------
// copy_n (not part of the C++ standard)
#if 1
template <class InputIter, class Size, class OutputIter>
OutputIter copy_n(InputIter first, Size count,
- OutputIter result) {
+ OutputIter result) {
for ( ; count > 0; --count) {
*result = *first;
++first;
template <class InputIter, class Size, class OutputIter>
inline OutputIter
copy_n__(InputIter first, Size count, OutputIter result) {
- typedef std::iterator_traits<InputIter>::iterator_category cat;
+ typedef typename std::iterator_traits<InputIter>::iterator_category cat;
return copy_n__(first, count, result, cat());
}
}
#endif // 1
-
+} // namespace multi_array
+} // namespace detail
} // namespace boost
#endif // BOOST_ALGORITHM_RG071801_HPP