RFR 4641897: Faster string conversion of large integers

Alan Eliasen eliasen at mindspring.com
Sat Jun 22 04:37:47 UTC 2013

On 06/21/2013 10:23 PM, Dmitry Nadezhin wrote:
> Brian,
> This patch significally enhances performance of string conversion  for
> large numbers.
> I suggest to create also a fast path for power-of-two radices: 2, 4, 8, 16,
> 32 .
> It is a simple linear algorithm that is suitable both for large and small
> numbers.
> Can it be attached to this bug activity ?
> Or should it be filed as another bug ?

   I'd file it as another bug.

   As you'll see if you run profiling tests, and the power-of-two
radices are already *much* faster than the other powers, as would be
expected.  It's possible to do the power-of-two conversions completely
with bit operations in BigInteger and not relying on Long, but the
improvement may be small as these cases are already relatively fast.

  Alan Eliasen
  eliasen at mindspring.com

More information about the core-libs-dev mailing list