/*
 * The JTS Topology Suite is a collection of Java classes that
 * implement the fundamental operations required to validate a given
 * geo-spatial data set to a known topological specification.
 *
 * Copyright (C) 2001 Vivid Solutions
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library 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
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 * For more information, contact:
 *
 *     Vivid Solutions
 *     Suite #1A
 *     2328 Government Street
 *     Victoria BC  V8T 5G5
 *     Canada
 *
 *     (250)385-6040
 *     www.vividsolutions.com
 */

package com.revolsys.geometry.test.old.algorithm;

import com.revolsys.geometry.algorithm.NonRobustLineIntersector;

import junit.framework.TestCase;

/**
 * @version 1.7
 */
public class NonRobustLineIntersectorTest extends TestCase {

  public static void main(final String[] args) {
    final String[] testCaseName = {
      NonRobustLineIntersectorTest.class.getName()
    };
    junit.textui.TestRunner.main(testCaseName);
  }// public static void main(String[] args)

  private final NonRobustLineIntersector li = new NonRobustLineIntersector();

  public NonRobustLineIntersectorTest(final String Name_) {
    super(Name_);
  }// public NonRobustLineIntersectorTest(String Name_)

  public void testGetIntersectionNum() {
    // MD: NonRobustLineIntersector may have different semantics for
    // getIntersectionNumber
    // li.computeIntersection(new BaseLasPoint((double)220, 0), new
    // PointDouble((double)110, 0),
    // new BaseLasPoint((double)0, 0), new PointDouble((double)110, 0));
    // assertEquals(1, li.getIntersectionNum());
  }

  public void testNegativeZero() {
    // MD suggests we ignore this issue for now.
    // li.computeIntersection(new BaseLasPoint((double)220, 260), new
    // PointDouble((double)220, 0),
    // new BaseLasPoint((double)220, 0), new PointDouble((double)100, 0));
    // assertEquals((new BaseLasPoint((double)220, 0)).toString(),
    // li.getIntersection(0).toString());
  }

}// public class NonRobustLineIntersectorTest extends TestCase