I use the same sort of logic to calculate Floor(Log2(n)) (number of largest bit set), to clear the bottom say b bits of an integer.
Is this a reasonable (though probably not idea) way to go?
I noted that the limbs are 32 bits on Windows and this leads me to my second question. How can I get the internals of boost using bigger chunks like 64 bit?
It seems I need a compiler supporting __int64.
<cstdint>).
I tried LLVM but that seemed quite slow. I may not have put enough effort into investigating LLVM up to this point.