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

David Benbennick dbenbenn at gmail.com
Tue Dec 4 01:05:26 EST 2007

On 12/3/07, Dan Piponi <dpiponi at gmail.com> wrote:
> 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.

Could you please post your code here when you're done?  I'd be
interested to see the final result.

More information about the Haskell-Cafe mailing list