> On 23 Oct 2015, at 09:41, stepharo <[email protected]> wrote: > >> Hi, >> >> Want would be the uses of this method? > > Apparently this is something really common on sets, you get all the subparts > combinations. > > Stef
https://en.wikipedia.org/wiki/Power_set The empty set should apparently be part of it too, which is explicitly not done with #combinations (a new method in Pharo 5 BTW). There is also an elegant recursive algorithm described in the Wikipedia page.
