[Haskell-cafe] bitSize

Steve Schafer steve at fenestra.com
Fri Aug 26 20:36:34 CEST 2011

On Fri, 26 Aug 2011 18:24:37 +0100, you wrote:

>I would usually want #3 or #4.

Out of curiosity, what for? While I do occasionally need to get a
"logarithmic size estimate" of a number (which is basically what #3 and
#4 are), the specific requirements in each case tend to vary, enough so
that it's unlikely that a single function (other than simply taking the
logarithm) can handle the majority of applications.

-Steve Schafer

More information about the Haskell-Cafe mailing list