1 // Copyright (C) 2007-2012 CEA/DEN, EDF R&D
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
20 #ifndef __INTERPKERNELGEO2DABSTRACTEDGE_HXX__
21 #define __INTERPKERNELGEO2DABSTRACTEDGE_HXX__
23 #include "INTERPKERNELDefines.hxx"
29 namespace INTERP_KERNEL
39 * Asumption is done with this iterator that we iterate on a container containing more than one edge.
41 class INTERPKERNEL_EXPORT IteratorOnComposedEdge
43 friend class ComposedEdge;
44 friend class ElementaryEdge;
45 friend class QuadraticPolygon;
47 IteratorOnComposedEdge();
48 IteratorOnComposedEdge(ComposedEdge *compEdges);
49 bool isValid() const { return _list_handle!=0; }
50 void operator=(const IteratorOnComposedEdge& other);
51 void first() { _deep_it=_list_handle->begin(); }
52 void next() { _deep_it++; }
56 bool finished() const { return _deep_it==_list_handle->end(); }
57 bool goToNextInOn(bool direction, int& i, int nbMax);
58 ElementaryEdge *current() { return *_deep_it; }
59 void assignMySelfToAllElems(ComposedEdge *elems);
60 void insertElemEdges(ComposedEdge *elems, bool changeMySelf);
62 std::list<ElementaryEdge *>::iterator _deep_it;
63 std::list<ElementaryEdge *>* _list_handle;