I'm not sure from your description, but what you want sounds very much like Algorithm::Loops::NestedLoops, which takes subroutines to create loops and nests those to create the data structure (as another iterator).
In reply to Re: Efficient but elegant Cross-Product iterator ?
by Corion
in thread Efficient but elegant Cross-Product iterator ?
by LanX
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |