On Apr 24, 12:24 pm, "Edward K. Ream" <[EMAIL PROTECTED]> wrote:
> For example, the old implementation of sort-siblings makes it > difficult to undo. The new code rearranges p.parent().t.children > directly. The undo code will be completely new. It should be simpler > than the old. > > Similarly, the undo/redo code for promote and demote will need a > rewrite. The sax-graph branch now contains rewritten code for move, sort, promote and demote, along with the corresponding undo/redo code. It looks like I can start eating my own dog food tomorrow. In all cases, the new code is simpler than the old, even the the code often uses the low-level structures t.children and t.parents, as well as p._parentVnode(). Happily, the new code does not call p._unlink at all. Edward --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "leo-editor" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/leo-editor?hl=en -~----------~----~----~----~------~----~------~--~---
