📄 vector_of_vector.hpp
字号:
j_ = it.j_;
itv_ = it.itv_;
it_ = it.it_;
return *this;
}
// Comparison
BOOST_UBLAS_INLINE
bool operator == (const const_iterator1 &it) const {
BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());
// BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ());
if (rank_ == 1 || it.rank_ == 1) {
return it_ == it.it_;
} else {
return i_ == it.i_ && j_ == it.j_;
}
}
private:
int rank_;
size_type i_;
size_type j_;
vector_const_iterator_type itv_;
const_iterator_type it_;
};
BOOST_UBLAS_INLINE
const_iterator1 begin1 () const {
return find1 (0, 0, 0);
}
BOOST_UBLAS_INLINE
const_iterator1 end1 () const {
return find1 (0, size1_, 0);
}
class iterator1:
public container_reference<generalized_vector_of_vector>,
public bidirectional_iterator_base<sparse_bidirectional_iterator_tag,
iterator1, value_type> {
public:
typedef sparse_bidirectional_iterator_tag iterator_category;
#ifndef BOOST_MSVC_STD_ITERATOR
typedef typename generalized_vector_of_vector::difference_type difference_type;
typedef typename generalized_vector_of_vector::value_type value_type;
typedef typename generalized_vector_of_vector::reference reference;
typedef typename generalized_vector_of_vector::pointer pointer;
#endif
typedef iterator2 dual_iterator_type;
typedef reverse_iterator2 dual_reverse_iterator_type;
// Construction and destruction
BOOST_UBLAS_INLINE
iterator1 ():
container_reference<self_type> (), rank_ (), i_ (), j_ (), itv_ (), it_ () {}
BOOST_UBLAS_INLINE
iterator1 (self_type &m, int rank, size_type i, size_type j, const vector_iterator_type &itv, const iterator_type &it):
container_reference<self_type> (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {}
// Arithmetic
BOOST_UBLAS_INLINE
iterator1 &operator ++ () {
self_type &m = (*this) ();
if (rank_ == 1 && functor_type::fast1 ())
++ it_;
else {
i_ = index1 () + 1;
if (rank_ == 1 && ++ itv_ == m.end1 ().itv_)
*this = m.find1 (rank_, i_, j_, 1);
else if (rank_ == 1) {
it_ = static_cast<vector_data_value_type &> (*itv_).begin ();
if (it_ == static_cast<vector_data_value_type &> (*itv_).end () || index2 () != j_)
*this = m.find1 (rank_, i_, j_, 1);
}
}
return *this;
}
BOOST_UBLAS_INLINE
iterator1 &operator -- () {
self_type &m = (*this) ();
if (rank_ == 1 && functor_type::fast1 ())
-- it_;
else {
i_ = index1 () - 1;
if (rank_ == 1 && -- itv_ == m.end1 ().itv_)
*this = m.find1 (rank_, i_, j_, -1);
else if (rank_ == 1) {
it_ = static_cast<vector_data_value_type &> (*itv_).begin ();
if (it_ == static_cast<vector_data_value_type &> (*itv_).end () || index2 () != j_)
*this = m.find1 (rank_, i_, j_, -1);
}
}
return *this;
}
// Dereference
BOOST_UBLAS_INLINE
reference operator * () const {
if (rank_ == 1) {
BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ());
BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ());
#if ! defined (BOOST_UBLAS_STRICT_STORAGE_SPARSE) && ! defined (BOOST_UBLAS_STRICT_VECTOR_SPARSE)
return static_cast<value_type &> (*it_);
#elif defined (BOOST_UBLAS_STRICT_VECTOR_SPARSE)
return reference (static_cast<vector_data_value_type &> (*itv_), it_.index ());
#endif
} else {
return reference ((*this) () (i_, j_));
}
}
#ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
BOOST_UBLAS_INLINE
#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION
typename self_type::
#endif
iterator2 begin () const {
self_type &m = (*this) ();
return m.find2 (1, index1 (), 0);
}
BOOST_UBLAS_INLINE
#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION
typename self_type::
#endif
iterator2 end () const {
self_type &m = (*this) ();
return m.find2 (1, index1 (), m.size2 ());
}
BOOST_UBLAS_INLINE
#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION
typename self_type::
#endif
reverse_iterator2 rbegin () const {
return reverse_iterator2 (end ());
}
BOOST_UBLAS_INLINE
#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION
typename self_type::
#endif
reverse_iterator2 rend () const {
return reverse_iterator2 (begin ());
}
#endif
// Indices
BOOST_UBLAS_INLINE
size_type index1 () const {
if (rank_ == 1) {
return functor_type::index1 (itv_.index (), it_.index ());
} else {
return i_;
}
}
BOOST_UBLAS_INLINE
size_type index2 () const {
if (rank_ == 1) {
return functor_type::index2 (itv_.index (), it_.index ());
} else {
return j_;
}
}
// Assignment
BOOST_UBLAS_INLINE
iterator1 &operator = (const iterator1 &it) {
container_reference<self_type>::assign (&it ());
rank_ = it.rank_;
i_ = it.i_;
j_ = it.j_;
itv_ = it.itv_;
it_ = it.it_;
return *this;
}
// Comparison
BOOST_UBLAS_INLINE
bool operator == (const iterator1 &it) const {
BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ());
// BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ());
if (rank_ == 1 || it.rank_ == 1) {
return it_ == it.it_;
} else {
return i_ == it.i_ && j_ == it.j_;
}
}
private:
int rank_;
size_type i_;
size_type j_;
vector_iterator_type itv_;
iterator_type it_;
friend class const_iterator1;
};
BOOST_UBLAS_INLINE
iterator1 begin1 () {
return find1 (0, 0, 0);
}
BOOST_UBLAS_INLINE
iterator1 end1 () {
return find1 (0, size1_, 0);
}
class const_iterator2:
public container_const_reference<generalized_vector_of_vector>,
public bidirectional_iterator_base<sparse_bidirectional_iterator_tag,
const_iterator2, value_type> {
public:
typedef sparse_bidirectional_iterator_tag iterator_category;
#ifdef BOOST_MSVC_STD_ITERATOR
typedef const_reference reference;
#else
typedef typename generalized_vector_of_vector::difference_type difference_type;
typedef typename generalized_vector_of_vector::value_type value_type;
typedef typename generalized_vector_of_vector::const_reference reference;
typedef typename generalized_vector_of_vector::const_pointer pointer;
#endif
typedef const_iterator1 dual_iterator_type;
typedef const_reverse_iterator1 dual_reverse_iterator_type;
// Construction and destruction
BOOST_UBLAS_INLINE
const_iterator2 ():
container_const_reference<self_type> (), rank_ (), i_ (), j_ (), itv_ (), it_ () {}
BOOST_UBLAS_INLINE
const_iterator2 (const self_type &m, int rank, size_type i, size_type j, const vector_const_iterator_type &itv, const const_iterator_type &it):
container_const_reference<self_type> (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {}
BOOST_UBLAS_INLINE
const_iterator2 (const iterator2 &it):
container_const_reference<self_type> (it ()), rank_ (it.rank_), i_ (it.i_), j_ (it.j_), itv_ (it.itv_), it_ (it.it_) {}
// Arithmetic
BOOST_UBLAS_INLINE
const_iterator2 &operator ++ () {
const self_type &m = (*this) ();
if (rank_ == 1 && functor_type::fast2 ())
++ it_;
else {
j_ = index2 () + 1;
if (rank_ == 1 && ++ itv_ == m.end2 ().itv_)
*this = m.find2 (rank_, i_, j_, 1);
else if (rank_ == 1) {
it_ = static_cast<const vector_data_value_type &> (*itv_).begin ();
if (it_ == static_cast<const vector_data_value_type &> (*itv_).end () || index1 () != i_)
*this = m.find2 (rank_, i_, j_, 1);
}
}
return *this;
}
BOOST_UBLAS_INLINE
const_iterator2 &operator -- () {
const self_type &m = (*this) ();
if (rank_ == 1 && functor_type::fast2 ())
-- it_;
else {
j_ = index2 () - 1;
if (rank_ == 1 && -- itv_ == m.end2 ().itv_)
*this = m.find2 (rank_, i_, j_, -1);
else if (rank_ == 1) {
it_ = static_cast<const vector_data_value_type &> (*itv_).begin ();
if (it_ == static_cast<const vector_data_value_type &> (*itv_).end () || index1 () != i_)
*this = m.find2 (rank_, i_, j_, -1);
}
}
return *this;
}
// Dereference
BOOST_UBLAS_INLINE
reference operator * () const {
if (rank_ == 1) {
BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ());
BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ());
return static_cast<const value_type &> (*it_);
} else {
return (*this) () (i_, j_);
}
}
#ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION
BOOST_UBLAS_INLINE
#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION
typename self_type::
#endif
const_iterator1 begin () const {
const self_type &m = (*this) ();
return m.find1 (1, 0, index2 ());
}
BOOST_UBLAS_INLINE
#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION
typename self_type::
#endif
const_iterator1 end () const {
const self_type &m = (*this) ();
return m.find1 (1, m.size1 (), index2 ());
}
BOOST_UBLAS_INLINE
#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION
typename self_type::
#endif
const_reverse_iterator1 rbegin () const {
return const_reverse_iterator1 (end ());
}
BOOST_UBLAS_INLINE
#ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -