1 // Copyright (C) 2007-2008 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
19 #ifndef __ABSTRACTEDGE_HXX__
20 #define __ABSTRACTEDGE_HXX__
26 namespace INTERP_KERNEL
36 * Asumption is done with this iterator that we iterate on a container containing more than one edge.
38 class IteratorOnComposedEdge
40 friend class ComposedEdge;
41 friend class ElementaryEdge;
42 friend class QuadraticPolygon;
44 IteratorOnComposedEdge();
45 IteratorOnComposedEdge(ComposedEdge *compEdges);
46 bool isValid() const { return _list_handle!=0; }
47 void operator=(const IteratorOnComposedEdge& other);
48 void first() { _deep_it=_list_handle->begin(); }
49 void next() { _deep_it++; }
53 bool finished() const { return _deep_it==_list_handle->end(); }
54 bool goToNextInOn(bool direction, int& i, int nbMax);
55 ElementaryEdge *current() { return *_deep_it; }
56 void assignMySelfToAllElems(ComposedEdge *elems);
57 void insertElemEdges(ComposedEdge *elems, bool changeMySelf);
59 std::list<ElementaryEdge *>::iterator _deep_it;
60 std::list<ElementaryEdge *>* _list_handle;