The repo now contains a rewritten, non-recursive, version of pd.find_position_for_relative_unl.
Don't even *think* about replacing this code unless your code passes all the test cases in @test pd.find_position_for_relative_unl. Previous versions failed one or more parts of this test. The new code follows a strategy that is completely different from g.recursiveUNLSearch. Imo, this strategy is more appropriate for linking @auto imported nodes. It does not use sibling order in any way. As described in another thread, it first finds all nodes whose headline matches the tail of the unl. It then looks at the matching node's parents, and adds the parents' headlines if they match the expanding tail of the unl. If there are more than one matches, it picks the node with the longest match. Edward -- You received this message because you are subscribed to the Google Groups "leo-editor" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/leo-editor. For more options, visit https://groups.google.com/d/optout.
