📄 vector_sparse.hpp
字号:
BOOST_UBLAS_INLINE
iterator &operator -- () {
-- it_;
return *this;
}
// Dereference
BOOST_UBLAS_INLINE
reference operator * () const {
BOOST_UBLAS_CHECK (index () < (*this) ().size (), bad_index ());
#if ! defined (BOOST_UBLAS_STRICT_STORAGE_SPARSE) && ! defined (BOOST_UBLAS_STRICT_VECTOR_SPARSE)
return (*it_).second;
#elif defined (BOOST_UBLAS_STRICT_VECTOR_SPARSE)
return reference ((*this) (), &(*it_).second, index ());
#elif defined (BOOST_UBLAS_STRICT_STORAGE_SPARSE)
return detail::make_reference ((*this) ().data (), it_);
#endif
}
// Index
BOOST_UBLAS_INLINE
size_type index () const {
return (*it_).first;
}
// 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 {
// FIXME: won't work with vector of vectors.
// BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());
return &(*this) () == &it () && it_ == it.it_;
}
private:
iterator_type it_;
friend class const_iterator;
};
BOOST_UBLAS_INLINE
iterator begin () {
return find (0);
}
BOOST_UBLAS_INLINE
iterator end () {
return find (size_);
}
// Reverse iterator
#ifdef BOOST_MSVC_STD_ITERATOR
typedef reverse_iterator_base<const_iterator, value_type, const_reference> const_reverse_iterator;
#else
typedef reverse_iterator_base<const_iterator> const_reverse_iterator;
#endif
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 ());
}
#ifdef BOOST_MSVC_STD_ITERATOR
typedef reverse_iterator_base<iterator, value_type, reference> reverse_iterator;
#else
typedef reverse_iterator_base<iterator> reverse_iterator;
#endif
BOOST_UBLAS_INLINE
reverse_iterator rbegin () {
return reverse_iterator (end ());
}
BOOST_UBLAS_INLINE
reverse_iterator rend () {
return reverse_iterator (begin ());
}
private:
size_type size_;
size_type non_zeros_;
array_type data_;
static value_type zero_;
};
template<class T, class A>
typename sparse_vector<T, A>::value_type sparse_vector<T, A>::zero_ =
sparse_vector<T, A>::value_type ();
// Array based sparse vector class
// Thanks to Kresimir Fresl for extending this to cover different index bases.
template<class T, std::size_t IB, class IA, class TA>
class compressed_vector:
public vector_expression<compressed_vector<T, IB, IA, TA> > {
public:
#ifndef BOOST_UBLAS_NO_PROXY_SHORTCUTS
BOOST_UBLAS_USING vector_expression<compressed_vector<T, IB, IA, TA> >::operator ();
#endif
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;
#ifndef BOOST_UBLAS_STRICT_VECTOR_SPARSE
typedef T &reference;
#else
typedef sparse_vector_element<compressed_vector<T, IB, IA, TA> > reference;
#endif
typedef const T *const_pointer;
typedef T *pointer;
typedef IA index_array_type;
typedef TA value_array_type;
typedef const compressed_vector<T, IB, IA, TA> const_self_type;
typedef compressed_vector<T, IB, IA, TA> 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 IA::const_iterator const_iterator_type;
typedef typename IA::iterator iterator_type;
typedef sparse_tag storage_category;
// Construction and destruction
BOOST_UBLAS_INLINE
compressed_vector ():
vector_expression<self_type> (),
size_ (0), non_zeros_ (0), filled_ (0),
index_data_ (), value_data_ () {}
BOOST_UBLAS_INLINE
compressed_vector (size_type size, size_type non_zeros = 0):
vector_expression<self_type> (),
size_ (size), non_zeros_ (non_zeros), filled_ (0),
index_data_ (non_zeros), value_data_ (non_zeros) {
reserve (non_zeros_);
}
BOOST_UBLAS_INLINE
compressed_vector (const compressed_vector &v):
vector_expression<self_type> (),
size_ (v.size_), non_zeros_ (v.non_zeros_), filled_ (v.filled_),
index_data_ (v.index_data_), value_data_ (v.value_data_) {}
template<class AE>
BOOST_UBLAS_INLINE
compressed_vector (const vector_expression<AE> &ae, size_type non_zeros = 0):
vector_expression<self_type> (),
size_ (ae ().size ()), non_zeros_ (non_zeros), filled_ (0),
index_data_ (non_zeros), value_data_ (non_zeros) {
reserve (non_zeros_, false);
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
size_type non_zeros () const {
return non_zeros_;
}
BOOST_UBLAS_INLINE
size_type filled () const {
return filled_;
}
BOOST_UBLAS_INLINE
static size_type index_base () {
return index_base_;
}
BOOST_UBLAS_INLINE
const index_array_type &index_data () const {
return index_data_;
}
BOOST_UBLAS_INLINE
index_array_type &index_data () {
return index_data_;
}
BOOST_UBLAS_INLINE
const value_array_type &value_data () const {
return value_data_;
}
BOOST_UBLAS_INLINE
value_array_type &value_data () {
return value_data_;
}
// Resizing
BOOST_UBLAS_INLINE
void resize (size_type size, size_type non_zeros = 0, bool preserve = true) {
size_ = size;
non_zeros_ = std::max (non_zeros, size_type (1));
non_zeros_ = std::min (non_zeros_, size_);
filled_ = 0;
detail::resize (index_data (), non_zeros_, preserve);
detail::resize (value_data (), non_zeros_, preserve);
}
// Reserving
BOOST_UBLAS_INLINE
void reserve (size_type non_zeros = 0, bool preserve = true) {
non_zeros_ = std::max (non_zeros, size_type (1));
non_zeros_ = std::min (non_zeros_, size_);
detail::resize (index_data (), non_zeros_, preserve);
detail::resize (value_data (), non_zeros_, preserve);
}
// Proxy support
#ifdef BOOST_UBLAS_STRICT_VECTOR_SPARSE
pointer find_element (size_type i) {
iterator_type it (detail::lower_bound (index_data ().begin (), index_data ().begin () + filled_, k_based (i), std::less<size_type> ()));
if (it == index_data ().begin () + filled_ || *it != k_based (i))
return 0;
return &value_data () [it - index_data ().begin ()];
}
#endif
// Element access
BOOST_UBLAS_INLINE
const_reference operator () (size_type i) const {
BOOST_UBLAS_CHECK (i < size_, bad_index ());
const_iterator_type it (detail::lower_bound (index_data ().begin (), index_data ().begin () + filled_, k_based (i), std::less<size_type> ()));
if (it == index_data ().begin () + filled_ || *it != k_based (i))
return zero_;
return value_data () [it - index_data ().begin ()];
}
BOOST_UBLAS_INLINE
reference operator () (size_type i) {
BOOST_UBLAS_CHECK (i < size_, bad_index ());
#ifndef BOOST_UBLAS_STRICT_VECTOR_SPARSE
iterator_type it (detail::lower_bound (index_data ().begin (), index_data ().begin () + filled_, k_based (i), std::less<size_type> ()));
if (it == index_data ().begin () + filled_ || *it != k_based (i)) {
insert (i, value_type ());
it = detail::lower_bound (index_data ().begin (), index_data ().begin () + filled_, k_based (i), std::less<size_type> ());
}
return value_data () [it - index_data ().begin ()];
#else
return reference (*this, i);
#endif
}
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
compressed_vector &operator = (const compressed_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 ());
size_ = v.size_;
non_zeros_ = v.non_zeros_;
filled_ = v.filled_;
detail::resize (index_data (), non_zeros_, false);
detail::resize (value_data (), non_zeros_, false);
index_data () = v.index_data ();
value_data () = v.value_data ();
}
return *this;
}
BOOST_UBLAS_INLINE
compressed_vector &assign_temporary (compressed_vector &v) {
swap (v);
return *this;
}
template<class AE>
BOOST_UBLAS_INLINE
compressed_vector &operator = (const vector_expression<AE> &ae) {
#ifdef BOOST_UBLAS_MUTABLE_TEMPORARY
return assign_temporary (self_type (ae, non_zeros_));
#else
// return assign (self_type (ae, non_zeros_));
self_type temporary (ae, non_zeros_);
return assign_temporary (temporary);
#endif
}
template<class AE>
BOOST_UBLAS_INLINE
compressed_vector &reset (const vector_expression<AE> &ae) {
self_type temporary (ae, non_zeros_);
resize (temporary.size (), non_zeros_, false);
return assign_temporary (temporary);
}
template<class AE>
BOOST_UBLAS_INLINE
compressed_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
compressed_vector &operator += (const vector_expression<AE> &ae) {
#ifdef BOOST_UBLAS_MUTABLE_TEMPORARY
return assign_temporary (self_type (*this + ae, non_zeros_));
#else
// return assign (self_type (*this + ae, non_zeros_));
self_type temporary (*this + ae, non_zeros_);
return assign_temporary (temporary);
#endif
}
template<class AE>
BOOST_UBLAS_INLINE
compressed_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
compressed_vector &operator -= (const vector_expression<AE> &ae) {
#ifdef BOOST_UBLAS_MUTABLE_TEMPORARY
return assign_temporary (self_type (*this - ae, non_zeros_));
#else
// return assign (self_type (*this - ae, non_zeros_));
self_type temporary (*this - ae, non_zeros_);
return assign_temporary (temporary);
#endif
}
template<class AE>
BOOST_UBLAS_INLINE
compressed_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
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -