Would a Bits instance for 2-adic numbers be useful?

Cheers,
Vanessa

Yeah, I would be really sad if I can't do popCount on Integer.

I suppose the issue really is whether you are allowed to have instances of Bits that have values with an infinite number of 1 bits, e.g. the 2-adic numbers.

On Sat, Nov 30, 2019, 9:21 AM Oleg Grenrus <oleg.grenrus@iki.fi> wrote:

Although, popCount for Integer/Natural kind of makes sense, as they
aren't infinite list of [Bit]s, but smarter structure.

On 30.11.2019 17.17, Oleg Grenrus wrote:
> I propose to change it to be member of FiniteBits
>
> I recall, there was a proposal to remove bitSize from Bits, so it's an
> opportunity to introduce another small, yet breaking change at the
> same time.
>
> Discussion time 2 week.
>
> - Oleg
>
> _______________________________________________
> Libraries mailing list
> Libraries@haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries
_______________________________________________
Libraries mailing list
Libraries@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries

_______________________________________________
Libraries mailing list
Libraries@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries