ForkMaster/smesh
1
0
Fork 0
mirror of https://git.salome-platform.org/gitpub/modules/smesh.git synced 2025-01-24 10:10:33 +05:00
Code Issues Packages Projects Releases Wiki Activity

indenting

Browse Source
This commit is contained in:
eap 2020-01-17 13:30:20 +03:00
parent ad718f9854
commit 09e26a7d86
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
src/Controls/SMESH_Controls.cxx
View File

@ -148,7 +148,7 @@ namespace {
// result should be 2 in both cases // result should be 2 in both cases
// //
int aResult0 = 0, aResult1 = 0; int aResult0 = 0, aResult1 = 0;
// last node, it is a medium one in a quadratic edge // last node, it is a medium one in a quadratic edge
const SMDS_MeshNode* aLastNode = anEdge->GetNode( anEdge->NbNodes() - 1 ); const SMDS_MeshNode* aLastNode = anEdge->GetNode( anEdge->NbNodes() - 1 );
const SMDS_MeshNode* aNode0 = anEdge->GetNode( 0 ); const SMDS_MeshNode* aNode0 = anEdge->GetNode( 0 );
const SMDS_MeshNode* aNode1 = anEdge->GetNode( 1 ); const SMDS_MeshNode* aNode1 = anEdge->GetNode( 1 );
@ -891,17 +891,17 @@ double AspectRatio::GetValue( const TSequenceOfXYZ& P )
// Si - areas of the triangles // Si - areas of the triangles
const double alpha = sqrt( 1 / 32. ); const double alpha = sqrt( 1 / 32. );
double L = Max( aLen[ 0 ], double L = Max( aLen[ 0 ],
Max( aLen[ 1 ], Max( aLen[ 1 ],
Max( aLen[ 2 ], Max( aLen[ 2 ],
Max( aLen[ 3 ], Max( aLen[ 3 ],
Max( aDia[ 0 ], aDia[ 1 ] ) ) ) ) ); Max( aDia[ 0 ], aDia[ 1 ] ) ) ) ) );
double C1 = sqrt( aLen[0] * aLen[0] + double C1 = sqrt( aLen[0] * aLen[0] +
aLen[1] * aLen[1] + aLen[1] * aLen[1] +
aLen[2] * aLen[2] + aLen[2] * aLen[2] +
aLen[3] * aLen[3] ); aLen[3] * aLen[3] );
double C2 = Min( anArea[ 0 ], double C2 = Min( anArea[ 0 ],
Min( anArea[ 1 ], Min( anArea[ 1 ],
Min( anArea[ 2 ], anArea[ 3 ] ) ) ); Min( anArea[ 2 ], anArea[ 3 ] ) ) );
if ( C2 <= theEps ) if ( C2 <= theEps )
return theInf; return theInf;
return alpha * L * C1 / C2; return alpha * L * C1 / C2;
@ -2752,7 +2752,7 @@ bool FreeFaces::IsSatisfy( long theId )
TItrMapOfVolume volEnd = mapOfVol.end(); TItrMapOfVolume volEnd = mapOfVol.end();
for ( ; volItr != volEnd; ++volItr ) for ( ; volItr != volEnd; ++volItr )
if ( (*volItr).second >= nbNode ) if ( (*volItr).second >= nbNode )
nbVol++; nbVol++;
// face is not free if number of volumes constructed on their nodes more than one // face is not free if number of volumes constructed on their nodes more than one
return (nbVol < 2); return (nbVol < 2);
} }