call this routine from your geometry initialization routine in the solver create all the necessary level-wise objects, such as element lists, dependencies
1.) build all dependencies for halos and ghost which are needed for interpolation/reconstruction (including MPI communications) 2.) build the pointers for each element to its neighbors/stencil elements. All this information is stored in tem_levelDesc_type
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(treelmesh_type), | intent(inout) | :: | tree | the global tree |
||
type(tem_levelDesc_type), | intent(inout) | :: | levelDesc(tree%global%minLevel:) | the level descriptor to be filled |
||
integer, | intent(out), | allocatable | :: | levelPointer(:) | Pointer from treeIDlist entry to level-wise fluid part of total list |
|
type(tem_stencilHeader_type) | :: | computeStencil(:) | array of all stencils used in the simulation |
|||
type(tem_commPattern_type), | intent(in) | :: | commPattern | the communication pattern used |
||
logical, | intent(in), | optional | :: | cleanup | cleanup arrays afterwards? |
|
integer, | intent(in), | optional | :: | reqNesting | nesting level |
|
type(tem_comm_env_type), | intent(in) | :: | proc | Process description to use. |
Type | Visibility | Attributes | Name | Initial | |||
---|---|---|---|---|---|---|---|
integer, | private | :: | iLevel | ||||
type(tem_path_type), | private, | allocatable | :: | pathFirst(:) | |||
type(tem_path_type), | private, | allocatable | :: | pathLast(:) | |||
logical, | private | :: | doAdditional | ||||
logical, | private | :: | clean_constructionArrays |