1 // Copyright (C) 2007-2016 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, or (at your option) any later version.
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
19 // Author : Anthony Geay (CEA/DEN)
21 #ifndef __INTERPKERNELGEO2DABSTRACTEDGE_HXX__
22 #define __INTERPKERNELGEO2DABSTRACTEDGE_HXX__
24 #include "INTERPKERNELDefines.hxx"
30 namespace INTERP_KERNEL
40 * Asumption is done with this iterator that we iterate on a container containing more than one edge.
42 class IteratorOnComposedEdge
44 friend class ComposedEdge;
45 friend class ElementaryEdge;
46 friend class QuadraticPolygon;
48 INTERPKERNEL_EXPORT IteratorOnComposedEdge();
49 INTERPKERNEL_EXPORT IteratorOnComposedEdge(ComposedEdge *compEdges);
50 INTERPKERNEL_EXPORT bool isValid() const { return _list_handle!=0; }
51 INTERPKERNEL_EXPORT void operator=(const IteratorOnComposedEdge& other);
52 INTERPKERNEL_EXPORT void first() { _deep_it=_list_handle->begin(); }
53 INTERPKERNEL_EXPORT void next() { _deep_it++; }
54 INTERPKERNEL_EXPORT void last();
55 INTERPKERNEL_EXPORT void nextLoop();
56 INTERPKERNEL_EXPORT void previousLoop();
57 INTERPKERNEL_EXPORT bool finished() const { return _deep_it==_list_handle->end(); }
58 INTERPKERNEL_EXPORT bool goToNextInOn(bool direction, int& i, int nbMax);
59 INTERPKERNEL_EXPORT ElementaryEdge *current() { return *_deep_it; }
60 INTERPKERNEL_EXPORT void assignMySelfToAllElems(ComposedEdge *elems);
61 INTERPKERNEL_EXPORT void insertElemEdges(ComposedEdge *elems, bool changeMySelf);
63 std::list<ElementaryEdge *>::iterator _deep_it;
64 std::list<ElementaryEdge *>* _list_handle;