Chris@16: //
Chris@16: //  Copyright (c) 2000-2002
Chris@16: //  Joerg Walter, Mathias Koch
Chris@16: //
Chris@16: //  Distributed under the Boost Software License, Version 1.0. (See
Chris@16: //  accompanying file LICENSE_1_0.txt or copy at
Chris@16: //  http://www.boost.org/LICENSE_1_0.txt)
Chris@16: //
Chris@16: //  The authors gratefully acknowledge the support of
Chris@16: //  GeNeSys mbH & Co. KG in producing this work.
Chris@16: //
Chris@16: 
Chris@16: #ifndef _BOOST_UBLAS_MATRIX_ASSIGN_
Chris@16: #define _BOOST_UBLAS_MATRIX_ASSIGN_
Chris@16: 
Chris@16: #include <boost/numeric/ublas/traits.hpp>
Chris@16: // Required for make_conformant storage
Chris@16: #include <vector>
Chris@16: 
Chris@16: // Iterators based on ideas of Jeremy Siek
Chris@16: 
Chris@16: namespace boost { namespace numeric { namespace ublas {
Chris@16: namespace detail {
Chris@16:     
Chris@16:     // Weak equality check - useful to compare equality two arbitary matrix expression results.
Chris@16:     // Since the actual expressions are unknown, we check for and arbitary error bound
Chris@16:     // on the relative error.
Chris@16:     // For a linear expression the infinity norm makes sense as we do not know how the elements will be
Chris@16:     // combined in the expression. False positive results are inevitable for arbirary expressions!
Chris@16:     template<class E1, class E2, class S>
Chris@16:     BOOST_UBLAS_INLINE
Chris@16:     bool equals (const matrix_expression<E1> &e1, const matrix_expression<E2> &e2, S epsilon, S min_norm) {
Chris@16:         return norm_inf (e1 - e2) < epsilon *
Chris@16:                std::max<S> (std::max<S> (norm_inf (e1), norm_inf (e2)), min_norm);
Chris@16:     }
Chris@16: 
Chris@16:     template<class E1, class E2>
Chris@16:     BOOST_UBLAS_INLINE
Chris@16:     bool expression_type_check (const matrix_expression<E1> &e1, const matrix_expression<E2> &e2) {
Chris@16:         typedef typename type_traits<typename promote_traits<typename E1::value_type,
Chris@16:                                      typename E2::value_type>::promote_type>::real_type real_type;
Chris@16:         return equals (e1, e2, BOOST_UBLAS_TYPE_CHECK_EPSILON, BOOST_UBLAS_TYPE_CHECK_MIN);
Chris@16:     }
Chris@16: 
Chris@16: 
Chris@16:     template<class M, class E, class R>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void make_conformant (M &m, const matrix_expression<E> &e, row_major_tag, R) {
Chris@16:         BOOST_UBLAS_CHECK (m.size1 () == e ().size1 (), bad_size ());
Chris@16:         BOOST_UBLAS_CHECK (m.size2 () == e ().size2 (), bad_size ());
Chris@16:         typedef R conformant_restrict_type;
Chris@16:         typedef typename M::size_type size_type;
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         typedef typename M::value_type value_type;
Chris@16:         // FIXME unbounded_array with push_back maybe better
Chris@16:         std::vector<std::pair<size_type, size_type> > index;
Chris@16:         typename M::iterator1 it1 (m.begin1 ());
Chris@16:         typename M::iterator1 it1_end (m.end1 ());
Chris@16:         typename E::const_iterator1 it1e (e ().begin1 ());
Chris@16:         typename E::const_iterator1 it1e_end (e ().end1 ());
Chris@16:         while (it1 != it1_end && it1e != it1e_end) {
Chris@16:             difference_type compare = it1.index1 () - it1e.index1 ();
Chris@16:             if (compare == 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                 typename M::iterator2 it2 (it1.begin ());
Chris@16:                 typename M::iterator2 it2_end (it1.end ());
Chris@16:                 typename E::const_iterator2 it2e (it1e.begin ());
Chris@16:                 typename E::const_iterator2 it2e_end (it1e.end ());
Chris@16: #else
Chris@16:                 typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:                 typename M::iterator2 it2_end (end (it1, iterator1_tag ()));
Chris@16:                 typename E::const_iterator2 it2e (begin (it1e, iterator1_tag ()));
Chris@16:                 typename E::const_iterator2 it2e_end (end (it1e, iterator1_tag ()));
Chris@16: #endif
Chris@16:                 if (it2 != it2_end && it2e != it2e_end) {
Chris@16:                     size_type it2_index = it2.index2 (), it2e_index = it2e.index2 ();
Chris@16:                     while (true) {
Chris@101:                         difference_type compare2 = it2_index - it2e_index;
Chris@101:                         if (compare2 == 0) {
Chris@16:                             ++ it2, ++ it2e;
Chris@16:                             if (it2 != it2_end && it2e != it2e_end) {
Chris@16:                                 it2_index = it2.index2 ();
Chris@16:                                 it2e_index = it2e.index2 ();
Chris@16:                             } else
Chris@16:                                 break;
Chris@101:                         } else if (compare2 < 0) {
Chris@101:                             increment (it2, it2_end, - compare2);
Chris@16:                             if (it2 != it2_end)
Chris@16:                                 it2_index = it2.index2 ();
Chris@16:                             else
Chris@16:                                 break;
Chris@101:                         } else if (compare2 > 0) {
Chris@16:                             if (conformant_restrict_type::other (it2e.index1 (), it2e.index2 ()))
Chris@16:                                 if (static_cast<value_type>(*it2e) != value_type/*zero*/())
Chris@16:                                     index.push_back (std::pair<size_type, size_type> (it2e.index1 (), it2e.index2 ()));
Chris@16:                             ++ it2e;
Chris@16:                             if (it2e != it2e_end)
Chris@16:                                 it2e_index = it2e.index2 ();
Chris@16:                             else
Chris@16:                                 break;
Chris@16:                         }
Chris@16:                     }
Chris@16:                 }
Chris@16:                 while (it2e != it2e_end) {
Chris@16:                     if (conformant_restrict_type::other (it2e.index1 (), it2e.index2 ()))
Chris@16:                         if (static_cast<value_type>(*it2e) != value_type/*zero*/())
Chris@16:                             index.push_back (std::pair<size_type, size_type> (it2e.index1 (), it2e.index2 ()));
Chris@16:                     ++ it2e;
Chris@16:                 }
Chris@16:                 ++ it1, ++ it1e;
Chris@16:             } else if (compare < 0) {
Chris@16:                 increment (it1, it1_end, - compare);
Chris@16:             } else if (compare > 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                 typename E::const_iterator2 it2e (it1e.begin ());
Chris@16:                 typename E::const_iterator2 it2e_end (it1e.end ());
Chris@16: #else
Chris@16:                 typename E::const_iterator2 it2e (begin (it1e, iterator1_tag ()));
Chris@16:                 typename E::const_iterator2 it2e_end (end (it1e, iterator1_tag ()));
Chris@16: #endif
Chris@16:                 while (it2e != it2e_end) {
Chris@16:                     if (conformant_restrict_type::other (it2e.index1 (), it2e.index2 ()))
Chris@16:                         if (static_cast<value_type>(*it2e) != value_type/*zero*/())
Chris@16:                             index.push_back (std::pair<size_type, size_type> (it2e.index1 (), it2e.index2 ()));
Chris@16:                     ++ it2e;
Chris@16:                 }
Chris@16:                 ++ it1e;
Chris@16:             }
Chris@16:         }
Chris@16:         while (it1e != it1e_end) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename E::const_iterator2 it2e (it1e.begin ());
Chris@16:             typename E::const_iterator2 it2e_end (it1e.end ());
Chris@16: #else
Chris@16:             typename E::const_iterator2 it2e (begin (it1e, iterator1_tag ()));
Chris@16:             typename E::const_iterator2 it2e_end (end (it1e, iterator1_tag ()));
Chris@16: #endif
Chris@16:             while (it2e != it2e_end) {
Chris@16:                 if (conformant_restrict_type::other (it2e.index1 (), it2e.index2 ()))
Chris@16:                     if (static_cast<value_type>(*it2e) != value_type/*zero*/())
Chris@16:                         index.push_back (std::pair<size_type, size_type> (it2e.index1 (), it2e.index2 ()));
Chris@16:                 ++ it2e;
Chris@16:             }
Chris@16:             ++ it1e;
Chris@16:         }
Chris@16:         // ISSUE proxies require insert_element
Chris@16:         for (size_type k = 0; k < index.size (); ++ k)
Chris@16:             m (index [k].first, index [k].second) = value_type/*zero*/();
Chris@16:     }
Chris@16:     template<class M, class E, class R>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void make_conformant (M &m, const matrix_expression<E> &e, column_major_tag, R) {
Chris@16:         BOOST_UBLAS_CHECK (m.size1 () == e ().size1 (), bad_size ());
Chris@16:         BOOST_UBLAS_CHECK (m.size2 () == e ().size2 (), bad_size ());
Chris@16:         typedef R conformant_restrict_type;
Chris@16:         typedef typename M::size_type size_type;
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         typedef typename M::value_type value_type;
Chris@16:         std::vector<std::pair<size_type, size_type> > index;
Chris@16:         typename M::iterator2 it2 (m.begin2 ());
Chris@16:         typename M::iterator2 it2_end (m.end2 ());
Chris@16:         typename E::const_iterator2 it2e (e ().begin2 ());
Chris@16:         typename E::const_iterator2 it2e_end (e ().end2 ());
Chris@16:         while (it2 != it2_end && it2e != it2e_end) {
Chris@16:             difference_type compare = it2.index2 () - it2e.index2 ();
Chris@16:             if (compare == 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                 typename M::iterator1 it1 (it2.begin ());
Chris@16:                 typename M::iterator1 it1_end (it2.end ());
Chris@16:                 typename E::const_iterator1 it1e (it2e.begin ());
Chris@16:                 typename E::const_iterator1 it1e_end (it2e.end ());
Chris@16: #else
Chris@16:                 typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:                 typename M::iterator1 it1_end (end (it2, iterator2_tag ()));
Chris@16:                 typename E::const_iterator1 it1e (begin (it2e, iterator2_tag ()));
Chris@16:                 typename E::const_iterator1 it1e_end (end (it2e, iterator2_tag ()));
Chris@16: #endif
Chris@16:                 if (it1 != it1_end && it1e != it1e_end) {
Chris@16:                     size_type it1_index = it1.index1 (), it1e_index = it1e.index1 ();
Chris@16:                     while (true) {
Chris@101:                         difference_type compare2 = it1_index - it1e_index;
Chris@101:                         if (compare2 == 0) {
Chris@16:                             ++ it1, ++ it1e;
Chris@16:                             if (it1 != it1_end && it1e != it1e_end) {
Chris@16:                                 it1_index = it1.index1 ();
Chris@16:                                 it1e_index = it1e.index1 ();
Chris@16:                             } else
Chris@16:                                 break;
Chris@101:                         } else if (compare2 < 0) {
Chris@101:                             increment (it1, it1_end, - compare2);
Chris@16:                             if (it1 != it1_end)
Chris@16:                                 it1_index = it1.index1 ();
Chris@16:                             else
Chris@16:                                 break;
Chris@101:                         } else if (compare2 > 0) {
Chris@16:                             if (conformant_restrict_type::other (it1e.index1 (), it1e.index2 ()))
Chris@16:                                 if (static_cast<value_type>(*it1e) != value_type/*zero*/())
Chris@16:                                     index.push_back (std::pair<size_type, size_type> (it1e.index1 (), it1e.index2 ()));
Chris@16:                             ++ it1e;
Chris@16:                             if (it1e != it1e_end)
Chris@16:                                 it1e_index = it1e.index1 ();
Chris@16:                             else
Chris@16:                                 break;
Chris@16:                         }
Chris@16:                     }
Chris@16:                 }
Chris@16:                 while (it1e != it1e_end) {
Chris@16:                     if (conformant_restrict_type::other (it1e.index1 (), it1e.index2 ()))
Chris@16:                         if (static_cast<value_type>(*it1e) != value_type/*zero*/())
Chris@16:                             index.push_back (std::pair<size_type, size_type> (it1e.index1 (), it1e.index2 ()));
Chris@16:                     ++ it1e;
Chris@16:                 }
Chris@16:                 ++ it2, ++ it2e;
Chris@16:             } else if (compare < 0) {
Chris@16:                 increment (it2, it2_end, - compare);
Chris@16:             } else if (compare > 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                 typename E::const_iterator1 it1e (it2e.begin ());
Chris@16:                 typename E::const_iterator1 it1e_end (it2e.end ());
Chris@16: #else
Chris@16:                 typename E::const_iterator1 it1e (begin (it2e, iterator2_tag ()));
Chris@16:                 typename E::const_iterator1 it1e_end (end (it2e, iterator2_tag ()));
Chris@16: #endif
Chris@16:                 while (it1e != it1e_end) {
Chris@16:                     if (conformant_restrict_type::other (it1e.index1 (), it1e.index2 ()))
Chris@16:                         if (static_cast<value_type>(*it1e) != value_type/*zero*/())
Chris@16:                             index.push_back (std::pair<size_type, size_type> (it1e.index1 (), it1e.index2 ()));
Chris@16:                     ++ it1e;
Chris@16:                 }
Chris@16:                 ++ it2e;
Chris@16:             }
Chris@16:         }
Chris@16:         while (it2e != it2e_end) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename E::const_iterator1 it1e (it2e.begin ());
Chris@16:             typename E::const_iterator1 it1e_end (it2e.end ());
Chris@16: #else
Chris@16:             typename E::const_iterator1 it1e (begin (it2e, iterator2_tag ()));
Chris@16:             typename E::const_iterator1 it1e_end (end (it2e, iterator2_tag ()));
Chris@16: #endif
Chris@16:             while (it1e != it1e_end) {
Chris@16:                 if (conformant_restrict_type::other (it1e.index1 (), it1e.index2 ()))
Chris@16:                     if (static_cast<value_type>(*it1e) != value_type/*zero*/())
Chris@16:                         index.push_back (std::pair<size_type, size_type> (it1e.index1 (), it1e.index2 ()));
Chris@16:                 ++ it1e;
Chris@16:             }
Chris@16:             ++ it2e;
Chris@16:         }
Chris@16:         // ISSUE proxies require insert_element
Chris@16:         for (size_type k = 0; k < index.size (); ++ k)
Chris@16:             m (index [k].first, index [k].second) = value_type/*zero*/();
Chris@16:     }
Chris@16: 
Chris@16: }//namespace detail
Chris@16: 
Chris@16: 
Chris@16:     // Explicitly iterating row major
Chris@16:     template<template <class T1, class T2> class F, class M, class T>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void iterating_matrix_assign_scalar (M &m, const T &t, row_major_tag) {
Chris@16:         typedef F<typename M::iterator2::reference, T> functor_type;
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         difference_type size1 (m.size1 ());
Chris@16:         difference_type size2 (m.size2 ());
Chris@16:         typename M::iterator1 it1 (m.begin1 ());
Chris@16:         BOOST_UBLAS_CHECK (size2 == 0 || m.end1 () - it1 == size1, bad_size ());
Chris@16:         while (-- size1 >= 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator2 it2 (it1.begin ());
Chris@16: #else
Chris@16:             typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16: #endif
Chris@16:             BOOST_UBLAS_CHECK (it1.end () - it2 == size2, bad_size ());
Chris@16:             difference_type temp_size2 (size2);
Chris@16: #ifndef BOOST_UBLAS_USE_DUFF_DEVICE
Chris@16:             while (-- temp_size2 >= 0)
Chris@16:                 functor_type::apply (*it2, t), ++ it2;
Chris@16: #else
Chris@16:             DD (temp_size2, 4, r, (functor_type::apply (*it2, t), ++ it2));
Chris@16: #endif
Chris@16:             ++ it1;
Chris@16:         }
Chris@16:     }
Chris@16:     // Explicitly iterating column major
Chris@16:     template<template <class T1, class T2> class F, class M, class T>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void iterating_matrix_assign_scalar (M &m, const T &t, column_major_tag) {
Chris@16:         typedef F<typename M::iterator1::reference, T> functor_type;
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         difference_type size2 (m.size2 ());
Chris@16:         difference_type size1 (m.size1 ());
Chris@16:         typename M::iterator2 it2 (m.begin2 ());
Chris@16:         BOOST_UBLAS_CHECK (size1 == 0 || m.end2 () - it2 == size2, bad_size ());
Chris@16:         while (-- size2 >= 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator1 it1 (it2.begin ());
Chris@16: #else
Chris@16:             typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16: #endif
Chris@16:             BOOST_UBLAS_CHECK (it2.end () - it1 == size1, bad_size ());
Chris@16:             difference_type temp_size1 (size1);
Chris@16: #ifndef BOOST_UBLAS_USE_DUFF_DEVICE
Chris@16:             while (-- temp_size1 >= 0)
Chris@16:                 functor_type::apply (*it1, t), ++ it1;
Chris@16: #else
Chris@16:             DD (temp_size1, 4, r, (functor_type::apply (*it1, t), ++ it1));
Chris@16: #endif
Chris@16:             ++ it2;
Chris@16:         }
Chris@16:     }
Chris@16:     // Explicitly indexing row major
Chris@16:     template<template <class T1, class T2> class F, class M, class T>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void indexing_matrix_assign_scalar (M &m, const T &t, row_major_tag) {
Chris@16:         typedef F<typename M::reference, T> functor_type;
Chris@16:         typedef typename M::size_type size_type;
Chris@16:         size_type size1 (m.size1 ());
Chris@16:         size_type size2 (m.size2 ());
Chris@16:         for (size_type i = 0; i < size1; ++ i) {
Chris@16: #ifndef BOOST_UBLAS_USE_DUFF_DEVICE
Chris@16:             for (size_type j = 0; j < size2; ++ j)
Chris@16:                 functor_type::apply (m (i, j), t);
Chris@16: #else
Chris@16:             size_type j (0);
Chris@16:             DD (size2, 4, r, (functor_type::apply (m (i, j), t), ++ j));
Chris@16: #endif
Chris@16:         }
Chris@16:     }
Chris@16:     // Explicitly indexing column major
Chris@16:     template<template <class T1, class T2> class F, class M, class T>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void indexing_matrix_assign_scalar (M &m, const T &t, column_major_tag) {
Chris@16:         typedef F<typename M::reference, T> functor_type;
Chris@16:         typedef typename M::size_type size_type;
Chris@16:         size_type size2 (m.size2 ());
Chris@16:         size_type size1 (m.size1 ());
Chris@16:         for (size_type j = 0; j < size2; ++ j) {
Chris@16: #ifndef BOOST_UBLAS_USE_DUFF_DEVICE
Chris@16:             for (size_type i = 0; i < size1; ++ i)
Chris@16:                 functor_type::apply (m (i, j), t);
Chris@16: #else
Chris@16:             size_type i (0);
Chris@16:             DD (size1, 4, r, (functor_type::apply (m (i, j), t), ++ i));
Chris@16: #endif
Chris@16:         }
Chris@16:     }
Chris@16: 
Chris@16:     // Dense (proxy) case
Chris@16:     template<template <class T1, class T2> class F, class M, class T, class C>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_assign_scalar (M &m, const T &t, dense_proxy_tag, C) {
Chris@16:         typedef C orientation_category;
Chris@16: #ifdef BOOST_UBLAS_USE_INDEXING
Chris@16:         indexing_matrix_assign_scalar<F> (m, t, orientation_category ());
Chris@16: #elif BOOST_UBLAS_USE_ITERATING
Chris@16:         iterating_matrix_assign_scalar<F> (m, t, orientation_category ());
Chris@16: #else
Chris@16:         typedef typename M::size_type size_type;
Chris@16:         size_type size1 (m.size1 ());
Chris@16:         size_type size2 (m.size2 ());
Chris@16:         if (size1 >= BOOST_UBLAS_ITERATOR_THRESHOLD &&
Chris@16:             size2 >= BOOST_UBLAS_ITERATOR_THRESHOLD)
Chris@16:             iterating_matrix_assign_scalar<F> (m, t, orientation_category ());
Chris@16:         else
Chris@16:             indexing_matrix_assign_scalar<F> (m, t, orientation_category ());
Chris@16: #endif
Chris@16:     }
Chris@16:     // Packed (proxy) row major case
Chris@16:     template<template <class T1, class T2> class F, class M, class T>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_assign_scalar (M &m, const T &t, packed_proxy_tag, row_major_tag) {
Chris@16:         typedef F<typename M::iterator2::reference, T> functor_type;
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         typename M::iterator1 it1 (m.begin1 ());
Chris@16:         difference_type size1 (m.end1 () - it1);
Chris@16:         while (-- size1 >= 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator2 it2 (it1.begin ());
Chris@16:             difference_type size2 (it1.end () - it2);
Chris@16: #else
Chris@16:             typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:             difference_type size2 (end (it1, iterator1_tag ()) - it2);
Chris@16: #endif
Chris@16:             while (-- size2 >= 0)
Chris@16:                 functor_type::apply (*it2, t), ++ it2;
Chris@16:             ++ it1;
Chris@16:         }
Chris@16:     }
Chris@16:     // Packed (proxy) column major case
Chris@16:     template<template <class T1, class T2> class F, class M, class T>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_assign_scalar (M &m, const T &t, packed_proxy_tag, column_major_tag) {
Chris@16:         typedef F<typename M::iterator1::reference, T> functor_type;
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         typename M::iterator2 it2 (m.begin2 ());
Chris@16:         difference_type size2 (m.end2 () - it2);
Chris@16:         while (-- size2 >= 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator1 it1 (it2.begin ());
Chris@16:             difference_type size1 (it2.end () - it1);
Chris@16: #else
Chris@16:             typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:             difference_type size1 (end (it2, iterator2_tag ()) - it1);
Chris@16: #endif
Chris@16:             while (-- size1 >= 0)
Chris@16:                 functor_type::apply (*it1, t), ++ it1;
Chris@16:             ++ it2;
Chris@16:         }
Chris@16:     }
Chris@16:     // Sparse (proxy) row major case
Chris@16:     template<template <class T1, class T2> class F, class M, class T>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_assign_scalar (M &m, const T &t, sparse_proxy_tag, row_major_tag) {
Chris@16:         typedef F<typename M::iterator2::reference, T> functor_type;
Chris@16:         typename M::iterator1 it1 (m.begin1 ());
Chris@16:         typename M::iterator1 it1_end (m.end1 ());
Chris@16:         while (it1 != it1_end) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator2 it2 (it1.begin ());
Chris@16:             typename M::iterator2 it2_end (it1.end ());
Chris@16: #else
Chris@16:             typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:             typename M::iterator2 it2_end (end (it1, iterator1_tag ()));
Chris@16: #endif
Chris@16:             while (it2 != it2_end)
Chris@16:                 functor_type::apply (*it2, t), ++ it2;
Chris@16:             ++ it1;
Chris@16:         }
Chris@16:     }
Chris@16:     // Sparse (proxy) column major case
Chris@16:     template<template <class T1, class T2> class F, class M, class T>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_assign_scalar (M &m, const T &t, sparse_proxy_tag, column_major_tag) {
Chris@16:         typedef F<typename M::iterator1::reference, T> functor_type;
Chris@16:         typename M::iterator2 it2 (m.begin2 ());
Chris@16:         typename M::iterator2 it2_end (m.end2 ());
Chris@16:         while (it2 != it2_end) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator1 it1 (it2.begin ());
Chris@16:             typename M::iterator1 it1_end (it2.end ());
Chris@16: #else
Chris@16:             typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:             typename M::iterator1 it1_end (end (it2, iterator2_tag ()));
Chris@16: #endif
Chris@16:             while (it1 != it1_end)
Chris@16:                 functor_type::apply (*it1, t), ++ it1;
Chris@16:             ++ it2;
Chris@16:         }
Chris@16:     }
Chris@16: 
Chris@16:     // Dispatcher
Chris@16:     template<template <class T1, class T2> class F, class M, class T>
Chris@16:     BOOST_UBLAS_INLINE
Chris@16:     void matrix_assign_scalar (M &m, const T &t) {
Chris@16:         typedef typename M::storage_category storage_category;
Chris@16:         typedef typename M::orientation_category orientation_category;
Chris@16:         matrix_assign_scalar<F> (m, t, storage_category (), orientation_category ());
Chris@16:     }
Chris@16: 
Chris@16:     template<class SC, bool COMPUTED, class RI1, class RI2>
Chris@16:     struct matrix_assign_traits {
Chris@16:         typedef SC storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<bool COMPUTED>
Chris@16:     struct matrix_assign_traits<dense_tag, COMPUTED, packed_random_access_iterator_tag, packed_random_access_iterator_tag> {
Chris@16:         typedef packed_tag storage_category;
Chris@16:     };
Chris@16:     template<>
Chris@16:     struct matrix_assign_traits<dense_tag, false, sparse_bidirectional_iterator_tag, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_tag storage_category;
Chris@16:     };
Chris@16:     template<>
Chris@16:     struct matrix_assign_traits<dense_tag, true, sparse_bidirectional_iterator_tag, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<bool COMPUTED>
Chris@16:     struct matrix_assign_traits<dense_proxy_tag, COMPUTED, packed_random_access_iterator_tag, packed_random_access_iterator_tag> {
Chris@16:         typedef packed_proxy_tag storage_category;
Chris@16:     };
Chris@16:     template<bool COMPUTED>
Chris@16:     struct matrix_assign_traits<dense_proxy_tag, COMPUTED, sparse_bidirectional_iterator_tag, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<>
Chris@16:     struct matrix_assign_traits<packed_tag, false, sparse_bidirectional_iterator_tag, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_tag storage_category;
Chris@16:     };
Chris@16:     template<>
Chris@16:     struct matrix_assign_traits<packed_tag, true, sparse_bidirectional_iterator_tag, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<bool COMPUTED>
Chris@16:     struct matrix_assign_traits<packed_proxy_tag, COMPUTED, sparse_bidirectional_iterator_tag, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<>
Chris@16:     struct matrix_assign_traits<sparse_tag, true, dense_random_access_iterator_tag, dense_random_access_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16:     template<>
Chris@16:     struct matrix_assign_traits<sparse_tag, true, packed_random_access_iterator_tag, packed_random_access_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16:     template<>
Chris@16:     struct matrix_assign_traits<sparse_tag, true, sparse_bidirectional_iterator_tag, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     // Explicitly iterating row major
Chris@16:     template<template <class T1, class T2> class F, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void iterating_matrix_assign (M &m, const matrix_expression<E> &e, row_major_tag) {
Chris@16:         typedef F<typename M::iterator2::reference, typename E::value_type> functor_type;
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         difference_type size1 (BOOST_UBLAS_SAME (m.size1 (), e ().size1 ()));
Chris@16:         difference_type size2 (BOOST_UBLAS_SAME (m.size2 (), e ().size2 ()));
Chris@16:         typename M::iterator1 it1 (m.begin1 ());
Chris@16:         BOOST_UBLAS_CHECK (size2 == 0 || m.end1 () - it1 == size1, bad_size ());
Chris@16:         typename E::const_iterator1 it1e (e ().begin1 ());
Chris@16:         BOOST_UBLAS_CHECK (size2 == 0 || e ().end1 () - it1e == size1, bad_size ());
Chris@16:         while (-- size1 >= 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator2 it2 (it1.begin ());
Chris@16:             typename E::const_iterator2 it2e (it1e.begin ());
Chris@16: #else
Chris@16:             typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:             typename E::const_iterator2 it2e (begin (it1e, iterator1_tag ()));
Chris@16: #endif
Chris@16:             BOOST_UBLAS_CHECK (it1.end () - it2 == size2, bad_size ());
Chris@16:             BOOST_UBLAS_CHECK (it1e.end () - it2e == size2, bad_size ());
Chris@16:             difference_type temp_size2 (size2);
Chris@16: #ifndef BOOST_UBLAS_USE_DUFF_DEVICE
Chris@16:             while (-- temp_size2 >= 0)
Chris@16:                 functor_type::apply (*it2, *it2e), ++ it2, ++ it2e;
Chris@16: #else
Chris@16:             DD (temp_size2, 2, r, (functor_type::apply (*it2, *it2e), ++ it2, ++ it2e));
Chris@16: #endif
Chris@16:             ++ it1, ++ it1e;
Chris@16:         }
Chris@16:     }
Chris@16:     // Explicitly iterating column major
Chris@16:     template<template <class T1, class T2> class F, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void iterating_matrix_assign (M &m, const matrix_expression<E> &e, column_major_tag) {
Chris@16:         typedef F<typename M::iterator1::reference, typename E::value_type> functor_type;
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         difference_type size2 (BOOST_UBLAS_SAME (m.size2 (), e ().size2 ()));
Chris@16:         difference_type size1 (BOOST_UBLAS_SAME (m.size1 (), e ().size1 ()));
Chris@16:         typename M::iterator2 it2 (m.begin2 ());
Chris@16:         BOOST_UBLAS_CHECK (size1 == 0 || m.end2 () - it2 == size2, bad_size ());
Chris@16:         typename E::const_iterator2 it2e (e ().begin2 ());
Chris@16:         BOOST_UBLAS_CHECK (size1 == 0 || e ().end2 () - it2e == size2, bad_size ());
Chris@16:         while (-- size2 >= 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator1 it1 (it2.begin ());
Chris@16:             typename E::const_iterator1 it1e (it2e.begin ());
Chris@16: #else
Chris@16:             typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:             typename E::const_iterator1 it1e (begin (it2e, iterator2_tag ()));
Chris@16: #endif
Chris@16:             BOOST_UBLAS_CHECK (it2.end () - it1 == size1, bad_size ());
Chris@16:             BOOST_UBLAS_CHECK (it2e.end () - it1e == size1, bad_size ());
Chris@16:             difference_type temp_size1 (size1);
Chris@16: #ifndef BOOST_UBLAS_USE_DUFF_DEVICE
Chris@16:             while (-- temp_size1 >= 0)
Chris@16:                 functor_type::apply (*it1, *it1e), ++ it1, ++ it1e;
Chris@16: #else
Chris@16:             DD (temp_size1, 2, r, (functor_type::apply (*it1, *it1e), ++ it1, ++ it1e));
Chris@16: #endif
Chris@16:             ++ it2, ++ it2e;
Chris@16:         }
Chris@16:     }
Chris@16:     // Explicitly indexing row major
Chris@16:     template<template <class T1, class T2> class F, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void indexing_matrix_assign (M &m, const matrix_expression<E> &e, row_major_tag) {
Chris@16:         typedef F<typename M::reference, typename E::value_type> functor_type;
Chris@16:         typedef typename M::size_type size_type;
Chris@16:         size_type size1 (BOOST_UBLAS_SAME (m.size1 (), e ().size1 ()));
Chris@16:         size_type size2 (BOOST_UBLAS_SAME (m.size2 (), e ().size2 ()));
Chris@16:         for (size_type i = 0; i < size1; ++ i) {
Chris@16: #ifndef BOOST_UBLAS_USE_DUFF_DEVICE
Chris@16:             for (size_type j = 0; j < size2; ++ j)
Chris@16:                 functor_type::apply (m (i, j), e () (i, j));
Chris@16: #else
Chris@16:             size_type j (0);
Chris@16:             DD (size2, 2, r, (functor_type::apply (m (i, j), e () (i, j)), ++ j));
Chris@16: #endif
Chris@16:         }
Chris@16:     }
Chris@16:     // Explicitly indexing column major
Chris@16:     template<template <class T1, class T2> class F, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void indexing_matrix_assign (M &m, const matrix_expression<E> &e, column_major_tag) {
Chris@16:         typedef F<typename M::reference, typename E::value_type> functor_type;
Chris@16:         typedef typename M::size_type size_type;
Chris@16:         size_type size2 (BOOST_UBLAS_SAME (m.size2 (), e ().size2 ()));
Chris@16:         size_type size1 (BOOST_UBLAS_SAME (m.size1 (), e ().size1 ()));
Chris@16:         for (size_type j = 0; j < size2; ++ j) {
Chris@16: #ifndef BOOST_UBLAS_USE_DUFF_DEVICE
Chris@16:             for (size_type i = 0; i < size1; ++ i)
Chris@16:                 functor_type::apply (m (i, j), e () (i, j));
Chris@16: #else
Chris@16:             size_type i (0);
Chris@16:             DD (size1, 2, r, (functor_type::apply (m (i, j), e () (i, j)), ++ i));
Chris@16: #endif
Chris@16:         }
Chris@16:     }
Chris@16: 
Chris@16:     // Dense (proxy) case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E, class C>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_assign (M &m, const matrix_expression<E> &e, dense_proxy_tag, C) {
Chris@16:         // R unnecessary, make_conformant not required
Chris@16:         typedef C orientation_category;
Chris@16: #ifdef BOOST_UBLAS_USE_INDEXING
Chris@16:         indexing_matrix_assign<F> (m, e, orientation_category ());
Chris@16: #elif BOOST_UBLAS_USE_ITERATING
Chris@16:         iterating_matrix_assign<F> (m, e, orientation_category ());
Chris@16: #else
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         size_type size1 (BOOST_UBLAS_SAME (m.size1 (), e ().size1 ()));
Chris@16:         size_type size2 (BOOST_UBLAS_SAME (m.size2 (), e ().size2 ()));
Chris@16:         if (size1 >= BOOST_UBLAS_ITERATOR_THRESHOLD &&
Chris@16:             size2 >= BOOST_UBLAS_ITERATOR_THRESHOLD)
Chris@16:             iterating_matrix_assign<F> (m, e, orientation_category ());
Chris@16:         else
Chris@16:             indexing_matrix_assign<F> (m, e, orientation_category ());
Chris@16: #endif
Chris@16:     }
Chris@16:     // Packed (proxy) row major case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_assign (M &m, const matrix_expression<E> &e, packed_proxy_tag, row_major_tag) {
Chris@16:         typedef typename matrix_traits<E>::value_type expr_value_type;
Chris@16:         typedef F<typename M::iterator2::reference, expr_value_type> functor_type;
Chris@16:         // R unnecessary, make_conformant not required
Chris@16:         typedef typename M::difference_type difference_type;
Chris@101: 
Chris@16:         BOOST_UBLAS_CHECK (m.size1 () == e ().size1 (), bad_size ());
Chris@16:         BOOST_UBLAS_CHECK (m.size2 () == e ().size2 (), bad_size ());
Chris@101: 
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@101:         typedef typename M::value_type value_type;
Chris@16:         matrix<value_type, row_major> cm (m.size1 (), m.size2 ());
Chris@16:         indexing_matrix_assign<scalar_assign> (cm, m, row_major_tag ());
Chris@16:         indexing_matrix_assign<F> (cm, e, row_major_tag ());
Chris@16: #endif
Chris@16:         typename M::iterator1 it1 (m.begin1 ());
Chris@16:         typename M::iterator1 it1_end (m.end1 ());
Chris@16:         typename E::const_iterator1 it1e (e ().begin1 ());
Chris@16:         typename E::const_iterator1 it1e_end (e ().end1 ());
Chris@16:         difference_type it1_size (it1_end - it1);
Chris@16:         difference_type it1e_size (it1e_end - it1e);
Chris@16:         difference_type diff1 (0);
Chris@16:         if (it1_size > 0 && it1e_size > 0)
Chris@16:             diff1 = it1.index1 () - it1e.index1 ();
Chris@16:         if (diff1 != 0) {
Chris@16:             difference_type size1 = (std::min) (diff1, it1e_size);
Chris@16:             if (size1 > 0) {
Chris@16:                 it1e += size1;
Chris@16:                 it1e_size -= size1;
Chris@16:                 diff1 -= size1;
Chris@16:             }
Chris@16:             size1 = (std::min) (- diff1, it1_size);
Chris@16:             if (size1 > 0) {
Chris@16:                 it1_size -= size1;
Chris@16:                 if (!functor_type::computed) {
Chris@16:                     while (-- size1 >= 0) { // zeroing
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                         typename M::iterator2 it2 (it1.begin ());
Chris@16:                         typename M::iterator2 it2_end (it1.end ());
Chris@16: #else
Chris@16:                         typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:                         typename M::iterator2 it2_end (end (it1, iterator1_tag ()));
Chris@16: #endif
Chris@16:                         difference_type size2 (it2_end - it2);
Chris@16:                         while (-- size2 >= 0)
Chris@16:                             functor_type::apply (*it2, expr_value_type/*zero*/()), ++ it2;
Chris@16:                         ++ it1;
Chris@16:                     }
Chris@16:                 } else {
Chris@16:                     it1 += size1;
Chris@16:                 }
Chris@16:                 diff1 += size1;
Chris@16:             }
Chris@16:         }
Chris@16:         difference_type size1 ((std::min) (it1_size, it1e_size));
Chris@16:         it1_size -= size1;
Chris@16:         it1e_size -= size1;
Chris@16:         while (-- size1 >= 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator2 it2 (it1.begin ());
Chris@16:             typename M::iterator2 it2_end (it1.end ());
Chris@16:             typename E::const_iterator2 it2e (it1e.begin ());
Chris@16:             typename E::const_iterator2 it2e_end (it1e.end ());
Chris@16: #else
Chris@16:             typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:             typename M::iterator2 it2_end (end (it1, iterator1_tag ()));
Chris@16:             typename E::const_iterator2 it2e (begin (it1e, iterator1_tag ()));
Chris@16:             typename E::const_iterator2 it2e_end (end (it1e, iterator1_tag ()));
Chris@16: #endif
Chris@16:             difference_type it2_size (it2_end - it2);
Chris@16:             difference_type it2e_size (it2e_end - it2e);
Chris@16:             difference_type diff2 (0);
Chris@16:             if (it2_size > 0 && it2e_size > 0) {
Chris@16:                 diff2 = it2.index2 () - it2e.index2 ();
Chris@16:                 difference_type size2 = (std::min) (diff2, it2e_size);
Chris@16:                 if (size2 > 0) {
Chris@16:                     it2e += size2;
Chris@16:                     it2e_size -= size2;
Chris@16:                     diff2 -= size2;
Chris@16:                 }
Chris@16:                 size2 = (std::min) (- diff2, it2_size);
Chris@16:                 if (size2 > 0) {
Chris@16:                     it2_size -= size2;
Chris@16:                     if (!functor_type::computed) {
Chris@16:                         while (-- size2 >= 0)   // zeroing
Chris@16:                             functor_type::apply (*it2, expr_value_type/*zero*/()), ++ it2;
Chris@16:                     } else {
Chris@16:                         it2 += size2;
Chris@16:                     }
Chris@16:                     diff2 += size2;
Chris@16:                 }
Chris@16:             }
Chris@16:             difference_type size2 ((std::min) (it2_size, it2e_size));
Chris@16:             it2_size -= size2;
Chris@16:             it2e_size -= size2;
Chris@16:             while (-- size2 >= 0)
Chris@16:                 functor_type::apply (*it2, *it2e), ++ it2, ++ it2e;
Chris@16:             size2 = it2_size;
Chris@16:             if (!functor_type::computed) {
Chris@16:                 while (-- size2 >= 0)   // zeroing
Chris@16:                     functor_type::apply (*it2, expr_value_type/*zero*/()), ++ it2;
Chris@16:             } else {
Chris@16:                 it2 += size2;
Chris@16:             }
Chris@16:             ++ it1, ++ it1e;
Chris@16:         }
Chris@16:         size1 = it1_size;
Chris@16:         if (!functor_type::computed) {
Chris@16:             while (-- size1 >= 0) { // zeroing
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                 typename M::iterator2 it2 (it1.begin ());
Chris@16:                 typename M::iterator2 it2_end (it1.end ());
Chris@16: #else
Chris@16:                 typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:                 typename M::iterator2 it2_end (end (it1, iterator1_tag ()));
Chris@16: #endif
Chris@16:                 difference_type size2 (it2_end - it2);
Chris@16:                 while (-- size2 >= 0)
Chris@16:                     functor_type::apply (*it2, expr_value_type/*zero*/()), ++ it2;
Chris@16:                 ++ it1;
Chris@16:             }
Chris@16:         } else {
Chris@16:             it1 += size1;
Chris@16:         }
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:         if (! disable_type_check<bool>::value)
Chris@16:             BOOST_UBLAS_CHECK (detail::expression_type_check (m, cm), external_logic ());
Chris@16: #endif
Chris@16:     }
Chris@16:     // Packed (proxy) column major case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_assign (M &m, const matrix_expression<E> &e, packed_proxy_tag, column_major_tag) {
Chris@16:         typedef typename matrix_traits<E>::value_type expr_value_type;
Chris@16:         typedef F<typename M::iterator1::reference, expr_value_type> functor_type;
Chris@16:         // R unnecessary, make_conformant not required
Chris@16:         typedef typename M::difference_type difference_type;
Chris@101: 
Chris@16:         BOOST_UBLAS_CHECK (m.size2 () == e ().size2 (), bad_size ());
Chris@16:         BOOST_UBLAS_CHECK (m.size1 () == e ().size1 (), bad_size ());
Chris@101: 
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@101:         typedef typename M::value_type value_type;
Chris@16:         matrix<value_type, column_major> cm (m.size1 (), m.size2 ());
Chris@16:         indexing_matrix_assign<scalar_assign> (cm, m, column_major_tag ());
Chris@16:         indexing_matrix_assign<F> (cm, e, column_major_tag ());
Chris@16: #endif
Chris@16:         typename M::iterator2 it2 (m.begin2 ());
Chris@16:         typename M::iterator2 it2_end (m.end2 ());
Chris@16:         typename E::const_iterator2 it2e (e ().begin2 ());
Chris@16:         typename E::const_iterator2 it2e_end (e ().end2 ());
Chris@16:         difference_type it2_size (it2_end - it2);
Chris@16:         difference_type it2e_size (it2e_end - it2e);
Chris@16:         difference_type diff2 (0);
Chris@16:         if (it2_size > 0 && it2e_size > 0)
Chris@16:             diff2 = it2.index2 () - it2e.index2 ();
Chris@16:         if (diff2 != 0) {
Chris@16:             difference_type size2 = (std::min) (diff2, it2e_size);
Chris@16:             if (size2 > 0) {
Chris@16:                 it2e += size2;
Chris@16:                 it2e_size -= size2;
Chris@16:                 diff2 -= size2;
Chris@16:             }
Chris@16:             size2 = (std::min) (- diff2, it2_size);
Chris@16:             if (size2 > 0) {
Chris@16:                 it2_size -= size2;
Chris@16:                 if (!functor_type::computed) {
Chris@16:                     while (-- size2 >= 0) { // zeroing
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                         typename M::iterator1 it1 (it2.begin ());
Chris@16:                         typename M::iterator1 it1_end (it2.end ());
Chris@16: #else
Chris@16:                         typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:                         typename M::iterator1 it1_end (end (it2, iterator2_tag ()));
Chris@16: #endif
Chris@16:                         difference_type size1 (it1_end - it1);
Chris@16:                         while (-- size1 >= 0)
Chris@16:                             functor_type::apply (*it1, expr_value_type/*zero*/()), ++ it1;
Chris@16:                         ++ it2;
Chris@16:                     }
Chris@16:                 } else {
Chris@16:                     it2 += size2;
Chris@16:                 }
Chris@16:                 diff2 += size2;
Chris@16:             }
Chris@16:         }
Chris@16:         difference_type size2 ((std::min) (it2_size, it2e_size));
Chris@16:         it2_size -= size2;
Chris@16:         it2e_size -= size2;
Chris@16:         while (-- size2 >= 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator1 it1 (it2.begin ());
Chris@16:             typename M::iterator1 it1_end (it2.end ());
Chris@16:             typename E::const_iterator1 it1e (it2e.begin ());
Chris@16:             typename E::const_iterator1 it1e_end (it2e.end ());
Chris@16: #else
Chris@16:             typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:             typename M::iterator1 it1_end (end (it2, iterator2_tag ()));
Chris@16:             typename E::const_iterator1 it1e (begin (it2e, iterator2_tag ()));
Chris@16:             typename E::const_iterator1 it1e_end (end (it2e, iterator2_tag ()));
Chris@16: #endif
Chris@16:             difference_type it1_size (it1_end - it1);
Chris@16:             difference_type it1e_size (it1e_end - it1e);
Chris@16:             difference_type diff1 (0);
Chris@16:             if (it1_size > 0 && it1e_size > 0) {
Chris@16:                 diff1 = it1.index1 () - it1e.index1 ();
Chris@16:                 difference_type size1 = (std::min) (diff1, it1e_size);
Chris@16:                 if (size1 > 0) {
Chris@16:                     it1e += size1;
Chris@16:                     it1e_size -= size1;
Chris@16:                     diff1 -= size1;
Chris@16:                 }
Chris@16:                 size1 = (std::min) (- diff1, it1_size);
Chris@16:                 if (size1 > 0) {
Chris@16:                     it1_size -= size1;
Chris@16:                     if (!functor_type::computed) {
Chris@16:                         while (-- size1 >= 0)   // zeroing
Chris@16:                             functor_type::apply (*it1, expr_value_type/*zero*/()), ++ it1;
Chris@16:                     } else {
Chris@16:                         it1 += size1;
Chris@16:                     }
Chris@16:                     diff1 += size1;
Chris@16:                 }
Chris@16:             }
Chris@16:             difference_type size1 ((std::min) (it1_size, it1e_size));
Chris@16:             it1_size -= size1;
Chris@16:             it1e_size -= size1;
Chris@16:             while (-- size1 >= 0)
Chris@16:                 functor_type::apply (*it1, *it1e), ++ it1, ++ it1e;
Chris@16:             size1 = it1_size;
Chris@16:             if (!functor_type::computed) {
Chris@16:                 while (-- size1 >= 0)   // zeroing
Chris@16:                     functor_type::apply (*it1, expr_value_type/*zero*/()), ++ it1;
Chris@16:             } else {
Chris@16:                 it1 += size1;
Chris@16:             }
Chris@16:             ++ it2, ++ it2e;
Chris@16:         }
Chris@16:         size2 = it2_size;
Chris@16:         if (!functor_type::computed) {
Chris@16:             while (-- size2 >= 0) { // zeroing
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                 typename M::iterator1 it1 (it2.begin ());
Chris@16:                 typename M::iterator1 it1_end (it2.end ());
Chris@16: #else
Chris@16:                 typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:                 typename M::iterator1 it1_end (end (it2, iterator2_tag ()));
Chris@16: #endif
Chris@16:                 difference_type size1 (it1_end - it1);
Chris@16:                 while (-- size1 >= 0)
Chris@16:                     functor_type::apply (*it1, expr_value_type/*zero*/()), ++ it1;
Chris@16:                 ++ it2;
Chris@16:             }
Chris@16:         } else {
Chris@16:             it2 += size2;
Chris@16:         }
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:         if (! disable_type_check<bool>::value)
Chris@16:             BOOST_UBLAS_CHECK (detail::expression_type_check (m, cm), external_logic ());
Chris@16: #endif
Chris@16:     }
Chris@16:     // Sparse row major case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_assign (M &m, const matrix_expression<E> &e, sparse_tag, row_major_tag) {
Chris@16:         typedef F<typename M::iterator2::reference, typename E::value_type> functor_type;
Chris@16:         // R unnecessary, make_conformant not required
Chris@16:         BOOST_STATIC_ASSERT ((!functor_type::computed));
Chris@16:         BOOST_UBLAS_CHECK (m.size1 () == e ().size1 (), bad_size ());
Chris@16:         BOOST_UBLAS_CHECK (m.size2 () == e ().size2 (), bad_size ());
Chris@16:         typedef typename M::value_type value_type;
Chris@16:         // Sparse type has no numeric constraints to check
Chris@16: 
Chris@16:         m.clear ();
Chris@16:         typename E::const_iterator1 it1e (e ().begin1 ());
Chris@16:         typename E::const_iterator1 it1e_end (e ().end1 ());
Chris@16:         while (it1e != it1e_end) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename E::const_iterator2 it2e (it1e.begin ());
Chris@16:             typename E::const_iterator2 it2e_end (it1e.end ());
Chris@16: #else
Chris@16:             typename E::const_iterator2 it2e (begin (it1e, iterator1_tag ()));
Chris@16:             typename E::const_iterator2 it2e_end (end (it1e, iterator1_tag ()));
Chris@16: #endif
Chris@16:             while (it2e != it2e_end) {
Chris@16:                 value_type t (*it2e);
Chris@16:                 if (t != value_type/*zero*/())
Chris@16:                     m.insert_element (it2e.index1 (), it2e.index2 (), t);
Chris@16:                 ++ it2e;
Chris@16:             }
Chris@16:             ++ it1e;
Chris@16:         }
Chris@16:     }
Chris@16:     // Sparse column major case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_assign (M &m, const matrix_expression<E> &e, sparse_tag, column_major_tag) {
Chris@16:         typedef F<typename M::iterator1::reference, typename E::value_type> functor_type;
Chris@16:         // R unnecessary, make_conformant not required
Chris@16:         BOOST_STATIC_ASSERT ((!functor_type::computed));
Chris@16:         BOOST_UBLAS_CHECK (m.size1 () == e ().size1 (), bad_size ());
Chris@16:         BOOST_UBLAS_CHECK (m.size2 () == e ().size2 (), bad_size ());
Chris@16:         typedef typename M::value_type value_type;
Chris@16:         // Sparse type has no numeric constraints to check
Chris@16: 
Chris@16:         m.clear ();
Chris@16:         typename E::const_iterator2 it2e (e ().begin2 ());
Chris@16:         typename E::const_iterator2 it2e_end (e ().end2 ());
Chris@16:         while (it2e != it2e_end) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename E::const_iterator1 it1e (it2e.begin ());
Chris@16:             typename E::const_iterator1 it1e_end (it2e.end ());
Chris@16: #else
Chris@16:             typename E::const_iterator1 it1e (begin (it2e, iterator2_tag ()));
Chris@16:             typename E::const_iterator1 it1e_end (end (it2e, iterator2_tag ()));
Chris@16: #endif
Chris@16:             while (it1e != it1e_end) {
Chris@16:                 value_type t (*it1e);
Chris@16:                 if (t != value_type/*zero*/())
Chris@16:                     m.insert_element (it1e.index1 (), it1e.index2 (), t);
Chris@16:                 ++ it1e;
Chris@16:             }
Chris@16:             ++ it2e;
Chris@16:         }
Chris@16:     }
Chris@16:     // Sparse proxy or functional row major case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_assign (M &m, const matrix_expression<E> &e, sparse_proxy_tag, row_major_tag) {
Chris@16:         typedef typename matrix_traits<E>::value_type expr_value_type;
Chris@16:         typedef F<typename M::iterator2::reference, expr_value_type> functor_type;
Chris@16:         typedef R conformant_restrict_type;
Chris@16:         typedef typename M::size_type size_type;
Chris@16:         typedef typename M::difference_type difference_type;
Chris@101: 
Chris@16:         BOOST_UBLAS_CHECK (m.size1 () == e ().size1 (), bad_size ());
Chris@16:         BOOST_UBLAS_CHECK (m.size2 () == e ().size2 (), bad_size ());
Chris@101: 
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@101:         typedef typename M::value_type value_type;
Chris@16:         matrix<value_type, row_major> cm (m.size1 (), m.size2 ());
Chris@16:         indexing_matrix_assign<scalar_assign> (cm, m, row_major_tag ());
Chris@16:         indexing_matrix_assign<F> (cm, e, row_major_tag ());
Chris@16: #endif
Chris@16:         detail::make_conformant (m, e, row_major_tag (), conformant_restrict_type ());
Chris@16: 
Chris@16:         typename M::iterator1 it1 (m.begin1 ());
Chris@16:         typename M::iterator1 it1_end (m.end1 ());
Chris@16:         typename E::const_iterator1 it1e (e ().begin1 ());
Chris@16:         typename E::const_iterator1 it1e_end (e ().end1 ());
Chris@16:         while (it1 != it1_end && it1e != it1e_end) {
Chris@16:             difference_type compare = it1.index1 () - it1e.index1 ();
Chris@16:             if (compare == 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                 typename M::iterator2 it2 (it1.begin ());
Chris@16:                 typename M::iterator2 it2_end (it1.end ());
Chris@16:                 typename E::const_iterator2 it2e (it1e.begin ());
Chris@16:                 typename E::const_iterator2 it2e_end (it1e.end ());
Chris@16: #else
Chris@16:                 typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:                 typename M::iterator2 it2_end (end (it1, iterator1_tag ()));
Chris@16:                 typename E::const_iterator2 it2e (begin (it1e, iterator1_tag ()));
Chris@16:                 typename E::const_iterator2 it2e_end (end (it1e, iterator1_tag ()));
Chris@16: #endif
Chris@16:                 if (it2 != it2_end && it2e != it2e_end) {
Chris@16:                     size_type it2_index = it2.index2 (), it2e_index = it2e.index2 ();
Chris@16:                     while (true) {
Chris@101:                         difference_type compare2 = it2_index - it2e_index;
Chris@101:                         if (compare2 == 0) {
Chris@16:                             functor_type::apply (*it2, *it2e);
Chris@16:                             ++ it2, ++ it2e;
Chris@16:                             if (it2 != it2_end && it2e != it2e_end) {
Chris@16:                                 it2_index = it2.index2 ();
Chris@16:                                 it2e_index = it2e.index2 ();
Chris@16:                             } else
Chris@16:                                 break;
Chris@101:                         } else if (compare2 < 0) {
Chris@16:                             if (!functor_type::computed) {
Chris@16:                                 functor_type::apply (*it2, expr_value_type/*zero*/());
Chris@16:                                 ++ it2;
Chris@16:                             } else
Chris@101:                                 increment (it2, it2_end, - compare2);
Chris@16:                             if (it2 != it2_end)
Chris@16:                                 it2_index = it2.index2 ();
Chris@16:                             else
Chris@16:                                 break;
Chris@101:                         } else if (compare2 > 0) {
Chris@101:                             increment (it2e, it2e_end, compare2);
Chris@16:                             if (it2e != it2e_end)
Chris@16:                                 it2e_index = it2e.index2 ();
Chris@16:                             else
Chris@16:                                 break;
Chris@16:                         }
Chris@16:                     }
Chris@16:                 }
Chris@16:                 if (!functor_type::computed) {
Chris@16:                     while (it2 != it2_end) {    // zeroing
Chris@16:                         functor_type::apply (*it2, expr_value_type/*zero*/());
Chris@16:                         ++ it2;
Chris@16:                     }
Chris@16:                 } else {
Chris@16:                     it2 = it2_end;
Chris@16:                 }
Chris@16:                 ++ it1, ++ it1e;
Chris@16:             } else if (compare < 0) {
Chris@16:                 if (!functor_type::computed) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                     typename M::iterator2 it2 (it1.begin ());
Chris@16:                     typename M::iterator2 it2_end (it1.end ());
Chris@16: #else
Chris@16:                     typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:                     typename M::iterator2 it2_end (end (it1, iterator1_tag ()));
Chris@16: #endif
Chris@16:                     while (it2 != it2_end) {    // zeroing
Chris@16:                         functor_type::apply (*it2, expr_value_type/*zero*/());
Chris@16:                         ++ it2;
Chris@16:                     }
Chris@16:                     ++ it1;
Chris@16:                 } else {
Chris@16:                     increment (it1, it1_end, - compare);
Chris@16:                 }
Chris@16:             } else if (compare > 0) {
Chris@16:                 increment (it1e, it1e_end, compare);
Chris@16:             }
Chris@16:         }
Chris@16:         if (!functor_type::computed) {
Chris@16:             while (it1 != it1_end) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                 typename M::iterator2 it2 (it1.begin ());
Chris@16:                 typename M::iterator2 it2_end (it1.end ());
Chris@16: #else
Chris@16:                 typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:                 typename M::iterator2 it2_end (end (it1, iterator1_tag ()));
Chris@16: #endif
Chris@16:                 while (it2 != it2_end) {    // zeroing
Chris@16:                     functor_type::apply (*it2, expr_value_type/*zero*/());
Chris@16:                     ++ it2;
Chris@16:                 }
Chris@16:                 ++ it1;
Chris@16:             }
Chris@16:         } else {
Chris@16:             it1 = it1_end;
Chris@16:         }
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:         if (! disable_type_check<bool>::value)
Chris@16:             BOOST_UBLAS_CHECK (detail::expression_type_check (m, cm), external_logic ());
Chris@16: #endif
Chris@16:     }
Chris@16:     // Sparse proxy or functional column major case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_assign (M &m, const matrix_expression<E> &e, sparse_proxy_tag, column_major_tag) {
Chris@16:         typedef typename matrix_traits<E>::value_type expr_value_type;
Chris@16:         typedef F<typename M::iterator1::reference, expr_value_type> functor_type;
Chris@16:         typedef R conformant_restrict_type;
Chris@16:         typedef typename M::size_type size_type;
Chris@16:         typedef typename M::difference_type difference_type;
Chris@101: 
Chris@16:         BOOST_UBLAS_CHECK (m.size1 () == e ().size1 (), bad_size ());
Chris@16:         BOOST_UBLAS_CHECK (m.size2 () == e ().size2 (), bad_size ());
Chris@101: 
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@101:         typedef typename M::value_type value_type;
Chris@16:         matrix<value_type, column_major> cm (m.size1 (), m.size2 ());
Chris@16:         indexing_matrix_assign<scalar_assign> (cm, m, column_major_tag ());
Chris@16:         indexing_matrix_assign<F> (cm, e, column_major_tag ());
Chris@16: #endif
Chris@16:         detail::make_conformant (m, e, column_major_tag (), conformant_restrict_type ());
Chris@16: 
Chris@16:         typename M::iterator2 it2 (m.begin2 ());
Chris@16:         typename M::iterator2 it2_end (m.end2 ());
Chris@16:         typename E::const_iterator2 it2e (e ().begin2 ());
Chris@16:         typename E::const_iterator2 it2e_end (e ().end2 ());
Chris@16:         while (it2 != it2_end && it2e != it2e_end) {
Chris@16:             difference_type compare = it2.index2 () - it2e.index2 ();
Chris@16:             if (compare == 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                 typename M::iterator1 it1 (it2.begin ());
Chris@16:                 typename M::iterator1 it1_end (it2.end ());
Chris@16:                 typename E::const_iterator1 it1e (it2e.begin ());
Chris@16:                 typename E::const_iterator1 it1e_end (it2e.end ());
Chris@16: #else
Chris@16:                 typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:                 typename M::iterator1 it1_end (end (it2, iterator2_tag ()));
Chris@16:                 typename E::const_iterator1 it1e (begin (it2e, iterator2_tag ()));
Chris@16:                 typename E::const_iterator1 it1e_end (end (it2e, iterator2_tag ()));
Chris@16: #endif
Chris@16:                 if (it1 != it1_end && it1e != it1e_end) {
Chris@16:                     size_type it1_index = it1.index1 (), it1e_index = it1e.index1 ();
Chris@16:                     while (true) {
Chris@101:                         difference_type compare2 = it1_index - it1e_index;
Chris@101:                         if (compare2 == 0) {
Chris@16:                             functor_type::apply (*it1, *it1e);
Chris@16:                             ++ it1, ++ it1e;
Chris@16:                             if (it1 != it1_end && it1e != it1e_end) {
Chris@16:                                 it1_index = it1.index1 ();
Chris@16:                                 it1e_index = it1e.index1 ();
Chris@16:                             } else
Chris@16:                                 break;
Chris@101:                         } else if (compare2 < 0) {
Chris@16:                             if (!functor_type::computed) {
Chris@16:                                 functor_type::apply (*it1, expr_value_type/*zero*/()); // zeroing
Chris@16:                                 ++ it1;
Chris@16:                             } else
Chris@101:                                 increment (it1, it1_end, - compare2);
Chris@16:                             if (it1 != it1_end)
Chris@16:                                 it1_index = it1.index1 ();
Chris@16:                             else
Chris@16:                                 break;
Chris@101:                         } else if (compare2 > 0) {
Chris@101:                             increment (it1e, it1e_end, compare2);
Chris@16:                             if (it1e != it1e_end)
Chris@16:                                 it1e_index = it1e.index1 ();
Chris@16:                             else
Chris@16:                                 break;
Chris@16:                         }
Chris@16:                     }
Chris@16:                 }
Chris@16:                 if (!functor_type::computed) {
Chris@16:                     while (it1 != it1_end) {    // zeroing
Chris@16:                         functor_type::apply (*it1, expr_value_type/*zero*/());
Chris@16:                         ++ it1;
Chris@16:                     }
Chris@16:                 } else {
Chris@16:                     it1 = it1_end;
Chris@16:                 }
Chris@16:                 ++ it2, ++ it2e;
Chris@16:             } else if (compare < 0) {
Chris@16:                 if (!functor_type::computed) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                     typename M::iterator1 it1 (it2.begin ());
Chris@16:                     typename M::iterator1 it1_end (it2.end ());
Chris@16: #else
Chris@16:                     typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:                     typename M::iterator1 it1_end (end (it2, iterator2_tag ()));
Chris@16: #endif
Chris@16:                     while (it1 != it1_end) {    // zeroing
Chris@16:                         functor_type::apply (*it1, expr_value_type/*zero*/());
Chris@16:                         ++ it1;
Chris@16:                     }
Chris@16:                     ++ it2;
Chris@16:                 } else {
Chris@16:                     increment (it2, it2_end, - compare);
Chris@16:                 }
Chris@16:             } else if (compare > 0) {
Chris@16:                 increment (it2e, it2e_end, compare);
Chris@16:             }
Chris@16:         }
Chris@16:         if (!functor_type::computed) {
Chris@16:             while (it2 != it2_end) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                 typename M::iterator1 it1 (it2.begin ());
Chris@16:                 typename M::iterator1 it1_end (it2.end ());
Chris@16: #else
Chris@16:                 typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:                 typename M::iterator1 it1_end (end (it2, iterator2_tag ()));
Chris@16: #endif
Chris@16:                 while (it1 != it1_end) {    // zeroing
Chris@16:                     functor_type::apply (*it1, expr_value_type/*zero*/());
Chris@16:                     ++ it1;
Chris@16:                 }
Chris@16:                 ++ it2;
Chris@16:             }
Chris@16:         } else {
Chris@16:             it2 = it2_end;
Chris@16:         }
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:         if (! disable_type_check<bool>::value)
Chris@16:             BOOST_UBLAS_CHECK (detail::expression_type_check (m, cm), external_logic ());
Chris@16: #endif
Chris@16:     }
Chris@16: 
Chris@16:     // Dispatcher
Chris@16:     template<template <class T1, class T2> class F, class M, class E>
Chris@16:     BOOST_UBLAS_INLINE
Chris@16:     void matrix_assign (M &m, const matrix_expression<E> &e) {
Chris@16:         typedef typename matrix_assign_traits<typename M::storage_category,
Chris@16:                                               F<typename M::reference, typename E::value_type>::computed,
Chris@16:                                               typename E::const_iterator1::iterator_category,
Chris@16:                                               typename E::const_iterator2::iterator_category>::storage_category storage_category;
Chris@16:         // give preference to matrix M's orientation if known
Chris@16:         typedef typename boost::mpl::if_<boost::is_same<typename M::orientation_category, unknown_orientation_tag>,
Chris@16:                                           typename E::orientation_category ,
Chris@16:                                           typename M::orientation_category >::type orientation_category;
Chris@16:         typedef basic_full<typename M::size_type> unrestricted;
Chris@16:         matrix_assign<F, unrestricted> (m, e, storage_category (), orientation_category ());
Chris@16:     }
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     BOOST_UBLAS_INLINE
Chris@16:     void matrix_assign (M &m, const matrix_expression<E> &e) {
Chris@16:         typedef R conformant_restrict_type;
Chris@16:         typedef typename matrix_assign_traits<typename M::storage_category,
Chris@16:                                               F<typename M::reference, typename E::value_type>::computed,
Chris@16:                                               typename E::const_iterator1::iterator_category,
Chris@16:                                               typename E::const_iterator2::iterator_category>::storage_category storage_category;
Chris@16:         // give preference to matrix M's orientation if known
Chris@16:         typedef typename boost::mpl::if_<boost::is_same<typename M::orientation_category, unknown_orientation_tag>,
Chris@16:                                           typename E::orientation_category ,
Chris@16:                                           typename M::orientation_category >::type orientation_category;
Chris@16:         matrix_assign<F, conformant_restrict_type> (m, e, storage_category (), orientation_category ());
Chris@16:     }
Chris@16: 
Chris@16:     template<class SC, class RI1, class RI2>
Chris@16:     struct matrix_swap_traits {
Chris@16:         typedef SC storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<>
Chris@16:     struct matrix_swap_traits<dense_proxy_tag, sparse_bidirectional_iterator_tag, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<>
Chris@16:     struct matrix_swap_traits<packed_proxy_tag, sparse_bidirectional_iterator_tag, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     // Dense (proxy) row major case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_swap (M &m, matrix_expression<E> &e, dense_proxy_tag, row_major_tag) {
Chris@16:         typedef F<typename M::iterator2::reference, typename E::reference> functor_type;
Chris@16:         // R unnecessary, make_conformant not required
Chris@101:         //typedef typename M::size_type size_type; // gcc is complaining that this is not used, although this is not right
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         typename M::iterator1 it1 (m.begin1 ());
Chris@16:         typename E::iterator1 it1e (e ().begin1 ());
Chris@101:         difference_type size1 (BOOST_UBLAS_SAME (m.size1 (), typename M::size_type (e ().end1 () - it1e)));
Chris@16:         while (-- size1 >= 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator2 it2 (it1.begin ());
Chris@16:             typename E::iterator2 it2e (it1e.begin ());
Chris@101:             difference_type size2 (BOOST_UBLAS_SAME (m.size2 (), typename M::size_type (it1e.end () - it2e)));
Chris@16: #else
Chris@16:             typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:             typename E::iterator2 it2e (begin (it1e, iterator1_tag ()));
Chris@101:             difference_type size2 (BOOST_UBLAS_SAME (m.size2 (), typename M::size_type (end (it1e, iterator1_tag ()) - it2e)));
Chris@16: #endif
Chris@16:             while (-- size2 >= 0)
Chris@16:                 functor_type::apply (*it2, *it2e), ++ it2, ++ it2e;
Chris@16:             ++ it1, ++ it1e;
Chris@16:         }
Chris@16:     }
Chris@16:     // Dense (proxy) column major case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_swap (M &m, matrix_expression<E> &e, dense_proxy_tag, column_major_tag) {
Chris@16:         typedef F<typename M::iterator1::reference, typename E::reference> functor_type;
Chris@16:         // R unnecessary, make_conformant not required
Chris@101:         // typedef typename M::size_type size_type; // gcc is complaining that this is not used, although this is not right
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         typename M::iterator2 it2 (m.begin2 ());
Chris@16:         typename E::iterator2 it2e (e ().begin2 ());
Chris@101:         difference_type size2 (BOOST_UBLAS_SAME (m.size2 (), typename M::size_type (e ().end2 () - it2e)));
Chris@16:         while (-- size2 >= 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator1 it1 (it2.begin ());
Chris@16:             typename E::iterator1 it1e (it2e.begin ());
Chris@101:             difference_type size1 (BOOST_UBLAS_SAME (m.size1 (), typename M::size_type (it2e.end () - it1e)));
Chris@16: #else
Chris@16:             typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:             typename E::iterator1 it1e (begin (it2e, iterator2_tag ()));
Chris@101:             difference_type size1 (BOOST_UBLAS_SAME (m.size1 (), typename M::size_type (end (it2e, iterator2_tag ()) - it1e)));
Chris@16: #endif
Chris@16:             while (-- size1 >= 0)
Chris@16:                 functor_type::apply (*it1, *it1e), ++ it1, ++ it1e;
Chris@16:             ++ it2, ++ it2e;
Chris@16:         }
Chris@16:     }
Chris@16:     // Packed (proxy) row major case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_swap (M &m, matrix_expression<E> &e, packed_proxy_tag, row_major_tag) {
Chris@16:         typedef F<typename M::iterator2::reference, typename E::reference> functor_type;
Chris@16:         // R unnecessary, make_conformant not required
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         typename M::iterator1 it1 (m.begin1 ());
Chris@16:         typename E::iterator1 it1e (e ().begin1 ());
Chris@16:         difference_type size1 (BOOST_UBLAS_SAME (m.end1 () - it1, e ().end1 () - it1e));
Chris@16:         while (-- size1 >= 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator2 it2 (it1.begin ());
Chris@16:             typename E::iterator2 it2e (it1e.begin ());
Chris@16:             difference_type size2 (BOOST_UBLAS_SAME (it1.end () - it2, it1e.end () - it2e));
Chris@16: #else
Chris@16:             typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:             typename E::iterator2 it2e (begin (it1e, iterator1_tag ()));
Chris@16:             difference_type size2 (BOOST_UBLAS_SAME (end (it1, iterator1_tag ()) - it2, end (it1e, iterator1_tag ()) - it2e));
Chris@16: #endif
Chris@16:             while (-- size2 >= 0)
Chris@16:                 functor_type::apply (*it2, *it2e), ++ it2, ++ it2e;
Chris@16:             ++ it1, ++ it1e;
Chris@16:         }
Chris@16:     }
Chris@16:     // Packed (proxy) column major case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_swap (M &m, matrix_expression<E> &e, packed_proxy_tag, column_major_tag) {
Chris@16:         typedef F<typename M::iterator1::reference, typename E::reference> functor_type;
Chris@16:         // R unnecessary, make_conformant not required
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         typename M::iterator2 it2 (m.begin2 ());
Chris@16:         typename E::iterator2 it2e (e ().begin2 ());
Chris@16:         difference_type size2 (BOOST_UBLAS_SAME (m.end2 () - it2, e ().end2 () - it2e));
Chris@16:         while (-- size2 >= 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator1 it1 (it2.begin ());
Chris@16:             typename E::iterator1 it1e (it2e.begin ());
Chris@16:             difference_type size1 (BOOST_UBLAS_SAME (it2.end () - it1, it2e.end () - it1e));
Chris@16: #else
Chris@16:             typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:             typename E::iterator1 it1e (begin (it2e, iterator2_tag ()));
Chris@16:             difference_type size1 (BOOST_UBLAS_SAME (end (it2, iterator2_tag ()) - it1, end (it2e, iterator2_tag ()) - it1e));
Chris@16: #endif
Chris@16:             while (-- size1 >= 0)
Chris@16:                 functor_type::apply (*it1, *it1e), ++ it1, ++ it1e;
Chris@16:             ++ it2, ++ it2e;
Chris@16:         }
Chris@16:     }
Chris@16:     // Sparse (proxy) row major case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_swap (M &m, matrix_expression<E> &e, sparse_proxy_tag, row_major_tag) {
Chris@16:         typedef F<typename M::iterator2::reference, typename E::reference> functor_type;
Chris@16:         typedef R conformant_restrict_type;
Chris@16:         typedef typename M::size_type size_type;
Chris@16:         typedef typename M::difference_type difference_type;
Chris@16:         BOOST_UBLAS_CHECK (m.size1 () == e ().size1 (), bad_size ());
Chris@16:         BOOST_UBLAS_CHECK (m.size2 () == e ().size2 (), bad_size ());
Chris@16: 
Chris@16:         detail::make_conformant (m, e, row_major_tag (), conformant_restrict_type ());
Chris@16:         // FIXME should be a seperate restriction for E
Chris@16:         detail::make_conformant (e (), m, row_major_tag (), conformant_restrict_type ());
Chris@16: 
Chris@16:         typename M::iterator1 it1 (m.begin1 ());
Chris@16:         typename M::iterator1 it1_end (m.end1 ());
Chris@16:         typename E::iterator1 it1e (e ().begin1 ());
Chris@16:         typename E::iterator1 it1e_end (e ().end1 ());
Chris@16:         while (it1 != it1_end && it1e != it1e_end) {
Chris@16:             difference_type compare = it1.index1 () - it1e.index1 ();
Chris@16:             if (compare == 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                 typename M::iterator2 it2 (it1.begin ());
Chris@16:                 typename M::iterator2 it2_end (it1.end ());
Chris@16:                 typename E::iterator2 it2e (it1e.begin ());
Chris@16:                 typename E::iterator2 it2e_end (it1e.end ());
Chris@16: #else
Chris@16:                 typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:                 typename M::iterator2 it2_end (end (it1, iterator1_tag ()));
Chris@16:                 typename E::iterator2 it2e (begin (it1e, iterator1_tag ()));
Chris@16:                 typename E::iterator2 it2e_end (end (it1e, iterator1_tag ()));
Chris@16: #endif
Chris@16:                 if (it2 != it2_end && it2e != it2e_end) {
Chris@16:                     size_type it2_index = it2.index2 (), it2e_index = it2e.index2 ();
Chris@16:                     while (true) {
Chris@101:                         difference_type compare2 = it2_index - it2e_index;
Chris@101:                         if (compare2 == 0) {
Chris@16:                             functor_type::apply (*it2, *it2e);
Chris@16:                             ++ it2, ++ it2e;
Chris@16:                             if (it2 != it2_end && it2e != it2e_end) {
Chris@16:                                 it2_index = it2.index2 ();
Chris@16:                                 it2e_index = it2e.index2 ();
Chris@16:                             } else
Chris@16:                                 break;
Chris@101:                         } else if (compare2 < 0) {
Chris@101:                             increment (it2, it2_end, - compare2);
Chris@16:                             if (it2 != it2_end)
Chris@16:                                 it2_index = it2.index2 ();
Chris@16:                             else
Chris@16:                                 break;
Chris@101:                         } else if (compare2 > 0) {
Chris@101:                             increment (it2e, it2e_end, compare2);
Chris@16:                             if (it2e != it2e_end)
Chris@16:                                 it2e_index = it2e.index2 ();
Chris@16:                             else
Chris@16:                                 break;
Chris@16:                         }
Chris@16:                     }
Chris@16:                 }
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:                 increment (it2e, it2e_end);
Chris@16:                 increment (it2, it2_end);
Chris@16: #endif
Chris@16:                 ++ it1, ++ it1e;
Chris@16:             } else if (compare < 0) {
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:                 while (it1.index1 () < it1e.index1 ()) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                     typename M::iterator2 it2 (it1.begin ());
Chris@16:                     typename M::iterator2 it2_end (it1.end ());
Chris@16: #else
Chris@16:                     typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:                     typename M::iterator2 it2_end (end (it1, iterator1_tag ()));
Chris@16: #endif
Chris@16:                     increment (it2, it2_end);
Chris@16:                     ++ it1;
Chris@16:                 }
Chris@16: #else
Chris@16:                 increment (it1, it1_end, - compare);
Chris@16: #endif
Chris@16:             } else if (compare > 0) {
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:                 while (it1e.index1 () < it1.index1 ()) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                     typename E::iterator2 it2e (it1e.begin ());
Chris@16:                     typename E::iterator2 it2e_end (it1e.end ());
Chris@16: #else
Chris@16:                     typename E::iterator2 it2e (begin (it1e, iterator1_tag ()));
Chris@16:                     typename E::iterator2 it2e_end (end (it1e, iterator1_tag ()));
Chris@16: #endif
Chris@16:                     increment (it2e, it2e_end);
Chris@16:                     ++ it1e;
Chris@16:                 }
Chris@16: #else
Chris@16:                 increment (it1e, it1e_end, compare);
Chris@16: #endif
Chris@16:             }
Chris@16:         }
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:         while (it1e != it1e_end) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename E::iterator2 it2e (it1e.begin ());
Chris@16:             typename E::iterator2 it2e_end (it1e.end ());
Chris@16: #else
Chris@16:             typename E::iterator2 it2e (begin (it1e, iterator1_tag ()));
Chris@16:             typename E::iterator2 it2e_end (end (it1e, iterator1_tag ()));
Chris@16: #endif
Chris@16:             increment (it2e, it2e_end);
Chris@16:             ++ it1e;
Chris@16:         }
Chris@16:         while (it1 != it1_end) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator2 it2 (it1.begin ());
Chris@16:             typename M::iterator2 it2_end (it1.end ());
Chris@16: #else
Chris@16:             typename M::iterator2 it2 (begin (it1, iterator1_tag ()));
Chris@16:             typename M::iterator2 it2_end (end (it1, iterator1_tag ()));
Chris@16: #endif
Chris@16:             increment (it2, it2_end);
Chris@16:             ++ it1;
Chris@16:         }
Chris@16: #endif
Chris@16:     }
Chris@16:     // Sparse (proxy) column major case
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it.
Chris@16:     void matrix_swap (M &m, matrix_expression<E> &e, sparse_proxy_tag, column_major_tag) {
Chris@16:         typedef F<typename M::iterator1::reference, typename E::reference> functor_type;
Chris@16:         typedef R conformant_restrict_type;
Chris@16:         typedef typename M::size_type size_type;
Chris@16:         typedef typename M::difference_type difference_type;
Chris@101: 
Chris@16:         BOOST_UBLAS_CHECK (m.size1 () == e ().size1 (), bad_size ());
Chris@16:         BOOST_UBLAS_CHECK (m.size2 () == e ().size2 (), bad_size ());
Chris@16: 
Chris@16:         detail::make_conformant (m, e, column_major_tag (), conformant_restrict_type ());
Chris@16:         // FIXME should be a seperate restriction for E
Chris@16:         detail::make_conformant (e (), m, column_major_tag (), conformant_restrict_type ());
Chris@16: 
Chris@16:         typename M::iterator2 it2 (m.begin2 ());
Chris@16:         typename M::iterator2 it2_end (m.end2 ());
Chris@16:         typename E::iterator2 it2e (e ().begin2 ());
Chris@16:         typename E::iterator2 it2e_end (e ().end2 ());
Chris@16:         while (it2 != it2_end && it2e != it2e_end) {
Chris@16:             difference_type compare = it2.index2 () - it2e.index2 ();
Chris@16:             if (compare == 0) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                 typename M::iterator1 it1 (it2.begin ());
Chris@16:                 typename M::iterator1 it1_end (it2.end ());
Chris@16:                 typename E::iterator1 it1e (it2e.begin ());
Chris@16:                 typename E::iterator1 it1e_end (it2e.end ());
Chris@16: #else
Chris@16:                 typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:                 typename M::iterator1 it1_end (end (it2, iterator2_tag ()));
Chris@16:                 typename E::iterator1 it1e (begin (it2e, iterator2_tag ()));
Chris@16:                 typename E::iterator1 it1e_end (end (it2e, iterator2_tag ()));
Chris@16: #endif
Chris@16:                 if (it1 != it1_end && it1e != it1e_end) {
Chris@16:                     size_type it1_index = it1.index1 (), it1e_index = it1e.index1 ();
Chris@16:                     while (true) {
Chris@101:                         difference_type compare2 = it1_index - it1e_index;
Chris@101:                         if (compare2 == 0) {
Chris@16:                             functor_type::apply (*it1, *it1e);
Chris@16:                             ++ it1, ++ it1e;
Chris@16:                             if (it1 != it1_end && it1e != it1e_end) {
Chris@16:                                 it1_index = it1.index1 ();
Chris@16:                                 it1e_index = it1e.index1 ();
Chris@16:                             } else
Chris@16:                                 break;
Chris@101:                         }  else if (compare2 < 0) {
Chris@101:                             increment (it1, it1_end, - compare2);
Chris@16:                             if (it1 != it1_end)
Chris@16:                                 it1_index = it1.index1 ();
Chris@16:                             else
Chris@16:                                 break;
Chris@101:                         } else if (compare2 > 0) {
Chris@101:                             increment (it1e, it1e_end, compare2);
Chris@16:                             if (it1e != it1e_end)
Chris@16:                                 it1e_index = it1e.index1 ();
Chris@16:                             else
Chris@16:                                 break;
Chris@16:                         }
Chris@16:                     }
Chris@16:                 }
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:                 increment (it1e, it1e_end);
Chris@16:                 increment (it1, it1_end);
Chris@16: #endif
Chris@16:                 ++ it2, ++ it2e;
Chris@16:             } else if (compare < 0) {
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:                 while (it2.index2 () < it2e.index2 ()) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                     typename M::iterator1 it1 (it2.begin ());
Chris@16:                     typename M::iterator1 it1_end (it2.end ());
Chris@16: #else
Chris@16:                     typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:                     typename M::iterator1 it1_end (end (it2, iterator2_tag ()));
Chris@16: #endif
Chris@16:                     increment (it1, it1_end);
Chris@16:                     ++ it2;
Chris@16:                 }
Chris@16: #else
Chris@16:                 increment (it2, it2_end, - compare);
Chris@16: #endif
Chris@16:             } else if (compare > 0) {
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:                 while (it2e.index2 () < it2.index2 ()) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:                     typename E::iterator1 it1e (it2e.begin ());
Chris@16:                     typename E::iterator1 it1e_end (it2e.end ());
Chris@16: #else
Chris@16:                     typename E::iterator1 it1e (begin (it2e, iterator2_tag ()));
Chris@16:                     typename E::iterator1 it1e_end (end (it2e, iterator2_tag ()));
Chris@16: #endif
Chris@16:                     increment (it1e, it1e_end);
Chris@16:                     ++ it2e;
Chris@16:                 }
Chris@16: #else
Chris@16:                 increment (it2e, it2e_end, compare);
Chris@16: #endif
Chris@16:             }
Chris@16:         }
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:         while (it2e != it2e_end) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename E::iterator1 it1e (it2e.begin ());
Chris@16:             typename E::iterator1 it1e_end (it2e.end ());
Chris@16: #else
Chris@16:             typename E::iterator1 it1e (begin (it2e, iterator2_tag ()));
Chris@16:             typename E::iterator1 it1e_end (end (it2e, iterator2_tag ()));
Chris@16: #endif
Chris@16:             increment (it1e, it1e_end);
Chris@16:             ++ it2e;
Chris@16:         }
Chris@16:         while (it2 != it2_end) {
Chris@16: #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
Chris@16:             typename M::iterator1 it1 (it2.begin ());
Chris@16:             typename M::iterator1 it1_end (it2.end ());
Chris@16: #else
Chris@16:             typename M::iterator1 it1 (begin (it2, iterator2_tag ()));
Chris@16:             typename M::iterator1 it1_end (end (it2, iterator2_tag ()));
Chris@16: #endif
Chris@16:             increment (it1, it1_end);
Chris@16:             ++ it2;
Chris@16:         }
Chris@16: #endif
Chris@16:     }
Chris@16: 
Chris@16:     // Dispatcher
Chris@16:     template<template <class T1, class T2> class F, class M, class E>
Chris@16:     BOOST_UBLAS_INLINE
Chris@16:     void matrix_swap (M &m, matrix_expression<E> &e) {
Chris@16:         typedef typename matrix_swap_traits<typename M::storage_category,
Chris@16:                                             typename E::const_iterator1::iterator_category,
Chris@16:                                             typename E::const_iterator2::iterator_category>::storage_category storage_category;
Chris@16:         // give preference to matrix M's orientation if known
Chris@16:         typedef typename boost::mpl::if_<boost::is_same<typename M::orientation_category, unknown_orientation_tag>,
Chris@16:                                           typename E::orientation_category ,
Chris@16:                                           typename M::orientation_category >::type orientation_category;
Chris@16:         typedef basic_full<typename M::size_type> unrestricted;
Chris@16:         matrix_swap<F, unrestricted> (m, e, storage_category (), orientation_category ());
Chris@16:     }
Chris@16:     template<template <class T1, class T2> class F, class R, class M, class E>
Chris@16:     BOOST_UBLAS_INLINE
Chris@16:     void matrix_swap (M &m, matrix_expression<E> &e) {
Chris@16:         typedef R conformant_restrict_type;
Chris@16:         typedef typename matrix_swap_traits<typename M::storage_category,
Chris@16:                                             typename E::const_iterator1::iterator_category,
Chris@16:                                             typename E::const_iterator2::iterator_category>::storage_category storage_category;
Chris@16:         // give preference to matrix M's orientation if known
Chris@16:         typedef typename boost::mpl::if_<boost::is_same<typename M::orientation_category, unknown_orientation_tag>,
Chris@16:                                           typename E::orientation_category ,
Chris@16:                                           typename M::orientation_category >::type orientation_category;
Chris@16:         matrix_swap<F, conformant_restrict_type> (m, e, storage_category (), orientation_category ());
Chris@16:     }
Chris@16: 
Chris@16: }}}
Chris@16: 
Chris@16: #endif