|
|
| OriginalCellPairTraversal (std::vector< CellTemplate > &cells, const std::array< unsigned long, 3 > &dims) |
| |
| virtual void | rebuild (std::vector< CellTemplate > &cells, const std::array< unsigned long, 3 > &dims, double cellLength[3], double cutoff, struct CellPairTraversalData *data) |
| |
| void | traverseCellPairs (CellProcessor &cellProcessor) |
| |
| void | traverseCellPairsOuter (CellProcessor &cellProcessor) |
| |
| void | traverseCellPairsInner (CellProcessor &cellProcessor, unsigned stage, unsigned stageCount) |
| |
|
virtual void | processBaseCell (CellProcessor &cellProcessor, unsigned long cellIndex) const |
| |
|
| CellPairTraversals (std::vector< CellTemplate > &cells, const std::array< unsigned long, 3 > &dims) |
| |
|
virtual bool | requiresForceExchange () const |
| |
|
virtual unsigned | maxCellsInCutoff () const |
| |
|
| enum | TraverseType { ALL_CELLS
, INNER_CELLS
, OUTER_CELLS
} |
| |
|
|
void | computeNeighbourOffsets () |
| |
|
void | traverseCellPairsBackend (CellProcessor &cellProcessor, unsigned loIndex, unsigned hiIndex, TraverseType type) const |
| |
|
|
std::array< long, 13 > | _forwardNeighbourOffsets |
| | Neighbours that come in the total ordering after a cell.
|
| |
|
std::array< long, 13 > | _backwardNeighbourOffsets |
| | Neighbours that come in the total ordering before a cell.
|
| |
|
std::vector< unsigned long > | _innerMostCellIndices |
| | Vector containing the indices (for the cells vector) of all inner cells (without boundary)
|
| |
|
std::vector< CellTemplate > * | _cells |
| |
|
std::array< unsigned long, 3 > | _dims |
| |
◆ rebuild()
template<class CellTemplate >
◆ traverseCellPairs()
template<class CellTemplate >
◆ traverseCellPairsInner()
template<class CellTemplate >
◆ traverseCellPairsOuter()
template<class CellTemplate >
The documentation for this class was generated from the following file: