Anonymous user
Power set: Difference between revisions
→{{header|F_sharp|F#}}
(→{{header|Prolog}}: be kind :) I am a noob in prolog.) |
|||
Line 514:
<code>[[], [1], [2], [1,2], [3], [1,3], [2,3], [1,2,3], [4], [1,4], [2,4], [1,2,4], [3,4], [1,3,4], [2,3,4], [1,2,3,4]]</code>
=={{header|F_sharp|F#}}==
almost exact copy of OCaml version
<lang fsharp>
let subsets xs = List.foldBack (fun x rest -> rest @ List.map (fun ys -> x::ys) rest) xs [[]]
</lang>
=={{header|Groovy}}==
Builds on the [[Combinations#Groovy|Combinations]] solution. '''Sets''' are not a "natural" collection type in Groovy. '''Lists''' are much more richly supported. Thus, this solution is liberally sprinkled with coercion from '''Set''' to '''List''' and from '''List''' to '''Set'''.
| |||