| 1 | /* | 
| 2 | * Copyright (c) 2011 The University of Notre Dame. All Rights Reserved. | 
| 3 | * | 
| 4 | * The University of Notre Dame grants you ("Licensee") a | 
| 5 | * non-exclusive, royalty free, license to use, modify and | 
| 6 | * redistribute this software in source and binary code form, provided | 
| 7 | * that the following conditions are met: | 
| 8 | * | 
| 9 | * 1. Redistributions of source code must retain the above copyright | 
| 10 | *    notice, this list of conditions and the following disclaimer. | 
| 11 | * | 
| 12 | * 2. Redistributions in binary form must reproduce the above copyright | 
| 13 | *    notice, this list of conditions and the following disclaimer in the | 
| 14 | *    documentation and/or other materials provided with the | 
| 15 | *    distribution. | 
| 16 | * | 
| 17 | * This software is provided "AS IS," without a warranty of any | 
| 18 | * kind. All express or implied conditions, representations and | 
| 19 | * warranties, including any implied warranty of merchantability, | 
| 20 | * fitness for a particular purpose or non-infringement, are hereby | 
| 21 | * excluded.  The University of Notre Dame and its licensors shall not | 
| 22 | * be liable for any damages suffered by licensee as a result of | 
| 23 | * using, modifying or distributing the software or its | 
| 24 | * derivatives. In no event will the University of Notre Dame or its | 
| 25 | * licensors be liable for any lost revenue, profit or data, or for | 
| 26 | * direct, indirect, special, consequential, incidental or punitive | 
| 27 | * damages, however caused and regardless of the theory of liability, | 
| 28 | * arising out of the use of or inability to use software, even if the | 
| 29 | * University of Notre Dame has been advised of the possibility of | 
| 30 | * such damages. | 
| 31 | * | 
| 32 | * SUPPORT OPEN SCIENCE!  If you use OpenMD or its source code in your | 
| 33 | * research, please cite the appropriate papers when you publish your | 
| 34 | * work.  Good starting points are: | 
| 35 | * | 
| 36 | * [1]  Meineke, et al., J. Comp. Chem. 26, 252-271 (2005). | 
| 37 | * [2]  Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006). | 
| 38 | * [3]  Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008). | 
| 39 | * [4]  Vardeman & Gezelter, in progress (2009). | 
| 40 | */ | 
| 41 | #ifndef UTILS_GRID3D_HPP | 
| 42 | #define UTILS_GRID3D_HPP | 
| 43 |  | 
| 44 | using namespace std; | 
| 45 | namespace OpenMD { | 
| 46 | /** | 
| 47 | * @class Grid3d | 
| 48 | * A generic 3d grid class | 
| 49 | */ | 
| 50 | template<class Elem> | 
| 51 | class Grid3D { | 
| 52 | public: | 
| 53 | Grid3D(unsigned int dim1, unsigned int dim2, unsigned int dim3) : dim1_(dim1), dim2_(dim2), dim3_(dim3) { | 
| 54 | data_.resize(dim1_*dim2_*dim3_); | 
| 55 | } | 
| 56 | Elem& operator ()(unsigned int i, unsigned int j, unsigned int k) { | 
| 57 | int index = isValidGrid(i, j , k); | 
| 58 | assert(index != -1); | 
| 59 | return data_[index]; | 
| 60 | } | 
| 61 |  | 
| 62 | const Elem& operator () (unsigned int i, unsigned int j, unsigned int k) const { | 
| 63 | int index = isValidGrid(i, j , k); | 
| 64 | assert(index != -1); | 
| 65 | return data_[index]; | 
| 66 | } | 
| 67 |  | 
| 68 | vector<Elem> getAllNeighbors(unsigned int i, unsigned int j, unsigned int k) { | 
| 69 | vector<Elem> result; | 
| 70 | int index; | 
| 71 | index = isValidGrid(i-1, j, k); | 
| 72 | if (index != -1) | 
| 73 | result.push_back(data_[index]); | 
| 74 |  | 
| 75 | index = isValidGrid(i+1, j, k); | 
| 76 | if (index != -1) | 
| 77 | result.push_back(data_[index]); | 
| 78 |  | 
| 79 | index = isValidGrid(i, j-1, k); | 
| 80 | if (index != -1) | 
| 81 | result.push_back(data_[index]); | 
| 82 |  | 
| 83 | index = isValidGrid(i, j+1, k); | 
| 84 | if (index != -1) | 
| 85 | result.push_back(data_[index]); | 
| 86 |  | 
| 87 | index = isValidGrid(i, j, k-1); | 
| 88 | if (index != -1) | 
| 89 | result.push_back(data_[index]); | 
| 90 |  | 
| 91 | index = isValidGrid(i, j, k+1); | 
| 92 | if (index != -1) | 
| 93 | result.push_back(data_[index]); | 
| 94 |  | 
| 95 | return result; | 
| 96 | } | 
| 97 |  | 
| 98 | private: | 
| 99 |  | 
| 100 | int isValidGrid(unsigned int i, unsigned int j, unsigned int k) const { | 
| 101 | int index = i * dim2_*dim3_ + j * dim3_ + k; | 
| 102 | return index < data_.size() ? index : -1; | 
| 103 | }; | 
| 104 |  | 
| 105 | unsigned int dim1_; | 
| 106 | unsigned int dim2_; | 
| 107 | unsigned int dim3_; | 
| 108 | vector<Elem> data_; | 
| 109 |  | 
| 110 | }; | 
| 111 | } | 
| 112 | #endif |