Iterate through the elements (i1,i2,....,in) with i1 ... in unsigned integers with the following constrain (i1>i2>......>in)
Definition at line 1051 of file grid_sm.hpp.
#include <grid_sm.hpp>
Public Member Functions  
size_t  getDim () 
Get the dimensionality of the iterator. More...  
Iterator_g_const (size_t n, size_t sz)  
Constructor. More...  
Iterator_g_const &  operator++ () 
Get the next element. More...  
bool  isNext () 
Check if there is the next element. More...  
grid_key_dx_r &  get () 
Return the actual key. More...  
Private Attributes  
size_t  dim 
size_t  sz 
size of the grid (the grid is assumed a square so equal on each dimension)  
grid_key_dx_r  gk 

inline 
Constructor.
n  Dimensionality (how many i1 ... in you have) 
sz  Size of the grid on all dimensions range of the value i1 ... in can assume 
Definition at line 1081 of file grid_sm.hpp.

inline 
Return the actual key.
Return the actual key
Definition at line 1178 of file grid_sm.hpp.

inline 
Get the dimensionality of the iterator.
Get the dimensionality of the iterator
Definition at line 1069 of file grid_sm.hpp.

inline 
Check if there is the next element.
Check if there is the next element
we did not reach the end of the grid
we reach the end of the grid
Definition at line 1153 of file grid_sm.hpp.

inline 
Get the next element.
Get the next element
increment the first index
check the overflow of all the index with exception of the last dimensionality
Definition at line 1100 of file grid_sm.hpp.