Jakob Kummerow 40b20c9401 [bigint] Faster .toString() ... Now that we have advanced division algorithms, we can implement a divide-and-conquer strategy for toString-conversions, to make their complexity sub-quadratic. For example, this speeds up `(2n ** (2n ** 21n)).toString().length` from 9400 ms to 200 ms on my laptop. Bug: v8:11515 Change-Id: Id20f7f2928dc7308609f4c1688f32b252e04f433 Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/3017805 Reviewed-by: Maya Lekova <mslekova@chromium.org> Commit-Queue: Jakob Kummerow <jkummerow@chromium.org> Cr-Commit-Position: refs/heads/master@{#75880}		2021-07-23 11:01:04 +00:00
..
bigint-shell.cc	[bigint] Faster .toString()	2021-07-23 11:01:04 +00:00
bigint.status	Reland^2 "[bigint] Karatsuba multiplication"	2021-06-07 11:01:14 +00:00
BUILD.gn	[bigint] Toom-Cook multiplication	2021-07-07 10:12:26 +00:00
DEPS	Reland^2 "[bigint] Karatsuba multiplication"	2021-06-07 11:01:14 +00:00
testcfg.py	Reland^2 "[bigint] Karatsuba multiplication"	2021-06-07 11:01:14 +00:00