22364: EDF SMESH: Create Mesh dialog box improvement: hide inapplicable algorithms/hypotheses

Minor fixes
This commit is contained in:
eap 2014-03-03 15:00:39 +04:00
parent e26ffcc005
commit 457be09338
4 changed files with 6 additions and 6 deletions

View File

@ -746,7 +746,7 @@ bool StdMeshers_Hexa_3D::Compute(SMESH_Mesh & aMesh, SMESH_MesherHelper* aHelper
* \brief Return true if the algorithm can mesh this shape * \brief Return true if the algorithm can mesh this shape
* \param [in] aShape - shape to check * \param [in] aShape - shape to check
* \param [in] toCheckAll - if true, this check returns OK if all shapes are OK, * \param [in] toCheckAll - if true, this check returns OK if all shapes are OK,
* else, returns OK if all at least one shape is OK * else, returns OK if at least one shape is OK
*/ */
//================================================================================ //================================================================================
@ -765,7 +765,7 @@ bool StdMeshers_Hexa_3D::IsApplicable( const TopoDS_Shape & aShape, bool toCheck
TopExp_Explorer exp1( exp0.Current(), TopAbs_SHELL ); TopExp_Explorer exp1( exp0.Current(), TopAbs_SHELL );
for ( ; exp1.More(); exp1.Next(), ++nbFoundShells) for ( ; exp1.More(); exp1.Next(), ++nbFoundShells)
if ( nbFoundShells == 2 ) break; if ( nbFoundShells == 2 ) break;
if ( nbFoundShells == 2){ if ( nbFoundShells != 1 ) {
if ( toCheckAll ) return false; if ( toCheckAll ) return false;
continue; continue;
} }

View File

@ -2134,7 +2134,7 @@ namespace // utils used by StdMeshers_Prism_3D::IsApplicable()
* \brief Return true if the algorithm can mesh this shape * \brief Return true if the algorithm can mesh this shape
* \param [in] aShape - shape to check * \param [in] aShape - shape to check
* \param [in] toCheckAll - if true, this check returns OK if all shapes are OK, * \param [in] toCheckAll - if true, this check returns OK if all shapes are OK,
* else, returns OK if all at least one shape is OK * else, returns OK if at least one shape is OK
*/ */
//================================================================================ //================================================================================

View File

@ -909,7 +909,7 @@ bool StdMeshers_Quadrangle_2D::Evaluate(SMESH_Mesh& aMesh,
* \brief Return true if the algorithm can mesh this shape * \brief Return true if the algorithm can mesh this shape
* \param [in] aShape - shape to check * \param [in] aShape - shape to check
* \param [in] toCheckAll - if true, this check returns OK if all shapes are OK, * \param [in] toCheckAll - if true, this check returns OK if all shapes are OK,
* else, returns OK if all at least one shape is OK * else, returns OK if at least one shape is OK
*/ */
//================================================================================ //================================================================================
@ -939,7 +939,7 @@ bool StdMeshers_Quadrangle_2D::IsApplicable( const TopoDS_Shape & aShape, bool t
if ( !toCheckAll && nbNoDegenEdges >= 3 ) return true; if ( !toCheckAll && nbNoDegenEdges >= 3 ) return true;
} }
return ( toCheckAll && nbFoundFaces != 0 ); return ( toCheckAll && nbFoundFaces != 0 );
}; }
//================================================================================ //================================================================================
/*! /*!

View File

@ -604,7 +604,7 @@ bool StdMeshers_RadialPrism_3D::Evaluate(SMESH_Mesh& aMesh,
* \brief Return true if the algorithm can mesh this shape * \brief Return true if the algorithm can mesh this shape
* \param [in] aShape - shape to check * \param [in] aShape - shape to check
* \param [in] toCheckAll - if true, this check returns OK if all shapes are OK, * \param [in] toCheckAll - if true, this check returns OK if all shapes are OK,
* else, returns OK if all at least one shape is OK * else, returns OK if at least one shape is OK
*/ */
//================================================================================ //================================================================================