vector_proxy.hpp

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

HPP
1,567
字号
            }            BOOST_UBLAS_INLINE            difference_type operator - (const iterator &it) const {                BOOST_UBLAS_CHECK ((*this) ().same_closure (it ()), external_logic ());                return it_ - it.it_;            }            // Dereference            BOOST_UBLAS_INLINE            reference operator * () const {                BOOST_UBLAS_CHECK (index () < (*this) ().size (), bad_index ());                return *it_;            }            BOOST_UBLAS_INLINE            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            iterator &operator = (const iterator &it) {                container_reference<self_type>::assign (&it ());                it_ = it.it_;                return *this;            }            // Comparison            BOOST_UBLAS_INLINE            bool operator == (const iterator &it) const {                BOOST_UBLAS_CHECK ((*this) ().same_closure (it ()), external_logic ());                return it_ == it.it_;            }            BOOST_UBLAS_INLINE            bool operator < (const iterator &it) const {                BOOST_UBLAS_CHECK ((*this) ().same_closure (it ()), external_logic ());                return it_ < it.it_;            }        private:            subiterator_type it_;            friend class const_iterator;        };#endif        BOOST_UBLAS_INLINE        iterator begin () {            return find (0);        }        BOOST_UBLAS_INLINE        iterator end () {            return find (size ());        }        // Reverse iterator        typedef reverse_iterator_base<const_iterator> const_reverse_iterator;        typedef reverse_iterator_base<iterator> reverse_iterator;        BOOST_UBLAS_INLINE        const_reverse_iterator rbegin () const {            return const_reverse_iterator (end ());        }        BOOST_UBLAS_INLINE        const_reverse_iterator rend () const {            return const_reverse_iterator (begin ());        }        BOOST_UBLAS_INLINE        reverse_iterator rbegin () {            return reverse_iterator (end ());        }        BOOST_UBLAS_INLINE        reverse_iterator rend () {            return reverse_iterator (begin ());        }    private:        vector_closure_type data_;        range_type r_;    };    // Simple Projections    template<class V>    BOOST_UBLAS_INLINE    vector_range<V> subrange (V &data, typename V::size_type start, typename V::size_type stop) {        typedef basic_range<typename V::size_type, typename V::difference_type> range_type;        return vector_range<V> (data, range_type (start, stop));    }    template<class V>    BOOST_UBLAS_INLINE    vector_range<const V> subrange (const V &data, typename V::size_type start, typename V::size_type stop) {        typedef basic_range<typename V::size_type, typename V::difference_type> range_type;        return vector_range<const V> (data, range_type (start, stop));    }    // Generic Projections    template<class V>    BOOST_UBLAS_INLINE    vector_range<V> project (V &data, typename vector_range<V>::range_type const &r) {        return vector_range<V> (data, r);    }    template<class V>    BOOST_UBLAS_INLINE    const vector_range<const V> project (const V &data, typename vector_range<V>::range_type const &r) {        // ISSUE was: return vector_range<V> (const_cast<V &> (data), r);        return vector_range<const V> (data, r);    }    template<class V>    BOOST_UBLAS_INLINE    vector_range<V> project (vector_range<V> &data, const typename vector_range<V>::range_type &r) {        return data.project (r);    }    template<class V>    BOOST_UBLAS_INLINE    const vector_range<V> project (const vector_range<V> &data, const typename vector_range<V>::range_type &r) {        return data.project (r);    }    // Specialization of temporary_traits    template <class V>    struct vector_temporary_traits< vector_range<V> >    : vector_temporary_traits< V > {} ;    template <class V>    struct vector_temporary_traits< const vector_range<V> >    : vector_temporary_traits< V > {} ;    // Vector based slice class    template<class V>    class vector_slice:        public vector_expression<vector_slice<V> > {        typedef vector_slice<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 basic_slice<size_type, difference_type> slice_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_slice (vector_type &data, const slice_type &s):            data_ (data), s_ (s.preprocess (data.size ())) {            // Early checking of preconditions here.            // BOOST_UBLAS_CHECK (s_.start () <= data_.size () &&            //                    s_.start () + s_.stride () * (s_.size () - (s_.size () > 0)) <= data_.size (), bad_index ());        }        BOOST_UBLAS_INLINE        vector_slice (const vector_closure_type &data, const slice_type &s, int):            data_ (data), s_ (s.preprocess (data.size ())) {            // Early checking of preconditions here.            // BOOST_UBLAS_CHECK (s_.start () <= data_.size () &&            //                    s_.start () + s_.stride () * (s_.size () - (s_.size () > 0)) <= data_.size (), bad_index ());        }        // Accessors        BOOST_UBLAS_INLINE        size_type start () const {            return s_.start ();        }        BOOST_UBLAS_INLINE        difference_type stride () const {            return s_.stride ();        }        BOOST_UBLAS_INLINE        size_type size () const {            return s_.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_ (s_ (i));        }        BOOST_UBLAS_INLINE        reference operator () (size_type i) {            return data_ (s_ (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_ (s_ (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_slice<vector_type> project (const range_type &r) const {            return vector_slice<vector_type>  (data_, s_.compose (r.preprocess (data_.size ())), false);        }        BOOST_UBLAS_INLINE        vector_slice<vector_type> project (const slice_type &s) const {            return vector_slice<vector_type>  (data_, s_.compose (s.preprocess (data_.size ())), false);        }        // Assignment        BOOST_UBLAS_INLINE        vector_slice &operator = (const vector_slice &vs) {            // ISSUE need a temporary, proxy can be overlaping alias            vector_assign<scalar_assign> (*this, typename vector_temporary_traits<V>::type (vs));            return *this;        }        BOOST_UBLAS_INLINE        vector_slice &assign_temporary (vector_slice &vs) {            // assign elements, proxied container remains the same            vector_assign<scalar_assign> (*this, vs);            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        vector_slice &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_slice &assign (const vector_expression<AE> &ae) {            vector_assign<scalar_assign> (*this, ae);            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        vector_slice &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_slice &plus_assign (const vector_expression<AE> &ae) {            vector_assign<scalar_plus_assign> (*this, ae);            return *this;        }        template<class AE>        BOOST_UBLAS_INLINE        vector_slice &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_slice &minus_assign (const vector_expression<AE> &ae) {            vector_assign<scalar_minus_assign> (*this, ae);            return *this;        }        template<class AT>        BOOST_UBLAS_INLINE        vector_slice &operator *= (const AT &at) {            vector_assign_scalar<scalar_multiplies_assign> (*this, at);            return *this;        }        template<class AT>        BOOST_UBLAS_INLINE        vector_slice &operator /= (const AT &at) {            vector_assign_scalar<scalar_divides_assign> (*this, at);            return *this;        }        // Closure comparison        BOOST_UBLAS_INLINE        bool same_closure (const vector_slice &vr) const {            return (*this).data_.same_closure (vr.data_);        }        // Comparison        BOOST_UBLAS_INLINE        bool operator == (const vector_slice &vs) const {            return (*this).data_ == vs.data_ && s_ == vs.s_;        }        // Swapping        BOOST_UBLAS_INLINE        void swap (vector_slice vs) {            if (this != &vs) {                BOOST_UBLAS_CHECK (size () == vs.size (), bad_size ());                // Sparse ranges may be nonconformant now.                // std::swap_ranges (begin (), end (), vs.begin ());                vector_swap<scalar_swap> (*this, vs);            }        }        BOOST_UBLAS_INLINE        friend void swap (vector_slice vs1, vector_slice vs2) {            vs1.swap (vs2);        }        // Iterator types    private:        // Use slice as an index - FIXME this fails for packed assignment        typedef typename slice_type::const_iterator const_subiterator_type;        typedef typename slice_type::const_iterator subiterator_type;    public:#ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR        typedef indexed_iterator<vector_slice<vector_type>,                                 typename vector_type::iterator::iterator_category> iterator;        typedef indexed_const_iterator<vector_slice<vector_type>,                                       typename vector_type::const_iterator::iterator_category> const_iterator;#else        class const_iterator;        class iterator;#endif        // Element lookup        BOOST_UBLAS_INLINE        const_iterator find (size_type i) const {#ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR            return const_iterator (*this, i);#else            return const_iterator (*this, s_.begin () + i);#endif        }        BOOST_UBLAS_INLINE        iterator find (size_type i) {#ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR            return iterator (*this, i);#else            return iterator (*this, s_.begin () + i);#endif        }#ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR        class const_iterator:            public container_const_reference<vector_slice>,            public iterator_base_traits<typename V::const_iterator::iterator_category>::template                        iterator_base<const_iterator, value_type>::type {        public:            typedef typename V::const_iterator::difference_type difference_type;            typedef typename V::const_iterator::value_type value_type;            typedef typename V::const_reference reference;    //FIXME due to indexing access            typedef typename V::const_iterator::pointer pointer;            // Construction and destruction            BOOST_UBLAS_INLINE            const_iterator ():                container_const_reference<self_type> (), it_ () {}            BOOST_UBLAS_INLINE            const_iterator (const self_type &vs, const const_subiterator_type &it):                container_const_reference<self_type> (vs), 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

⌨️ 快捷键说明

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