Go to the documentation of this file.
50 if(m_ig+1<
static_cast<int>(m_block->nparts_at_gridpoint(m_ix,m_iy,m_iz))){
56 while(!found && !end){
57 if(m_ix<m_block->m_xmax){
61 if(m_iy<m_block->m_ymax){
65 if(m_iz<m_block->m_zmax){
68 m_ix=m_block->m_xmax+1;
69 m_iy=m_block->m_ymax+1;
70 m_iz=m_block->m_zmax+1;
75 if(!end) found=m_block->nparts_at_gridpoint(m_ix,m_iy,m_iz)>0;
105 return m_block->ptr(m_ix,m_iy,m_iz,m_ig);
116 return m_block->ref(m_ix,m_iy,m_iz,m_ig);
bool operator==(const NTBlock_iter< T > &b1, const NTBlock_iter< T > &b2)
Definition: ntb_iter.hpp:123
representation of a slab of the search array of a NeigborTable
Definition: nt_block.h:33
int m_ix
Definition: ntb_iter.h:50
int m_iz
Definition: ntb_iter.h:50
NTBlock< T > * m_block
Definition: ntb_iter.h:49
int m_ig
Definition: ntb_iter.h:50
bool operator!=(const NTBlock_iter< T > &b1, const NTBlock_iter< T > &b2)
Definition: ntb_iter.hpp:136
iterator for a NTBlock
Definition: ntb_iter.h:39
int m_iy
Definition: ntb_iter.h:50
T * operator->()
access ops
Definition: ntb_iter.hpp:103
NTBlock_iter & operator++()
move ops
Definition: ntb_iter.hpp:38
T & operator*()
Definition: ntb_iter.hpp:114
NTBlock_iter(NTBlock< T > *, int, int, int, int)
Definition: ntb_iter.hpp:23