Recursive routine to find all actual (eligible) leave nodes in the local partition for a given treeID. Alternatively use tem_findPath, which uses precomputed paths in the tree and should speed up the search (at the expense of storing the paths beforehand).
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k) | :: | TreeID | TreeID to find in the array of Elements |
|||
integer | :: | eligible_child(:) | Candidate childs, which might be considered as neighbors |
|||
type(tem_longList), | pointer | :: | ElemList | linked list of resulting elements building the neighbor |
||
integer(kind=long_k), | intent(in) | :: | treeIDlist(nElems) | array of treeIDs |
||
integer, | intent(in) | :: | nElems | number of elements in list |
||
integer(kind=long_k), | intent(in) | :: | Part_First(:) | parts first entry |
||
integer(kind=long_k), | intent(in) | :: | Part_Last(:) | parts last entry |
||
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 | :: | childID | ||||
integer(kind=long_k), | private | :: | off |