⚠️ Warning: This is a draft ⚠️
This means it might contain formatting issues, incorrect code, conceptual problems, or other severe issues.
If you want to help to improve and eventually enable this page, please fork RosettaGit's repository and open a merge request on GitHub.
So how about the slow approach of coming up with random combinations and adding them to a set until it has 2n elements? The set object would have to guarantee uniqueness, but it would work eventually. To save some time you could add each element in the original list and the empty set to start then add sets of size 2 to n. --[[User:Mwn3d|Mwn3d]] 10:59, 16 June 2008 (MDT)
This is what your Ada code gives:
: This is fixed. --[[User:Dmitry-kazakov|Dmitry-kazakov]] 18:22, 14 October 2008 (UTC)
== Another copyleft issue? ==
::: Maybe this page (reached by clicking bottom-left copyright note "credits") helps, even though indeed it could not be too much clear to what "this site" can refer to (blogs and wiki are under the same domain afterall): [http://smalltalk.gnu.org/credits]
Verbatim copying and distribution of the contents of this site is permitted in any medium, provided this notice is preserved.
::: So the code could be reposted, provided I understand how/where to preserve the notice (needed even if this site is all licensed with GNU FDL?). Wainting feedback before reposting. --[[User:ShinTakezou|ShinTakezou]] 11:34, 2 April 2009 (UTC)
== CLISP: How can I run this example? ==
(powerset '(l i s p))
i.e., where do I store the function definition? --[[User:Walterpachl|Walterpachl]] ([[User talk:Walterpachl|talk]]) 12:21, 23 May 2016 (UTC)