insaf021 opened a new pull request, #346: URL: https://github.com/apache/commons-math/pull/346
DfpMath.pow(Dfp, int) doubles an int trial counter until it exceeds the exponent, so any exponent beyond 2^30 in magnitude (reachable through Dfp.pow(int) and Dfp.scalb(int)) overflows the counter and the inner loop spins forever, and Integer.MIN_VALUE also survives the a = -a negation; carrying the exponent and the counter as long removes both overflows and leaves results for smaller exponents unchanged. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
