Am 04.07.2011 um 09:06 schrieb Paul Isambert: > Problem 1:
> for n in node.traverse(tex.box[0].head) do what I usually do (not always true, of course ;) is a while loop while head do ... head = head.next end which makes a bit easier for me to understand what happens if I remove/insert some nodes. Patrick
