UniformGridIt< parent_grid_t, index_t > Class Template Reference

Iterator going through all points in the grid range corresponding to nst, nen. More...

#include <grid.h>

Inheritance diagram for UniformGridIt< parent_grid_t, index_t >:

Public Member Functions
	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
	UniformGridIt (const parent_grid_t *sparent, int end_=0)
	if this is end iterator

Protected Attributes
int	ie
	current grid indices

Friends
template<typename A , size_t B, typename C , typename D >
class	UniformGrid

Detailed Description

template<class parent_grid_t, class index_t>
class UniformGridIt< parent_grid_t, index_t >

Iterator going through all points in the grid range corresponding to nst, nen.

Index change order is Z(2), Y(1), X(0), index goes from small to large. Now only works with UniformGrid as parent.

Constructor & Destructor Documentation

UniformGridIt()

template<class parent_grid_t , class index_t >

UniformGridIt< parent_grid_t, index_t >::UniformGridIt ( const parent_grid_t *  sparent, int  end_ = 0  )

inlineprotected

if this is end iterator

grid constructor, constructs sequence start

---

The documentation for this class was generated from the following file:

• grid.h