On Wed, Oct 5, 2011 at 2:57 PM, Edward K. Ream <[email protected]> wrote:
> That is, if p has a next sibling (after == p.next()) the next position > (after the move) will be equal to p (before the move)! Otherwise, > p.nodeAfterTree will, of course, remain unchanged. The "of course" requires a short proof. If after != p.next(), then either after is None, or after is the next sibling of one of p's parents. The move changes neither p's parents nor any of the siblings of those parents. QED. EKR -- 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.
