-// SMESH SMDS : implementaion of Salome mesh data structure
+// Copyright (C) 2007-2008 CEA/DEN, EDF R&D, OPEN CASCADE
+//
+// Copyright (C) 2003-2007 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.
//
-// 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
+// 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.salome-platform.org/ or email : webmaster.salome@opencascade.com
//
+// SMESH SMDS : implementaion of Salome mesh data structure
// File : SMDS_MeshElementIDFactory.cxx
// Author : Jean-Michel BOULCOURT
// Module : SMESH
-
+//
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#endif
#include "SMDS_MeshElementIDFactory.hxx"
#include "SMDS_MeshElement.hxx"
//function : SMDS_MeshElementIDFactory
//purpose :
//=======================================================================
-SMDS_MeshElementIDFactory::SMDS_MeshElementIDFactory():SMDS_MeshIDFactory()
+SMDS_MeshElementIDFactory::SMDS_MeshElementIDFactory():
+ SMDS_MeshIDFactory(),
+ myMin(0), myMax(0)
{
}
//=======================================================================
bool SMDS_MeshElementIDFactory::BindID(int ID, SMDS_MeshElement * elem)
{
- bool bound=myIDElements.insert(
- map<int, SMDS_MeshElement*>::value_type(ID,elem)).second;
- if(bound) elem->myID=ID;
- return bound;
+ if (myIDElements.IsBound(ID))
+ return false;
+ myIDElements.Bind(ID,elem);
+ elem->myID=ID;
+ updateMinMax (ID);
+ return true;
}
//=======================================================================
//=======================================================================
SMDS_MeshElement* SMDS_MeshElementIDFactory::MeshElement(int ID)
{
- map<int, SMDS_MeshElement*>::iterator it=myIDElements.find(ID);
- if(it==myIDElements.end()) return NULL; else return (*it).second;
+ if (!myIDElements.IsBound(ID))
+ return NULL;
+ return myIDElements.Find(ID);
}
int ID;
do {
ID = SMDS_MeshIDFactory::GetFreeID();
- } while (myIDElements.find(ID) != myIDElements.end());
+ } while (myIDElements.IsBound(ID));
return ID;
}
//=======================================================================
void SMDS_MeshElementIDFactory::ReleaseID(const int ID)
{
- myIDElements.erase(ID);
+ myIDElements.UnBind(ID);
SMDS_MeshIDFactory::ReleaseID(ID);
+ if (ID == myMax)
+ myMax = 0;
+ if (ID == myMin)
+ myMin = 0;
}
//=======================================================================
int SMDS_MeshElementIDFactory::GetMaxID() const
{
- map<int, SMDS_MeshElement*>::const_reverse_iterator it = myIDElements.rbegin();
- if ( it != myIDElements.rend() )
- return (*it).first;
-
- return 0;
+ if (myMax == 0)
+ updateMinMax();
+ return myMax;
}
//=======================================================================
int SMDS_MeshElementIDFactory::GetMinID() const
{
- map<int, SMDS_MeshElement*>::const_iterator it = myIDElements.begin();
- if ( it != myIDElements.end() )
- return (*it).first;
+ if (myMin == 0)
+ updateMinMax();
+ return myMin;
+}
+
+//=======================================================================
+//function : updateMinMax
+//purpose :
+//=======================================================================
+
+void SMDS_MeshElementIDFactory::updateMinMax() const
+{
+ myMin = IntegerLast();
+ myMax = 0;
+ SMDS_IdElementMap::Iterator it(myIDElements);
+ for (; it.More(); it.Next())
+ updateMinMax (it.Key());
+ if (myMin == IntegerLast())
+ myMin = 0;
+}
- return 0;
+//=======================================================================
+//function : elementsIterator
+//purpose : Return an iterator on elements of the factory
+//=======================================================================
+
+class SMDS_Fact_MyElemIterator:public SMDS_ElemIterator
+{
+ SMDS_IdElementMap::Iterator myIterator;
+ public:
+ SMDS_Fact_MyElemIterator(const SMDS_IdElementMap& s):myIterator(s)
+ {}
+
+ bool more()
+ {
+ return myIterator.More() != Standard_False;
+ }
+
+ const SMDS_MeshElement* next()
+ {
+ const SMDS_MeshElement* current = myIterator.Value();
+ myIterator.Next();
+ return current;
+ }
+};
+
+SMDS_ElemIteratorPtr SMDS_MeshElementIDFactory::elementsIterator() const
+{
+ return SMDS_ElemIteratorPtr
+ (new SMDS_Fact_MyElemIterator(myIDElements));
}
+void SMDS_MeshElementIDFactory::Clear()
+{
+ myIDElements.Clear();
+ myMin = myMax = 0;
+ SMDS_MeshIDFactory::Clear();
+}
