On Friday, January 10, 2014 6:01:19 AM UTC-6, Edward K. Ream wrote: > This post will be pre-writing for further documentation. It contains important insights for both users and developers.
Another happy insight: this code is super fast. Newly-added statistics show that the algorithm scans 54 nodes and moves 57 when processing a copy of leoViews.py In words, the sum of the two global node lists is 57 :-) The code should verify that the algorithm will leave the original file unchanged when the reorganized files are written. The obvious way is to compare a trial write of the *reorganized* outline with the original @auto file. Note that the @auto algorithm does similar comparison (using a trial write) before calling the new code. As I write this, I see that there is a faster, if less reliable way: just remember the original outline order, and then do a smart comparison, taking into account added organizer nodes and comments that may have been moved into organizer nodes. But a second full trial write is good enough for now... 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.
