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

📄 triangular.hpp

📁 CGAL is a collaborative effort of several sites in Europe and Israel. The goal is to make the most i
💻 HPP
📖 第 1 页 / 共 5 页
字号:
            } else {#ifndef BOOST_UBLAS_REFERENCE_CONST_MEMBER                bad_index ().raise ();#endif                return const_cast<reference>(zero_);            }        }#else        BOOST_UBLAS_INLINE        reference operator () (size_type i, size_type j) const {            BOOST_UBLAS_CHECK (i < size1 (), bad_index ());            BOOST_UBLAS_CHECK (j < size2 (), bad_index ());            if (functor_type::other (i, j))                return data () (i, j);            else if (functor_type::one (i, j)) {#ifndef BOOST_UBLAS_REFERENCE_CONST_MEMBER                bad_index ().raise ();#endif                return const_cast<reference>(one_);            } else {#ifndef BOOST_UBLAS_REFERENCE_CONST_MEMBER                bad_index ().raise ();#endif                return const_cast<reference>(zero_);            }        }#endif        // Assignment        BOOST_UBLAS_INLINE        triangular_adaptor &operator = (const triangular_adaptor &m) {            matrix_assign (scalar_assign<BOOST_UBLAS_TYPENAME iterator1_type::reference, value_type> (), *this, m);            return *this;        }        BOOST_UBLAS_INLINE        triangular_adaptor &assign_temporary (triangular_adaptor &m) {            *this = m;            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        triangular_adaptor &operator = (const matrix_expression<AE> &ae) {            matrix_assign (scalar_assign<BOOST_UBLAS_TYPENAME iterator1_type::reference, value_type> (), *this, matrix<value_type> (ae));            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        triangular_adaptor &assign (const matrix_expression<AE> &ae) {            matrix_assign (scalar_assign<BOOST_UBLAS_TYPENAME iterator1_type::reference, BOOST_UBLAS_TYPENAME AE::value_type> (), *this, ae);            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        triangular_adaptor& operator += (const matrix_expression<AE> &ae) {            matrix_assign (scalar_assign<BOOST_UBLAS_TYPENAME iterator1_type::reference, value_type> (), *this, matrix<value_type> (*this + ae));            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        triangular_adaptor &plus_assign (const matrix_expression<AE> &ae) {            matrix_assign (scalar_plus_assign<BOOST_UBLAS_TYPENAME iterator1_type::reference, BOOST_UBLAS_TYPENAME AE::value_type> (), *this, ae);            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        triangular_adaptor& operator -= (const matrix_expression<AE> &ae) {            matrix_assign (scalar_assign<BOOST_UBLAS_TYPENAME iterator1_type::reference, value_type> (), *this, matrix<value_type> (*this - ae));            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        triangular_adaptor &minus_assign (const matrix_expression<AE> &ae) {            matrix_assign (scalar_minus_assign<BOOST_UBLAS_TYPENAME iterator1_type::reference, BOOST_UBLAS_TYPENAME AE::value_type> (), *this, ae);            return *this;        }        template<class AT>        BOOST_UBLAS_INLINE        triangular_adaptor& operator *= (const AT &at) {            matrix_assign_scalar (scalar_multiplies_assign<BOOST_UBLAS_TYPENAME iterator1_type::reference, AT> (), *this, at);            return *this;        }        template<class AT>        BOOST_UBLAS_INLINE        triangular_adaptor& operator /= (const AT &at) {            matrix_assign_scalar (scalar_divides_assign<BOOST_UBLAS_TYPENAME iterator1_type::reference, AT> (), *this, at);            return *this;        }        // Closure comparison        BOOST_UBLAS_INLINE        bool same_closure (const triangular_adaptor &ta) const {            return (*this).data ().same_closure (ta.data ());        }        // Swapping        BOOST_UBLAS_INLINE        void swap (triangular_adaptor &m) {            if (this != &m)                matrix_swap (scalar_swap<BOOST_UBLAS_TYPENAME iterator1_type::reference, BOOST_UBLAS_TYPENAME iterator1_type::reference> (), *this, m);        }#ifndef BOOST_UBLAS_NO_MEMBER_FRIENDS        BOOST_UBLAS_INLINE        friend void swap (triangular_adaptor &m1, triangular_adaptor &m2) {            m1.swap (m2);        }#endif        // Iterator types   private:#ifndef BOOST_UBLAS_CT_PROXY_BASE_TYPEDEFS        // Use matrix iterator        typedef typename M::const_iterator1 const_iterator1_type;        typedef typename M::iterator1 iterator1_type;        typedef typename M::const_iterator2 const_iterator2_type;        typedef typename M::iterator2 iterator2_type;#else        typedef typename M::const_iterator1 const_iterator1_type;        typedef typename boost::mpl::if_<boost::is_const<M>,                                          typename M::const_iterator1,                                          typename M::iterator1>::type iterator1_type;        typedef typename M::const_iterator2 const_iterator2_type;        typedef typename boost::mpl::if_<boost::is_const<M>,                                          typename M::const_iterator2,                                          typename M::iterator2>::type iterator2_type;#endif    public:#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;        typedef reverse_iterator_base1<iterator1, value_type, reference> reverse_iterator1;        typedef reverse_iterator_base2<const_iterator2, value_type, const_reference> const_reverse_iterator2;        typedef reverse_iterator_base2<iterator2, value_type, reference> reverse_iterator2;#else        typedef reverse_iterator_base1<const_iterator1> const_reverse_iterator1;        typedef reverse_iterator_base1<iterator1> reverse_iterator1;        typedef reverse_iterator_base2<const_iterator2> const_reverse_iterator2;        typedef reverse_iterator_base2<iterator2> reverse_iterator2;#endif        // Element lookup        BOOST_UBLAS_INLINE        const_iterator1 find1 (int rank, size_type i, size_type j) const {            if (rank == 1)                i = functor_type::restrict1 (i, j);            return const_iterator1 (*this, data ().find1 (rank, i, j));        }        BOOST_UBLAS_INLINE        iterator1 find1 (int rank, size_type i, size_type j) {            if (rank == 1)                i = functor_type::mutable_restrict1 (i, j);            return iterator1 (*this, data ().find1 (rank, i, j));        }        BOOST_UBLAS_INLINE        const_iterator2 find2 (int rank, size_type i, size_type j) const {            if (rank == 1)                j = functor_type::restrict2 (i, j);            return const_iterator2 (*this, data ().find2 (rank, i, j));        }        BOOST_UBLAS_INLINE        iterator2 find2 (int rank, size_type i, size_type j) {            if (rank == 1)                j = functor_type::mutable_restrict2 (i, j);            return iterator2 (*this, data ().find2 (rank, i, j));        }        // Iterators simply are indices.#ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR        class const_iterator1:            public container_const_reference<triangular_adaptor>,            public random_access_iterator_base<packed_random_access_iterator_tag,                                               const_iterator1, value_type> {        public:#ifndef BOOST_MSVC_STD_ITERATOR            typedef typename iterator_restrict_traits<typename const_iterator1_type::iterator_category,                                                      packed_random_access_iterator_tag>::iterator_category iterator_category;            typedef typename const_iterator1_type::value_type value_type;            typedef typename const_iterator1_type::difference_type difference_type;            typedef typename const_iterator1_type::reference reference;            typedef typename const_iterator1_type::pointer pointer;#else            typedef typename iterator_restrict_traits<typename M::const_iterator1::iterator_category,                                                      packed_random_access_iterator_tag>::iterator_category iterator_category;            typedef const_reference reference;#endif            typedef const_iterator2 dual_iterator_type;            typedef const_reverse_iterator2 dual_reverse_iterator_type;            // Construction and destruction            BOOST_UBLAS_INLINE            const_iterator1 ():                container_const_reference<self_type> (), it1_ () {}            BOOST_UBLAS_INLINE            const_iterator1 (const self_type &m, const const_iterator1_type &it1):                container_const_reference<self_type> (m), it1_ (it1) {}            BOOST_UBLAS_INLINE            const_iterator1 (const iterator1 &it):                container_const_reference<self_type> (it ()), it1_ (it.it1_) {}            // Arithmetic            BOOST_UBLAS_INLINE            const_iterator1 &operator ++ () {                ++ it1_;                return *this;            }            BOOST_UBLAS_INLINE            const_iterator1 &operator -- () {                -- it1_;                return *this;            }            BOOST_UBLAS_INLINE            const_iterator1 &operator += (difference_type n) {                it1_ += n;                return *this;            }            BOOST_UBLAS_INLINE            const_iterator1 &operator -= (difference_type n) {                it1_ -= n;                return *this;            }            BOOST_UBLAS_INLINE            difference_type operator - (const const_iterator1 &it) const {                BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());                return it1_ - it.it1_;            }            // Dereference            BOOST_UBLAS_INLINE            const_reference operator * () const {                size_type i = index1 ();                size_type j = index2 ();                BOOST_UBLAS_CHECK (i < (*this) ().size1 (), bad_index ());                BOOST_UBLAS_CHECK (j < (*this) ().size2 (), bad_index ());                if (functor_type::other (i, j))                    return *it1_;                else                    return (*this) () (i, j);            }#ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION            BOOST_UBLAS_INLINE#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION            typename self_type::#endif            const_iterator2 begin () const {                return (*this) ().find2 (1, index1 (), 0);            }            BOOST_UBLAS_INLINE#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION            typename self_type::#endif            const_iterator2 end () const {                return (*this) ().find2 (1, index1 (), (*this) ().size2 ());            }            BOOST_UBLAS_INLINE#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION            typename self_type::#endif            const_reverse_iterator2 rbegin () const {                return const_reverse_iterator2 (end ());            }            BOOST_UBLAS_INLINE#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION            typename self_type::#endif            const_reverse_iterator2 rend () const {                return const_reverse_iterator2 (begin ());            }#endif            // Indices            BOOST_UBLAS_INLINE            size_type index1 () const {                return it1_.index1 ();            }            BOOST_UBLAS_INLINE            size_type index2 () const {                return it1_.index2 ();            }            // Assignment            BOOST_UBLAS_INLINE            const_iterator1 &operator = (const const_iterator1 &it) {                container_const_reference<self_type>::assign (&it ());                it1_ = it.it1_;                return *this;            }            // Comparison            BOOST_UBLAS_INLINE            bool operator == (const const_iterator1 &it) const {                BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());                return it1_ == it.it1_;            }            BOOST_UBLAS_INLINE            bool operator < (const const_iterator1 &it) const {                BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());                return it1_ < it.it1_;            }        private:            const_iterator1_type it1_;        };#endif        BOOST_UBLAS_INLINE        const_iterator1 begin1 () const {            return find1 (0, 0, 0);        }        BOOST_UBLAS_INLINE        const_iterator1 end1 () const {            return find1 (0, size1 (), 0);        }#ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR        class iterator1:            public container_reference<triangular_adaptor>,            public random_access_iterator_base<packed_random_access_iterator_tag,                                               iterator1, value_type> {        public:#ifndef BOOST_MSVC_STD_ITERATOR            typedef typename iterator_restrict_traits<typename iterator1_type::iterator_category,                                                      packed_random_access_iterator_tag>::iterator_category iterator_category;            typedef typename iterator1_type::value_type value_type;            typedef typename iterator1_type::difference_type difference_type;            typedef typename iterator1_type::reference reference;            typedef typename iterator1_type::pointer pointer;#else            typedef typename iterator_restrict_traits<typename M::iterator1::iterator_category,                                                      packed_random_access_iterator_tag>::iterator_category iterator_category;#endif            typedef iterator2 dual_iterator_type;            typedef reverse_iterator2 dual_reverse_iterator_type;            // Construction and destruction            BOOST_UBLAS_INLINE

⌨️ 快捷键说明

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