| 1 | /* | 
|---|
| 2 | * linkedcell.hpp | 
|---|
| 3 | * | 
|---|
| 4 | *  If the linked cell should be usable, the class has to inherit LCNodeSet and the nodes (containing the Vectors) have to inherit LCNode. This works well | 
|---|
| 5 | *  for molecule and atom classes. | 
|---|
| 6 | * | 
|---|
| 7 | *  Created on: Aug 3, 2009 | 
|---|
| 8 | *      Author: heber | 
|---|
| 9 | */ | 
|---|
| 10 |  | 
|---|
| 11 | #ifndef LINKEDCELL_HPP_ | 
|---|
| 12 | #define LINKEDCELL_HPP_ | 
|---|
| 13 |  | 
|---|
| 14 | using namespace std; | 
|---|
| 15 |  | 
|---|
| 16 | /*********************************************** includes ***********************************/ | 
|---|
| 17 |  | 
|---|
| 18 | // include config.h | 
|---|
| 19 | #ifdef HAVE_CONFIG_H | 
|---|
| 20 | #include <config.h> | 
|---|
| 21 | #endif | 
|---|
| 22 |  | 
|---|
| 23 | #include <list> | 
|---|
| 24 | #include <vector> | 
|---|
| 25 | #include <map> | 
|---|
| 26 |  | 
|---|
| 27 | //#include "CodePatterns/Assert.hpp" | 
|---|
| 28 | //#include "CodePatterns/Log.hpp" | 
|---|
| 29 | //#include "CodePatterns/Verbose.hpp" | 
|---|
| 30 | #include "Helpers/defs.hpp" | 
|---|
| 31 | #include "LinearAlgebra/Vector.hpp" | 
|---|
| 32 | #include "World.hpp" | 
|---|
| 33 |  | 
|---|
| 34 | /****************************************** forward declarations *****************************/ | 
|---|
| 35 |  | 
|---|
| 36 | class IPointCloud; | 
|---|
| 37 | class TesselPoint; | 
|---|
| 38 |  | 
|---|
| 39 | /********************************************** definitions *********************************/ | 
|---|
| 40 |  | 
|---|
| 41 | //< Upper bound for number of cell nodes used in sensibility check on allocation. | 
|---|
| 42 | enum { MAX_LINKEDCELLNODES = 1000000 }; | 
|---|
| 43 |  | 
|---|
| 44 | /********************************************** declarations *******************************/ | 
|---|
| 45 |  | 
|---|
| 46 | typedef std::list<TesselPoint *> TesselPointSTLList; | 
|---|
| 47 |  | 
|---|
| 48 | /** Linked Cell class for containing Vectors in real space efficiently. | 
|---|
| 49 | */ | 
|---|
| 50 | class LinkedCell_deprecated { | 
|---|
| 51 | private: | 
|---|
| 52 |  | 
|---|
| 53 | public: | 
|---|
| 54 | Vector max;       // upper boundary | 
|---|
| 55 | Vector min;       // lower boundary | 
|---|
| 56 | TesselPointSTLList *LC;  // linked cell list | 
|---|
| 57 | double RADIUS;    // cell edge length | 
|---|
| 58 | int N[NDIM];      // number of cells per axis | 
|---|
| 59 | mutable int n[NDIM];      // temporary variable for current cell per axis | 
|---|
| 60 | mutable int index;        // temporary index variable , access by index = n[0] * N[1] * N[2] + n[1] * N[2] + n[2]; | 
|---|
| 61 |  | 
|---|
| 62 | LinkedCell_deprecated(); | 
|---|
| 63 | LinkedCell_deprecated(IPointCloud &set, const double radius); | 
|---|
| 64 | ~LinkedCell_deprecated(); | 
|---|
| 65 | const TesselPointSTLList* GetCurrentCell()const ; | 
|---|
| 66 | const TesselPointSTLList* GetRelativeToCurrentCell(const int relative[NDIM])const ; | 
|---|
| 67 | bool SetIndexToNode(const TesselPoint * const Walker)const ; | 
|---|
| 68 | bool SetIndexToVector(const Vector &x)const ; | 
|---|
| 69 | double SetClosestIndexToOutsideVector(const Vector * const x) const; | 
|---|
| 70 | bool CheckBounds()const ; | 
|---|
| 71 | bool CheckBounds(const int relative[NDIM])const ; | 
|---|
| 72 | void GetNeighbourBounds(int lower[NDIM], int upper[NDIM], int step = 1)const ; | 
|---|
| 73 |  | 
|---|
| 74 | TesselPointSTLList* GetallNeighbours(const double distance = 0) const; | 
|---|
| 75 | TesselPointSTLList* GetPointsInsideSphere(const double radius, const Vector * const center) const; | 
|---|
| 76 | // not implemented yet | 
|---|
| 77 | bool AddNode(Vector *Walker); | 
|---|
| 78 | bool DeleteNode(Vector *Walker); | 
|---|
| 79 | bool MoveNode(Vector *Walker); | 
|---|
| 80 | }; | 
|---|
| 81 |  | 
|---|
| 82 | #endif /*LINKEDCELL_HPP_*/ | 
|---|