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_VECTOR_ASSIGN_
Chris@16: #define _BOOST_UBLAS_VECTOR_ASSIGN_
Chris@16: 
Chris@16: #include <boost/numeric/ublas/functional.hpp> // scalar_assign
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 vector 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 vector_expression<E1> &e1, const vector_expression<E2> &e2, S epsilon, S min_norm) {
Chris@101:         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 vector_expression<E1> &e1, const vector_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:     // Make sparse proxies conformant
Chris@16:     template<class V, 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 make_conformant (V &v, const vector_expression<E> &e) {
Chris@16:         BOOST_UBLAS_CHECK (v.size () == e ().size (), bad_size ());
Chris@16:         typedef typename V::size_type size_type;
Chris@16:         typedef typename V::difference_type difference_type;
Chris@16:         typedef typename V::value_type value_type;
Chris@16:         // FIXME unbounded_array with push_back maybe better
Chris@16:         std::vector<size_type> index;
Chris@16:         typename V::iterator it (v.begin ());
Chris@16:         typename V::iterator it_end (v.end ());
Chris@16:         typename E::const_iterator ite (e ().begin ());
Chris@16:         typename E::const_iterator ite_end (e ().end ());
Chris@16:         if (it != it_end && ite != ite_end) {
Chris@16:             size_type it_index = it.index (), ite_index = ite.index ();
Chris@16:             while (true) {
Chris@16:                 difference_type compare = it_index - ite_index;
Chris@16:                 if (compare == 0) {
Chris@16:                     ++ it, ++ ite;
Chris@16:                     if (it != it_end && ite != ite_end) {
Chris@16:                         it_index = it.index ();
Chris@16:                         ite_index = ite.index ();
Chris@16:                     } else
Chris@16:                         break;
Chris@16:                 } else if (compare < 0) {
Chris@16:                     increment (it, it_end, - compare);
Chris@16:                     if (it != it_end)
Chris@16:                         it_index = it.index ();
Chris@16:                     else
Chris@16:                         break;
Chris@16:                 } else if (compare > 0) {
Chris@16:                     if (*ite != value_type/*zero*/())
Chris@16:                         index.push_back (ite.index ());
Chris@16:                     ++ ite;
Chris@16:                     if (ite != ite_end)
Chris@16:                         ite_index = ite.index ();
Chris@16:                     else
Chris@16:                         break;
Chris@16:                 }
Chris@16:             }
Chris@16:         }
Chris@16: 
Chris@16:         while (ite != ite_end) {
Chris@16:             if (*ite != value_type/*zero*/())
Chris@16:                 index.push_back (ite.index ());
Chris@16:             ++ ite;
Chris@16:         }
Chris@16:         for (size_type k = 0; k < index.size (); ++ k)
Chris@16:             v (index [k]) = value_type/*zero*/();
Chris@16:     }
Chris@16: 
Chris@16: }//namespace detail
Chris@16: 
Chris@16: 
Chris@16:     // Explicitly iterating
Chris@16:     template<template <class T1, class T2> class F, class V, 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_vector_assign_scalar (V &v, const T &t) {
Chris@16:         typedef F<typename V::iterator::reference, T> functor_type;
Chris@16:         typedef typename V::difference_type difference_type;
Chris@16:         difference_type size (v.size ());
Chris@16:         typename V::iterator it (v.begin ());
Chris@16:         BOOST_UBLAS_CHECK (v.end () - it == size, bad_size ());
Chris@16: #ifndef BOOST_UBLAS_USE_DUFF_DEVICE
Chris@16:         while (-- size >= 0)
Chris@16:             functor_type::apply (*it, t), ++ it;
Chris@16: #else
Chris@16:         DD (size, 4, r, (functor_type::apply (*it, t), ++ it));
Chris@16: #endif
Chris@16:     }
Chris@16:     // Explicitly case
Chris@16:     template<template <class T1, class T2> class F, class V, 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_vector_assign_scalar (V &v, const T &t) {
Chris@16:         typedef F<typename V::reference, T> functor_type;
Chris@16:         typedef typename V::size_type size_type;
Chris@16:         size_type size (v.size ());
Chris@16: #ifndef BOOST_UBLAS_USE_DUFF_DEVICE
Chris@16:         for (size_type i = 0; i < size; ++ i)
Chris@16:             functor_type::apply (v (i), t);
Chris@16: #else
Chris@16:         size_type i (0);
Chris@16:         DD (size, 4, r, (functor_type::apply (v (i), t), ++ i));
Chris@16: #endif
Chris@16:     }
Chris@16: 
Chris@16:     // Dense (proxy) case
Chris@16:     template<template <class T1, class T2> class F, class V, 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 vector_assign_scalar (V &v, const T &t, dense_proxy_tag) {
Chris@16: #ifdef BOOST_UBLAS_USE_INDEXING
Chris@16:         indexing_vector_assign_scalar<F> (v, t);
Chris@16: #elif BOOST_UBLAS_USE_ITERATING
Chris@16:         iterating_vector_assign_scalar<F> (v, t);
Chris@16: #else
Chris@16:         typedef typename V::size_type size_type;
Chris@16:         size_type size (v.size ());
Chris@16:         if (size >= BOOST_UBLAS_ITERATOR_THRESHOLD)
Chris@16:             iterating_vector_assign_scalar<F> (v, t);
Chris@16:         else
Chris@16:             indexing_vector_assign_scalar<F> (v, t);
Chris@16: #endif
Chris@16:     }
Chris@16:     // Packed (proxy) case
Chris@16:     template<template <class T1, class T2> class F, class V, 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 vector_assign_scalar (V &v, const T &t, packed_proxy_tag) {
Chris@16:         typedef F<typename V::iterator::reference, T> functor_type;
Chris@16:         typedef typename V::difference_type difference_type;
Chris@16:         typename V::iterator it (v.begin ());
Chris@16:         difference_type size (v.end () - it);
Chris@16:         while (-- size >= 0)
Chris@16:             functor_type::apply (*it, t), ++ it;
Chris@16:     }
Chris@16:     // Sparse (proxy) case
Chris@16:     template<template <class T1, class T2> class F, class V, 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 vector_assign_scalar (V &v, const T &t, sparse_proxy_tag) {
Chris@16:         typedef F<typename V::iterator::reference, T> functor_type;
Chris@16:         typename V::iterator it (v.begin ());
Chris@16:         typename V::iterator it_end (v.end ());
Chris@16:         while (it != it_end)
Chris@16:             functor_type::apply (*it, t), ++ it;
Chris@16:     }
Chris@16: 
Chris@16:     // Dispatcher
Chris@16:     template<template <class T1, class T2> class F, class V, class T>
Chris@16:     BOOST_UBLAS_INLINE
Chris@16:     void vector_assign_scalar (V &v, const T &t) {
Chris@16:         typedef typename V::storage_category storage_category;
Chris@16:         vector_assign_scalar<F> (v, t, storage_category ());
Chris@16:     }
Chris@16: 
Chris@16:     template<class SC, bool COMPUTED, class RI>
Chris@16:     struct vector_assign_traits {
Chris@16:         typedef SC storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<bool COMPUTED>
Chris@16:     struct vector_assign_traits<dense_tag, COMPUTED, packed_random_access_iterator_tag> {
Chris@16:         typedef packed_tag storage_category;
Chris@16:     };
Chris@16:     template<>
Chris@16:     struct vector_assign_traits<dense_tag, false, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_tag storage_category;
Chris@16:     };
Chris@16:     template<>
Chris@16:     struct vector_assign_traits<dense_tag, true, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<bool COMPUTED>
Chris@16:     struct vector_assign_traits<dense_proxy_tag, COMPUTED, packed_random_access_iterator_tag> {
Chris@16:         typedef packed_proxy_tag storage_category;
Chris@16:     };
Chris@16:     template<>
Chris@16:     struct vector_assign_traits<dense_proxy_tag, false, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16:     template<>
Chris@16:     struct vector_assign_traits<dense_proxy_tag, true, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<>
Chris@16:     struct vector_assign_traits<packed_tag, false, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_tag storage_category;
Chris@16:     };
Chris@16:     template<>
Chris@16:     struct vector_assign_traits<packed_tag, true, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<bool COMPUTED>
Chris@16:     struct vector_assign_traits<packed_proxy_tag, COMPUTED, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<>
Chris@16:     struct vector_assign_traits<sparse_tag, true, dense_random_access_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16:     template<>
Chris@16:     struct vector_assign_traits<sparse_tag, true, packed_random_access_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16:     template<>
Chris@16:     struct vector_assign_traits<sparse_tag, true, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     // Explicitly iterating
Chris@16:     template<template <class T1, class T2> class F, class V, 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_vector_assign (V &v, const vector_expression<E> &e) {
Chris@16:         typedef F<typename V::iterator::reference, typename E::value_type> functor_type;
Chris@16:         typedef typename V::difference_type difference_type;
Chris@16:         difference_type size (BOOST_UBLAS_SAME (v.size (), e ().size ()));
Chris@16:         typename V::iterator it (v.begin ());
Chris@16:         BOOST_UBLAS_CHECK (v.end () - it == size, bad_size ());
Chris@16:         typename E::const_iterator ite (e ().begin ());
Chris@16:         BOOST_UBLAS_CHECK (e ().end () - ite == size, bad_size ());
Chris@16: #ifndef BOOST_UBLAS_USE_DUFF_DEVICE
Chris@16:         while (-- size >= 0)
Chris@16:             functor_type::apply (*it, *ite), ++ it, ++ ite;
Chris@16: #else
Chris@16:         DD (size, 2, r, (functor_type::apply (*it, *ite), ++ it, ++ ite));
Chris@16: #endif
Chris@16:     }
Chris@16:     // Explicitly indexing
Chris@16:     template<template <class T1, class T2> class F, class V, 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_vector_assign (V &v, const vector_expression<E> &e) {
Chris@16:         typedef F<typename V::reference, typename E::value_type> functor_type;
Chris@16:         typedef typename V::size_type size_type;
Chris@16:         size_type size (BOOST_UBLAS_SAME (v.size (), e ().size ()));
Chris@16: #ifndef BOOST_UBLAS_USE_DUFF_DEVICE
Chris@16:         for (size_type i = 0; i < size; ++ i)
Chris@16:             functor_type::apply (v (i), e () (i));
Chris@16: #else
Chris@16:         size_type i (0);
Chris@16:         DD (size, 2, r, (functor_type::apply (v (i), e () (i)), ++ i));
Chris@16: #endif
Chris@16:     }
Chris@16: 
Chris@16:     // Dense (proxy) case
Chris@16:     template<template <class T1, class T2> class F, class V, 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 vector_assign (V &v, const vector_expression<E> &e, dense_proxy_tag) {
Chris@16: #ifdef BOOST_UBLAS_USE_INDEXING
Chris@16:         indexing_vector_assign<F> (v, e);
Chris@16: #elif BOOST_UBLAS_USE_ITERATING
Chris@16:         iterating_vector_assign<F> (v, e);
Chris@16: #else
Chris@16:         typedef typename V::size_type size_type;
Chris@16:         size_type size (BOOST_UBLAS_SAME (v.size (), e ().size ()));
Chris@16:         if (size >= BOOST_UBLAS_ITERATOR_THRESHOLD)
Chris@16:             iterating_vector_assign<F> (v, e);
Chris@16:         else
Chris@16:             indexing_vector_assign<F> (v, e);
Chris@16: #endif
Chris@16:     }
Chris@16:     // Packed (proxy) case
Chris@16:     template<template <class T1, class T2> class F, class V, 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 vector_assign (V &v, const vector_expression<E> &e, packed_proxy_tag) {
Chris@16:         BOOST_UBLAS_CHECK (v.size () == e ().size (), bad_size ());
Chris@16:         typedef F<typename V::iterator::reference, typename E::value_type> functor_type;
Chris@16:         typedef typename V::difference_type difference_type;
Chris@16:         typedef typename V::value_type value_type;
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:         vector<value_type> cv (v.size ());
Chris@16:         indexing_vector_assign<scalar_assign> (cv, v);
Chris@16:         indexing_vector_assign<F> (cv, e);
Chris@16: #endif
Chris@16:         typename V::iterator it (v.begin ());
Chris@16:         typename V::iterator it_end (v.end ());
Chris@16:         typename E::const_iterator ite (e ().begin ());
Chris@16:         typename E::const_iterator ite_end (e ().end ());
Chris@16:         difference_type it_size (it_end - it);
Chris@16:         difference_type ite_size (ite_end - ite);
Chris@16:         if (it_size > 0 && ite_size > 0) {
Chris@16:             difference_type size ((std::min) (difference_type (it.index () - ite.index ()), ite_size));
Chris@16:             if (size > 0) {
Chris@16:                 ite += size;
Chris@16:                 ite_size -= size;
Chris@16:             }
Chris@16:         }
Chris@16:         if (it_size > 0 && ite_size > 0) {
Chris@16:             difference_type size ((std::min) (difference_type (ite.index () - it.index ()), it_size));
Chris@16:             if (size > 0) {
Chris@16:                 it_size -= size;
Chris@16:                 if (!functor_type::computed) {
Chris@16:                     while (-- size >= 0)    // zeroing
Chris@16:                         functor_type::apply (*it, value_type/*zero*/()), ++ it;
Chris@16:                 } else {
Chris@16:                     it += size;
Chris@16:                 }
Chris@16:             }
Chris@16:         }
Chris@16:         difference_type size ((std::min) (it_size, ite_size));
Chris@16:         it_size -= size;
Chris@16:         ite_size -= size;
Chris@16:         while (-- size >= 0)
Chris@16:             functor_type::apply (*it, *ite), ++ it, ++ ite;
Chris@16:         size = it_size;
Chris@16:         if (!functor_type::computed) {
Chris@16:             while (-- size >= 0)    // zeroing
Chris@16:                 functor_type::apply (*it, value_type/*zero*/()), ++ it;
Chris@16:         } else {
Chris@16:             it += size;
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 (v, cv), 
Chris@16:                                external_logic ("external logic or bad condition of inputs"));
Chris@16: #endif
Chris@16:     }
Chris@16:     // Sparse case
Chris@16:     template<template <class T1, class T2> class F, class V, 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 vector_assign (V &v, const vector_expression<E> &e, sparse_tag) {
Chris@16:         BOOST_UBLAS_CHECK (v.size () == e ().size (), bad_size ());
Chris@16:         typedef F<typename V::iterator::reference, typename E::value_type> functor_type;
Chris@16:         BOOST_STATIC_ASSERT ((!functor_type::computed));
Chris@16:         typedef typename V::value_type value_type;
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:         vector<value_type> cv (v.size ());
Chris@16:         indexing_vector_assign<scalar_assign> (cv, v);
Chris@16:         indexing_vector_assign<F> (cv, e);
Chris@16: #endif
Chris@16:         v.clear ();
Chris@16:         typename E::const_iterator ite (e ().begin ());
Chris@16:         typename E::const_iterator ite_end (e ().end ());
Chris@16:         while (ite != ite_end) {
Chris@16:             value_type t (*ite);
Chris@16:             if (t != value_type/*zero*/())
Chris@16:                 v.insert_element (ite.index (), t);
Chris@16:             ++ ite;
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 (v, cv), 
Chris@16:                                external_logic ("external logic or bad condition of inputs"));
Chris@16: #endif
Chris@16:     }
Chris@16:     // Sparse proxy or functional case
Chris@16:     template<template <class T1, class T2> class F, class V, 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 vector_assign (V &v, const vector_expression<E> &e, sparse_proxy_tag) {
Chris@16:         BOOST_UBLAS_CHECK (v.size () == e ().size (), bad_size ());
Chris@16:         typedef F<typename V::iterator::reference, typename E::value_type> functor_type;
Chris@16:         typedef typename V::size_type size_type;
Chris@16:         typedef typename V::difference_type difference_type;
Chris@16:         typedef typename V::value_type value_type;
Chris@101: 
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:         vector<value_type> cv (v.size ());
Chris@16:         indexing_vector_assign<scalar_assign> (cv, v);
Chris@16:         indexing_vector_assign<F> (cv, e);
Chris@16: #endif
Chris@16:         detail::make_conformant (v, e);
Chris@16: 
Chris@16:         typename V::iterator it (v.begin ());
Chris@16:         typename V::iterator it_end (v.end ());
Chris@16:         typename E::const_iterator ite (e ().begin ());
Chris@16:         typename E::const_iterator ite_end (e ().end ());
Chris@16:         if (it != it_end && ite != ite_end) {
Chris@16:             size_type it_index = it.index (), ite_index = ite.index ();
Chris@16:             while (true) {
Chris@16:                 difference_type compare = it_index - ite_index;
Chris@16:                 if (compare == 0) {
Chris@16:                     functor_type::apply (*it, *ite);
Chris@16:                     ++ it, ++ ite;
Chris@16:                     if (it != it_end && ite != ite_end) {
Chris@16:                         it_index = it.index ();
Chris@16:                         ite_index = ite.index ();
Chris@16:                     } else
Chris@16:                         break;
Chris@16:                 } else if (compare < 0) {
Chris@16:                     if (!functor_type::computed) {
Chris@16:                         functor_type::apply (*it, value_type/*zero*/());
Chris@16:                         ++ it;
Chris@16:                     } else
Chris@16:                         increment (it, it_end, - compare);
Chris@16:                     if (it != it_end)
Chris@16:                         it_index = it.index ();
Chris@16:                     else
Chris@16:                         break;
Chris@16:                 } else if (compare > 0) {
Chris@16:                     increment (ite, ite_end, compare);
Chris@16:                     if (ite != ite_end)
Chris@16:                         ite_index = ite.index ();
Chris@16:                     else
Chris@16:                         break;
Chris@16:                 }
Chris@16:             }
Chris@16:         }
Chris@16: 
Chris@16:         if (!functor_type::computed) {
Chris@16:             while (it != it_end) {  // zeroing
Chris@16:                 functor_type::apply (*it, value_type/*zero*/());
Chris@16:                 ++ it;
Chris@16:             }
Chris@16:         } else {
Chris@16:             it = it_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 (v, cv), 
Chris@16:                                external_logic ("external logic or bad condition of inputs"));
Chris@16: #endif
Chris@16:     }
Chris@16: 
Chris@16:     // Dispatcher
Chris@16:     template<template <class T1, class T2> class F, class V, class E>
Chris@16:     BOOST_UBLAS_INLINE
Chris@16:     void vector_assign (V &v, const vector_expression<E> &e) {
Chris@16:         typedef typename vector_assign_traits<typename V::storage_category,
Chris@16:                                               F<typename V::reference, typename E::value_type>::computed,
Chris@16:                                               typename E::const_iterator::iterator_category>::storage_category storage_category;
Chris@16:         vector_assign<F> (v, e, storage_category ());
Chris@16:     }
Chris@16: 
Chris@16:     template<class SC, class RI>
Chris@16:     struct vector_swap_traits {
Chris@16:         typedef SC storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<>
Chris@16:     struct vector_swap_traits<dense_proxy_tag, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     template<>
Chris@16:     struct vector_swap_traits<packed_proxy_tag, sparse_bidirectional_iterator_tag> {
Chris@16:         typedef sparse_proxy_tag storage_category;
Chris@16:     };
Chris@16: 
Chris@16:     // Dense (proxy) case
Chris@16:     template<template <class T1, class T2> class F, class V, 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 vector_swap (V &v, vector_expression<E> &e, dense_proxy_tag) {
Chris@16:         typedef F<typename V::iterator::reference, typename E::iterator::reference> functor_type;
Chris@16:         typedef typename V::difference_type difference_type;
Chris@16:         difference_type size (BOOST_UBLAS_SAME (v.size (), e ().size ()));
Chris@16:         typename V::iterator it (v.begin ());
Chris@16:         typename E::iterator ite (e ().begin ());
Chris@16:         while (-- size >= 0)
Chris@16:             functor_type::apply (*it, *ite), ++ it, ++ ite;
Chris@16:     }
Chris@16:     // Packed (proxy) case
Chris@16:     template<template <class T1, class T2> class F, class V, 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 vector_swap (V &v, vector_expression<E> &e, packed_proxy_tag) {
Chris@16:         typedef F<typename V::iterator::reference, typename E::iterator::reference> functor_type;
Chris@16:         typedef typename V::difference_type difference_type;
Chris@16:         typename V::iterator it (v.begin ());
Chris@16:         typename V::iterator it_end (v.end ());
Chris@16:         typename E::iterator ite (e ().begin ());
Chris@16:         typename E::iterator ite_end (e ().end ());
Chris@16:         difference_type it_size (it_end - it);
Chris@16:         difference_type ite_size (ite_end - ite);
Chris@16:         if (it_size > 0 && ite_size > 0) {
Chris@16:             difference_type size ((std::min) (difference_type (it.index () - ite.index ()), ite_size));
Chris@16:             if (size > 0) {
Chris@16:                 ite += size;
Chris@16:                 ite_size -= size;
Chris@16:             }
Chris@16:         }
Chris@16:         if (it_size > 0 && ite_size > 0) {
Chris@16:             difference_type size ((std::min) (difference_type (ite.index () - it.index ()), it_size));
Chris@16:             if (size > 0)
Chris@16:                 it_size -= size;
Chris@16:         }
Chris@16:         difference_type size ((std::min) (it_size, ite_size));
Chris@16:         it_size -= size;
Chris@16:         ite_size -= size;
Chris@16:         while (-- size >= 0)
Chris@16:             functor_type::apply (*it, *ite), ++ it, ++ ite;
Chris@16:     }
Chris@16:     // Sparse proxy case
Chris@16:     template<template <class T1, class T2> class F, class V, 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 vector_swap (V &v, vector_expression<E> &e, sparse_proxy_tag) {
Chris@16:         BOOST_UBLAS_CHECK (v.size () == e ().size (), bad_size ());
Chris@16:         typedef F<typename V::iterator::reference, typename E::iterator::reference> functor_type;
Chris@16:         typedef typename V::size_type size_type;
Chris@16:         typedef typename V::difference_type difference_type;
Chris@16: 
Chris@16:         detail::make_conformant (v, e);
Chris@16:         // FIXME should be a seperate restriction for E
Chris@16:         detail::make_conformant (e (), v);
Chris@16: 
Chris@16:         typename V::iterator it (v.begin ());
Chris@16:         typename V::iterator it_end (v.end ());
Chris@16:         typename E::iterator ite (e ().begin ());
Chris@16:         typename E::iterator ite_end (e ().end ());
Chris@16:         if (it != it_end && ite != ite_end) {
Chris@16:             size_type it_index = it.index (), ite_index = ite.index ();
Chris@16:             while (true) {
Chris@16:                 difference_type compare = it_index - ite_index;
Chris@16:                 if (compare == 0) {
Chris@16:                     functor_type::apply (*it, *ite);
Chris@16:                     ++ it, ++ ite;
Chris@16:                     if (it != it_end && ite != ite_end) {
Chris@16:                         it_index = it.index ();
Chris@16:                         ite_index = ite.index ();
Chris@16:                     } else
Chris@16:                         break;
Chris@16:                 } else if (compare < 0) {
Chris@16:                     increment (it, it_end, - compare);
Chris@16:                     if (it != it_end)
Chris@16:                         it_index = it.index ();
Chris@16:                     else
Chris@16:                         break;
Chris@16:                 } else if (compare > 0) {
Chris@16:                     increment (ite, ite_end, compare);
Chris@16:                     if (ite != ite_end)
Chris@16:                         ite_index = ite.index ();
Chris@16:                     else
Chris@16:                         break;
Chris@16:                 }
Chris@16:             }
Chris@16:         }
Chris@16: 
Chris@16: #if BOOST_UBLAS_TYPE_CHECK
Chris@16:         increment (ite, ite_end);
Chris@16:         increment (it, it_end);
Chris@16: #endif
Chris@16:     }
Chris@16: 
Chris@16:     // Dispatcher
Chris@16:     template<template <class T1, class T2> class F, class V, class E>
Chris@16:     BOOST_UBLAS_INLINE
Chris@16:     void vector_swap (V &v, vector_expression<E> &e) {
Chris@16:         typedef typename vector_swap_traits<typename V::storage_category,
Chris@16:                                             typename E::const_iterator::iterator_category>::storage_category storage_category;
Chris@16:         vector_swap<F> (v, e, storage_category ());
Chris@16:     }
Chris@16: 
Chris@16: }}}
Chris@16: 
Chris@16: #endif