Go to the documentation of this file.
60 T*
ptr(
int,
int,
int,
int);
61 T&
ref(
int,
int,
int,
int);
67 friend ostream& operator<< <>(ostream &,
const NTBlock &);
representation of a slab of the search array of a NeigborTable
Definition: nt_block.h:33
int m_ymin
Definition: nt_block.h:41
bool operator==(const NTBlock< T > &, const NTBlock< T > &)
Definition: nt_block.hpp:159
int m_xmin
Definition: nt_block.h:41
T & ref(int, int, int, int)
Definition: nt_block.hpp:146
int m_zmax
Definition: nt_block.h:41
unsigned int nparts_at_gridpoint(int x, int y, int z) const
< number of particles at a given gridpoint
Definition: nt_block.h:57
int m_zmin
Definition: nt_block.h:41
bool operator!=(const NTBlock< T > &, const NTBlock< T > &)
Definition: nt_block.hpp:174
iterator for a NTBlock
Definition: ntb_iter.h:39
iterator begin()
Definition: nt_block.hpp:73
NTBlock_iter< T > iterator
Definition: nt_block.h:35
NTBlock_iter< T > const_iterator
Definition: nt_block.h:36
unsigned int size()
Definition: nt_block.hpp:56
int m_xmax
Definition: nt_block.h:41
class for neighbor search
Definition: ntable.h:68
int m_ymax
Definition: nt_block.h:41
T * ptr(int, int, int, int)
Definition: nt_block.hpp:133
T value_type
Definition: nt_block.h:37
NTBlock()
Definition: nt_block.hpp:17
ostream & operator<<(ostream &, const NTBlock< T > &)
Definition: nt_block.hpp:193
iterator end()
Definition: nt_block.hpp:107
NeighborTable< T > * m_table
Definition: nt_block.h:40