Stokhos
Development
|
Bi-directional iterator for traversing a sparse array. More...
#include <Stokhos_SparseArray.hpp>
Public Member Functions | |
SparseArrayIterator () | |
Default constructor. | |
SparseArrayIterator (index_iterator_type index_it, value_iterator_type value_it) | |
Constructor. | |
bool | operator== (const SparseArrayIterator &it) const |
== operator | |
bool | operator!= (const SparseArrayIterator &it) const |
!= operator | |
reference | operator* () const |
pointer | operator-> () const |
-> operator | |
SparseArrayIterator & | operator++ () |
Prefix ++. | |
SparseArrayIterator | operator++ (int) |
Postfix ++. | |
SparseArrayIterator & | operator-- () |
Prefix –. | |
SparseArrayIterator | operator-- (int) |
Postfix –. | |
bool | operator< (const SparseArrayIterator &b) const |
Return true of *this < b. | |
value_reference | value () const |
Return value associated with iterator. | |
Protected Attributes | |
index_iterator_type | index_iterator |
Index iterator. | |
value_iterator_type | value_iterator |
Value iterator. | |
Bi-directional iterator for traversing a sparse array.
The "value" of the iterator is the index, which is what you get from dereferencing the iterator (* or ->). There is also a method called value() that gives you the value of the sparse array pointed at by the iterator.
This could easily be a random access iterator. I just haven't implemented those methods.
|
inline |
References Stokhos::SparseArrayIterator< index_iterator, value_iterator >::index_iterator.