You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by ah...@apache.org on 2019/11/09 08:49:36 UTC
[commons-numbers] 02/02: Use final.
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 3be23775678979d05cf5dc9b94e143af0f12c8f8
Author: Alex Herbert <ah...@apache.org>
AuthorDate: Sat Nov 9 08:49:30 2019 +0000
Use final.
---
.../org/apache/commons/numbers/combinatorics/FactorialDouble.java | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/commons-numbers-combinatorics/src/main/java/org/apache/commons/numbers/combinatorics/FactorialDouble.java b/commons-numbers-combinatorics/src/main/java/org/apache/commons/numbers/combinatorics/FactorialDouble.java
index 154be52..32cd5d1 100644
--- a/commons-numbers-combinatorics/src/main/java/org/apache/commons/numbers/combinatorics/FactorialDouble.java
+++ b/commons-numbers-combinatorics/src/main/java/org/apache/commons/numbers/combinatorics/FactorialDouble.java
@@ -48,8 +48,8 @@ public final class FactorialDouble {
factorialsDouble = new double[numValues];
// Initialize first two entries.
- for (int i = 0, max = numValues < 2 ? numValues : 2;
- i < max; i++) {
+ final int max = numValues < 2 ? numValues : 2;
+ for (int i = 0; i < max; i++) {
factorialsDouble[i] = 1;
}