I had a similar question awhile back about using a dynamic number of nested for loops (Topic thread here,tilly's answer here).

I wanted to loop through x sets of items and process the combinations:

i.e.: the sets {1,2,3},{a,b,c},{!@#} yield (inorder) 1a!, 1a@, 1a#, 1b!, 1b@, 1b#...3c#

tilly's answer had it all AND made me REALLY understand closures and iterators and how powerfull they really are.


_________________
madams@scc.net

              (__)
              (\/)
       /-------\/
      / | 666 ||
     *  ||----||
[download]