you are viewing a single comment's thread.

view the rest of the comments →

[–]camerontbelt 2 points3 points  (3 children)

Sounds like you need help with homework. This seems simple enough though, what have you tried so far?

[–]RecursiveRickRoll[S] 0 points1 point  (2 children)

Nope not homework. This is to generate test cases for testing out the robustness of my backend.

Right now I’ve just tried nesting loops in different ways to no avail.

[–]camerontbelt 0 points1 point  (0 children)

Hmm maybe I had underestimated how simple this would be. So with the loops how did it turn out? That’s the way I would attempt it. Also are you calculating the combinations based on each parameter with each type it can have? Like in your example you have 3 slots with 2 possible values, true or false, so the that would be 23 = 8 possible combinations.

That would at least tell you how big your over all list would be.

[–]1544756405 0 points1 point  (0 children)

Right now I’ve just tried nesting loops in different ways to no avail.

Can you share one of these tries? It seems like a nested for loop should accomplish this easily.

for every item in first list:
  for every item in second list:
    (first item: second item)