This routine builds the preliminary tree with geometry intersection and neighbor identification
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| type(sdr_protoTree_type), | intent(out) | :: | me | preliminary tree created by this routine |
||
| type(sdr_geometry_type), | intent(inout) | :: | geometry | type which contains all geometry object infos |
||
| type(sdr_confHead_type), | intent(inout) | :: | header | some global information on solver name and version |
| Type | Visibility | Attributes | Name | Initial | |||
|---|---|---|---|---|---|---|---|
| integer(kind=long_k), | private | :: | parent_ID_offset | ||||
| real(kind=rk), | private | :: | parent_dx | ||||
| integer, | private | :: | parent_coord(4) | ||||
| integer, | private | :: | iLevel | ||||
| integer, | private | :: | iParent | ||||
| integer, | private | :: | iSide | ||||
| integer, | private | :: | firstParent | ||||
| integer, | private | :: | lastParent | ||||
| integer, | private | :: | nodePos | ||||
| integer, | private | :: | nNodes | ||||
| integer, | private | :: | nColors | ||||
| integer, | private | :: | iColor | ||||
| integer, | private | :: | nBoundaries | ||||
| integer, | private | :: | nSublevels | ||||
| logical, | private | :: | distanceRefine | ||||
| integer, | private, | allocatable | :: | nodeprops(:) | |||
| integer, | private | :: | linkpos(6) | ||||
| logical, | private | :: | nullify_parent_sl | ||||
| logical, | private | :: | neigh_noLeaf | ||||
| logical, | private | :: | neigh_noSub | ||||
| logical, | private | :: | neigh_intersected | ||||
| logical, | private | :: | testAll | ||||
| type(levelValues_type), | private | :: | leVal |