vector_proxy.hpp

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

HPP
1,567
字号
////  Copyright (c) 2000-2002//  Joerg Walter, Mathias Koch////  Distributed under the Boost Software License, Version 1.0. (See//  accompanying file LICENSE_1_0.txt or copy at//  http://www.boost.org/LICENSE_1_0.txt)////  The authors gratefully acknowledge the support of//  GeNeSys mbH & Co. KG in producing this work.//#ifndef _BOOST_UBLAS_VECTOR_PROXY_#define _BOOST_UBLAS_VECTOR_PROXY_#include <boost/numeric/ublas/vector_expression.hpp>#include <boost/numeric/ublas/detail/vector_assign.hpp>#include <boost/numeric/ublas/detail/temporary.hpp>// Iterators based on ideas of Jeremy Sieknamespace boost { namespace numeric { namespace ublas {    // Vector based range class    template<class V>    class vector_range:        public vector_expression<vector_range<V> > {        typedef vector_range<V> self_type;    public:#ifdef BOOST_UBLAS_ENABLE_PROXY_SHORTCUTS        using vector_expression<self_type>::operator ();#endif        typedef const V const_vector_type;        typedef V vector_type;        typedef typename V::size_type size_type;        typedef typename V::difference_type difference_type;        typedef typename V::value_type value_type;        typedef typename V::const_reference const_reference;        typedef typename boost::mpl::if_<boost::is_const<V>,                                          typename V::const_reference,                                          typename V::reference>::type reference;        typedef typename boost::mpl::if_<boost::is_const<V>,                                          typename V::const_closure_type,                                          typename V::closure_type>::type vector_closure_type;        typedef basic_range<size_type, difference_type> range_type;        typedef const self_type const_closure_type;        typedef self_type closure_type;        typedef typename storage_restrict_traits<typename V::storage_category,                                                 dense_proxy_tag>::storage_category storage_category;        // Construction and destruction        BOOST_UBLAS_INLINE        vector_range (vector_type &data, const range_type &r):            data_ (data), r_ (r.preprocess (data.size ())) {            // Early checking of preconditions here.            // BOOST_UBLAS_CHECK (r_.start () <= data_.size () &&            //                   r_.start () + r_.size () <= data_.size (), bad_index ());        }        BOOST_UBLAS_INLINE        vector_range (const vector_closure_type &data, const range_type &r, bool):            data_ (data), r_ (r.preprocess (data.size ())) {            // Early checking of preconditions here.            // BOOST_UBLAS_CHECK (r_.start () <= data_.size () &&            //                    r_.start () + r_.size () <= data_.size (), bad_index ());        }        // Accessors        BOOST_UBLAS_INLINE        size_type start () const {            return r_.start ();        }        BOOST_UBLAS_INLINE        size_type size () const {            return r_.size ();        }        // Storage accessors        BOOST_UBLAS_INLINE        const vector_closure_type &data () const {            return data_;        }        BOOST_UBLAS_INLINE        vector_closure_type &data () {            return data_;        }        // Element access#ifndef BOOST_UBLAS_PROXY_CONST_MEMBER        BOOST_UBLAS_INLINE        const_reference operator () (size_type i) const {            return data_ (r_ (i));        }        BOOST_UBLAS_INLINE        reference operator () (size_type i) {            return data_ (r_ (i));        }        BOOST_UBLAS_INLINE        const_reference operator [] (size_type i) const {            return (*this) (i);        }        BOOST_UBLAS_INLINE        reference operator [] (size_type i) {            return (*this) (i);        }#else        BOOST_UBLAS_INLINE        reference operator () (size_type i) const {            return data_ (r_ (i));        }        BOOST_UBLAS_INLINE        reference operator [] (size_type i) const {            return (*this) (i);        }#endif        // ISSUE can this be done in free project function?        // Although a const function can create a non-const proxy to a non-const object        // Critical is that vector_type and data_ (vector_closure_type) are const correct        BOOST_UBLAS_INLINE        vector_range<vector_type> project (const range_type &r) const {            return vector_range<vector_type> (data_, r_.compose (r.preprocess (data_.size ())), false);        }        // Assignment        BOOST_UBLAS_INLINE        vector_range &operator = (const vector_range &vr) {            // ISSUE need a temporary, proxy can be overlaping alias            vector_assign<scalar_assign> (*this, typename vector_temporary_traits<V>::type (vr));            return *this;        }        BOOST_UBLAS_INLINE        vector_range &assign_temporary (vector_range &vr) {            // assign elements, proxied container remains the same            vector_assign<scalar_assign> (*this, vr);            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        vector_range &operator = (const vector_expression<AE> &ae) {            vector_assign<scalar_assign> (*this, typename vector_temporary_traits<V>::type (ae));            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        vector_range &assign (const vector_expression<AE> &ae) {            vector_assign<scalar_assign> (*this, ae);            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        vector_range &operator += (const vector_expression<AE> &ae) {            vector_assign<scalar_assign> (*this, typename vector_temporary_traits<V>::type (*this + ae));            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        vector_range &plus_assign (const vector_expression<AE> &ae) {            vector_assign<scalar_plus_assign> (*this, ae);            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        vector_range &operator -= (const vector_expression<AE> &ae) {            vector_assign<scalar_assign> (*this, typename vector_temporary_traits<V>::type (*this - ae));            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        vector_range &minus_assign (const vector_expression<AE> &ae) {            vector_assign<scalar_minus_assign> (*this, ae);            return *this;        }        template<class AT>        BOOST_UBLAS_INLINE        vector_range &operator *= (const AT &at) {            vector_assign_scalar<scalar_multiplies_assign> (*this, at);            return *this;        }        template<class AT>        BOOST_UBLAS_INLINE        vector_range &operator /= (const AT &at) {            vector_assign_scalar<scalar_divides_assign> (*this, at);            return *this;        }        // Closure comparison        BOOST_UBLAS_INLINE        bool same_closure (const vector_range &vr) const {            return (*this).data_.same_closure (vr.data_);        }        // Comparison        BOOST_UBLAS_INLINE        bool operator == (const vector_range &vr) const {            return (*this).data_ == vr.data_ && r_ == vr.r_;        }        // Swapping        BOOST_UBLAS_INLINE        void swap (vector_range vr) {            if (this != &vr) {                BOOST_UBLAS_CHECK (size () == vr.size (), bad_size ());                // Sparse ranges may be nonconformant now.                // std::swap_ranges (begin (), end (), vr.begin ());                vector_swap<scalar_swap> (*this, vr);            }        }        BOOST_UBLAS_INLINE        friend void swap (vector_range vr1, vector_range vr2) {            vr1.swap (vr2);        }        // Iterator types    private:        typedef typename V::const_iterator const_subiterator_type;        typedef typename boost::mpl::if_<boost::is_const<V>,                                          typename V::const_iterator,                                          typename V::iterator>::type subiterator_type;    public:#ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR        typedef indexed_iterator<vector_range<vector_type>,                                 typename subiterator_type::iterator_category> iterator;        typedef indexed_const_iterator<vector_range<vector_type>,                                       typename const_subiterator_type::iterator_category> const_iterator;#else        class const_iterator;        class iterator;#endif        // Element lookup        BOOST_UBLAS_INLINE        const_iterator find (size_type i) const {            const_subiterator_type it (data_.find (start () + i));#ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR            return const_iterator (*this, it.index ());#else            return const_iterator (*this, it);#endif        }        BOOST_UBLAS_INLINE        iterator find (size_type i) {            subiterator_type it (data_.find (start () + i));#ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR            return iterator (*this, it.index ());#else            return iterator (*this, it);#endif        }#ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR        class const_iterator:            public container_const_reference<vector_range>,            public iterator_base_traits<typename const_subiterator_type::iterator_category>::template                        iterator_base<const_iterator, value_type>::type {        public:            typedef typename const_subiterator_type::difference_type difference_type;            typedef typename const_subiterator_type::value_type value_type;            typedef typename const_subiterator_type::reference reference;            typedef typename const_subiterator_type::pointer pointer;            // Construction and destruction            BOOST_UBLAS_INLINE            const_iterator ():                container_const_reference<self_type> (), it_ () {}            BOOST_UBLAS_INLINE            const_iterator (const self_type &vr, const const_subiterator_type &it):                container_const_reference<self_type> (vr), it_ (it) {}            BOOST_UBLAS_INLINE            const_iterator (const typename self_type::iterator &it):  // ISSUE self_type:: stops VC8 using std::iterator here                container_const_reference<self_type> (it ()), it_ (it.it_) {}            // Arithmetic            BOOST_UBLAS_INLINE            const_iterator &operator ++ () {                ++ it_;                return *this;            }            BOOST_UBLAS_INLINE            const_iterator &operator -- () {                -- it_;                return *this;            }            BOOST_UBLAS_INLINE            const_iterator &operator += (difference_type n) {                it_ += n;                return *this;            }            BOOST_UBLAS_INLINE            const_iterator &operator -= (difference_type n) {                it_ -= n;                return *this;            }            BOOST_UBLAS_INLINE            difference_type operator - (const const_iterator &it) const {                BOOST_UBLAS_CHECK ((*this) ().same_closure (it ()), external_logic ());                return it_ - it.it_;            }            // Dereference            BOOST_UBLAS_INLINE            const_reference operator * () const {                BOOST_UBLAS_CHECK (index () < (*this) ().size (), bad_index ());                return *it_;            }            BOOST_UBLAS_INLINE            const_reference operator [] (difference_type n) const {                return *(*this + n);            }            // Index            BOOST_UBLAS_INLINE            size_type index () const {                return it_.index () - (*this) ().start ();            }            // Assignment            BOOST_UBLAS_INLINE            const_iterator &operator = (const const_iterator &it) {                container_const_reference<self_type>::assign (&it ());                it_ = it.it_;                return *this;            }            // Comparison            BOOST_UBLAS_INLINE            bool operator == (const const_iterator &it) const {                BOOST_UBLAS_CHECK ((*this) ().same_closure (it ()), external_logic ());                return it_ == it.it_;            }            BOOST_UBLAS_INLINE            bool operator < (const const_iterator &it) const {                BOOST_UBLAS_CHECK ((*this) ().same_closure (it ()), external_logic ());                return it_ < it.it_;            }        private:            const_subiterator_type it_;        };#endif        BOOST_UBLAS_INLINE        const_iterator begin () const {            return find (0);        }        BOOST_UBLAS_INLINE        const_iterator end () const {            return find (size ());        }#ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR        class iterator:            public container_reference<vector_range>,            public iterator_base_traits<typename subiterator_type::iterator_category>::template                        iterator_base<iterator, value_type>::type {        public:            typedef typename subiterator_type::difference_type difference_type;            typedef typename subiterator_type::value_type value_type;            typedef typename subiterator_type::reference reference;            typedef typename subiterator_type::pointer pointer;            // Construction and destruction            BOOST_UBLAS_INLINE            iterator ():                container_reference<self_type> (), it_ () {}            BOOST_UBLAS_INLINE            iterator (self_type &vr, const subiterator_type &it):                container_reference<self_type> (vr), it_ (it) {}            // Arithmetic            BOOST_UBLAS_INLINE            iterator &operator ++ () {                ++ it_;                return *this;            }            BOOST_UBLAS_INLINE            iterator &operator -- () {                -- it_;                return *this;            }            BOOST_UBLAS_INLINE            iterator &operator += (difference_type n) {                it_ += n;                return *this;            }            BOOST_UBLAS_INLINE            iterator &operator -= (difference_type n) {                it_ -= n;                return *this;

⌨️ 快捷键说明

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