Changes in src/Filling/Mesh/CubeMesh.cpp [5d81e5:2382d7]
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/Filling/Mesh/CubeMesh.cpp
r5d81e5 r2382d7 41 41 CubeMesh::CubeMesh(const Vector &counts, const Vector &offset, const RealSpaceMatrix &M) 42 42 { 43 RealSpaceMatrix partition;44 int n[NDIM];45 46 43 #ifndef NDEBUG 47 44 for (size_t i=0;i<NDIM;++i) { … … 49 46 "CubeMesh::CubeMesh() - offset coordinates must be in [0,1) but offset[" 50 47 +toString(i)+"] is "+toString(offset[i])+"."); 51 ASSERT(counts[i] != 0.,52 "CubeMesh::CubeMesh() - counts["+toString(i)+"] must be != "+toString(counts[i])+".");48 ASSERT(counts[i] == (int)counts[i], 49 "CubeMesh::CubeMesh() - counts["+toString(i)+"] must be integer: != "+toString(counts[i])+"."); 53 50 } 54 51 #endif 52 53 std::vector< unsigned int> size_counts; 54 for (size_t i=0;i<NDIM;++i) { 55 size_counts.push_back( (int)counts[i] ); 56 } 57 init(size_counts, offset, M); 58 } 59 60 /** Constructor for class CubeMesh. 61 * 62 * Here, we generate nodes homogeneously distributed over a cuboid. 63 * 64 * \a offset shifts the coordinates, e.g. if counts = 2, we would set nodes at 65 * 0 and 0.5 with offset = 0 and 0.4999... and 0.9999.. with offset = 0.999... 66 * 67 * @param counts number of points per axis 68 * @param offset offset Vector (coordinates in [0,1)) 69 * @param M matrix to transform the default cuboid from (0,0,0) to (1,1,1). 70 */ 71 CubeMesh::CubeMesh(const std::vector< unsigned int > &counts, const Vector &offset, const RealSpaceMatrix &M) 72 { 73 ASSERT(counts.size() == 3, 74 "CubeMesh::CubeMesh() - counts does not have three but " 75 +toString(counts.size())+" entries."); 76 77 init(counts, offset, M); 78 } 79 80 void CubeMesh::init(const std::vector< unsigned int > &counts, const Vector &offset, const RealSpaceMatrix &M) 81 { 82 RealSpaceMatrix partition; 55 83 56 84 partition.setZero(); … … 59 87 LOG(1, "INFO: partition is " << partition << "."); 60 88 61 62 89 // go over [0,1]^3 filler grid 90 int n[NDIM]; 63 91 for (n[0] = 0; n[0] < counts[0]; n[0]++) 64 92 for (n[1] = 0; n[1] < counts[1]; n[1]++)
Note:
See TracChangeset
for help on using the changeset viewer.