// SMESH SMDS : implementaion of Salome mesh data structure // // Copyright (C) 2003 OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN, // CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS // // 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 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 // // See http://www.opencascade.org/SALOME/ or email : webmaster.salome@opencascade.org #ifdef _MSC_VER #pragma warning(disable:4786) #endif #include "SMDS_FaceOfEdges.hxx" #include "SMDS_IteratorOfElements.hxx" #include "SMDS_MeshNode.hxx" using namespace std; //======================================================================= //function : NbEdges //purpose : //======================================================================= int SMDS_FaceOfEdges::NbEdges() const { return myNbEdges; } int SMDS_FaceOfEdges::NbFaces() const { return 1; } //======================================================================= //function : Print //purpose : //======================================================================= void SMDS_FaceOfEdges::Print(ostream & OS) const { OS << "face <" << GetID() << " > : "; int i; for (i = 0; i < NbEdges() - 1; i++) OS << myEdges[i] << ","; OS << myEdges[i] << ") " << endl; } SMDSAbs_ElementType SMDS_FaceOfEdges::GetType() const { return SMDSAbs_Face; } //======================================================================= //function : elementsIterator //purpose : //======================================================================= class SMDS_FaceOfEdges_MyIterator:public SMDS_ElemIterator { const SMDS_MeshEdge* const *mySet; int myLength; int index; public: SMDS_FaceOfEdges_MyIterator(const SMDS_MeshEdge* const *s, int l): mySet(s),myLength(l),index(0) {} bool more() { return index set1,set2; SMDS_ElemIteratorPtr it; const SMDS_MeshNode * n; it=f1.nodesIterator(); while(it->more()) { n=static_cast(it->next()); set1.insert(*n); } delete it; it=f2.nodesIterator(); while(it->more()) { n=static_cast(it->next()); set2.insert(*n); } delete it; return set1NbNodes() + myEdges[1]->NbNodes() + myEdges[2]->NbNodes() + ( myNbEdges == 4 ? myEdges[3]->NbNodes() : 0 ) - myNbEdges; } /*! * \brief Return node by its index * \param ind - node index * \retval const SMDS_MeshNode* - the node * * Index is wrapped if it is out of a valid range */ const SMDS_MeshNode* SMDS_FaceOfEdges::GetNode(const int ind) const { int index = WrappedIndex( ind ); for ( int i = 0; i < myNbEdges; ++i ) { if ( index >= myEdges[ i ]->NbNodes() ) index -= myEdges[ i ]->NbNodes(); else return myEdges[ i ]->GetNode( index ); } return 0; }