From time to time, a question about this has appeared on this list. I have just posted a blog about how to do it.
Problem: You have a number of sets and you want all the combinations when choosing one element from each set. In mathematics, these combinations are called the Cartesian products. They are also known as cross-products. In the database world, they are sometimes called cross-joins. See http://lookatperl.blogspot.ca/2012/12/a-look-at-cartesian-products.html -- Just my 0.00000002 million dollars worth, Shawn Programming is as much about organization and communication as it is about coding. Why fit in when you can stand out? Dr. Seuss The only way that problems get solved in real life is with a lot of hard work on getting the details right. Linus Torvalds -- To unsubscribe, e-mail: beginners-unsubscr...@perl.org For additional commands, e-mail: beginners-h...@perl.org http://learn.perl.org/
