Flatten nested set expressions as they are built so that we are less likely to hit Python's recursion limit when compiling the expression to SQL.
This relies on the left associativity of all the set expressions. (i.e. that Union(Union(a, b), c) is equivalent to Union(a, b, c)).
« Back to merge proposal
Flatten nested set expressions as they are built so that we are less likely to hit Python's recursion limit when compiling the expression to SQL.
This relies on the left associativity of all the set expressions. (i.e. that Union(Union(a, b), c) is equivalent to Union(a, b, c)).