Generate all subsets with setPowerset

setPowerset returns the power set: every possible subset of an input set, including the empty set and the full set.

Example

A three-member set has eight subsets. This is useful for exhaustive feature choices and small combinatorial searches. Compare combinations when only subsets of one size are needed, and setCartesian for ordered cross-combinations.

Growth caveat

A set of n members produces 2^n subsets, so output becomes enormous quickly. Check setSize first and deduplicate with setDistinct. Avoid powerset for large inputs unless a constrained search is intended.