Chunyu Jin, Clive Verghese, Cong Liu, Corentin Kerisit, Daniel Chen, Daniel Kuts, Daniel Ng, Daniel Sosa, Daniel Suo, Danila Malyutin, David Dunleavy, David Majnemer, David Pizzuto, Deepika Rajani, deeptanshusekhri, dependabot[bot], Deqiang Chen, Derek Murray, Dillon Sharlet, Dimitar (Mitko) Asenov, Dimitris Vardoulakis, Dirk Hornung, DottsGit, Dragan Mladjenovic, Eetu Sjöblom, Elen Kalda, Emilio Cota, Emily Fertig, Eugene Zhulenev, Eusebio Durán Montaña, Evan Brown, Ezekiel Calubaquib, Faijul Amin,...

// We could do that by doubling _W * n times, or with a square-and-double // chain log2(_W * n) long. Turns out the fastest thing is to start out with // doublings, and switch to square-and-double once the exponent is large // enough to justify the cost of the multiplications. // The threshold is selected experimentally as a linear function of n. threshold := n / 4 // We calculate how many of the most-significant bits of the exponent we can // compute before crossing the threshold, and we do it with...

// We could do that by doubling _W * n times, or with a square-and-double // chain log2(_W * n) long. Turns out the fastest thing is to start out with // doublings, and switch to square-and-double once the exponent is large // enough to justify the cost of the multiplications. // The threshold is selected experimentally as a linear function of n. threshold := n / 4 // We calculate how many of the most-significant bits of the exponent we can // compute before crossing the threshold, and we do it with...