What references do we have as constants now? If a parent has childs that change, but he wont, can we reference back to him during an iteration through its child nodes? In that case we could just use that function to store the relative position from the nodes-wanted-to-be-deleted to that non-changing-parent and then "go down-erase" as I did..
I currently need to be able to access/refer that non-changing-parent for an iteration I need to perform (IE Restart the iteration after changes have been made to its childs)...so, does that function exist? Thanks! On Tuesday, May 14, 2013 3:44:17 PM UTC+2, Edward K. Ream wrote: > > On Tue, May 14, 2013 at 7:00 AM, Fidel Pérez <[email protected]<javascript:> > > wrote: > >> I got something which does the trick: >> >> for x in range (0,totalnumberofnodes+1): >>> c.executeMinibufferCommand('goto-next-node') >>> c.executeMinibufferCommand('delete-node') >> >> > I'm glad this works for you. I'd like to point out, however, that it's > not a general solution to the problem you posed. What we want is something > that works for any list of (copies of) positions, randomly distributed > throughout a tree. I have doubts that p.deletePositionsInList(aList) works > ;-) I'll investigate... > > 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.
