On Thu, May 23, 2013 at 9:53 AM, Terry Brown <[email protected]>wrote:
Building large data visualization (i.e. throw away) trees is slow with > positions, but fast with vnodes. I use this monkey patch: > > from leo.core.leoNodes import vnode > if not hasattr(vnode, 'insertAsLastChild'): > def ialc(self): > vnode(self.context)._linkAsNthChild(self, len(self.children)) > return self.children[-1] > vnode.insertAsLastChild = ialc > Cool. As I look at p.deletePositionsInList, I can think of no reason why it should work. It looks thoroughly broken. Who wrote this trash? According to qblame, I did. Hahaha. I don't know how you are approaching the problem, Terry, but it seems to me that it's more natural to look at things from the data (vnode) point of view rather than the traversal (position) point of view. If that is so, then having higher-level vnode methods, such as v.insertAsLastChild, makes a lot of sense. 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 http://groups.google.com/group/leo-editor?hl=en-US. For more options, visit https://groups.google.com/groups/opt_out.
