On Wed, 7 Aug 2013 15:33:46 -0500
Terry Brown <[email protected]> wrote:

> alist = []
> for parent in set(p.parents()):
>     alist.extend([i.copy() for i in parent.children() if i.v == p.v])
> c.deletePositionsInList(alist)
> c.redraw()
> 
> untested

OH NO, don't do it ;-) that's completely wrong - p.parents() is
actually a list of p's ancestors, not the same a v.parents at all... so
the above won't work.

But I think you can use the even simpler

c.deletePositionsInList(c.vnode2allPositions(p.v))

Cheers -Terry

-- 
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.
For more options, visit https://groups.google.com/groups/opt_out.


Reply via email to