On Tue, Oct 21, 2008 at 11:31 AM, Edward K. Ream >> At least redraw-on-expand (a very frequent occurence) can be made insanely >> fast. > > Ok. I'll look into this today.
As expected, this is much harder than the full redraw case. And the dog has started barking: I've found ways to crash qt/python :-) I am dubious about using id(it) as a hash. When the tree is changing it would be so easy to refer to something that looks like a tree item but isn't because it has been deallocated. Boom. Presumably id(it) was used as a hash because tree items aren't hashable. I'll check this soon... Also, deleting a tree isn't as easy as item.takeChildren: the leoTkTree dictionaries must be updated or further chaos will happen. I haven't given up, but this is turning into a project. 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 -~----------~----~----~----~------~----~------~--~---
