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

📄 matrix.hpp

📁 CGAL is a collaborative effort of several sites in Europe and Israel. The goal is to make the most i
💻 HPP
📖 第 1 页 / 共 5 页
字号:
                BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ());                return *it_;            }#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 {                const self_type &m = (*this) ();                return m.find2 (1, index1 (), 0);            }            BOOST_UBLAS_INLINE#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION            typename self_type::#endif            const_iterator2 end () const {                const self_type &m = (*this) ();                return m.find2 (1, index1 (), m.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 i_;            }            BOOST_UBLAS_INLINE            size_type index2 () const {                return j_;            }            // Assignment            BOOST_UBLAS_INLINE            const_iterator1 &operator = (const const_iterator1 &it) {                container_const_reference<self_type>::assign (&it ());                it_ = it.it_;                return *this;            }            // Comparison            BOOST_UBLAS_INLINE            bool operator == (const const_iterator1 &it) const {                BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());                BOOST_UBLAS_CHECK (index2 () == it.index2 (), bad_index ());                return it_ == it.it_;            }            BOOST_UBLAS_INLINE            bool operator < (const const_iterator1 &it) const {                BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());                BOOST_UBLAS_CHECK (index2 () == it.index2 (), bad_index ());                return it_ < it.it_;            }        private:            size_type i_;            size_type j_;            const_iterator_type it_;            friend class iterator1;        };#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<vector_of_vector>,            public random_access_iterator_base<dense_random_access_iterator_tag,                                               iterator1, value_type> {        public:            typedef dense_random_access_iterator_tag iterator_category;#ifndef BOOST_MSVC_STD_ITERATOR            typedef typename vector_of_vector::value_type value_type;            typedef typename vector_of_vector::difference_type difference_type;            typedef typename vector_of_vector::reference reference;            typedef typename vector_of_vector::pointer pointer;#endif            typedef iterator2 dual_iterator_type;            typedef reverse_iterator2 dual_reverse_iterator_type;            // Construction and destruction            BOOST_UBLAS_INLINE            iterator1 ():                container_reference<self_type> (), i_ (), j_ (), it_ () {}            BOOST_UBLAS_INLINE            iterator1 (self_type &m, size_type i, size_type j, const iterator_type &it):                container_reference<self_type> (m), i_ (i), j_ (j), it_ (it) {}            // Arithmetic            BOOST_UBLAS_INLINE            iterator1 &operator ++ () {                ++ i_;                self_type &m = (*this) ();                if (functor_type::fast1 ())                    ++ it_;                else                    it_ = m.find1 (1, i_, j_).it_;                return *this;            }            BOOST_UBLAS_INLINE            iterator1 &operator -- () {                -- i_;                self_type &m = (*this) ();                if (functor_type::fast1 ())                    -- it_;                else                    it_ = m.find1 (1, i_, j_).it_;                return *this;            }            BOOST_UBLAS_INLINE            iterator1 &operator += (difference_type n) {                i_ += n;                self_type &m = (*this) ();                it_ = m.find1 (1, i_, j_).it_;                return *this;            }            BOOST_UBLAS_INLINE            iterator1 &operator -= (difference_type n) {                i_ -= n;                self_type &m = (*this) ();                it_ = m.find1 (1, i_, j_).it_;                return *this;            }            BOOST_UBLAS_INLINE            difference_type operator - (const iterator1 &it) const {                BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());                BOOST_UBLAS_CHECK (index2 () == it.index2 (), bad_index ());                return index1 () - it.index1 ();            }            // Dereference            BOOST_UBLAS_INLINE            reference operator * () const {                BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ());                BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ());                return *it_;            }#ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION            BOOST_UBLAS_INLINE#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION            typename self_type::#endif            iterator2 begin () const {                self_type &m = (*this) ();                return m.find2 (1, index1 (), 0);            }            BOOST_UBLAS_INLINE#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION            typename self_type::#endif            iterator2 end () const {                self_type &m = (*this) ();                return m.find2 (1, index1 (), m.size2 ());            }            BOOST_UBLAS_INLINE#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION            typename self_type::#endif            reverse_iterator2 rbegin () const {                return reverse_iterator2 (end ());            }            BOOST_UBLAS_INLINE#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION            typename self_type::#endif            reverse_iterator2 rend () const {                return reverse_iterator2 (begin ());            }#endif            // Indices            BOOST_UBLAS_INLINE            size_type index1 () const {                return i_;            }            BOOST_UBLAS_INLINE            size_type index2 () const {                return j_;            }            // Assignment            BOOST_UBLAS_INLINE            iterator1 &operator = (const iterator1 &it) {                container_reference<self_type>::assign (&it ());                it_ = it.it_;                return *this;            }            // Comparison            BOOST_UBLAS_INLINE            bool operator == (const iterator1 &it) const {                BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());                BOOST_UBLAS_CHECK (index2 () == it.index2 (), bad_index ());                return it_ == it.it_;            }            BOOST_UBLAS_INLINE            bool operator < (const iterator1 &it) const {                BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());                BOOST_UBLAS_CHECK (index2 () == it.index2 (), bad_index ());                return it_ < it.it_;            }        private:            size_type i_;            size_type j_;            iterator_type it_;            friend class const_iterator1;        };#endif        BOOST_UBLAS_INLINE        iterator1 begin1 () {            return find1 (0, 0, 0);        }        BOOST_UBLAS_INLINE        iterator1 end1 () {            return find1 (0, size1_, 0);        }#ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR        class const_iterator2:            public container_const_reference<vector_of_vector>,            public random_access_iterator_base<dense_random_access_iterator_tag,                                               const_iterator2, value_type> {        public:            typedef dense_random_access_iterator_tag iterator_category;#ifdef BOOST_MSVC_STD_ITERATOR            typedef const_reference reference;#else            typedef typename vector_of_vector::value_type value_type;            typedef typename vector_of_vector::difference_type difference_type;            typedef typename vector_of_vector::const_reference reference;            typedef const typename vector_of_vector::pointer pointer;#endif            typedef const_iterator1 dual_iterator_type;            typedef const_reverse_iterator1 dual_reverse_iterator_type;            // Construction and destruction            BOOST_UBLAS_INLINE            const_iterator2 ():                container_const_reference<self_type> (), i_ (), j_ (), it_ () {}            BOOST_UBLAS_INLINE            const_iterator2 (const self_type &m, size_type i, size_type j, const const_iterator_type &it):                container_const_reference<self_type> (m), i_ (i), j_ (j), it_ (it) {}            BOOST_UBLAS_INLINE            const_iterator2 (const iterator2 &it):                container_const_reference<self_type> (it ()), i_ (it.i_), j_ (it.j_), it_ (it.it_) {}            // Arithmetic            BOOST_UBLAS_INLINE            const_iterator2 &operator ++ () {                ++ j_;                const self_type &m = (*this) ();                if (functor_type::fast2 ())                    ++ it_;                else                    it_ = m.find2 (1, i_, j_).it_;                return *this;            }            BOOST_UBLAS_INLINE            const_iterator2 &operator -- () {                -- j_;                const self_type &m = (*this) ();                if (functor_type::fast2 ())                    -- it_;                else                    it_ = m.find2 (1, i_, j_).it_;                return *this;            }            BOOST_UBLAS_INLINE            const_iterator2 &operator += (difference_type n) {                j_ += n;                const self_type &m = (*this) ();                it_ = m.find2 (1, i_, j_).it_;                return *this;            }            BOOST_UBLAS_INLINE            const_iterator2 &operator -= (difference_type n) {                j_ -= n;                const self_type &m = (*this) ();                it_ = m.find2 (1, i_, j_).it_;                return *this;            }            BOOST_UBLAS_INLINE            difference_type operator - (const const_iterator2 &it) const {                BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());                BOOST_UBLAS_CHECK (index1 () == it.index1 (), bad_index ());                return index2 () - it.index2 ();            }            // Dereference            BOOST_UBLAS_INLINE            const_reference operator * () const {                BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ());                BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ());                return *it_;            }#ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION            BOOST_UBLAS_INLINE#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION            typename self_type::#endif            const_iterator1 begin () const {                const self_type &m = (*this) ();                return m.find1 (1, 0, index2 ());            }            BOOST_UBLAS_INLINE#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION            typename self_type::

⌨️ 快捷键说明

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