Go to the documentation of this file.
40 if(m_curr.second+1 <
static_cast<int>(m_slab->nparts_at_gridpoint(m_curr.first))) {
46 (m_curr.first <
static_cast<int>(m_slab->slab_size()))
48 (m_slab->nparts_at_gridpoint(m_curr.first) == 0)
80 while((m_curr.first>=0)&&
81 m_slab->nparts_at_gridpoint(m_curr.first)==0){
85 m_curr.second=m_slab->nparts_at_gridpoint(m_curr.first)-1;
100 return m_slab->ptr(m_curr);
108 template <
typename T>
111 return m_slab->ref(m_curr);
117 template <
typename T>
126 template <
typename T>
137 template <
typename T>
bool operator==(const NTSlab_iter< T > &i1, const NTSlab_iter< T > &i2)
Definition: nts_iter.hpp:127
NTSlab< T > * m_slab
Definition: nts_iter.h:49
bool operator!=(const NTSlab_iter< T > &i1, const NTSlab_iter< T > &i2)
Definition: nts_iter.hpp:138
T & operator*()
Definition: nts_iter.hpp:109
T * operator->()
access ops
Definition: nts_iter.hpp:98
NTSlab_iter & operator++()
move ops
Definition: nts_iter.hpp:27
pair< int, int > indextype
Definition: ntable.h:72
NeighborTable< T >::indextype m_curr
Definition: nts_iter.h:50
representation of a slab of the search array of a NeigborTable
Definition: nt_slab.h:35
NTSlab_iter & operator--()
Definition: nts_iter.hpp:63
iterator for a NTSlab
Definition: nts_iter.h:39
NeighborTable< T >::indextype index() const
Definition: nts_iter.hpp:118
NTSlab_iter(NTSlab< T > *, typename NeighborTable< T >::indextype)
Definition: nts_iter.hpp:17