Recursive routine to find all actual (eligible) leave nodes in the local partition for a given treeID.
HK: when doing this for the complete domain it would probably better just compute the ID on the finest level along with the information on the level of each leaf, in order to speed up things a little. This way comparison would be just a simple integer comparison.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_path_type), | intent(in) | :: | Path | Path to the leaf to find in the array of Elements |
||
integer, | intent(in) | :: | eligible_child(:) | Candidate childs, which might be considered as neighbors |
||
type(tem_longList), | pointer | :: | ElemList | linked list of resulting elements building the neighbor |
||
type(tem_path_type), | intent(in) | :: | pathlist(nElems) | array of paths |
||
integer, | intent(in) | :: | nElems | number of elements in list |
||
logical, | intent(inout), | optional | :: | otherLevel | entry is on another level |
Type | Visibility | Attributes | Name | Initial | |||
---|---|---|---|---|---|---|---|
integer(kind=long_k), | private | :: | pos | ||||
integer, | private | :: | i | ||||
integer(kind=long_k), | private | :: | off | ||||
type(tem_path_type), | private | :: | childPath |