Mark Dickinson added the comment:

> Mark, the code I showed in is somewhat more accurate and highly 
> significantly faster than the code you just posted.

Okay, fair enough. In that case, we still need a solution for computing rootn(x 
* 2**e) in the case where x*2**e itself overflows / underflows an IEEE 754 


Python tracker <>
Python-bugs-list mailing list

Reply via email to