* Alan Eliasen:
> Alan Eliasen wrote:
>>Note that my optimizations for the pow() function give vastly better
>> performance at even small bit sizes for many operands, as they factor
>> out powers of 2 in the exponent and perform these very rapidly as
>> bit-shifts.
>
>Oops. I mean powers
Michael,
I think the best way to handle the coordination is in two steps.
I'd like to get my Linux-clone changes in first (you should review,
I will commit)
and then we switch hats and I will review your Solaris changes.
It seems best to do this in two steps: to better place blame when
it breaks (
Alan Eliasen wrote:
> Andrew Haley wrote:
>> You give examples of the speedup for very large bignums, but you
>> don't say the size of numbers at which your approach becomes faster
>> than the current code. Of course any asymptotic improvement helps
>> with numbers that are half a million decimal
