* src/MenuBackend.[Ch]: the specialMenu is now a real menu, not a

[lyx.git] / boost / boost / multi_array / storage_order.hpp

diff --git a/boost/boost/multi_array/storage_order.hpp b/boost/boost/multi_array/storage_order.hpp
index e8e571c2bbbd52f09e8e977835999cf4aaa5cd0c..3eb71360c1c25490a85d0c352500a7a9e80aada2 100644 (file)
--- a/boost/boost/multi_array/storage_order.hpp
+++ b/boost/boost/multi_array/storage_order.hpp
@@ -1,3 +1,15 @@
+// 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.
+
 #ifndef BOOST_STORAGE_ORDER_RG071801_HPP
 #define BOOST_STORAGE_ORDER_RG071801_HPP
 
@@ -23,9 +35,9 @@ namespace boost {
     typedef detail::multi_array::size_type size_type;
     template <typename OrderingIter, typename AscendingIter>
     general_storage_order(OrderingIter ordering,
-                         AscendingIter ascending) {
-      boost::copy_n(ordering,NumDims,ordering_.begin());
-      boost::copy_n(ascending,NumDims,ascending_.begin());
+                          AscendingIter ascending) {
+      boost::detail::multi_array::copy_n(ordering,NumDims,ordering_.begin());
+      boost::detail::multi_array::copy_n(ascending,NumDims,ascending_.begin());
     }
 
     // RG - ideally these would not be necessary, but some compilers
@@ -34,14 +46,14 @@ namespace boost {
     // storage_order objects, I sacrifice that feature for compiler support.
     general_storage_order(const c_storage_order&) {
       for (size_type i=0; i != NumDims; ++i) {
-       ordering_[i] = NumDims - 1 - i;
+        ordering_[i] = NumDims - 1 - i;
       }
       ascending_.assign(true);
     }
 
     general_storage_order(const fortran_storage_order&) {
       for (size_type i=0; i != NumDims; ++i) {
-       ordering_[i] = i;
+        ordering_[i] = i;
       }
       ascending_.assign(true);
     }
@@ -51,12 +63,12 @@ namespace boost {
 
     bool all_dims_ascending() const {
       return std::accumulate(ascending_.begin(),ascending_.end(),true,
-                     std::logical_and<bool>());
+                      std::logical_and<bool>());
     }
 
     bool operator==(general_storage_order const& rhs) const {
       return (ordering_ == rhs.ordering_) &&
-       (ascending_ == rhs.ascending_);
+        (ascending_ == rhs.ascending_);
     }
 
   protected:
@@ -77,11 +89,11 @@ namespace boost {
       boost::array<bool,NumDims> ascending;
 
       for (size_type i=0; i != NumDims; ++i) {
-       ordering[i] = NumDims - 1 - i;
-       ascending[i] = true;
+        ordering[i] = NumDims - 1 - i;
+        ascending[i] = true;
       }
       return general_storage_order<NumDims>(ordering.begin(),
-                                           ascending.begin());
+                                            ascending.begin());
     }
 #endif
   };
@@ -99,11 +111,11 @@ namespace boost {
       boost::array<bool,NumDims> ascending;
 
       for (size_type i=0; i != NumDims; ++i) {
-       ordering[i] = i;
-       ascending[i] = true;
+        ordering[i] = i;
+        ascending[i] = true;
       }
       return general_storage_order<NumDims>(ordering.begin(),
-                                           ascending.begin());
+                                            ascending.begin());
     }
 #endif
   };