Specialize _toPow2String for bigint to make it linear instead of quadratic.

runtime/lib/bigint.dart

 // Copyright (c) 2014, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 // Copyright 2009 The Go Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style
 // license that can be found in the LICENSE file.
 
 /*
  * Copyright (c) 2003-2005  Tom Wu
@@ skipping 1100 matching lines @@
     return r._toValidInt();
   }
 
   int get sign {
     return (_used == 0) ? 0 : _neg ? -1 : 1;
   }
 
   bool get isEven => _used == 0 || (_digits[0] & 1) == 0;
   bool get isNegative => _neg;
 
+  String _toPow2String(int radix) {
+    if (_used == 0) return "0";
+    assert(radix & (radix - 1) == 0);
+    final bitsPerChar = radix.bitLength - 1;
+    final firstcx = _neg ? 1 : 0;  // Index of first char in str after the sign.
+    final lastdx = _used - 1;  // Index of last digit in bigint.
+    final bitLength = lastdx*DIGIT_BITS + _nbits(_digits[lastdx]);
+    // Index of char in str. Initialize with str length.
+    var cx = firstcx + (bitLength + bitsPerChar - 1) ~/ bitsPerChar;
+    _OneByteString str = _OneByteString._allocate(cx);
+    str._setAt(0, 0x2d);  // '-'. Is overwritten if not negative.
+    final mask = radix - 1;
+    var dx = 0;  // Digit index in bigint.
+    var bx = 0;  // Bit index in bigint digit.
+    do {
+      var ch;
+      if (bx > (DIGIT_BITS - bitsPerChar)) {
+        ch = _digits[dx++] >> bx;
+        bx += bitsPerChar - DIGIT_BITS;
+        if (dx <= lastdx) {
+          ch |= (_digits[dx] & ((1 << bx) - 1)) << (bitsPerChar - bx);
+        }
+      } else {
+        ch = (_digits[dx] >> bx) & mask;
+        bx += bitsPerChar;
+        if (bx >= DIGIT_BITS) {
+          bx -= DIGIT_BITS;
+          dx++;
+        }
+      }
+      str._setAt(--cx, _IntegerImplementation._digits.codeUnitAt(ch));
+    } while (cx > firstcx);
+    return str;
+  }
+
   _leftShiftWithMask32(int count, int mask) {
     if (_used == 0) return 0;
     if (count is! _Smi) {
       _shlFromInt(count);  // Throws out of memory exception.
     }
     assert(DIGIT_BITS == 32);  // Otherwise this code needs to be revised.
     if (count > 31) return 0;
     return (_digits[0] << count) & mask;
   }
 
@@ skipping 310 matching lines @@
   void _sqrTo(_Bigint x, _Bigint r) {
     x._sqrTo(r);
     _reduce(r);
   }
 
   void _mulTo(_Bigint x, _Bigint y, _Bigint r) {
     x._mulTo(y, r);
     _reduce(r);
   }
 }