This is an automated email from the ASF dual-hosted git repository. aherbert pushed a commit to branch master in repository https://gitbox.apache.org/repos/asf/commons-numbers.git
commit ab1518882a283da1a3510a085193804d2ea0c6cc Author: Alex Herbert <[email protected]> AuthorDate: Thu Sep 17 09:51:03 2026 +0100 Checkstyle: Remove unnecessary parentheses --- .../src/main/java/org/apache/commons/numbers/complex/Complex.java | 2 +- .../src/main/java/org/apache/commons/numbers/core/DD.java | 6 +++--- .../main/java/org/apache/commons/numbers/fraction/BigFraction.java | 2 +- .../src/main/java/org/apache/commons/numbers/fraction/Fraction.java | 4 ++-- .../main/java/org/apache/commons/numbers/primes/SmallPrimes.java | 2 +- 5 files changed, 8 insertions(+), 8 deletions(-) diff --git a/commons-numbers-complex/src/main/java/org/apache/commons/numbers/complex/Complex.java b/commons-numbers-complex/src/main/java/org/apache/commons/numbers/complex/Complex.java index 52866030..5c7edbcc 100644 --- a/commons-numbers-complex/src/main/java/org/apache/commons/numbers/complex/Complex.java +++ b/commons-numbers-complex/src/main/java/org/apache/commons/numbers/complex/Complex.java @@ -3407,7 +3407,7 @@ public final class Complex implements Serializable { // Only interested in the maximum final long bits = Math.max(x, y); // Get the unbiased exponent - int exp = ((int) (bits >>> 52)) - EXPONENT_OFFSET; + int exp = (int) (bits >>> 52) - EXPONENT_OFFSET; // No case to distinguish nan/inf // Handle sub-normal numbers diff --git a/commons-numbers-core/src/main/java/org/apache/commons/numbers/core/DD.java b/commons-numbers-core/src/main/java/org/apache/commons/numbers/core/DD.java index b9df6afc..13f5f87c 100644 --- a/commons-numbers-core/src/main/java/org/apache/commons/numbers/core/DD.java +++ b/commons-numbers-core/src/main/java/org/apache/commons/numbers/core/DD.java @@ -1708,7 +1708,7 @@ public final class DD // Inf/NaN numbers have a biased exponent of 2047. // Catch both cases by extracting the raw exponent, subtracting 1 // and compare unsigned (so 0 underflows to a unsigned large value). - final int baisedExponent = ((int) (Double.doubleToRawLongBits(a) >>> 52)) & EXP_MASK; + final int baisedExponent = (int) (Double.doubleToRawLongBits(a) >>> 52) & EXP_MASK; // Pre-compute the additions used by Integer.compareUnsigned return baisedExponent + CMP_UNSIGNED_MINUS_1 >= CMP_UNSIGNED_2046; } @@ -1813,7 +1813,7 @@ public final class DD * @return the double */ static double twoPow(int n) { - return Double.longBitsToDouble(((long) (n + 1023)) << 52); + return Double.longBitsToDouble((long) (n + 1023) << 52); } /** @@ -1900,7 +1900,7 @@ public final class DD // Only interested in the exponent and mantissa so remove the sign bit final long bits = Double.doubleToRawLongBits(a) & UNSIGN_MASK; // Get the unbiased exponent - int exp = ((int) (bits >>> 52)) - EXPONENT_OFFSET; + int exp = (int) (bits >>> 52) - EXPONENT_OFFSET; // No case to distinguish nan/inf (exp == 1024). // Handle sub-normal numbers diff --git a/commons-numbers-fraction/src/main/java/org/apache/commons/numbers/fraction/BigFraction.java b/commons-numbers-fraction/src/main/java/org/apache/commons/numbers/fraction/BigFraction.java index d69c6bbc..22399578 100644 --- a/commons-numbers-fraction/src/main/java/org/apache/commons/numbers/fraction/BigFraction.java +++ b/commons-numbers-fraction/src/main/java/org/apache/commons/numbers/fraction/BigFraction.java @@ -285,7 +285,7 @@ public final class BigFraction } else { // Normalized number: Add the implicit most significant bit. m = mantissa | 0x0010000000000000L; - k = ((int) (exponent >> 52)) - 1075; // Exponent bias is 1023. + k = (int) (exponent >> 52) - 1075; // Exponent bias is 1023. } if (sign != 0) { m = -m; diff --git a/commons-numbers-fraction/src/main/java/org/apache/commons/numbers/fraction/Fraction.java b/commons-numbers-fraction/src/main/java/org/apache/commons/numbers/fraction/Fraction.java index 7044369b..48958da5 100644 --- a/commons-numbers-fraction/src/main/java/org/apache/commons/numbers/fraction/Fraction.java +++ b/commons-numbers-fraction/src/main/java/org/apache/commons/numbers/fraction/Fraction.java @@ -874,8 +874,8 @@ public final class Fraction } // Compare absolute magnitude. // Multiplication by the signum is equal to the absolute. - final long nOd = ((long) numerator) * lns * other.denominator * rds; - final long dOn = ((long) denominator) * lds * other.numerator * rns; + final long nOd = (long) numerator * lns * other.denominator * rds; + final long dOn = (long) denominator * lds * other.numerator * rns; return lhsSigNum > 0 ? Long.compare(nOd, dOn) : Long.compare(dOn, nOd); diff --git a/commons-numbers-primes/src/main/java/org/apache/commons/numbers/primes/SmallPrimes.java b/commons-numbers-primes/src/main/java/org/apache/commons/numbers/primes/SmallPrimes.java index de39a9cf..b74de541 100644 --- a/commons-numbers-primes/src/main/java/org/apache/commons/numbers/primes/SmallPrimes.java +++ b/commons-numbers-primes/src/main/java/org/apache/commons/numbers/primes/SmallPrimes.java @@ -262,7 +262,7 @@ final class SmallPrimes { if (y != 1 && y != nMinus1) { int j = 1; while (j <= s - 1 && y != nMinus1) { - final long square = ((long) y) * y; + final long square = (long) y * y; y = (int) (square % n); if (y == 1) { return false;
