The code in Algorithm::Odometer::Tiny is indeed tiny, but loops over lists/arrays not subs. (like the other listed solutions)
(my title Cross Product might be misleading though ... sorry)
EDIT: I suppose though it is possible to re-init the arrays once one loop level is entered.
I wasn't able to locate the code for "forsetproduct from Math::Prime::Util" but the docs say
Our "forsetproduct" matches Set::Product in both high performance and functionality (that module's single function "product" in Set::Product is essentially identical to ours).
But that's not a lazy iterator but returning a greedy list.
Regarding Set::Product::XS , I'm more interested in PP solutions.
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
On a side note, if you want to create a string from the product, consider using the glob-iterator
DB<65> p "$_\n" while <"{1,2,3}:{a,b,c}"> 1:a 1:b 1:c 2:a 2:b 2:c 3:a 3:b 3:c
In reply to Re^2: Efficient but elegant Cross-Product iterator ?
by LanX
in thread Efficient but elegant Cross-Product iterator ?
by LanX
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |