[commons-math] 06/06: Fixed "CheckStyle" warnings.

[erans]

This is an automated email from the ASF dual-hosted git repository.

erans pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-math.git

commit 7b005845af41746e938b713b6fc8f45ff98a8e60
Author: Gilles Sadowski <gillese...@gmail.com>
AuthorDate: Tue Apr 7 19:18:11 2020 +0200

    Fixed "CheckStyle" warnings.
---
 .../integration/BaseAbstractUnivariateIntegrator.java        |  5 ++---
 .../commons/math4/analysis/polynomials/PolynomialsUtils.java | 12 ++++++------
 2 files changed, 8 insertions(+), 9 deletions(-)

diff --git 
a/src/main/java/org/apache/commons/math4/analysis/integration/BaseAbstractUnivariateIntegrator.java
 
b/src/main/java/org/apache/commons/math4/analysis/integration/BaseAbstractUnivariateIntegrator.java
index fadb1d0..e9a4cb2 100644
--- 
a/src/main/java/org/apache/commons/math4/analysis/integration/BaseAbstractUnivariateIntegrator.java
+++ 
b/src/main/java/org/apache/commons/math4/analysis/integration/BaseAbstractUnivariateIntegrator.java
@@ -44,6 +44,8 @@ public abstract class BaseAbstractUnivariateIntegrator 
implements UnivariateInte
     /** Default maximal iteration count. */
     public static final int DEFAULT_MAX_ITERATIONS_COUNT = Integer.MAX_VALUE;
 
+    /** The iteration count. */
+    protected IntegerSequence.Incrementor iterations;
 
     /** Maximum absolute error. */
     private final double absoluteAccuracy;
@@ -56,9 +58,6 @@ public abstract class BaseAbstractUnivariateIntegrator 
implements UnivariateInte
     /** maximum number of iterations */
     private final int maximalIterationCount;
 
-    /** The iteration count. */
-    protected IntegerSequence.Incrementor iterations;
-
     /** The functions evaluation count. */
     private IntegerSequence.Incrementor evaluations;
 
diff --git 
a/src/main/java/org/apache/commons/math4/analysis/polynomials/PolynomialsUtils.java
 
b/src/main/java/org/apache/commons/math4/analysis/polynomials/PolynomialsUtils.java
index 2076ef7..69b2900 100644
--- 
a/src/main/java/org/apache/commons/math4/analysis/polynomials/PolynomialsUtils.java
+++ 
b/src/main/java/org/apache/commons/math4/analysis/polynomials/PolynomialsUtils.java
@@ -32,9 +32,9 @@ import org.apache.commons.math4.util.FastMath;
  */
 public class PolynomialsUtils {
     /** -1 */
-    private static final BigFraction BF__MINUS_ONE = BigFraction.of(-1);
+    private static final BigFraction BF_MINUS_ONE = BigFraction.of(-1);
     /** 2 */
-    private static final BigFraction BF__TWO = BigFraction.of(2);
+    private static final BigFraction BF_TWO = BigFraction.of(2);
 
     /** Coefficients for Chebyshev polynomials. */
     private static final List<BigFraction> CHEBYSHEV_COEFFICIENTS;
@@ -65,14 +65,14 @@ public class PolynomialsUtils {
         HERMITE_COEFFICIENTS = new ArrayList<>();
         HERMITE_COEFFICIENTS.add(BigFraction.ONE);
         HERMITE_COEFFICIENTS.add(BigFraction.ZERO);
-        HERMITE_COEFFICIENTS.add(BF__TWO);
+        HERMITE_COEFFICIENTS.add(BF_TWO);
 
         // initialize recurrence for Laguerre polynomials
         // L0(X) = 1, L1(X) = 1 - 1 * X
         LAGUERRE_COEFFICIENTS = new ArrayList<>();
         LAGUERRE_COEFFICIENTS.add(BigFraction.ONE);
         LAGUERRE_COEFFICIENTS.add(BigFraction.ONE);
-        LAGUERRE_COEFFICIENTS.add(BF__MINUS_ONE);
+        LAGUERRE_COEFFICIENTS.add(BF_MINUS_ONE);
 
         // initialize recurrence for Legendre polynomials
         // P0(X) = 1, P1(X) = 0 + 1 * X
@@ -110,7 +110,7 @@ public class PolynomialsUtils {
         return buildPolynomial(degree, CHEBYSHEV_COEFFICIENTS,
                 new RecurrenceCoefficientsGenerator() {
             /** Fixed recurrence coefficients. */
-            private final BigFraction[] coeffs = { BigFraction.ZERO, BF__TWO, 
BigFraction.ONE };
+            private final BigFraction[] coeffs = { BigFraction.ZERO, BF_TWO, 
BigFraction.ONE };
             /** {@inheritDoc} */
             @Override
             public BigFraction[] generate(int k) {
@@ -142,7 +142,7 @@ public class PolynomialsUtils {
             public BigFraction[] generate(int k) {
                 return new BigFraction[] {
                         BigFraction.ZERO,
-                        BF__TWO,
+                        BF_TWO,
                         BigFraction.of(2 * k)};
             }
         });