Toward this purpose I created Set::CrossProduct. Instead of figuring out all the combinations, I have a bunch of anonymous arrays that specify possible values for each input. The module handles everything and hands me one set of inputs at a time. You call them "guard conditions" and I call them "boundary conditions".

In this case, there are only 16 combinations, but I've been able to work with thousands of combinations without making the test code huge.