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

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


The following commit(s) were added to refs/heads/master by this push:
     new ce58624  Standardize on American English spelling of 'behavior'.
ce58624 is described below

commit ce58624fb191aa25e40c93468459d86294044ba9
Author: Gary Gregory <garydgreg...@gmail.com>
AuthorDate: Mon Mar 30 15:17:02 2020 -0400

    Standardize on American English spelling of 'behavior'.
---
 .../src/main/java/org/apache/commons/numbers/complex/Complex.java     | 2 +-
 .../src/test/java/org/apache/commons/numbers/complex/ComplexTest.java | 4 ++--
 .../java/org/apache/commons/numbers/rootfinder/BrentSolverTest.java   | 2 +-
 src/main/resources/checkstyle/checkstyle.xml                          | 2 +-
 4 files changed, 5 insertions(+), 5 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 d2d3a7d..7cae634 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
@@ -30,7 +30,7 @@ import java.util.List;
  *
  * <p>Arithmetic in this class conforms to the C99 standard for complex numbers
  * defined in ISO/IEC 9899, Annex G. Methods have been named using the 
equivalent
- * method in ISO C99. The behaviour for special cases is listed as defined in 
C99.</p>
+ * method in ISO C99. The behaviorfor special cases is listed as defined in 
C99.</p>
  *
  * <p>For functions \( f \) which obey the conjugate equality \( conj(f(z)) = 
f(conj(z)) \),
  * the specifications for the upper half-plane imply the specifications for 
the lower
diff --git 
a/commons-numbers-complex/src/test/java/org/apache/commons/numbers/complex/ComplexTest.java
 
b/commons-numbers-complex/src/test/java/org/apache/commons/numbers/complex/ComplexTest.java
index a610943..57b1228 100644
--- 
a/commons-numbers-complex/src/test/java/org/apache/commons/numbers/complex/ComplexTest.java
+++ 
b/commons-numbers-complex/src/test/java/org/apache/commons/numbers/complex/ComplexTest.java
@@ -2058,7 +2058,7 @@ public class ComplexTest {
 
         // Each sample fails approximately 3% of the time if using a standard 
x^2+y^2 in sqrt()
         // and high accuracy representation in abs().
-        // Use 1000 samples to ensure the behaviour is OK.
+        // Use 1000 samples to ensure the behavior is OK.
         // Do not use data which will over/underflow so we can use a simple 
computation in the test
         assertAbsVsSqrt(1000, () -> 
Complex.ofCartesian(createFixedExponentNumber(rng, 1000),
                                                         
createFixedExponentNumber(rng, 1000)));
@@ -2119,7 +2119,7 @@ public class ComplexTest {
         // No test around |z| == 1 as a high accuracy computation is required: 
Math.log1p(x*x+y*y-1)
 
         // Each sample fails approximately 25% of the time if using a standard 
x^2+y^2 in log()
-        // and high accuracy representation in abs(). Use 100 samples to 
ensure the behaviour is OK.
+        // and high accuracy representation in abs(). Use 100 samples to 
ensure the behavior is OK.
         assertAbsVsLog(100, () -> 
Complex.ofCartesian(createFixedExponentNumber(rng, 1022),
                                                       
createFixedExponentNumber(rng, 1022)));
         assertAbsVsLog(100, () -> 
Complex.ofCartesian(createFixedExponentNumber(rng, -1022),
diff --git 
a/commons-numbers-rootfinder/src/test/java/org/apache/commons/numbers/rootfinder/BrentSolverTest.java
 
b/commons-numbers-rootfinder/src/test/java/org/apache/commons/numbers/rootfinder/BrentSolverTest.java
index c1d6b7e..ab2afb6 100644
--- 
a/commons-numbers-rootfinder/src/test/java/org/apache/commons/numbers/rootfinder/BrentSolverTest.java
+++ 
b/commons-numbers-rootfinder/src/test/java/org/apache/commons/numbers/rootfinder/BrentSolverTest.java
@@ -149,7 +149,7 @@ public class BrentSolverTest {
         double result;
         MonitoredFunction f;
 
-        // Very large bracket around 1 for testing fast growth behaviour.
+        // Very large bracket around 1 for testing fast growth behavior.
         f = new MonitoredFunction(func);
         result = solver.findRoot(f, 0.85, 5);
         Assertions.assertEquals(1.0, result, DEFAULT_ABSOLUTE_ACCURACY);
diff --git a/src/main/resources/checkstyle/checkstyle.xml 
b/src/main/resources/checkstyle/checkstyle.xml
index 3af3265..23d566a 100644
--- a/src/main/resources/checkstyle/checkstyle.xml
+++ b/src/main/resources/checkstyle/checkstyle.xml
@@ -22,7 +22,7 @@
           "https://checkstyle.org/dtds/configuration_1_3.dtd";>
 
 <!--
-  Commons Numbers customization of default Checkstyle behaviour:
+  Commons Numbers customization of default Checkstyle behavior:
   
https://github.com/checkstyle/checkstyle/blob/master/src/main/resources/sun_checks.xml
 -->
 <module name="Checker">

Reply via email to