Compare Position of two treeIDs in the linearized tree This is relatively expansive, therefore the result should be stored, if more than one comparison of the same treeIDs has to be done. Result: -1: left is lower than right 0: left is same than right 1: left is higher than right
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(in) | :: | left | candidate treeID |
||
integer(kind=long_k), | intent(in) | :: | right | candidate treeID |
relation between the treeIDs
Type | Visibility | Attributes | Name | Initial | |||
---|---|---|---|---|---|---|---|
type(tem_path_type), | private | :: | left_path | ||||
type(tem_path_type), | private | :: | right_path |