This is an automated email from the ASF dual-hosted git repository. mattjuntunen pushed a commit to branch master in repository https://gitbox.apache.org/repos/asf/commons-geometry.git
commit f53807a4fac975516b368c4c3626544651928adc Author: XenoAmess <[email protected]> AuthorDate: Sat Jul 4 00:58:06 2020 +0800 fix typos. --- .../geometry/core/partitioning/HyperplaneSubset.java | 2 +- .../bsp/AbstractRegionBSPTreeBooleanTest.java | 16 ++++++++-------- .../core/partitioning/bsp/AbstractRegionBSPTreeTest.java | 8 ++++---- .../core/partitioning/test/PartitionTestUtils.java | 2 +- .../geometry/core/partitioning/test/TestLineSegment.java | 2 +- .../commons/geometry/euclidean/internal/Vectors.java | 2 +- .../commons/geometry/euclidean/oned/RegionBSPTree1D.java | 4 ++-- .../apache/commons/geometry/euclidean/threed/Planes.java | 2 +- .../geometry/euclidean/threed/SphericalCoordinates.java | 2 +- .../euclidean/threed/rotation/AxisAngleSequence.java | 4 ++-- .../twod/path/InteriorAngleLinePathConnectorTest.java | 4 ++-- .../commons/geometry/spherical/oned/RegionBSPTree1S.java | 4 ++-- .../commons/geometry/spherical/SphericalTestUtils.java | 2 +- 13 files changed, 27 insertions(+), 27 deletions(-) diff --git a/commons-geometry-core/src/main/java/org/apache/commons/geometry/core/partitioning/HyperplaneSubset.java b/commons-geometry-core/src/main/java/org/apache/commons/geometry/core/partitioning/HyperplaneSubset.java index e6ce14b..f77cd6d 100644 --- a/commons-geometry-core/src/main/java/org/apache/commons/geometry/core/partitioning/HyperplaneSubset.java +++ b/commons-geometry-core/src/main/java/org/apache/commons/geometry/core/partitioning/HyperplaneSubset.java @@ -26,7 +26,7 @@ import org.apache.commons.geometry.core.Transform; /** Interface representing a subset of the points lying in a hyperplane. Examples include * rays and line segments in Euclidean 2D space and triangular facets in Euclidean 3D space. * Hyperplane subsets can have finite or infinite size and can represent contiguous regions - * of the hyperplane (as in the examples aboves); multiple, disjoint regions; or the + * of the hyperplane (as in the examples above); multiple, disjoint regions; or the * {@link Hyperplane#span() entire hyperplane}. * * <p>This interface is very similar to the {@link org.apache.commons.geometry.core.Region Region} diff --git a/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/bsp/AbstractRegionBSPTreeBooleanTest.java b/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/bsp/AbstractRegionBSPTreeBooleanTest.java index 266cb11..7f438ab 100644 --- a/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/bsp/AbstractRegionBSPTreeBooleanTest.java +++ b/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/bsp/AbstractRegionBSPTreeBooleanTest.java @@ -143,7 +143,7 @@ public class AbstractRegionBSPTreeBooleanTest { return box; }; - final Supplier<TestRegionBSPTree> horizonalFactory = () -> { + final Supplier<TestRegionBSPTree> horizontalFactory = () -> { final TestRegionBSPTree horizontal = fullTree(); horizontal.getRoot().insertCut(new TestLine(new TestPoint2D(2, 2), new TestPoint2D(0, 2))); @@ -151,7 +151,7 @@ public class AbstractRegionBSPTreeBooleanTest { }; // act/assert - unionChecker(horizonalFactory, boxFactory) + unionChecker(horizontalFactory, boxFactory) .count(3) .inside(TestPoint2D.ZERO, new TestPoint2D(1, 1), new TestPoint2D(1, -1)) .outside(new TestPoint2D(0, 3), new TestPoint2D(3, 3)) @@ -268,7 +268,7 @@ public class AbstractRegionBSPTreeBooleanTest { return box; }; - final Supplier<TestRegionBSPTree> horizonalFactory = () -> { + final Supplier<TestRegionBSPTree> horizontalFactory = () -> { final TestRegionBSPTree horizontal = fullTree(); horizontal.getRoot().insertCut(new TestLine(new TestPoint2D(2, -2), new TestPoint2D(0, -2))); @@ -276,7 +276,7 @@ public class AbstractRegionBSPTreeBooleanTest { }; // act/assert - intersectionChecker(horizonalFactory, boxFactory) + intersectionChecker(horizontalFactory, boxFactory) .inside(new TestPoint2D(1, -3)) .outside(new TestPoint2D(1, -1), new TestPoint2D(-1, -3), new TestPoint2D(1, -5), new TestPoint2D(3, -3)) @@ -395,7 +395,7 @@ public class AbstractRegionBSPTreeBooleanTest { return box; }; - final Supplier<TestRegionBSPTree> horizonalFactory = () -> { + final Supplier<TestRegionBSPTree> horizontalFactory = () -> { final TestRegionBSPTree horizontal = fullTree(); horizontal.getRoot().insertCut(new TestLine(new TestPoint2D(2, -2), new TestPoint2D(0, -2))); @@ -403,7 +403,7 @@ public class AbstractRegionBSPTreeBooleanTest { }; // act/assert - differenceChecker(horizonalFactory, boxFactory) + differenceChecker(horizontalFactory, boxFactory) .inside(new TestPoint2D(-1, -3), new TestPoint2D(-1, -5), new TestPoint2D(1, -5), new TestPoint2D(3, -5), new TestPoint2D(4, -3)) @@ -529,7 +529,7 @@ public class AbstractRegionBSPTreeBooleanTest { return box; }; - final Supplier<TestRegionBSPTree> horizonalFactory = () -> { + final Supplier<TestRegionBSPTree> horizontalFactory = () -> { final TestRegionBSPTree horizontal = fullTree(); horizontal.getRoot().insertCut(new TestLine(new TestPoint2D(2, -2), new TestPoint2D(0, -2))); @@ -537,7 +537,7 @@ public class AbstractRegionBSPTreeBooleanTest { }; // act/assert - xorChecker(horizonalFactory, boxFactory) + xorChecker(horizontalFactory, boxFactory) .inside(new TestPoint2D(-1, -3), new TestPoint2D(-1, -5), new TestPoint2D(1, -5), new TestPoint2D(3, -5), new TestPoint2D(4, -3), new TestPoint2D(1, -1)) diff --git a/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/bsp/AbstractRegionBSPTreeTest.java b/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/bsp/AbstractRegionBSPTreeTest.java index 05c3b37..57305fd 100644 --- a/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/bsp/AbstractRegionBSPTreeTest.java +++ b/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/bsp/AbstractRegionBSPTreeTest.java @@ -747,7 +747,7 @@ public class AbstractRegionBSPTreeTest { } @Test - public void tetsGetCutBoundary_singleCut() { + public void testGetCutBoundary_singleCut() { // arrange tree.insert(new TestLineSegment(new TestPoint2D(0, 0), new TestPoint2D(1, 0))); @@ -762,7 +762,7 @@ public class AbstractRegionBSPTreeTest { } @Test - public void tetsGetCutBoundary_singleCut_leafNode() { + public void testGetCutBoundary_singleCut_leafNode() { // arrange tree.insert(new TestLineSegment(new TestPoint2D(0, 0), new TestPoint2D(1, 0))); @@ -774,7 +774,7 @@ public class AbstractRegionBSPTreeTest { } @Test - public void tetsGetCutBoundary_singleCorner() { + public void testGetCutBoundary_singleCorner() { // arrange tree.insert(new TestLineSegment(new TestPoint2D(-1, 0), new TestPoint2D(1, 0))); tree.insert(new TestLineSegment(TestPoint2D.ZERO, new TestPoint2D(0, 1))); @@ -793,7 +793,7 @@ public class AbstractRegionBSPTreeTest { } @Test - public void tetsGetCutBoundary_leafNode() { + public void testGetCutBoundary_leafNode() { // arrange tree.insert(new TestLineSegment(new TestPoint2D(-1, 0), new TestPoint2D(1, 0))); tree.insert(new TestLineSegment(TestPoint2D.ZERO, new TestPoint2D(0, 1))); diff --git a/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/test/PartitionTestUtils.java b/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/test/PartitionTestUtils.java index 7a3ef73..127ba59 100644 --- a/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/test/PartitionTestUtils.java +++ b/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/test/PartitionTestUtils.java @@ -52,7 +52,7 @@ public final class PartitionTestUtils { Assert.assertEquals(msg, expected.getY(), actual.getY(), EPS); } - /** Assert that two line segemtns are equal using the default test epsilon. + /** Assert that two line segments are equal using the default test epsilon. * @param expected * @param actual */ diff --git a/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/test/TestLineSegment.java b/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/test/TestLineSegment.java index 19cd081..965bf39 100644 --- a/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/test/TestLineSegment.java +++ b/commons-geometry-core/src/test/java/org/apache/commons/geometry/core/partitioning/test/TestLineSegment.java @@ -65,7 +65,7 @@ public class TestLineSegment implements HyperplaneConvexSubset<TestPoint2D> { /** Construct a line segment based on an existing line. * @param start abscissa of the line segment start point * @param end abscissa of the line segment end point - * @param line the underyling line + * @param line the underlying line */ public TestLineSegment(final double start, final double end, final TestLine line) { this.start = Math.min(start, end); diff --git a/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/internal/Vectors.java b/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/internal/Vectors.java index 44589a0..4f33535 100644 --- a/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/internal/Vectors.java +++ b/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/internal/Vectors.java @@ -26,7 +26,7 @@ public final class Vectors { /** Private constructor. */ private Vectors() {} - /** Returns true if the given value is real (ie, not NaN or inifinite) + /** Returns true if the given value is real (ie, not NaN or infinite) * and not equal to zero. * @param value the value to test * @return true if {@code value} is not NaN, infinite, or zero; otherwise diff --git a/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/oned/RegionBSPTree1D.java b/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/oned/RegionBSPTree1D.java index 4726f0d..917b977 100644 --- a/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/oned/RegionBSPTree1D.java +++ b/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/oned/RegionBSPTree1D.java @@ -438,9 +438,9 @@ public final class RegionBSPTree1D extends AbstractRegionBSPTree<Vector1D, Regio return max; } - /** Get the minumum value of the interval or {@link Double#NEGATIVE_INFINITY} + /** Get the minimum value of the interval or {@link Double#NEGATIVE_INFINITY} * if no minimum value exists. - * @return the minumum value of the interval or {@link Double#NEGATIVE_INFINITY} + * @return the minimum value of the interval or {@link Double#NEGATIVE_INFINITY} * if no minimum value exists. */ public double getMinValue() { diff --git a/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/threed/Planes.java b/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/threed/Planes.java index 9b5007a..dfde9e3 100644 --- a/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/threed/Planes.java +++ b/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/threed/Planes.java @@ -621,7 +621,7 @@ public final class Planes { /** The previous point from the point sequence. */ private Vector3D prevPt; - /** The previous vector from the point sequence, preceeding from the {@code startPt} to {@code prevPt}. */ + /** The previous vector from the point sequence, preceding from the {@code startPt} to {@code prevPt}. */ private Vector3D prevVector; /** The computed {@code normal} vector for the plane. */ diff --git a/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/threed/SphericalCoordinates.java b/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/threed/SphericalCoordinates.java index 0c7dc21..cdab529 100644 --- a/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/threed/SphericalCoordinates.java +++ b/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/threed/SphericalCoordinates.java @@ -282,7 +282,7 @@ public final class SphericalCoordinates implements Spatial { * For example, a polar angle of {@code -pi/2} and one of {@code +pi/2} will both * normalize to {@code pi/2}. * @param polar polar value in radians - * @return equalivalent polar value in the range {@code [0, +pi]} + * @return equivalent polar value in the range {@code [0, +pi]} */ public static double normalizePolar(double polar) { // normalize the polar angle; this is the angle between the polar vector and the point ray diff --git a/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/threed/rotation/AxisAngleSequence.java b/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/threed/rotation/AxisAngleSequence.java index f108ec0..1f42ee7 100644 --- a/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/threed/rotation/AxisAngleSequence.java +++ b/commons-geometry-euclidean/src/main/java/org/apache/commons/geometry/euclidean/threed/rotation/AxisAngleSequence.java @@ -121,8 +121,8 @@ public final class AxisAngleSequence { return angle2; } - /** Get the angle of rotation around the thrid axis, in radians. - * @return angle of rotation around the thrid axis, in radians + /** Get the angle of rotation around the third axis, in radians. + * @return angle of rotation around the third axis, in radians */ public double getAngle3() { return angle3; diff --git a/commons-geometry-euclidean/src/test/java/org/apache/commons/geometry/euclidean/twod/path/InteriorAngleLinePathConnectorTest.java b/commons-geometry-euclidean/src/test/java/org/apache/commons/geometry/euclidean/twod/path/InteriorAngleLinePathConnectorTest.java index edf06cb..4611172 100644 --- a/commons-geometry-euclidean/src/test/java/org/apache/commons/geometry/euclidean/twod/path/InteriorAngleLinePathConnectorTest.java +++ b/commons-geometry-euclidean/src/test/java/org/apache/commons/geometry/euclidean/twod/path/InteriorAngleLinePathConnectorTest.java @@ -168,7 +168,7 @@ public class InteriorAngleLinePathConnectorTest { } @Test - public void testConnectAll_mutipleSegmentsAtVertex_maximize() { + public void testConnectAll_multipleSegmentsAtVertex_maximize() { // arrange final Maximize connector = new Maximize(); @@ -217,7 +217,7 @@ public class InteriorAngleLinePathConnectorTest { } @Test - public void testConnectAll_mutipleSegmentsAtVertex_minimize() { + public void testConnectAll_multipleSegmentsAtVertex_minimize() { // arrange final Minimize connector = new Minimize(); diff --git a/commons-geometry-spherical/src/main/java/org/apache/commons/geometry/spherical/oned/RegionBSPTree1S.java b/commons-geometry-spherical/src/main/java/org/apache/commons/geometry/spherical/oned/RegionBSPTree1S.java index bb1a290..a976dce 100644 --- a/commons-geometry-spherical/src/main/java/org/apache/commons/geometry/spherical/oned/RegionBSPTree1S.java +++ b/commons-geometry-spherical/src/main/java/org/apache/commons/geometry/spherical/oned/RegionBSPTree1S.java @@ -466,8 +466,8 @@ public class RegionBSPTree1S extends AbstractRegionBSPTree<Point1S, RegionBSPTre return max; } - /** Get the minumum value of the interval or zero if no minimum value exists. - * @return the minumum value of the interval or zero + /** Get the minimum value of the interval or zero if no minimum value exists. + * @return the minimum value of the interval or zero * if no minimum value exists. */ public double getMinValue() { diff --git a/commons-geometry-spherical/src/test/java/org/apache/commons/geometry/spherical/SphericalTestUtils.java b/commons-geometry-spherical/src/test/java/org/apache/commons/geometry/spherical/SphericalTestUtils.java index 04a541c..04fe724 100644 --- a/commons-geometry-spherical/src/test/java/org/apache/commons/geometry/spherical/SphericalTestUtils.java +++ b/commons-geometry-spherical/src/test/java/org/apache/commons/geometry/spherical/SphericalTestUtils.java @@ -52,7 +52,7 @@ public final class SphericalTestUtils { Assert.assertEquals(msg, expected.getPolar(), actual.getPolar(), tolerance); } - /** Assert that the given points are equalivalent, using the specified tolerance value. + /** Assert that the given points are equivalent, using the specified tolerance value. * @param expected * @param actual * @param tolerance
