This routine checks if neighbor node with intersected boundary is level higher than current node level.
If neighbor node is intersected boundary bit but no a leaf or target or node with qVal than refine current node.
| Type | Intent | Optional | Attributes | Name | ||
|---|---|---|---|---|---|---|
| type(sdr_protoTree_type), | intent(inout) | :: | proto |
preliminary tree on which childern are created |
||
| integer, | intent(in) | :: | parent |
Position of parent node on the dynamic array of node%treeID and node_data in preliminary tree |
||
| integer(kind=long_k), | intent(in) | :: | parent_ID_offset |
first treeID of the parent |
||
| type(levelValues_type), | intent(in) | :: | leVal |
contains information on current level on which children are created |
||
| integer, | intent(inout) | :: | maxLevel |
Maximum level to refine current node |