On Tuesday, June 20, 2017 at 10:09:29 AM UTC-5, Edward K. Ream wrote: In the interests of reaching the widest possible audience, here is a > shorter summary of my intentions, from #505: >
And here is some thinking out loud about implementation. This is a repeat of comments in #505. *Positions vs vnodes* I would like to make minimal changes to the read code. The code is inherently complex, and starting over is not likely to clarify matters. The priority rules given above depend on a clone's ancestor @file node. But this depend on the clone's position within the outline. The clone's vnode/gnx does not suffice. This creates at least two problems: 1. Positions will change when reading @file trees. 2. The present code is (for good reasons) based on vnodes (gnx's) rather than positions. It may be necessary (and simplest) to defer the final assignment of headlines and body text until all positions have stabilized. That can be done easily: vnodes could contain *lists *of possible values for v.h and v.b, along with the vnode (probably) of the corresponding ancestor root @file node, if any. A post-pass will pick the highest priority item in the list, creating Recovered Nodes entries only when there are two entries with the same priority, higher than any other item in the list. 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 https://groups.google.com/group/leo-editor. For more options, visit https://groups.google.com/d/optout.
