Well too darned bad, 'cause I'm gonna share the magic formula I just found anyway:
[((i&-i)-1).popcount() for i in srange(1,2^n)] from http://aggregate.org/MAGIC/ On Fri, Dec 6, 2013 at 6:42 AM, Nathann Cohen <nathann.co...@gmail.com> wrote: > Yooooooooo !! > >> Yes indeed -- with a formula like that, there's little reason not to >> implement it ad-hoc every time. Unless a user wants it, and doesn't >> know this bit of information. Though... what Nathannnnnn said was >> that he wants to know which bit changes... >> >> (i.valuation(2) for i in srange(1,2^n)) >> >> does the job -- though this can certainly be implemented better. > > Well, it's true that the one-liner simplifies a lot of things :-D > > There are good implementations there if we need them in some fast C > code though : www.jjj.de/fxt/fxtbook.pdf > > But my problem is solved ! Thanks :-D > > Nathann > > -- > You received this message because you are subscribed to the Google Groups > "sage-devel" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to sage-devel+unsubscr...@googlegroups.com. > To post to this group, send email to sage-devel@googlegroups.com. > Visit this group at http://groups.google.com/group/sage-devel. > For more options, visit https://groups.google.com/groups/opt_out. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/groups/opt_out.
