/ - Diff - | gvSIG desktop 1 - gvSIG

Revision 31988

+     *
      * Copyright (C) 2007-2008 Infrastructures and Transports Department
      * of the Valencian Government (CIT)
+     *
+     *
      * This program is free software; you can redistribute it and/or
      * modify it under the terms of the GNU General Public License
      * as published by the Free Software Foundation; either version 2
      * of the License, or (at your option) any later version.
+     *
+     *
      * This program is distributed in the hope that it will be useful,
      * but WITHOUT ANY WARRANTY; without even the implied warranty of
      * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
      * GNU General Public License for more details.
+     *
+     *
      * You should have received a copy of the GNU General Public License
      * along with this program; if not, write to the Free Software
      * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
      * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
      * MA  02110-1301, USA.
+     *
+     *
      */
     import java.awt.geom.PathIterator;
-...
         /**
          * Calculates the length of a polygon (perimeter) or a line.
+         *
+         *
          * @param vp
          * @param geom
          * @return
-...
     	 * multipolygon or multilyne. Each element of the array list is an array
     	 * (Double[][]) containing the X and Y coordinates for each polygon
     	 * part.</p>
+    	 *
+    	 *
     	 * <p>I think it wll be clearer with an example:
+    	 *
+    	 *
     	 * <pre>ArrayList parts = GeometryUtilities.getParts(geom);
     	 * // xs will contain all the X coordinates from the first polygon part
     	 * // xs will contain all the X coordinates from the first polygon part
     	 * Double[] xs = parts.get(0)[0];
     	 * // ys will contain all the Y coordinates from the first polygon part
     	 * Double[] ys = parts.get(0)[1];
+    	 *
+    	 *
     	 * ... do something with 'xs' and 'ys' ...
+    	 *
     	 * // xs will now contain all the X coordinates from the second polygon part
+    	 *
     	 * // xs will now contain all the X coordinates from the second polygon part
     	 * xs = parts.get(1)[0];
     	 * // ys will now contain all the Y coordinates from the second polygon part
     	 * ys = parts.get(1)[1];
-...
     	 * parts.get(3), etc... of course, we should check how many parts the polygon
     	 * really has.
     	 * </pre>
+    	 *
+    	 *
+    	 *
+    	 *
     	 * @param geometry
     	 * @return
     	 */
-...
             int numParts = 0;
             theIterator = geometry.getPathIterator(null, FConverter.FLATNESS); //, flatness);
             boolean isClosed = false;
             double firstX=0;
             double firstY=0;
             while (!theIterator.isDone()) {
                 theType = theIterator.currentSegment(theData);
                 switch (theType) {
                 case PathIterator.SEG_MOVETO:
                 		if (numParts==0){
                 			firstX=theData[0];
                 			firstY=theData[1];
                 			xs.add(new Double(theData[0]));
                 			ys.add(new Double(theData[1]));
                 		}else{
-...
                 				xs.clear();
                 				ys.clear();
+                			}
                 			firstX=theData[0];
                 			firstY=theData[1];
                 			xs.add(new Double(theData[0]));
                 			ys.add(new Double(theData[1]));
+                		}
-...
                 	isClosed=true;
                     xs.add(new Double(theData[0]));
                     ys.add(new Double(theData[1]));
                     xs.add(new Double(firstX));
                     ys.add(new Double(firstY));
                     Double[] x = (Double[]) xs.toArray(new Double[0]);
                     Double[] y = (Double[]) ys.toArray(new Double[0]);
                     parts.add(new Double[][] { x, y });
-...
     	/**
     	 * Returns the area of a polygon, whose coordinates are defined
     	 * in a geographic (latitude/longitude) CRS.
+    	 *
+    	 *
     	 * @param xs
     	 * @param ys
     	 * @return
-...
         	int currentType;
         	boolean closed = false;
         	long numPoints = 0;
     		while (! it.isDone()) {
     			currentType = it.currentSegment(newCoords);
-...
         /**
          * Creates a polyline 2D from an array of points
+         *
+         *
          * @param points
          * @return
          */
         public static IGeometry getPolyLine2D(FPoint2D[] points) {
         	if (points.length < 2)
         		return null;
         	// Creates the general path of the new polyline
         	GeneralPathX gPath = new GeneralPathX();
         	gPath.moveTo(points[0].getX(), points[0].getY());
         	for (int i = 1; i < points.length; i++) {
         		gPath.lineTo(points[i].getX(), points[i].getY());
+    		}
         	return ShapeFactory.createPolyline2D(gPath);
+        }
         /**
          * Creates a polygon 2D from an array of points.
+         *
+         *
          * @param points
          * @return
          */
         public static IGeometry getPolygon2D(FPoint2D[] points) {
         	if (points.length < 3)
         		return null;
         	// Creates the general path of the new polygon
         	GeneralPathX gPath = new GeneralPathX();
         	gPath.moveTo(points[0].getX(), points[0].getY());
         	for (int i = 1; i < points.length; i++) {
         		gPath.lineTo(points[i].getX(), points[i].getY());
+    		}
         	// Forces to close the polygon
         	gPath.closePath();

Also available in: Unified diff