On Tue, Aug 3, 2010 at 8:19 AM, Edward K. Ream <[email protected]> wrote:
> # Simulate the iterator
Oops. I forgot we don't have the constraints as when using the
iterator. We can simplify the loop as in the original code:
# Simulate the iterator.
p = first
while p and p != after
if p in aList:
# Skip deleted/moved positions.
next = p.nodeAfterTree()
# Call the callback to delete or move the node.
callback(p.copy())
# Special case: we're done if there is no after node.
p = next
else:
p.moveToThreadNext()
Ok. Time for testing.
Edward
--
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.
