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

Brandon S. Allbery KF8NH allbery at ece.cmu.edu
Mon Dec 3 23:40:14 EST 2007

On Dec 3, 2007, at 23:36 , Dan Piponi wrote:

> Is there anything in any of the interfaces to Integer that will allow
> me to quickly find the highest bit set in an Integer? If not, does

Isn't Integer unlimited (well, limited by RAM)?

brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery at kf8nh.com
system administrator [openafs,heimdal,too many hats] allbery at ece.cmu.edu
electrical and computer engineering, carnegie mellon university    KF8NH

More information about the Haskell-Cafe mailing list