📄 vector.hpp
字号:
//
// Copyright (c) 2000-2002
// Joerg Walter, Mathias Koch
//
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation. The authors make no representations
// about the suitability of this software for any purpose.
// It is provided "as is" without express or implied warranty.
//
// The authors gratefully acknowledge the support of
// GeNeSys mbH & Co. KG in producing this work.
//
#ifndef BOOST_UBLAS_VECTOR_H
#define BOOST_UBLAS_VECTOR_H
#include <boost/numeric/ublas/config.hpp>
#include <boost/numeric/ublas/storage.hpp>
#include <boost/numeric/ublas/vector_expression.hpp>
#include <boost/numeric/ublas/vector_assign.hpp>
#include <boost/numeric/ublas/vector_proxy.hpp>
// Iterators based on ideas of Jeremy Siek
namespace boost { namespace numeric { namespace ublas {
// Array based vector class
template<class T, class A>
class vector:
public vector_expression<vector<T, A> > {
public:
#ifndef BOOST_UBLAS_NO_PROXY_SHORTCUTS
BOOST_UBLAS_USING vector_expression<vector<T, A> >::operator ();
#endif
typedef concrete_tag simd_category;
typedef std::size_t size_type;
typedef std::ptrdiff_t difference_type;
typedef T value_type;
// typedef const T &const_reference;
typedef typename type_traits<T>::const_reference const_reference;
typedef T &reference;
typedef const T *const_pointer;
typedef T *pointer;
typedef A array_type;
typedef const A const_array_type;
typedef const vector<T, A> const_self_type;
typedef vector<T, A> self_type;
#ifndef BOOST_UBLAS_CT_REFERENCE_BASE_TYPEDEFS
typedef const vector_const_reference<const_self_type> const_closure_type;
#else
typedef const vector_reference<const_self_type> const_closure_type;
#endif
typedef vector_reference<self_type> closure_type;
typedef typename A::const_iterator const_iterator_type;
typedef typename A::iterator iterator_type;
typedef dense_tag storage_category;
// Construction and destruction
BOOST_UBLAS_INLINE
vector ():
vector_expression<self_type> (),
size_ (0), data_ (0) {}
BOOST_UBLAS_EXPLICIT BOOST_UBLAS_INLINE
vector (size_type size):
vector_expression<self_type> (),
size_ (size), data_ (0) {
resize (size);
}
BOOST_UBLAS_INLINE
vector (size_type size, const array_type &data):
vector_expression<self_type> (),
size_ (size), data_ (data) {}
BOOST_UBLAS_INLINE
vector (const vector &v):
vector_expression<self_type> (),
size_ (v.size_), data_ (v.data_) {}
template<class AE>
BOOST_UBLAS_INLINE
vector (const vector_expression<AE> &ae):
vector_expression<self_type> (),
size_ (ae ().size ()), data_ (0) {
#ifndef BOOST_UBLAS_TYPE_CHECK
resize (ae ().size (), false);
#else
resize (ae ().size (), true);
#endif
vector_assign (scalar_assign<reference, BOOST_UBLAS_TYPENAME AE::value_type> (), *this, ae);
}
// Accessors
BOOST_UBLAS_INLINE
size_type size () const {
return size_;
}
BOOST_UBLAS_INLINE
const_array_type &data () const {
return data_;
}
BOOST_UBLAS_INLINE
array_type &data () {
return data_;
}
// Resizing
BOOST_UBLAS_INLINE
void resize (size_type size, bool preserve = true) {
size_ = size;
detail::resize (data (), size, preserve);
}
// Element access
BOOST_UBLAS_INLINE
const_reference operator () (size_type i) const {
return data () [i];
}
BOOST_UBLAS_INLINE
reference operator () (size_type i) {
return data () [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);
}
// Assignment
BOOST_UBLAS_INLINE
vector &operator = (const vector &v) {
// Precondition for container relaxed as requested during review.
// BOOST_UBLAS_CHECK (size_ == v.size_, bad_size ());
size_ = v.size_;
data () = v.data ();
return *this;
}
BOOST_UBLAS_INLINE
vector &assign_temporary (vector &v) {
swap (v);
return *this;
}
template<class AE>
BOOST_UBLAS_INLINE
vector &operator = (const vector_expression<AE> &ae) {
#ifdef BOOST_UBLAS_MUTABLE_TEMPORARY
return assign_temporary (self_type (ae));
#else
// return assign (self_type (ae));
self_type temporary (ae);
return assign_temporary (temporary);
#endif
}
template<class AE>
BOOST_UBLAS_INLINE
vector &reset (const vector_expression<AE> &ae) {
self_type temporary (ae);
resize (temporary.size (), false);
return assign_temporary (temporary);
}
template<class AE>
BOOST_UBLAS_INLINE
vector &assign (const vector_expression<AE> &ae) {
vector_assign (scalar_assign<reference, BOOST_UBLAS_TYPENAME AE::value_type> (), *this, ae);
return *this;
}
template<class AE>
BOOST_UBLAS_INLINE
vector &operator += (const vector_expression<AE> &ae) {
#ifdef BOOST_UBLAS_MUTABLE_TEMPORARY
return assign_temporary (self_type (*this + ae));
#else
// return assign (self_type (*this + ae));
self_type temporary (*this + ae);
return assign_temporary (temporary);
#endif
}
template<class AE>
BOOST_UBLAS_INLINE
vector &plus_assign (const vector_expression<AE> &ae) {
vector_assign (scalar_plus_assign<reference, BOOST_UBLAS_TYPENAME AE::value_type> (), *this, ae);
return *this;
}
template<class AE>
BOOST_UBLAS_INLINE
vector &operator -= (const vector_expression<AE> &ae) {
#ifdef BOOST_UBLAS_MUTABLE_TEMPORARY
return assign_temporary (self_type (*this - ae));
#else
// return assign (self_type (*this - ae));
self_type temporary (*this - ae);
return assign_temporary (temporary);
#endif
}
template<class AE>
BOOST_UBLAS_INLINE
vector &minus_assign (const vector_expression<AE> &ae) {
vector_assign (scalar_minus_assign<reference, BOOST_UBLAS_TYPENAME AE::value_type> (), *this, ae);
return *this;
}
template<class AT>
BOOST_UBLAS_INLINE
vector &operator *= (const AT &at) {
vector_assign_scalar (scalar_multiplies_assign<reference, AT> (), *this, at);
return *this;
}
template<class AT>
BOOST_UBLAS_INLINE
vector &operator /= (const AT &at) {
vector_assign_scalar (scalar_divides_assign<reference, AT> (), *this, at);
return *this;
}
// Swapping
BOOST_UBLAS_INLINE
void swap (vector &v) {
// Too unusual semantic.
// BOOST_UBLAS_CHECK (this != &v, external_logic ());
if (this != &v) {
// Precondition for container relaxed as requested during review.
// BOOST_UBLAS_CHECK (size_ == v.size_, bad_size ());
std::swap (size_, v.size_);
data ().swap (v.data ());
}
}
#ifndef BOOST_UBLAS_NO_MEMBER_FRIENDS
BOOST_UBLAS_INLINE
friend void swap (vector &v1, vector &v2) {
v1.swap (v2);
}
#endif
// Element insertion and erasure
// These functions should work with std::vector.
// Thanks to Kresimir Fresl for spotting this.
BOOST_UBLAS_INLINE
void insert (size_type i, const_reference t) {
// FIXME: only works for EqualityComparable value types.
// BOOST_UBLAS_CHECK (data () [i] == value_type (), bad_index ());
// data ().insert (data ().begin () + i, t);
data () [i] = t;
}
BOOST_UBLAS_INLINE
void erase (size_type i) {
// data ().erase (data ().begin () + i);
data () [i] = value_type ();
}
BOOST_UBLAS_INLINE
void clear () {
// data ().clear ();
std::fill (data ().begin (), data ().end (), value_type ());
}
#ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR
typedef indexed_iterator<self_type, dense_random_access_iterator_tag> iterator;
typedef indexed_const_iterator<self_type, dense_random_access_iterator_tag> const_iterator;
#else
class const_iterator;
class iterator;
#endif
// Element lookup
BOOST_UBLAS_INLINE
const_iterator find (size_type i) const {
#ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR
return const_iterator (*this, data ().begin () + i);
#else
return const_iterator (*this, i);
#endif
}
BOOST_UBLAS_INLINE
iterator find (size_type i) {
#ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR
return iterator (*this, data ().begin () + i);
#else
return iterator (*this, i);
#endif
}
// Iterators simply are pointers.
#ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR
class const_iterator:
public container_const_reference<vector>,
public random_access_iterator_base<dense_random_access_iterator_tag,
const_iterator, value_type> {
public:
typedef dense_random_access_iterator_tag iterator_category;
#ifdef BOOST_MSVC_STD_ITERATOR
typedef const_reference reference;
#else
typedef typename vector::difference_type difference_type;
typedef typename vector::value_type value_type;
typedef typename vector::const_reference reference;
typedef typename vector::const_pointer pointer;
#endif
// Construction and destruction
BOOST_UBLAS_INLINE
const_iterator ():
container_const_reference<self_type> (), it_ () {}
BOOST_UBLAS_INLINE
const_iterator (const self_type &v, const const_iterator_type &it):
container_const_reference<self_type> (v), it_ (it) {}
BOOST_UBLAS_INLINE
#ifndef BOOST_UBLAS_QUALIFIED_TYPENAME
const_iterator (const iterator &it):
#else
const_iterator (const typename self_type::iterator &it):
#endif
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) () == &it (), external_logic ());
return it_ - it.it_;
}
// Dereference
BOOST_UBLAS_INLINE
reference operator * () const {
BOOST_UBLAS_CHECK (index () < (*this) ().size (), bad_index ());
return *it_;
}
// Index
BOOST_UBLAS_INLINE
size_type index () const {
return it_ - (*this) ().begin ().it_;
}
// 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) () == &it (), external_logic ());
return it_ == it.it_;
}
BOOST_UBLAS_INLINE
bool operator < (const const_iterator &it) const {
BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());
return it_ < it.it_;
}
private:
const_iterator_type it_;
friend class iterator;
};
#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>,
public random_access_iterator_base<dense_random_access_iterator_tag,
iterator, value_type> {
public:
typedef dense_random_access_iterator_tag iterator_category;
#ifndef BOOST_MSVC_STD_ITERATOR
typedef typename vector::difference_type difference_type;
typedef typename vector::value_type value_type;
typedef typename vector::reference reference;
typedef typename vector::pointer pointer;
#endif
// Construction and destruction
BOOST_UBLAS_INLINE
iterator ():
container_reference<self_type> (), it_ () {}
BOOST_UBLAS_INLINE
iterator (self_type &v, const iterator_type &it):
container_reference<self_type> (v), 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;
}
BOOST_UBLAS_INLINE
difference_type operator - (const iterator &it) const {
BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());
return it_ - it.it_;
}
// Dereference
BOOST_UBLAS_INLINE
reference operator * () const {
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -