On Mon, Aug 8, 2011 at 8:32 PM, Terry Brown <[email protected]> wrote:
> That seems reasonable, > > while parent: > parents.insert(0, parent.h) > parent = parent.getParent() IIRC there was also p.parents(). Reversing that list is probably faster than building a list that way. (Yeah, this is bikeshedding) -- 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.
