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

📄 banded.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_BANDED_H#define BOOST_UBLAS_BANDED_H#include <boost/numeric/ublas/config.hpp>#include <boost/numeric/ublas/storage.hpp>#include <boost/numeric/ublas/matrix.hpp>// Iterators based on ideas of Jeremy Sieknamespace boost { namespace numeric { namespace ublas {    // Array based banded matrix class    template<class T, class F, class A>    class banded_matrix:        public matrix_expression<banded_matrix<T, F, A> > {    public:#ifndef BOOST_UBLAS_NO_PROXY_SHORTCUTS        BOOST_UBLAS_USING matrix_expression<banded_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 const T &const_reference;        typedef T &reference;        typedef A array_type;    private:        typedef T *pointer;        typedef F functor_type;        typedef banded_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 vector<T, A> vector_temporary_type;        typedef matrix<T, F, A> matrix_temporary_type;  // general sub-matrix        typedef packed_tag storage_category;        typedef typename F::orientation_category orientation_category;        // Construction and destruction        BOOST_UBLAS_INLINE        banded_matrix ():            matrix_expression<self_type> (),            size1_ (0), size2_ (0),            lower_ (0), upper_ (0), data_ (0) {}        BOOST_UBLAS_INLINE        banded_matrix (size_type size1, size_type size2, size_type lower = 0, size_type upper = 0):            matrix_expression<self_type> (),            size1_ (size1), size2_ (size2),            lower_ (lower), upper_ (upper), data_ ((std::max) (size1, size2) * (lower + 1 + upper)) {        }        BOOST_UBLAS_INLINE        banded_matrix (size_type size1, size_type size2, size_type lower, size_type upper, const array_type &data):            matrix_expression<self_type> (),            size1_ (size1), size2_ (size2),            lower_ (lower), upper_ (upper), data_ (data) {}        BOOST_UBLAS_INLINE        banded_matrix (const banded_matrix &m):            matrix_expression<self_type> (),            size1_ (m.size1_), size2_ (m.size2_),            lower_ (m.lower_), upper_ (m.upper_), data_ (m.data_) {}        template<class AE>        BOOST_UBLAS_INLINE        banded_matrix (const matrix_expression<AE> &ae, size_type lower = 0, size_type upper = 0):            matrix_expression<self_type> (),            size1_ (ae ().size1 ()), size2_ (ae ().size2 ()),            lower_ (lower), upper_ (upper),            data_ (std::max (size1_, size2_) * (lower_ + 1 + upper_)) {            matrix_assign (scalar_assign<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 lower () const {            return lower_;        }        BOOST_UBLAS_INLINE        size_type upper () const {            return upper_;        }        BOOST_UBLAS_INLINE        const array_type &data () const {            return data_;        }        BOOST_UBLAS_INLINE        array_type &data () {            return data_;        }        // Resizing        BOOST_UBLAS_INLINE        void resize (size_type size1, size_type size2, size_type lower = 0, size_type upper = 0, bool preserve = true) {            size1_ = size1;            size2_ = size2;            lower_ = lower;            upper_ = upper;            if (preserve) {                self_type temporary (size1, size2, lower, upper);                // FIXME use matrix_resize_preserve on conformant compilers                // detail::matrix_resize_preserve<functor_type> (*this, temporary, size_, size_);                assign_temporary (temporary);            }            else                data ().resize ((std::max) (size1, size2) * (lower + 1 + upper));        }        BOOST_UBLAS_INLINE        void resize_packed_preserve (size_type size1, size_type size2, size_type lower = 0, size_type upper = 0) {            size1_ = size1;            size2_ = size2;            lower_ = lower;            upper_ = upper;            data ().resize ((std::max) (size1, size2) * (lower + 1 + upper), value_type (0));        }        // Element access        BOOST_UBLAS_INLINE        const_reference operator () (size_type i, size_type j) const {            BOOST_UBLAS_CHECK (i < size1_, bad_index ());            BOOST_UBLAS_CHECK (j < size2_, bad_index ());#ifdef BOOST_UBLAS_OWN_BANDED            size_type k = (std::max) (i, j);            size_type l = lower_ + j - i;            if (k < (std::max) (size1_, size2_) &&                l < lower_ + 1 + upper_)                return data () [functor_type::element (k, (std::max) (size1_, size2_),                                                       l, lower_ + 1 + upper_)];#else            size_type k = j;            size_type l = upper_ + i - j;            if (k < size2_ &&                l < lower_ + 1 + upper_)                return data () [functor_type::element (k, size2_,                                                       l, lower_ + 1 + upper_)];#endif            return zero_;        }        BOOST_UBLAS_INLINE        reference operator () (size_type i, size_type j) {            BOOST_UBLAS_CHECK (i < size1_, bad_index ());            BOOST_UBLAS_CHECK (j < size2_, bad_index ());#ifdef BOOST_UBLAS_OWN_BANDED            size_type k = (std::max) (i, j);            size_type l = lower_ + j - i;            if (k < (std::max) (size1_, size2_) &&                l < lower_ + 1 + upper_)                return data () [functor_type::element (k, (std::max) (size1_, size2_),                                                       l, lower_ + 1 + upper_)];#else            size_type k = j;            size_type l = upper_ + i - j;            if (k < size2_ &&                l < lower_ + 1 + upper_)                return data () [functor_type::element (k, size2_,                                                       l, lower_ + 1 + upper_)];#endif#ifndef BOOST_UBLAS_REFERENCE_CONST_MEMBER            bad_index ().raise ();#endif            return const_cast<reference>(zero_);        }        // Assignment        BOOST_UBLAS_INLINE        banded_matrix &operator = (const banded_matrix &m) {            size1_ = m.size1_;            size2_ = m.size2_;            lower_ = m.lower_;            upper_ = m.upper_;            data () = m.data ();            return *this;        }        BOOST_UBLAS_INLINE        banded_matrix &assign_temporary (banded_matrix &m) {            swap (m);            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        banded_matrix &operator = (const matrix_expression<AE> &ae) {            // return assign (self_type (ae, lower_, upper_));            self_type temporary (ae, lower_, upper_);            return assign_temporary (temporary);        }        template<class AE>        BOOST_UBLAS_INLINE        banded_matrix &assign (const matrix_expression<AE> &ae) {            matrix_assign (scalar_assign<reference, BOOST_UBLAS_TYPENAME AE::value_type> (), *this, ae);            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        banded_matrix& operator += (const matrix_expression<AE> &ae) {            // return assign (self_type (*this + ae, lower_, upper_));            self_type temporary (*this + ae, lower_, upper_);            return assign_temporary (temporary);        }        template<class AE>        BOOST_UBLAS_INLINE        banded_matrix &plus_assign (const matrix_expression<AE> &ae) {            matrix_assign (scalar_plus_assign<reference, BOOST_UBLAS_TYPENAME AE::value_type> (), *this, ae);            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        banded_matrix& operator -= (const matrix_expression<AE> &ae) {            // return assign (self_type (*this - ae, lower_, upper_));            self_type temporary (*this - ae, lower_, upper_);            return assign_temporary (temporary);        }        template<class AE>        BOOST_UBLAS_INLINE        banded_matrix &minus_assign (const matrix_expression<AE> &ae) {            matrix_assign (scalar_minus_assign<reference, BOOST_UBLAS_TYPENAME AE::value_type> (), *this, ae);            return *this;        }        template<class AT>        BOOST_UBLAS_INLINE        banded_matrix& operator *= (const AT &at) {            matrix_assign_scalar (scalar_multiplies_assign<reference, AT> (), *this, at);            return *this;        }        template<class AT>        BOOST_UBLAS_INLINE        banded_matrix& operator /= (const AT &at) {            matrix_assign_scalar (scalar_divides_assign<reference, AT> (), *this, at);            return *this;        }        // Swapping        BOOST_UBLAS_INLINE        void swap (banded_matrix &m) {            if (this != &m) {                std::swap (size1_, m.size1_);                std::swap (size2_, m.size2_);                std::swap (lower_, m.lower_);                std::swap (upper_, m.upper_);                data ().swap (m.data ());            }        }#ifndef BOOST_UBLAS_NO_MEMBER_FRIENDS        BOOST_UBLAS_INLINE        friend void swap (banded_matrix &m1, banded_matrix &m2) {            m1.swap (m2);        }#endif        // Element insertion and erasure        // These functions should work with std::vector.        // Thanks to Kresimir Fresl for spotting this.        BOOST_UBLAS_INLINE        void insert (size_type i, size_type j, const_reference t) {            BOOST_UBLAS_CHECK (i < size1_, bad_index ());            BOOST_UBLAS_CHECK (j < size2_, bad_index ());#ifdef BOOST_UBLAS_OWN_BANDED            size_type k = (std::max) (i, j);            size_type l = lower_ + j - i;            BOOST_UBLAS_CHECK (type_traits<value_type>::equals (data () [functor_type::element (k, std::max (size1_, size2_),                                                                                                l, lower_ + 1 + upper_)], value_type (0)), bad_index ());            // data ().insert (data ().begin () + functor_type::element (k, (std::max) (size1_, size2_),            //                                                           l, lower_ + 1 + upper_), t);            data () [functor_type::element (k, (std::max) (size1_, size2_),                                            l, lower_ + 1 + upper_)] = t;#else            size_type k = j;            size_type l = upper_ + i - j;            BOOST_UBLAS_CHECK (type_traits<value_type>::equals (data () [functor_type::element (k, size2_,                                                                                                l, lower_ + 1 + upper_)], value_type (0)), bad_index ());            // data ().insert (data ().begin () + functor_type::element (k, size2_,            //                                                           l, lower_ + 1 + upper_), t);            data () [functor_type::element (k, size2_,                                            l, lower_ + 1 + upper_)] = t;#endif        }        BOOST_UBLAS_INLINE        void erase (size_type i, size_type j) {            BOOST_UBLAS_CHECK (i < size1_, bad_index ());            BOOST_UBLAS_CHECK (j < size2_, bad_index ());#ifdef BOOST_UBLAS_OWN_BANDED            size_type k = (std::max) (i, j);            size_type l = lower_ + j - i;            // data ().erase (data ().begin () + functor_type::element (k, (std::max) (size1_, size2_),            //                                                         l, lower_ + 1 + upper_));            data () [functor_type::element (k, (std::max) (size1_, size2_),                                            l, lower_ + 1 + upper_)] = value_type (0);#else            size_type k = j;            size_type l = upper_ + i - j;            // data ().erase (data ().begin () + functor_type::element (k, size2_,            //                                                          l, lower_ + 1 + upper_));            data () [functor_type::element (k, size2_,                                            l, lower_ + 1 + upper_)] = value_type (0);#endif        }        BOOST_UBLAS_INLINE        void clear () {            // data ().clear ();            std::fill (data ().begin (), data ().end (), value_type (0));        }        // Iterator types#ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR        typedef indexed_iterator1<self_type, packed_random_access_iterator_tag> iterator1;        typedef indexed_iterator2<self_type, packed_random_access_iterator_tag> iterator2;        typedef indexed_const_iterator1<self_type, packed_random_access_iterator_tag> const_iterator1;        typedef indexed_const_iterator2<self_type, packed_random_access_iterator_tag> const_iterator2;#else        class const_iterator1;        class iterator1;        class const_iterator2;        class iterator2;#endif#ifdef BOOST_MSVC_STD_ITERATOR        typedef reverse_iterator_base1<const_iterator1, value_type, const_reference> const_reverse_iterator1;

⌨️ 快捷键说明

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