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

On Dec 3, 2007 9:32 PM, Sterling Clover 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. -- Dan