MEDCoupling API renaming - stage #2

[tools/medcoupling.git] / src / INTERP_KERNELTest / QuadraticPlanarInterpTest.hxx

diff --git a/src/INTERP_KERNELTest/QuadraticPlanarInterpTest.hxx b/src/INTERP_KERNELTest/QuadraticPlanarInterpTest.hxx
index da60159a8372a8c219ce9d9be44d1da64e12e119..991e47b281b8d0864b3d236d2ffe7e4d1a369351 100644 (file)
--- a/src/INTERP_KERNELTest/QuadraticPlanarInterpTest.hxx
+++ b/src/INTERP_KERNELTest/QuadraticPlanarInterpTest.hxx
@@ -1,33 +1,35 @@
-//  Copyright (C) 2007-2008  CEA/DEN, EDF R&D
+// Copyright (C) 2007-2015  CEA/DEN, EDF R&D
 //
-//  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.
+// 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.
+// 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
+// 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
 //
-//  See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
+// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
 //
+// Author : Anthony Geay (CEA/DEN)
+
 #ifndef _QUADRATICPLANARINTERPTEST_HXX_
 #define _QUADRATICPLANARINTERPTEST_HXX_
 
 #include <cppunit/extensions/HelperMacros.h>
 
-namespace INTERP_KERNEL
-{
-  class Node;
-  class EdgeArcCircle;
-  class QuadraticPolygon;
+#include "InterpKernelTestExport.hxx"
+#include "InterpKernelGeo2DEdgeArcCircle.hxx"
+#include "InterpKernelGeo2DQuadraticPolygon.hxx"
 
-  class QuadraticPlanarInterpTest : public CppUnit::TestFixture
+namespace INTERP_TEST
+{
+  class INTERPKERNELTEST_EXPORT QuadraticPlanarInterpTest : public CppUnit::TestFixture
   {
     CPPUNIT_TEST_SUITE( QuadraticPlanarInterpTest );
     CPPUNIT_TEST( ReadWriteInXfigElementary );
@@ -103,6 +105,11 @@ namespace INTERP_KERNEL
     CPPUNIT_TEST ( checkNonRegressionOmar0030 );
     //
     CPPUNIT_TEST( checkNormalize );
+    CPPUNIT_TEST( checkMakePartitionAbs1 );
+    //
+    CPPUNIT_TEST( checkIsInOrOut );
+    CPPUNIT_TEST( checkGetMiddleOfPoints );
+    CPPUNIT_TEST( checkGetMiddleOfPointsOriented );
     CPPUNIT_TEST_SUITE_END();
   public:  
     void setUp();
@@ -190,11 +197,17 @@ namespace INTERP_KERNEL
     void checkNonRegressionOmar0030();
     //
     void checkNormalize();
+    void checkMakePartitionAbs1();
+    // From Adrien:
+    void checkIsInOrOut();
+    void checkGetMiddleOfPoints();
+    void checkGetMiddleOfPointsOriented();
+
   private:
-    QuadraticPolygon *buildQuadraticPolygonCoarseInfo(const double *coords, const int *conn, int lgth);
-    EdgeArcCircle *buildArcOfCircle(const double *center, double radius, double alphaStart, double alphaEnd);
-    double btw2NodesAndACenter(const Node& n1, const Node& n2, const double *center);
-    void checkBasicsOfPolygons(QuadraticPolygon& pol1, QuadraticPolygon& pol2, bool checkDirection);
+    INTERP_KERNEL::QuadraticPolygon *buildQuadraticPolygonCoarseInfo(const double *coords, const int *conn, int lgth);
+    INTERP_KERNEL::EdgeArcCircle *buildArcOfCircle(const double *center, double radius, double alphaStart, double alphaEnd);
+    double btw2NodesAndACenter(const INTERP_KERNEL::Node& n1, const INTERP_KERNEL::Node& n2, const double *center);
+    void checkBasicsOfPolygons(INTERP_KERNEL::QuadraticPolygon& pol1, INTERP_KERNEL::QuadraticPolygon& pol2, bool checkDirection);
   };
 }