On Sat, Jul 4, 2009 at 11:40 PM, Edward K. Ream<[email protected]> wrote:
>> This table would be per-controller, and it would have valid data at >> all times. It can be used to identify cloned nodes (those have >> refcount >1, or len(parentlist) > 1. > > I dislike such schemes. They are yet another form of caching. > > Besides, it probably takes exactly as much work to keep the cache > up-to-date as it does to recompute info as needed. > > Anyway, I think we will find that "the simplest thing that could > possibly work" > will be good enough. Certainly, that's where I shall start. If you have a simpler scheme in mind, definitely. But I'm not sure there is a simpler scheme. Note that this is not "caching", as this dict would be the only place this information would be available (assuming it's the reference count). This kind of reference count structure is maintained e.g. by Unix filesystems. We also know the places where that structure is to be updated (position connect/disconnect to tree). And, we already have equivalent structure (tnodesdict). It's needed to detect clones in @thin node reading. -- Ville M. Vainio http://tinyurl.com/vainio --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
