hermitian.hpp

来自「Boost provides free peer-reviewed portab」· HPP 代码 · 共 1,677 行 · 第 1/5 页

HPP
1,677
字号
            matrix_assign_scalar<scalar_divides_assign> (*this, at);            return *this;        }        // Closure comparison        BOOST_UBLAS_INLINE        bool same_closure (const hermitian_adaptor &ha) const {            return (*this).data ().same_closure (ha.data ());        }        // Swapping        BOOST_UBLAS_INLINE        void swap (hermitian_adaptor &m) {            if (this != &m)                matrix_swap<scalar_swap, triangular_type> (*this, m);        }        BOOST_UBLAS_INLINE        friend void swap (hermitian_adaptor &m1, hermitian_adaptor &m2) {            m1.swap (m2);        }        // Iterator types    private:        // Use matrix iterator        typedef typename M::const_iterator1 const_subiterator1_type;        typedef typename boost::mpl::if_<boost::is_const<M>,                                          typename M::const_iterator1,                                          typename M::iterator1>::type subiterator1_type;        typedef typename M::const_iterator2 const_subiterator2_type;        typedef typename boost::mpl::if_<boost::is_const<M>,                                          typename M::const_iterator2,                                          typename M::iterator2>::type subiterator2_type;    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, dense_random_access_iterator_tag> const_iterator1;        typedef indexed_const_iterator2<self_type, dense_random_access_iterator_tag> const_iterator2;#else        class const_iterator1;        class iterator1;        class const_iterator2;        class iterator2;#endif        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;        // Element lookup        BOOST_UBLAS_INLINE        const_iterator1 find1 (int rank, size_type i, size_type j) const {            if (triangular_type::other (i, j)) {                if (triangular_type::other (size1 (), j)) {                    return const_iterator1 (*this, 0, 0,                                            data ().find1 (rank, i, j), data ().find1 (rank, size1 (), j),                                            data ().find2 (rank, size2 (), size1 ()), data ().find2 (rank, size2 (), size1 ()));                } else {                    return const_iterator1 (*this, 0, 1,                                            data ().find1 (rank, i, j), data ().find1 (rank, j, j),                                            data ().find2 (rank, j, j), data ().find2 (rank, j, size1 ()));                }            } else {                if (triangular_type::other (size1 (), j)) {                    return const_iterator1 (*this, 1, 0,                                            data ().find1 (rank, j, j), data ().find1 (rank, size1 (), j),                                            data ().find2 (rank, j, i), data ().find2 (rank, j, j));                } else {                    return const_iterator1 (*this, 1, 1,                                            data ().find1 (rank, size1 (), size2 ()), data ().find1 (rank, size1 (), size2 ()),                                            data ().find2 (rank, j, i), data ().find2 (rank, j, size1 ()));                }            }        }        BOOST_UBLAS_INLINE        iterator1 find1 (int rank, size_type i, size_type j) {            if (rank == 1)                i = triangular_type::mutable_restrict1 (i, j, size1(), size2());            if (rank == 0)                i = triangular_type::global_mutable_restrict1 (i, size1(), j, size2());            return iterator1 (*this, data ().find1 (rank, i, j));        }        BOOST_UBLAS_INLINE        const_iterator2 find2 (int rank, size_type i, size_type j) const {            if (triangular_type::other (i, j)) {                if (triangular_type::other (i, size2 ())) {                    return const_iterator2 (*this, 1, 1,                                            data ().find1 (rank, size2 (), size1 ()), data ().find1 (rank, size2 (), size1 ()),                                            data ().find2 (rank, i, j), data ().find2 (rank, i, size2 ()));                } else {                    return const_iterator2 (*this, 1, 0,                                            data ().find1 (rank, i, i), data ().find1 (rank, size2 (), i),                                            data ().find2 (rank, i, j), data ().find2 (rank, i, i));                }            } else {                if (triangular_type::other (i, size2 ())) {                    return const_iterator2 (*this, 0, 1,                                            data ().find1 (rank, j, i), data ().find1 (rank, i, i),                                            data ().find2 (rank, i, i), data ().find2 (rank, i, size2 ()));                } else {                    return const_iterator2 (*this, 0, 0,                                            data ().find1 (rank, j, i), data ().find1 (rank, size2 (), i),                                            data ().find2 (rank, size1 (), size2 ()), data ().find2 (rank, size2 (), size2 ()));                }            }        }        BOOST_UBLAS_INLINE        iterator2 find2 (int rank, size_type i, size_type j) {            if (rank == 1)                j = triangular_type::mutable_restrict2 (i, j, size1(), size2());            if (rank == 0)                j = triangular_type::global_mutable_restrict2 (i, size1(), j, size2());            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<hermitian_adaptor>,            public random_access_iterator_base<typename iterator_restrict_traits<                                                   typename const_subiterator1_type::iterator_category, dense_random_access_iterator_tag>::iterator_category,                                               const_iterator1, value_type> {        public:            typedef typename const_subiterator1_type::value_type value_type;            typedef typename const_subiterator1_type::difference_type difference_type;            // FIXME no better way to not return the address of a temporary?            // typedef typename const_subiterator1_type::reference reference;            typedef typename const_subiterator1_type::value_type reference;            typedef typename const_subiterator1_type::pointer pointer;            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> (),                begin_ (-1), end_ (-1), current_ (-1),                it1_begin_ (), it1_end_ (), it1_ (),                it2_begin_ (), it2_end_ (), it2_ () {}            BOOST_UBLAS_INLINE            const_iterator1 (const self_type &m, int begin, int end,                             const const_subiterator1_type &it1_begin, const const_subiterator1_type &it1_end,                             const const_subiterator2_type &it2_begin, const const_subiterator2_type &it2_end):                container_const_reference<self_type> (m),                begin_ (begin), end_ (end), current_ (begin),                it1_begin_ (it1_begin), it1_end_ (it1_end), it1_ (it1_begin_),                it2_begin_ (it2_begin), it2_end_ (it2_end), it2_ (it2_begin_) {                if (current_ == 0 && it1_ == it1_end_)                    current_ = 1;                if (current_ == 1 && it2_ == it2_end_)                    current_ = 0;                if ((current_ == 0 && it1_ == it1_end_) ||                    (current_ == 1 && it2_ == it2_end_))                    current_ = end_;                BOOST_UBLAS_CHECK (current_ == end_ ||                                   (current_ == 0 && it1_ != it1_end_) ||                                   (current_ == 1 && it2_ != it2_end_), internal_logic ());            }            // FIXME cannot compile            //  iterator1 does not have these members!            BOOST_UBLAS_INLINE            const_iterator1 (const iterator1 &it):                container_const_reference<self_type> (it ()),                begin_ (it.begin_), end_ (it.end_), current_ (it.current_),                it1_begin_ (it.it1_begin_), it1_end_ (it.it1_end_), it1_ (it.it1_),                it2_begin_ (it.it2_begin_), it2_end_ (it.it2_end_), it2_ (it.it2_) {                BOOST_UBLAS_CHECK (current_ == end_ ||                                   (current_ == 0 && it1_ != it1_end_) ||                                   (current_ == 1 && it2_ != it2_end_), internal_logic ());            }            // Arithmetic            BOOST_UBLAS_INLINE            const_iterator1 &operator ++ () {                BOOST_UBLAS_CHECK (current_ == 0 || current_ == 1, internal_logic ());                if (current_ == 0) {                    BOOST_UBLAS_CHECK (it1_ != it1_end_, internal_logic ());                    ++ it1_;                    if (it1_ == it1_end_ && end_ == 1) {                        it2_ = it2_begin_;                        current_ = 1;                    }                } else /* if (current_ == 1) */ {                    BOOST_UBLAS_CHECK (it2_ != it2_end_, internal_logic ());                    ++ it2_;                    if (it2_ == it2_end_ && end_ == 0) {                        it1_ = it1_begin_;                        current_ = 0;                    }                }                return *this;            }            BOOST_UBLAS_INLINE            const_iterator1 &operator -- () {                BOOST_UBLAS_CHECK (current_ == 0 || current_ == 1, internal_logic ());                if (current_ == 0) {                    if (it1_ == it1_begin_ && begin_ == 1) {                        it2_ = it2_end_;                        BOOST_UBLAS_CHECK (it2_ != it2_begin_, internal_logic ());                        -- it2_;                        current_ = 1;                    } else {                        -- it1_;                    }                } else /* if (current_ == 1) */ {                    if (it2_ == it2_begin_ && begin_ == 0) {                        it1_ = it1_end_;                        BOOST_UBLAS_CHECK (it1_ != it1_begin_, internal_logic ());                        -- it1_;                        current_ = 0;                    } else {                        -- it2_;                    }                }                return *this;            }            BOOST_UBLAS_INLINE            const_iterator1 &operator += (difference_type n) {                BOOST_UBLAS_CHECK (current_ == 0 || current_ == 1, internal_logic ());                if (current_ == 0) {                    size_type d = (std::min) (n, it1_end_ - it1_);                    it1_ += d;                    n -= d;                    if (n > 0 || (end_ == 1 && it1_ == it1_end_)) {                        BOOST_UBLAS_CHECK (end_ == 1, external_logic ());                        d = (std::min) (n, it2_end_ - it2_begin_);                        it2_ = it2_begin_ + d;                        n -= d;                        current_ = 1;                    }                } else /* if (current_ == 1) */ {                    size_type d = (std::min) (n, it2_end_ - it2_);                    it2_ += d;                    n -= d;                    if (n > 0 || (end_ == 0 && it2_ == it2_end_)) {                        BOOST_UBLAS_CHECK (end_ == 0, external_logic ());                        d = (std::min) (n, it1_end_ - it1_begin_);                        it1_ = it1_begin_ + d;                        n -= d;                        current_ = 0;                    }                }                BOOST_UBLAS_CHECK (n == 0, external_logic ());                return *this;            }            BOOST_UBLAS_INLINE            const_iterator1 &operator -= (difference_type n) {                BOOST_UBLAS_CHECK (current_ == 0 || current_ == 1, internal_logic ());                if (current_ == 0) {                    size_type d = (std::min) (n, it1_ - it1_begin_);                    it1_ -= d;                    n -= d;                    if (n > 0) {                        BOOST_UBLAS_CHECK (end_ == 1, external_logic ());                        d = (std::min) (n, it2_end_ - it2_begin_);                        it2_ = it2_end_ - d;                        n -= d;                        current_ = 1;                    }                } else /* if (current_ == 1) */ {                    size_type d = (std::min) (n, it2_ - it2_begin_);                    it2_ -= d;                    n -= d;                    if (n > 0) {                        BOOST_UBLAS_CHECK (end_ == 0, external_logic ());                        d = (std::min) (n, it1_end_ - it1_begin_);                        it1_ = it1_end_ - d;                        n -= d;                        current_ = 0;                    }                }                BOOST_UBLAS_CHECK (n == 0, external_logic ());                return *this;            }            BOOST_UBLAS_INLINE            difference_type operator - (const const_iterator1 &it) const {                BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());                BOOST_UBLAS_CHECK (current_ == 0 || current_ == 1, internal_logic ());                BOOST_UBLAS_CHECK (it.current_ == 0 || it.current_ == 1, internal_logic ());                BOOST_UBLAS_CHECK (/* begin_ == it.begin_ && */ end_ == it.end_, internal_logic ());                if (current_ == 0 && it.current_ == 0) {                    return it1_ - it.it1_;                } else if (current_ == 0 && it.current_ == 1) {                    if (end_ == 1 && it.end_ == 1) {                        return (it1_ - it.it1_end_) + (it.it2_begin_ - it.it2_);                    } else /* if (end_ == 0 && it.end_ == 0) */ {                        return (it1_ - it.it1_begin_) + (it.it2_end_ - it.it2_);                    }                } else if (current_ == 1 && it.current_ == 0) {                    if (end_ == 1 && it.end_ == 1) {                        return (it2_ - it.it2_begin_) + (it.it1_end_ - it.it1_);                    } else /* if (end_ == 0 && it.end_ == 0) */ {                        return (it2_ - it.it2_end_) + (it.it1_begin_ - it.it1_);                    }                } else /* if (current_ == 1 && it.current_ == 1) */ {                    return it2_ - it.it2_;                }            }            // Dereference            BOOST_UBLAS_INLINE            const_reference operator * () const {                BOOST_UBLAS_CHECK (current_ == 0 || current_ == 1, internal_logic ());                if (current_ == 0) {                    BOOST_UBLAS_CHECK (it1_ != it1_end_, internal_logic ());                    if (triangular_type::other (index1 (), index2 ()))                        return *it1_;                    else                        return type_traits<value_type>::conj (*it1_);                } else /* if (current_ == 1) */ {                    BOOST_UBLAS_CHECK (it2_ != it2_end_, internal_logic ());                    if (triangular_type::other (index1 (), index2 ()))                        return *it2_;                    else                        return type_traits<value_type>::conj (*it2_);                }            }            BOOST_UBLAS_INLINE            const_reference operator [] (difference_type n) const {                return *(*this + n);            }#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 {        

⌨️ 快捷键说明

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