This serves as an simple grid generation for performance or scaling analysis without being obliged to use Seeder. You have to specify the generic grid parameters in the lua file insted of the mesh folder
mesh = { predefined='cube',
origin = {0.,0.,0.},
length = 10.,
refinementLevel = 6 }
You have to specify the shape 'cube', a bounding box origin, its length and also the refinement level, which results in different amount elements in the grid. The result of this routine is mainly the treeID list with the additional lists for saving the properties. They are all set to zero here, however. As we only have a simple cube which includes all the elements on this level, the treeID list just contains contiguously increasing integers
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(treelmesh_type), | intent(out) | :: | me | Mesh to generate |
||
real(kind=rk), | intent(in) | :: | origin(3) | Corner of the cube |
||
real(kind=rk), | intent(in) | :: | length | Length of cube |
||
integer, | intent(in) | :: | level | Resolution level |
||
integer, | intent(in) | :: | myPart | Partition of the caller (starts with 0) |
||
integer, | intent(in) | :: | nParts | Number of partitions |
||
integer, | intent(in) | :: | comm | communicator to be used |
Type | Visibility | Attributes | Name | Initial | |||
---|---|---|---|---|---|---|---|
integer(kind=long_k), | private | :: | firstID | ||||
integer(kind=long_k), | private | :: | lastID | ||||
integer(kind=long_k), | private | :: | share | ||||
integer, | private | :: | remainder | ||||
integer, | private | :: | iPart | ||||
integer, | private | :: | iElem |