On Thursday, January 16, 2014 9:58:16 AM UTC-6, Edward K. Ream wrote: Rev 6589 gets a lot closer to success. It passes for a realistic @auto file. The vast majority of the code now works reliably.
The present code fails for nested existing organizer nodes. Not a big surprise ;-) The code fails to find one of the nested nodes, that is, to associate its unl with an imported node. I'll work on this tomorrow. I am happy with the overall design. The read code consists of three *completely independent* phases: 1. Initing the OrganizerData nodes and other global data (precompute_all_data & helpers) 2. Generating the global moved node list (demote_helper & helpers) 3. Actually moving the nodes as specified by the list (move_nodes & helpers) For example, the unl failure discussed above is confined to phase 1. Edward P.S. Recent revs fixed four or five bugs. Most involve special cases. Happily, these special cases don't add to the global complexity. In each case, the complication is confined to a specific method (including possibly its helpers). 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.
