On Thu, Jan 16, 2014 at 3:16 AM, Edward K. Ream <[email protected]> wrote:
> vc.compute_organized_positions can easily compute the unl of where Y will be found. If od.exists, just remove the penultimate part of the unl! > This simple change *might* suffice to handle existing organizer nodes. We shall see, but not just yet. It's after 3 a.m. and time for a bit more sleep... Getting some sleep was a wise idea. It's important to have all my wits about me in these latter stages of the project. Dropping the penultimate unl did suffice to connect unl's in existing organizers to the correct node (position). However, traces in move_nodes & helpers clearly show the nodes organized by existing organizers are not being added to the global move list, and thus are not being moved. Fixing this problem might make everything work. However, the unit test that verifies that the "after" outline is as expected now fails, probably because the test itself must be modified to reflect the new capabilities of the algorithm. And even if everything suddenly does "just work" there are two more items on the list: 1. Restore headlines from @headlines nodes. 2. Add more error checking: - Use full trial write for comparisons. - Revert the outline if the trial write fails. Both items must be complete before we go to general alpha testing. So despite my eagerness to finish this project, patience (and sleep!) are essential. EKR -- 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/groups/opt_out.
