Sorry, but I don't get, how this could
help me with my current problem. Maybe
because its a bit late already... Give
me the chance to sleep about this idea
,but I doubt that this union-structure
will help me very much with a good way
to test for intersections.

What I want to to is to compute all of
the positions in SDL before postioning
them. But to do this efficient I think
I need something like references to be
able to create list or tree structures
like they are common in other programm-
ing languages.

It could be able to create such things
with the help of some arrays and a lot
macros. But the overhead would be more
than neccesary and the efficiency gets
lost, so it would no longer be faster
than my current approach...

Post a reply to this message