Re: 4646474 : BigInteger.pow() algorithm slow in 1.4.0

2013-05-20 Thread Brian Burkhalter
Thought I sent this last week but it was saved in Drafts … On May 16, 2013, at 10:48 PM, Alan Eliasen wrote: > Yes, the extreme examples are ones like in the original bug report, > which are literally millions of times faster. If the base contains a > power of 2, (which is by far the most comm

Re: 4646474 : BigInteger.pow() algorithm slow in 1.4.0

2013-05-16 Thread Alan Eliasen
On 05/14/2013 07:11 PM, Brian Burkhalter wrote: > The test in this issue report > > http://bugs.sun.com/bugdatabase/view_bug.do?bug_id=4646474 > > is pretty much useless for comparative purposes after applying > 4837946 as the computed value is just a power of two which will be > handled very qui