archive/jdk
1
0
Fork 0
mirror of https://github.com/openjdk/jdk.git synced 2025-08-27 06:45:07 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

8247782: typos in java.math

Browse source 
Reviewed-by: rriggs, lancea, darcy
This commit is contained in:
Martin Buchholz 2020-06-17 12:29:58 -07:00
parent 34c79640e7
commit 4f2edacaaf
2 changed files with 4 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

4
src/java.base/share/classes/java/math/BigDecimal.java
View file

@ -934,7 +934,7 @@ public class BigDecimal extends Number implements Comparable<BigDecimal> {
// At this point, val == sign * significand * 2**exponent.
/*
* Special case zero to supress nonterminating normalization and bogus
* Special case zero to suppress nonterminating normalization and bogus
* scale calculation.
*/
if (significand == 0) {
@ -4052,7 +4052,7 @@ public class BigDecimal extends Number implements Comparable<BigDecimal> {
pows[i] = pows[i - 1].multiply(BigInteger.TEN);
}
// Based on the following facts:
// 1. pows is a private local varible;
// 1. pows is a private local variable;
// 2. the following store is a volatile store.
// the newly created array elements can be safely published.
BIG_TEN_POWERS_TABLE = pows;

4
src/java.base/share/classes/java/math/BigInteger.java
View file

@ -2751,7 +2751,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
BigInteger base2 = (this.signum < 0 || this.compareTo(m1) >= 0
? this.mod(m1) : this);
// Caculate (base ** exponent) mod m1.
// Calculate (base ** exponent) mod m1.
BigInteger a1 = (m1.equals(ONE) ? ZERO :
base2.oddModPow(exponent, m1));
@ -2905,7 +2905,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
* This means that if you have a k-bit window, to compute n^z,
* where z is the high k bits of the exponent, 1/2 of the time
* it requires no squarings. 1/4 of the time, it requires 1
* squaring, ... 1/2^(k-1) of the time, it reqires k-2 squarings.
* squaring, ... 1/2^(k-1) of the time, it requires k-2 squarings.
* And the remaining 1/2^(k-1) of the time, the top k bits are a
* 1 followed by k-1 0 bits, so it again only requires k-2
* squarings, not k-1. The average of these is 1. Add that