static double cpunew, cpuold=0;
-void tempscpu_( double & tempsec )
+void
+#ifdef WIN32
+ __stdcall
+#endif
+tempscpu_( double & tempsec )
//Retourne le temps CPU utilise en secondes
{
tempsec = ( (double) clock() ) / CLOCKS_PER_SEC;
}
-void deltacpu_( R & dtcpu )
+void
+#ifdef WIN32
+ __stdcall
+#endif
+deltacpu_( R & dtcpu )
//Retourne le temps CPU utilise en secondes depuis le precedent appel
{
tempscpu_( cpunew );
bool IsBoundary() const { return !_qfaces[1]; }
void RemoveFace( const QFace* face ) const
- { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) swap(_qfaces[0],_qfaces[1]); }
+ { _qfaces[(face == _qfaces[1])] = 0; if (!_qfaces[0]) std::swap(_qfaces[0],_qfaces[1]); }
const QFace* NextFace( const QFace* f ) const
{ return _qfaces[0]==f ? _qfaces[1] : _qfaces[0]; }
// --------------------------------------------------------------------
typedef list< TChainLink > TChain;
typedef set < TChainLink > TLinkSet;
- typedef TLinkSet::iterator TLinkInSet;
+ typedef TLinkSet::const_iterator TLinkInSet;
const int theFirstStep = 5;
ostream& operator << (ostream& out, const QFace& f)
{
out <<"QFace nodes: "/*<< &f << " "*/;
- for ( TIDSortedElemSet::iterator n = f.begin(); n != f.end(); ++n )
+ for ( TIDSortedElemSet::const_iterator n = f.begin(); n != f.end(); ++n )
out << (*n)->GetID() << " ";
out << " \tvolumes: "
<< (f._volumes[0] ? f._volumes[0]->GetID() : 0) << " "
if ( iFaceCont > 0 ) // continues faces found, set one by the other
{
if ( iFaceCont != 1 )
- swap( _faces[1], _faces[iFaceCont] );
+ std::swap( _faces[1], _faces[iFaceCont] );
}
else if ( _faces.size() > 1 ) // not found, set NULL by the first face
{
}
}
curBndLinks->clear();
- swap( curBndLinks, newBndLinks );
+ std::swap( curBndLinks, newBndLinks );
}
}