commons-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From l..@apache.org
Subject svn commit: r1554649 - in /commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry: euclidean/threed/OutlineExtractor.java euclidean/twod/PolygonsSet.java euclidean/twod/Segment.java partitioning/BSPTree.java
Date Wed, 01 Jan 2014 17:26:10 GMT
Author: luc
Date: Wed Jan  1 17:26:10 2014
New Revision: 1554649

URL: http://svn.apache.org/r1554649
Log:
Javadoc typos.

Modified:
    commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/threed/OutlineExtractor.java
    commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/PolygonsSet.java
    commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/Segment.java
    commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/partitioning/BSPTree.java

Modified: commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/threed/OutlineExtractor.java
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/threed/OutlineExtractor.java?rev=1554649&r1=1554648&r2=1554649&view=diff
==============================================================================
--- commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/threed/OutlineExtractor.java
(original)
+++ commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/threed/OutlineExtractor.java
Wed Jan  1 17:26:10 2014
@@ -96,13 +96,13 @@ public class OutlineExtractor {
 
     }
 
-    /** Check if a point is geometrically between its neighbour in an array.
-     * <p>The neighbours are computed considering the array is a loop
+    /** Check if a point is geometrically between its neighbor in an array.
+     * <p>The neighbors are computed considering the array is a loop
      * (i.e. point at index (n-1) is before point at index 0)</p>
      * @param loop points array
      * @param n number of points to consider in the array
      * @param i index of the point to check (must be between 0 and n-1)
-     * @return true if the point is exactly between its neighbours
+     * @return true if the point is exactly between its neighbors
      */
     private boolean pointIsBetween(final Vector2D[] loop, final int n, final int i) {
         final Vector2D previous = loop[(i + n - 1) % n];

Modified: commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/PolygonsSet.java
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/PolygonsSet.java?rev=1554649&r1=1554648&r2=1554649&view=diff
==============================================================================
--- commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/PolygonsSet.java
(original)
+++ commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/PolygonsSet.java
Wed Jan  1 17:26:10 2014
@@ -71,13 +71,13 @@ public class PolygonsSet extends Abstrac
      * its plus side.</p>
      * <p>The boundary elements can be in any order, and can form
      * several non-connected sets (like for example polygons with holes
-     * or a set of disjoint polyhedrons considered as a whole). In
+     * or a set of disjoint polygons considered as a whole). In
      * fact, the elements do not even need to be connected together
      * (their topological connections are not used here). However, if the
      * boundary does not really separate an inside open from an outside
      * open (open having here its topological meaning), then subsequent
      * calls to the {@link
-     * org.apache.commons.math3.geometry.partitioning.Region#checkPoint(org.apache.commons.math3.geometry.Vector)
+     * org.apache.commons.math3.geometry.partitioning.Region#checkPoint(org.apache.commons.math3.geometry.Point)
      * checkPoint} method will not be meaningful anymore.</p>
      * <p>If the boundary is empty, the region will represent the whole
      * space.</p>
@@ -262,7 +262,7 @@ public class PolygonsSet extends Abstrac
             return;
         }
 
-        // we have split the node by inserted an edge as a cut sub-hyperplane
+        // we have split the node by inserting an edge as a cut sub-hyperplane
         // distribute the remaining edges in the two sub-trees
         final List<Edge> plusList  = new ArrayList<Edge>();
         final List<Edge> minusList = new ArrayList<Edge>();
@@ -616,7 +616,7 @@ public class PolygonsSet extends Abstrac
                     }
                 }
 
-                // tranform the loops in an array of arrays of points
+                // transform the loops in an array of arrays of points
                 vertices = new Vector2D[loops.size()][];
                 int i = 0;
 
@@ -830,7 +830,7 @@ public class PolygonsSet extends Abstrac
         public void visitLeafNode(final BSPTree<Euclidean2D> node) {
         }
 
-        /** Add he contribution of a boundary facet.
+        /** Add the contribution of a boundary facet.
          * @param sub boundary facet
          * @param reversed if true, the facet has the inside on its plus side
          */

Modified: commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/Segment.java
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/Segment.java?rev=1554649&r1=1554648&r2=1554649&view=diff
==============================================================================
--- commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/Segment.java
(original)
+++ commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/euclidean/twod/Segment.java
Wed Jan  1 17:26:10 2014
@@ -27,7 +27,7 @@ public class Segment {
     /** Start point of the segment. */
     private final Vector2D start;
 
-    /** End point of the segments. */
+    /** End point of the segment. */
     private final Vector2D end;
 
     /** Line containing the segment. */

Modified: commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/partitioning/BSPTree.java
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/partitioning/BSPTree.java?rev=1554649&r1=1554648&r2=1554649&view=diff
==============================================================================
--- commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/partitioning/BSPTree.java
(original)
+++ commons/proper/math/trunk/src/main/java/org/apache/commons/math3/geometry/partitioning/BSPTree.java
Wed Jan  1 17:26:10 2014
@@ -102,7 +102,7 @@ public class BSPTree<S extends Space> {
      * <p>This method does <em>not</em> perform any verification on
      * consistency of its arguments, it should therefore be used only
      * when then caller knows what it is doing.</p>
-     * <p>This method is mainly useful kto build trees
+     * <p>This method is mainly useful to build trees
      * bottom-up. Building trees top-down is realized with the help of
      * method {@link #insertCut insertCut}.</p>
      * @param cut cut sub-hyperplane for the tree
@@ -170,7 +170,7 @@ public class BSPTree<S extends Space> {
     }
 
     /** Copy the instance.
-     * <p>The instance created is completely independant of the original
+     * <p>The instance created is completely independent of the original
      * one. A deep copy is used, none of the underlying objects are
      * shared (except for the nodes attributes and immutable
      * objects).</p>
@@ -330,7 +330,7 @@ public class BSPTree<S extends Space> {
 
     /** Perform condensation on a tree.
      * <p>The condensation operation is not recursive, it must be called
-     * explicitely from leaves to root.</p>
+     * explicitly from leaves to root.</p>
      */
     private void condense() {
         if ((cut != null) && (plus.cut == null) && (minus.cut == null) &&



Mime
View raw message