Power set

The power set of a set is the set of all possible subsets. It can be computed using the power function, which takes a Set(T) and returns a Set(Set(T)):

Disco> power({1,2,3})
{{}, {1}, {1, 2}, {1, 2, 3}, {1, 3}, {2}, {2, 3}, {3}}
Disco> power(set("hi"))
{{}, {'h'}, {'h', 'i'}, {'i'}}
Disco> power({})
{{}}
Disco> power(power({}))
{{}, {{}}}

Disco can also find the power set of a Bags, yielding a bag of all possible subbags.

Disco> power(bag[1,1,2,3])
⟅⟅⟆, ⟅1⟆ # 2, ⟅1, 2⟆ # 2, ⟅1, 2, 3⟆ # 2, ⟅1, 3⟆ # 2, ⟅1 # 2⟆, ⟅1 # 2, 2⟆, ⟅1 # 2, 2, 3⟆, ⟅1 # 2, 3⟆, ⟅2⟆, ⟅2, 3⟆, ⟅3⟆⟆