On Tuesday, January 7, 2014 6:29:11 AM UTC-6, Edward K. Ream wrote: > Computing the source unl [of an organizer node] is similar to computing the raw unl, but the computation drops the tail of the unl only until a non-organizer part is seen.
I was confused. In fact, the source unl of an organizer node O is self.drop_unl_tail(self.drop_all_organizers_in_unl(O)) > There is also an ever-present complication: moving nodes into an organizer node has the potential to invalidate previously-computed positions. In general, the way around all such problems is to process nodes in a depth-first manner. This preserves the validity of all positions while they are being used. EKR -- 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.
