Hi Sebastian, Am Samstag, 27. Oktober 2007 schrieb Sebastian Bergmann: > Thomas Nunninger schrieb: > > Unfortunately, the loop node needs more than one outnode. > > Of course it does: you need to enter the loop (first incomint node), > you need to jump back to the start of the loop (second incoming > node), you need to enter the loop body (first outgoing node), and you > need exit the loop (second outgoing node). > > => LOOP <=> STEP > > \/ > EXIT > > I do not see how this could be implemented differently.
My idea was to create an XOR in the end of the loop construct myself (in the end as described in my previous mail). I don't know about the implementation of the loop node - so I don't know if it is just about constraints (number of in/out nodes) or if there is some additional implementation. But if I see correctly, you don't know which condition goes in the loop and which one exits the loop. But I do not know what happens regarding threads and whatever in the loop node. I only know, that I had problems using simple merge (instead of the loop node) + XOR (at the end of my looping construct). But if you do not see how to implement, just forget about it. I just wanted to tell you, that there are situations where it is not that intuitive... Thanks and have a nice weekend Thomas -- Components mailing list [email protected] http://lists.ez.no/mailman/listinfo/components
