⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 matrix_sparse.hpp

📁 CGAL is a collaborative effort of several sites in Europe and Israel. The goal is to make the most i
💻 HPP
📖 第 1 页 / 共 5 页
字号:
////  Copyright (c) 2000-2002//  Joerg Walter, Mathias Koch////  Permission to use, copy, modify, distribute and sell this software//  and its documentation for any purpose is hereby granted without fee,//  provided that the above copyright notice appear in all copies and//  that both that copyright notice and this permission notice appear//  in supporting documentation.  The authors make no representations//  about the suitability of this software for any purpose.//  It is provided "as is" without express or implied warranty.////  The authors gratefully acknowledge the support of//  GeNeSys mbH & Co. KG in producing this work.//#ifndef BOOST_UBLAS_MATRIX_SPARSE_H#define BOOST_UBLAS_MATRIX_SPARSE_H#include <boost/numeric/ublas/config.hpp>#include <boost/numeric/ublas/storage_sparse.hpp>#include <boost/numeric/ublas/vector_sparse.hpp>#include <boost/numeric/ublas/matrix.hpp>// Iterators based on ideas of Jeremy Sieknamespace boost { namespace numeric { namespace ublas {#ifdef BOOST_UBLAS_STRICT_MATRIX_SPARSE    template<class M>    class sparse_matrix_element:       public container_reference<M> {    public:        typedef M matrix_type;        typedef typename M::size_type size_type;        typedef typename M::value_type value_type;        typedef const value_type &const_reference;        typedef value_type *pointer;        // Construction and destruction        BOOST_UBLAS_INLINE        sparse_matrix_element (matrix_type &m, size_type i, size_type j):            container_reference<matrix_type> (m), i_ (i), j_ (j), d_ (), dirty_ (false) {            pointer it = (*this) ().find_element (i_, j_);            if (it)                d_ = *it;        }        BOOST_UBLAS_INLINE        sparse_matrix_element (const sparse_matrix_element &p):            container_reference<matrix_type> (p), i_ (p.i_), d_ (p.d_), dirty_ (p.dirty_) {}        BOOST_UBLAS_INLINE        ~sparse_matrix_element () {            if (dirty_) {                pointer it = (*this) ().find_element (i_, j_);                if (! it)                    (*this) ().insert (i_, j_, d_);                else                    *it = d_;            }        }        // Assignment        BOOST_UBLAS_INLINE        sparse_matrix_element &operator = (const sparse_matrix_element &p) {            // Overide the implict copy assignment            d_ = p.d_;            dirty_ = true;            return *this;        }        template<class D>        BOOST_UBLAS_INLINE        sparse_matrix_element &operator = (const D &d) {            d_ = d;            dirty_ = true;            return *this;        }        template<class D>        BOOST_UBLAS_INLINE        sparse_matrix_element &operator += (const D &d) {            d_ += d;            dirty_ = true;            return *this;        }        template<class D>        BOOST_UBLAS_INLINE        sparse_matrix_element &operator -= (const D &d) {            d_ -= d;            dirty_ = true;            return *this;        }        template<class D>        BOOST_UBLAS_INLINE        sparse_matrix_element &operator *= (const D &d) {            d_ *= d;            dirty_ = true;            return *this;        }        template<class D>        BOOST_UBLAS_INLINE        sparse_matrix_element &operator /= (const D &d) {            d_ /= d;            dirty_ = true;            return *this;        }        // Comparison        template<class D>        BOOST_UBLAS_INLINE        bool operator == (const D &d) const {            return d_ == d;        }        template<class D>        BOOST_UBLAS_INLINE        bool operator != (const D &d) const {            return d_ != d;        }        // Conversion        BOOST_UBLAS_INLINE        operator const_reference () const {            return d_;        }        // Swapping        BOOST_UBLAS_INLINE        void swap (sparse_matrix_element p) {            if (this != &p) {                dirty_ = true;                p.dirty_ = true;                std::swap (d_, p.d_);            }        }#ifndef BOOST_UBLAS_NO_MEMBER_FRIENDS        BOOST_UBLAS_INLINE        friend void swap (sparse_matrix_element p1, sparse_matrix_element p2) {            p1.swap (p2);        }#endif    private:        size_type i_;        size_type j_;        value_type d_;        bool dirty_;    };    template<class M>    struct type_traits<sparse_matrix_element<M> > {        typedef typename M::value_type element_type;        typedef type_traits<sparse_matrix_element<M> > self_type;        typedef typename type_traits<element_type>::value_type value_type;        typedef typename type_traits<element_type>::const_reference const_reference;        typedef sparse_matrix_element<M> reference;        typedef typename type_traits<element_type>::real_type real_type;        typedef typename type_traits<element_type>::precision_type precision_type;        BOOST_STATIC_CONSTANT (unsigned, plus_complexity = type_traits<element_type>::plus_complexity);        BOOST_STATIC_CONSTANT (unsigned, multiplies_complexity = type_traits<element_type>::multiplies_complexity);        static        BOOST_UBLAS_INLINE        real_type real (const_reference t) {            return type_traits<element_type>::real (t);        }        static        BOOST_UBLAS_INLINE        real_type imag (const_reference t) {            return type_traits<element_type>::imag (t);        }        static        BOOST_UBLAS_INLINE        value_type conj (const_reference t) {            return type_traits<element_type>::conj (t);        }        static        BOOST_UBLAS_INLINE        real_type abs (const_reference t) {            return type_traits<element_type>::abs (t);        }        static        BOOST_UBLAS_INLINE        value_type sqrt (const_reference t) {            return type_traits<element_type>::sqrt (t);        }        static        BOOST_UBLAS_INLINE        real_type norm_1 (const_reference t) {            return type_traits<element_type>::norm_1 (t);        }        static        BOOST_UBLAS_INLINE        real_type norm_2 (const_reference t) {            return type_traits<element_type>::norm_2 (t);        }        static        BOOST_UBLAS_INLINE        real_type norm_inf (const_reference t) {            return type_traits<element_type>::norm_inf (t);        }        static        BOOST_UBLAS_INLINE        bool equals (const_reference t1, const_reference t2) {            return type_traits<element_type>::equals (t1, t2);        }    };    template<class M1, class T2>    struct promote_traits<sparse_matrix_element<M1>, T2> {        typedef typename promote_traits<typename sparse_matrix_element<M1>::value_type, T2>::promote_type promote_type;    };    template<class T1, class M2>    struct promote_traits<T1, sparse_matrix_element<M2> > {        typedef typename promote_traits<T1, typename sparse_matrix_element<M2>::value_type>::promote_type promote_type;    };    template<class M1, class M2>    struct promote_traits<sparse_matrix_element<M1>, sparse_matrix_element<M2> > {        typedef typename promote_traits<typename sparse_matrix_element<M1>::value_type,                                        typename sparse_matrix_element<M2>::value_type>::promote_type promote_type;    };#endif    // Array based sparse matrix class    template<class T, class F, class A>    class sparse_matrix:        public matrix_expression<sparse_matrix<T, F, A> > {    public:#ifndef BOOST_UBLAS_NO_PROXY_SHORTCUTS        BOOST_UBLAS_USING matrix_expression<sparse_matrix<T, F, A> >::operator ();#endif        typedef typename A::size_type size_type;        typedef typename A::difference_type difference_type;        typedef T value_type;        typedef A array_type;        typedef const T &const_reference;#ifndef BOOST_UBLAS_STRICT_MATRIX_SPARSE        typedef BOOST_UBLAS_TYPENAME detail::map_traits<A, T>::reference reference;#else        typedef sparse_matrix_element<sparse_matrix<T, F, A> > reference;#endif    private:        typedef T &true_reference;        typedef T *pointer;        typedef F functor_type;        typedef sparse_matrix<T, F, A> self_type;    public:#ifndef BOOST_UBLAS_CT_REFERENCE_BASE_TYPEDEFS        typedef const matrix_const_reference<const self_type> const_closure_type;#else        typedef const matrix_reference<const self_type> const_closure_type;#endif        typedef matrix_reference<self_type> closure_type;        typedef sparse_vector<T, A> vector_temporary_type;        typedef self_type matrix_temporary_type;        typedef sparse_tag storage_category;        typedef typename F::orientation_category orientation_category;        // Construction and destruction        BOOST_UBLAS_INLINE        sparse_matrix ():            matrix_expression<self_type> (),            size1_ (0), size2_ (0), data_ () {}        BOOST_UBLAS_INLINE        sparse_matrix (size_type size1, size_type size2, size_type non_zeros = 0):            matrix_expression<self_type> (),            size1_ (size1), size2_ (size2), data_ () {            detail::map_reserve (data (), restrict_nz (non_zeros));        }        BOOST_UBLAS_INLINE        sparse_matrix (const sparse_matrix &m):            matrix_expression<self_type> (),            size1_ (m.size1_), size2_ (m.size2_), data_ (m.data_) {}        template<class AE>        BOOST_UBLAS_INLINE        sparse_matrix (const matrix_expression<AE> &ae, size_type non_zeros = 0):            matrix_expression<self_type> (),            size1_ (ae ().size1 ()), size2_ (ae ().size2 ()), data_ () {            detail::map_reserve (data (), restrict_nz (non_zeros));            matrix_assign (scalar_assign<true_reference, BOOST_UBLAS_TYPENAME AE::value_type> (), *this, ae);        }        // Accessors        BOOST_UBLAS_INLINE        size_type size1 () const {            return size1_;        }        BOOST_UBLAS_INLINE        size_type size2 () const {            return size2_;        }        BOOST_UBLAS_INLINE        size_type non_zeros () const {            return detail::map_capacity (data ());        }        BOOST_UBLAS_INLINE        const array_type &data () const {            return data_;        }        BOOST_UBLAS_INLINE        array_type &data () {            return data_;        }        // Resizing    private:        BOOST_UBLAS_INLINE        size_type restrict_nz (size_type non_zeros) const {            // Guarding against overflow - Thanks to Alexei Novakov for the hint.            // non_zeros_ = (std::min) (non_zeros, size1_ * size2_);            if (size1_ > 0 && non_zeros / size1_ >= size2_)                non_zeros = size1_ * size2_;            return non_zeros;        }    public:        BOOST_UBLAS_INLINE        void resize (size_type size1, size_type size2, bool preserve = true) {            // FIXME preserve unimplemented            BOOST_UBLAS_CHECK (!preserve, internal_logic ());            size1_ = size1;            size2_ = size2;            data ().clear ();        }        // Reserving

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -