commons-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From l..@apache.org
Subject svn commit: r1558150 - /commons/proper/math/trunk/src/test/java/org/apache/commons/math3/geometry/spherical/twod/SphericalPolygonsSetTest.java
Date Tue, 14 Jan 2014 18:27:03 GMT
Author: luc
Date: Tue Jan 14 18:27:02 2014
New Revision: 1558150

URL: http://svn.apache.org/r1558150
Log:
Removed development bits.

Modified:
    commons/proper/math/trunk/src/test/java/org/apache/commons/math3/geometry/spherical/twod/SphericalPolygonsSetTest.java

Modified: commons/proper/math/trunk/src/test/java/org/apache/commons/math3/geometry/spherical/twod/SphericalPolygonsSetTest.java
URL: http://svn.apache.org/viewvc/commons/proper/math/trunk/src/test/java/org/apache/commons/math3/geometry/spherical/twod/SphericalPolygonsSetTest.java?rev=1558150&r1=1558149&r2=1558150&view=diff
==============================================================================
--- commons/proper/math/trunk/src/test/java/org/apache/commons/math3/geometry/spherical/twod/SphericalPolygonsSetTest.java
(original)
+++ commons/proper/math/trunk/src/test/java/org/apache/commons/math3/geometry/spherical/twod/SphericalPolygonsSetTest.java
Tue Jan 14 18:27:02 2014
@@ -387,93 +387,4 @@ public class SphericalPolygonsSetTest {
         return new SubCircle(phased, set);
     }
 
-//    private static void displayCells(String name, SphericalPolygonsSet polygons, double
maxStep, double grid) {
-//        TesselationDisplay td = new TesselationDisplay(name, maxStep, grid, polygons.getTolerance());
-//        polygons.getTree(false).visit(td);
-//        td.close();
-//    }
-//
-//    private static class TesselationDisplay implements BSPTreeVisitor<Sphere2D> {
-//        private double maxStep;
-//        private double grid;
-//        private double tolerance;
-//        private PrintStream out;
-//        public TesselationDisplay(String name, double maxStep, double grid, double tolerance)
{
-//            try {
-//            this.out = new PrintStream(new File(new File(System.getProperty("user.home")),
name));
-//            this.maxStep   = maxStep;
-//            this.grid      = grid;
-//            this.tolerance = tolerance;
-//            } catch (IOException ioe) {
-//                Assert.fail(ioe.getMessage());
-//            }
-//        }
-//        public Order visitOrder(BSPTree<Sphere2D> node) {
-//            return Order.MINUS_PLUS_SUB;
-//        }
-//        public void visitInternalNode(BSPTree<Sphere2D> node) {
-//        }
-//        public void visitLeafNode(BSPTree<Sphere2D> node) {
-//            if ((Boolean) node.getAttribute()) {
-//                final SphericalPolygonsSet cell =
-//                        new SphericalPolygonsSet(node.pruneAroundConvexCell(true, false,
null), tolerance);
-//                display(out, cell, maxStep, grid);
-//            }
-//        }
-//        public void close() {
-//            out.close();
-//        }
-//    }
-//
-//    private static void display(String name, SphericalPolygonsSet polygons, double maxStep,
double grid) {
-//        PrintStream out = null;
-//        try {
-//            out = new PrintStream(new File(new File(System.getProperty("user.home")), name));
-//            display(out, polygons, maxStep, grid);
-//        } catch (IOException ioe) {
-//            Assert.fail(ioe.getMessage());
-//        } finally {
-//            if (out != null) {
-//                out.close();
-//            }
-//        }
-//    }
-//
-//    private static void display(PrintStream out, SphericalPolygonsSet polygons, double
maxStep, double grid) {
-//            for (final SphericalPolygonsSet.Vertex start : polygons.getBoundaryLoops())
{
-//                int n = 0;
-//                for (SphericalPolygonsSet.Edge edge = start.getOutgoing();
-//                     n == 0 || edge.getStart() != start;
-//                     edge = edge.getEnd().getOutgoing()) {
-//                    int m = (int) FastMath.ceil(edge.getLength() / maxStep);
-//                    double step = edge.getLength() / m;
-//                    for (int i = 0; i <= m; ++i) {
-//                       final Vector3D p = edge.getPointAt(i * step);
-//                       out.format(Locale.US, "%9.6f %9.6f %9.6f%n", p.getX(), p.getY(),
p.getZ());
-//                    }
-//                    n++;
-//                }
-//                out.println("&");
-//            }
-//            if (grid > 0) {
-//                for (double phi = grid; phi < FastMath.PI - grid; phi += grid) {
-//                    Location previous = Location.OUTSIDE;
-//                    for (double theta = 0; theta < MathUtils.TWO_PI; theta += grid)
{
-//                        S2Point point = new S2Point(theta, phi);
-//                        Location current = polygons.checkPoint(point);
-//                        if (current == Location.OUTSIDE) {
-//                            if (previous != Location.OUTSIDE) {
-//                                out.println("&");
-//                            }
-//                        } else {
-//                            out.format(Locale.US, "%9.6f %9.6f %9.6f%n",
-//                                       point.getVector().getX(), point.getVector().getY(),
point.getVector().getZ());
-//                        }
-//                        previous = current;
-//                    }
-//                    out.println("&");
-//                }
-//            }
-//    }
-
 }



Mime
View raw message