Revision as of 09:29, 15 March 2012 (view source) rosettacode>Lewis1711 (Added racket version) ← Older edit		Revision as of 22:46, 28 March 2012 (view source) rosettacode>Bearophile (Updated first D entry) Newer edit →
Line 502: =={{header\|D}}== Version using just arrays (assumed to contain distinct items):▼ <lang d>import std.stdio~~: writeln~~;▼ T[][] ~~powerset~~powerSet(T)(in T[] s) pure nothrow {▼ ▲Version using just arrays: auto r = new ~~T[][]~~typeof(return)(1, 0);▼ ▲<lang d>import std.stdio: writeln; ▲T[][] powerset(T)(T[] s) { ▲ auto r = new T[][](1, 0); foreach (e; s) { ~~T[][]~~typeof(return) rs; foreach (x; r) rs ~= x ~ [e]; Line 519 ⟶ 517: void main() { writeln(~~powerset~~powerSet([1, 2, 3])); }</lang> {{out}} <pre>[[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]]</pre> A [[Power_set/D\|set implementation]] and its power set function.

Power set (view source)