Normalize to US English spelling.
diff --git a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/sampling/distribution/PoissonSamplersPerformance.java b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/sampling/distribution/PoissonSamplersPerformance.java
index 1aa2394..d687181 100644
--- a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/sampling/distribution/PoissonSamplersPerformance.java
+++ b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/sampling/distribution/PoissonSamplersPerformance.java
@@ -796,7 +796,7 @@
cumulativeProbability[0] = probabilityX;
guideTable = new int[cumulativeProbability.length + 1];
- initialiseGuideTable(probabilityX);
+ initializeGuideTable(probabilityX);
} else {
// This will catch NaN mean values
throw new IllegalArgumentException("No probability for mean " + mean);
@@ -809,7 +809,7 @@
*
* @param p0 the probability for x=0
*/
- private void initialiseGuideTable(double p0) {
+ private void initializeGuideTable(double p0) {
for (int index = getGuideTableIndex(p0); index >= 0; index--) {
guideTable[index] = 1;
}
diff --git a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/simple/ConstructionPerformance.java b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/simple/ConstructionPerformance.java
index 0cf8df5..565fe39 100644
--- a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/simple/ConstructionPerformance.java
+++ b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/simple/ConstructionPerformance.java
@@ -143,7 +143,7 @@
}
/**
- * Default constructor to initialise state.
+ * Default constructor to initialize state.
*/
public ConstructionPerformance() {
values = new Object[SEEDS];
diff --git a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/LargeMeanPoissonSampler.java b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/LargeMeanPoissonSampler.java
index d2ea63c..d568820 100644
--- a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/LargeMeanPoissonSampler.java
+++ b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/LargeMeanPoissonSampler.java
@@ -182,7 +182,7 @@
// Plain constructor uses the uncached function.
factorialLog = NO_CACHE_FACTORIAL_LOG;
- // Use the state to initialise the algorithm
+ // Use the state to initialize the algorithm
lambda = state.getLambdaRaw();
logLambda = state.getLogLambda();
logLambdaFactorial = state.getLogLambdaFactorial();
diff --git a/commons-rng-sampling/src/test/java/org/apache/commons/rng/sampling/CombinationSamplerTest.java b/commons-rng-sampling/src/test/java/org/apache/commons/rng/sampling/CombinationSamplerTest.java
index 928ff1b..1e5a27e 100644
--- a/commons-rng-sampling/src/test/java/org/apache/commons/rng/sampling/CombinationSamplerTest.java
+++ b/commons-rng-sampling/src/test/java/org/apache/commons/rng/sampling/CombinationSamplerTest.java
@@ -162,7 +162,7 @@
// otherwise they are negative.
final int totalBitCombinations = 1 << n;
int[] codeLookup = new int[totalBitCombinations];
- Arrays.fill(codeLookup, -1); // initialise as negative
+ Arrays.fill(codeLookup, -1); // initialize as negative
int codes = 0;
for (int i = 0; i < totalBitCombinations; i++) {
if (Integer.bitCount(i) == k) {
