-// Copyright (C) 2007-2016 CEA/DEN, EDF R&D, OPEN CASCADE
+// Copyright (C) 2007-2022 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
/*!
* \brief Computes segment for a given edge
*/
- double GetLength(const SMESH_Mesh* aMesh, const TopoDS_Shape& anEdge)
- throw(SALOME_Exception);
+ double GetLength(const SMESH_Mesh* aMesh, const TopoDS_Shape& anEdge);
/*!
* \brief Computes segment length for an edge of given length
*/
- double GetLength(const SMESH_Mesh* aMesh, const double edgeLength)
- throw(SALOME_Exception);
+ double GetLength(const SMESH_Mesh* aMesh, const double edgeLength);
/*!
* \brief Set Fineness
* The "Initial Number of Elements on the Shortest Edge" (S0)
* is divided by (0.5 + 4.5 x theFineness)
*/
- void SetFineness(double theFineness)
- throw(SALOME_Exception);
+ void SetFineness(double theFineness);
/*!
* \brief Return mesh Fineness