I got the crude code below to work in every case I tried (clones,
children)
reverse() might be too crude however
Also undo part does not work
u = c.undoer
marked = [ p.copy() for p in c.all_positions() if p.isMarked() ]
marked.reverse()
if marked:
for p in marked:
p.doDelete()
else:
g.es('No Marked Nodes')
c.redraw()
I doubt the reverse trickwill handle all complicated trees
To help me understand Leo tree code better:
In a case with clone nodes where both are marked, does the fact that a
node position no longer exists when working backward on tree matter if
it would have been deleted anyway?
--
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.
