ivutils
|
Iterator going through all points in the grid range corresponding to nst, nen. More...
#include <vecgrid.h>
Public Member Functions | |
VecGridIt (const VecGridIt &other) | |
copy constructor | |
VecGridIt | operator- (const VecGridIt &other) const |
iterator difference | |
VecGridIt & | operator++ () |
index change order: iz, iy, ix skips parts of vectors that are outside ien[2] takes span into account | |
VecGridIt & | operator+= (index_t incr) |
positive increment to an iterator | |
VecGridIt | shift (index_t *sh) const |
returns iterator with shifted grid indices does this work? | |
![]() | |
UniformGridIt () | |
default constructor constructs sequence end | |
UniformGridIt (const UniformGridIt &other) | |
copy constructor | |
index_t | operator- (const UniformGridIt &other) const |
iterator difference | |
UniformGridIt & | operator++ () |
Increment, index change order: iz, iy, ix. | |
template<class ind_t > | |
UniformGridIt & | increment (const ind_t &reorder) |
Increment with index change order according to reorder array. | |
UniformGridIt & | operator+= (index_t incr) |
positive increment to an iterator | |
bool | operator!= (const UniformGridIt &other) const |
complete test | |
UniformGridIt | shift (index_t *sh) const |
returns iterator with shifted grid indices | |
void | set (index_t i0, index_t i1, index_t i2) |
Explicitly sets indicies (use with care since it may break the iteration order) | |
index_t | get_normalized_ind (int i) const |
counts from the memory start | |
Protected Member Functions | |
VecGridIt (const parent_grid_t *sparent, int end_=0) | |
grid constructor, constructs sequence start | |
![]() | |
UniformGridIt (const parent_grid_t *sparent, int end_=0) | |
if this is end iterator | |
Additional Inherited Members | |
![]() | |
int | ie |
current grid indices | |
Iterator going through all points in the grid range corresponding to nst, nen.
Index change order is according to Z-curve