Jakob Kummerow dd5e5535ea [bigint] Faster parsing from long strings ... Combining parts in a balanced-binary-tree like order allows us to use fast multiplication algorithms. Bug: v8:11515 Change-Id: I6829929671770f009f10f6f3b383501fede476ab Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/3049079 Reviewed-by: Maya Lekova <mslekova@chromium.org> Commit-Queue: Jakob Kummerow <jkummerow@chromium.org> Cr-Commit-Position: refs/heads/main@{#76404}		2021-08-20 10:54:34 +00:00
..
bigint-shell.cc	[bigint] Faster parsing from long strings	2021-08-20 10:54:34 +00:00
bigint.status	Reland^2 "[bigint] Karatsuba multiplication"	2021-06-07 11:01:14 +00:00
BUILD.gn	[bigint] Define V8_ADVANCED_BIGINT_ALGORITHMS everywhere	2021-07-27 15:17:34 +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