X-Git-Url: http://git.salome-platform.org/gitweb/?a=blobdiff_plain;f=src%2FINTERP_KERNEL%2FGeometric2D%2FInterpKernelGeo2DAbstractEdge.hxx;h=952262ef3236cc46ad7df19710fff5920158621c;hb=aa4f88a9573230e4469301d334bba03356dab168;hp=b0c5b4e2bda615394c794089aec684fe20049c3d;hpb=293a6104470482e450701aa8061d9b244f2057d5;p=tools%2Fmedcoupling.git

diff --git a/src/INTERP_KERNEL/Geometric2D/InterpKernelGeo2DAbstractEdge.hxx b/src/INTERP_KERNEL/Geometric2D/InterpKernelGeo2DAbstractEdge.hxx
index b0c5b4e2b..952262ef3 100644
--- a/src/INTERP_KERNEL/Geometric2D/InterpKernelGeo2DAbstractEdge.hxx
+++ b/src/INTERP_KERNEL/Geometric2D/InterpKernelGeo2DAbstractEdge.hxx
@@ -1,9 +1,9 @@
-// Copyright (C) 2007-2012  CEA/DEN, EDF R&D
+// Copyright (C) 2007-2014  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.
+// 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
@@ -39,26 +39,26 @@ namespace INTERP_KERNEL
   /*!
    * Asumption is done with this iterator that we iterate on a container containing more than one edge.
    */
-  class INTERPKERNEL_EXPORT IteratorOnComposedEdge
+  class IteratorOnComposedEdge
   {
     friend class ComposedEdge;
     friend class ElementaryEdge;
     friend class QuadraticPolygon;
   public:
-    IteratorOnComposedEdge();
-    IteratorOnComposedEdge(ComposedEdge *compEdges);
-    bool isValid() const { return _list_handle!=0; } 
-    void operator=(const IteratorOnComposedEdge& other);
-    void first() { _deep_it=_list_handle->begin(); }
-    void next() { _deep_it++; }
-    void last();
-    void nextLoop();
-    void previousLoop();
-    bool finished() const { return _deep_it==_list_handle->end(); }
-    bool goToNextInOn(bool direction, int& i, int nbMax);
-    ElementaryEdge *current() { return *_deep_it; }
-    void assignMySelfToAllElems(ComposedEdge *elems);
-    void insertElemEdges(ComposedEdge *elems, bool changeMySelf);
+    INTERPKERNEL_EXPORT IteratorOnComposedEdge();
+    INTERPKERNEL_EXPORT IteratorOnComposedEdge(ComposedEdge *compEdges);
+    INTERPKERNEL_EXPORT bool isValid() const { return _list_handle!=0; } 
+    INTERPKERNEL_EXPORT void operator=(const IteratorOnComposedEdge& other);
+    INTERPKERNEL_EXPORT void first() { _deep_it=_list_handle->begin(); }
+    INTERPKERNEL_EXPORT void next() { _deep_it++; }
+    INTERPKERNEL_EXPORT void last();
+    INTERPKERNEL_EXPORT void nextLoop();
+    INTERPKERNEL_EXPORT void previousLoop();
+    INTERPKERNEL_EXPORT bool finished() const { return _deep_it==_list_handle->end(); }
+    INTERPKERNEL_EXPORT bool goToNextInOn(bool direction, int& i, int nbMax);
+    INTERPKERNEL_EXPORT ElementaryEdge *current() { return *_deep_it; }
+    INTERPKERNEL_EXPORT void assignMySelfToAllElems(ComposedEdge *elems);
+    INTERPKERNEL_EXPORT void insertElemEdges(ComposedEdge *elems, bool changeMySelf);
   private:
     std::list<ElementaryEdge *>::iterator _deep_it;
     std::list<ElementaryEdge *>* _list_handle;