[Haskell-cafe] Looking for smallest power of 2 >= Integer

Dan Piponi dpiponi at gmail.com
Tue Dec 4 00:59:00 EST 2007

On Dec 3, 2007 9:32 PM, Sterling Clover <s.clover at gmail.com> wrote:
> if all else fails, be determined by unpacking it
> into the primitives, which are (# Int#, ByteArr# #) with the Int# as
> the number of "limbs" of the integer, as well as its sign.

That's the answer I'm looking for, thanks.

More information about the Haskell-Cafe mailing list