What is the more efficient way to generate all combinations of dicts in a list

Question

I want to generate all combinations of a list that have the format:

[{"first": a, "second": b, "third": c, "fourth": d}, {"first": e, "second": f, "third": g, "fourth": h}, {"first": i, "second": j, "third": k, "fourth": l}]

where a, b, c, e, f, g, h, i, j are float between 0.1 and 0.9 and d, h, l are integers between -20 and 20.

I am using for loops with range() but it takes too much time or cpu.

python collections.combinations can simplify your code but probably will not speed it up — woblob, Sep 24 '20 at 14:43
Please tell why you want to do that. It will help solving your problem. — Jao, Sep 24 '20 at 14:44
Basically brute forcing a function. Providing two outputs, the list on the question and another known output I need to find a known result. — Antoine, Sep 24 '20 at 14:46

score -1 · Answer 1 · answered Sep 24 '20 at 14:50

-1

You could do it through pandas, where each of your keys is a column in the dataframe and you then get the list of dictionaries out of it (see here)

answered Sep 24 '20 at 14:50

DDD1

361
1
11

What is the more efficient way to generate all combinations of dicts in a list

1 Answers1