Can anyone help me convert this Python code into C++? If the line "tf = list(product([True, False], repeat=len(opers)))" can't be done, I'll be happy with the rest of the function at least. Basically generating all length-n permutations of True/False. opers is a list that holds the proposition variables. For example: p&q, so it stores p and q.

def gen_table(prepostion, alpha_order=False): values = OrderedDict() opers = [] for p in prepostion: if p.isalpha() and p not in opers: opers.append(p) if alpha_order: opers = sorted (opers) list(product([True, False), repeat=len (opers))) for i, x in enumerate(opers): values[x] = [] for e, n in enumerate(tf): values[x].append(n[i]) tf = return values Enter a prepostion: p&q q q p&q True True True True False false False True False False false false def gen_table(prepostion, alpha_order=False): values = OrderedDict() opers = [] for p in prepostion: if p.isalpha() and p not in opers: opers.append(p) if alpha_order: opers = sorted (opers) list(product([True, False), repeat=len (opers))) for i, x in enumerate(opers): values[x] = [] for e, n in enumerate(tf): values[x].append(n[i]) tf = return values Enter a prepostion: p&q q q p&q True True True True False false False True False False false false