|
Stokhos Development
|
Iterator class for iterating over elements of the index set. More...
#include <Stokhos_ProductBasisUtils.hpp>


Public Member Functions | |
| Iterator (ordinal_type max_order_, const multiindex_type &component_max_order_, const multiindex_type &index_) | |
| Constructor. | |
| bool | operator== (const Iterator &it) const |
| Compare equality of iterators. | |
| bool | operator!= (const Iterator &it) const |
| Compare inequality of iterators. | |
| const_reference | operator* () const |
| Dereference. | |
| const_pointer | operator-> () const |
| Dereference. | |
| Iterator & | operator++ () |
| Prefix increment, i.e., ++iterator. | |
| Iterator & | operator++ (int) |
| Postfix increment, i.e., iterator++. | |
Iterator class for iterating over elements of the index set.
|
inline |
Constructor.
max_order_ is the maximum order of the set (inclusive) and index_ is the starting multi-index.
References component_max_order, dim, Stokhos::AnisotropicTotalOrderIndexSet< ordinal_t >::dimension(), index, max_order, and orders.
Referenced by operator!=(), operator++(), operator++(), and operator==().
|
inline |
Prefix increment, i.e., ++iterator.
No particular ordering of the indices is guaranteed. The current implementation produces multi-indices sorted lexographically backwards among the elements, e.g., [0 0], [1 0], [2 0], ... [0 1], [1 1], [2 1], ... but one shouldn't assume that. To obtain a specific ordering, one should implement a "less" functional and put the indices in a sorted container such as std::map<>.
References component_max_order, dim, index, Iterator(), and orders.