diff --git a/EgtGeomKernel.rc b/EgtGeomKernel.rc index 3bdb01e..714c7cc 100644 Binary files a/EgtGeomKernel.rc and b/EgtGeomKernel.rc differ diff --git a/IdManager.h b/IdManager.h index c8b03ee..15f7ea0 100644 --- a/IdManager.h +++ b/IdManager.h @@ -57,7 +57,7 @@ class IdManager m_nMaxId = nId ; } void UpdateMaxId( void) { int nMaxId = 0 ; - for each (const auto& Igdbo in m_GdbIdMap) + for (const auto& Igdbo : m_GdbIdMap) nMaxId = std::max( nMaxId, Igdbo.first) ; m_nMaxId = nMaxId ; } diff --git a/IntersSurfTmSurfTm.cpp b/IntersSurfTmSurfTm.cpp index 92915b1..c6c6b77 100644 --- a/IntersSurfTmSurfTm.cpp +++ b/IntersSurfTmSurfTm.cpp @@ -131,7 +131,7 @@ IntersSurfTmSurfTm( const ISurfTriMesh& Stm1, const ISurfTriMesh& Stm2, } // se altrimenti sovrapposizione else if ( nRes == ITTT_OVERLAPS) { - for each ( const auto& Tria in vIttTria) { + for ( const auto& Tria : vIttTria) { // verifico se triangolo già inserito bool bFound = false ; BBox3d b3Tria ; diff --git a/PointGrid3d.cpp b/PointGrid3d.cpp index 52b9914..7843c90 100644 --- a/PointGrid3d.cpp +++ b/PointGrid3d.cpp @@ -264,7 +264,7 @@ PointGrid3d::FindNearest( const Point3d& ptTest, INTVECTOR& vnIds) bool bFound = false ; double dMinDist ; double dSqMinDist ; - for each ( const auto& PntI in m_MMap) { + for ( const auto& PntI : m_MMap) { // quadrato della distanza double dSqDist = SqDist( ptTest, PntI.second.first) ; // altro punto con la stessa minima distanza già trovata diff --git a/PolyLine.cpp b/PolyLine.cpp index 4469936..f6cd7bf 100644 --- a/PolyLine.cpp +++ b/PolyLine.cpp @@ -269,7 +269,7 @@ PolyLine::GetLocalBBox( BBox3d& b3Loc) const { // assegno il box in locale, scorrendo tutti i punti b3Loc.Reset() ; - for each ( const auto& UPnt in m_lUPoints) + for ( const auto& UPnt : m_lUPoints) b3Loc.Add( UPnt.first) ; return true ; @@ -1030,7 +1030,7 @@ PolyLine::GetConvexHullXY( PNTVECTOR& vConvHull) const // inserisco i punti in un array ( considero solo x e y, annullo le z) PNTVECTOR vPnt( nSize) ; int k = 0 ; - for each ( const auto& Pnt in m_lUPoints) + for ( const auto& Pnt : m_lUPoints) vPnt[k++] = Point3d( Pnt.first.x, Pnt.first.y, 0) ; // ordino secondo le X crescenti sort( vPnt.begin(), vPnt.end(),