#include <Standard_Handle.hxx>
#include <gp_Ax1.hxx>
-#include <Standard_Boolean.hxx>
#include <BRepFeat_Status.hxx>
#include <TopoDS_Face.hxx>
#include <BRepFeat_Builder.hxx>
-#include <Standard_Real.hxx>
-class StdFail_NotDone;
-class Standard_ConstructionError;
-class gp_Ax1;
-class TopoDS_Shape;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! Provides a tool to make cylindrical holes on a shape.
class BRepFeat_MakeCylindricalHole : public BRepFeat_Builder
class TopoDS_Vertex;
class TopoDS_Shape;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! Describes functions to build fillets and chamfers on the
//! vertices of a planar face.
//=======================================================================
Handle(Geom_Surface) BRepOffset::Surface(const Handle(Geom_Surface)& Surface,
const Standard_Real Offset,
- BRepOffset_Status& Status)
+ BRepOffset_Status& theStatus)
{
Standard_Real Tol = Precision::Confusion();
- Status = BRepOffset_Good;
+ theStatus = BRepOffset_Good;
Handle(Geom_Surface) Result;
Handle(Standard_Type) TheType = Surface->DynamicType();
else if ( Radius <= -Tol ){
Axis.Rotate(gp_Ax1(Axis.Location(),Axis.Direction()),M_PI);
Result = new Geom_CylindricalSurface( Axis, Abs(Radius));
- Status = BRepOffset_Reversed;
+ theStatus = BRepOffset_Reversed;
}
else {
- Status = BRepOffset_Degenerated;
+ theStatus = BRepOffset_Degenerated;
}
}
else if (TheType == STANDARD_TYPE(Geom_ConicalSurface)) {
Axis.Rotate(gp_Ax1(Axis.Location(),Axis.Direction()),M_PI);
Axis.ZReverse();
Result = new Geom_SphericalSurface(Axis, -Radius);
- Status = BRepOffset_Reversed;
+ theStatus = BRepOffset_Reversed;
}
else {
- Status = BRepOffset_Degenerated;
+ theStatus = BRepOffset_Degenerated;
}
}
else if (TheType == STANDARD_TYPE(Geom_ToroidalSurface)) {
Result = new Geom_ToroidalSurface(Axis,MajorRadius,MinorRadius);
}
else if (MinorRadius <= -Tol) {
- Status = BRepOffset_Reversed;
+ theStatus = BRepOffset_Reversed;
}
else {
- Status = BRepOffset_Degenerated;
+ theStatus = BRepOffset_Degenerated;
}
}
}
Handle(Geom_RectangularTrimmedSurface)::DownCast(Surface);
Standard_Real U1,U2,V1,V2;
S->Bounds(U1,U2,V1,V2);
- Handle(Geom_Surface) Off =
- BRepOffset::Surface(S->BasisSurface(),Offset,Status);
+ Handle(Geom_Surface) Off = BRepOffset::Surface (S->BasisSurface(), Offset, theStatus);
Result = new Geom_RectangularTrimmedSurface (Off,U1,U2,V1,V2);
}
else if (TheType == STANDARD_TYPE(Geom_OffsetSurface)) {
//!
//! If no particular case is detected, the returned
//! surface will have the Type Geom_OffsetSurface.
- Standard_EXPORT static Handle(Geom_Surface) Surface (const Handle(Geom_Surface)& Surface, const Standard_Real Offset, BRepOffset_Status& Status);
+ Standard_EXPORT static Handle(Geom_Surface) Surface (const Handle(Geom_Surface)& Surface, const Standard_Real Offset, BRepOffset_Status& theStatus);
#include <Standard_DefineAlloc.hxx>
#include <Standard_Handle.hxx>
-#include <TopoDS_Shape.hxx>
#include <BRepOffset_Status.hxx>
#include <TopoDS_Face.hxx>
#include <TopTools_DataMapOfShapeShape.hxx>
-#include <Standard_Real.hxx>
-#include <Standard_Boolean.hxx>
#include <GeomAbs_JoinType.hxx>
#include <GeomAbs_Shape.hxx>
#include <TopTools_ListOfShape.hxx>
-class TopoDS_Face;
class TopoDS_Edge;
class TopoDS_Vertex;
-class TopoDS_Shape;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! This class compute elemenary offset surface.
//! Evaluate the offset generated :
#include <Draft_ErrorStatus.hxx>
#include <BRepTools_ReShape.hxx>
-class StdFail_NotDone;
-class Standard_NullObject;
-class Standard_NoSuchObject;
-class Standard_ConstructionError;
class TopoDS_Shape;
class TopoDS_Face;
class gp_Dir;
class gp_Pln;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! Taper-adding transformations on a shape.
//! The resulting shape is constructed by defining one face
//=======================================================================
BRepBuilderAPI_PipeError BRepOffsetAPI_MakePipeShell::GetStatus() const
{
- BRepBuilderAPI_PipeError Status;
GeomFill_PipeError stat;
stat = myPipe->GetStatus();
switch (stat) {
case GeomFill_PipeOk :
{
- Status = BRepBuilderAPI_PipeDone;
- break;
+ return BRepBuilderAPI_PipeDone;
}
case GeomFill_PlaneNotIntersectGuide :
{
- Status = BRepBuilderAPI_PlaneNotIntersectGuide;
- break;
+ return BRepBuilderAPI_PlaneNotIntersectGuide;
}
case GeomFill_ImpossibleContact :
{
- Status = BRepBuilderAPI_ImpossibleContact;
- break;
+ return BRepBuilderAPI_ImpossibleContact;
}
default :
- Status = BRepBuilderAPI_PipeNotDone;
+ return BRepBuilderAPI_PipeNotDone;
}
- return Status;
}
//=======================================================================
class TopoDS_Shape;
class TopoDS_Vertex;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class BRepTools_ReShape;
DEFINE_STANDARD_HANDLE(BRepTools_ReShape, MMgt_TShared)
const Standard_Boolean IsVPer = surf->IsVPeriodic();
const Standard_Real uperiod = IsUPer ? surf->UPeriod() : 0.0;
const Standard_Real vperiod = IsVPer ? surf->VPeriod() : 0.0;
- TopAbs_State Status = TopAbs_UNKNOWN;
+ TopAbs_State aStatus = TopAbs_UNKNOWN;
Standard_Boolean urecadre = Standard_False, vrecadre = Standard_False;
if (RecadreOnPeriodic)
Standard_Real m_Toluv = (Toluv > 4.0) ? 4.0 : Toluv;
//aClassifier.Perform(Face,Puv,Toluv);
aClassifier.Perform(Face,Puv,m_Toluv);
- Status = aClassifier.State();
+ aStatus = aClassifier.State();
}
if(dedans == 1) {
- Status = TopAbs_IN;
+ aStatus = TopAbs_IN;
}
if(dedans == -1) {
- Status = TopAbs_OUT;
+ aStatus = TopAbs_OUT;
}
}
else { //-- TabOrien(1)=-1 False Wire
BRepClass_FaceClassifier aClassifier;
aClassifier.Perform(Face,Puv,Toluv);
- Status = aClassifier.State();
+ aStatus = aClassifier.State();
}
if (!RecadreOnPeriodic || (!IsUPer && !IsVPer))
- return Status;
- if (Status == TopAbs_IN || Status == TopAbs_ON)
- return Status;
+ return aStatus;
+ if (aStatus == TopAbs_IN || aStatus == TopAbs_ON)
+ return aStatus;
if (!urecadre)
{
u = uu;
if (v > Vmax || !IsVPer)
- return Status;
+ return aStatus;
}
} //for (;;)
}
const Standard_Boolean IsVPer = surf->IsVPeriodic();
const Standard_Real uperiod = IsUPer ? surf->UPeriod() : 0.0;
const Standard_Real vperiod = IsVPer ? surf->VPeriod() : 0.0;
- TopAbs_State Status = TopAbs_UNKNOWN;
+ TopAbs_State aStatus = TopAbs_UNKNOWN;
Standard_Boolean urecadre = Standard_False, vrecadre = Standard_False;
if (RecadreOnPeriodic)
}
}
if(dedans==0) {
- Status = TopAbs_ON;
+ aStatus = TopAbs_ON;
}
if(dedans == 1) {
- Status = TopAbs_IN;
+ aStatus = TopAbs_IN;
}
if(dedans == -1) {
- Status = TopAbs_OUT;
+ aStatus = TopAbs_OUT;
}
}
else { //-- TabOrien(1)=-1 False Wire
BRepClass_FaceClassifier aClassifier;
aClassifier.Perform(Face,Puv,Tol);
- Status = aClassifier.State();
+ aStatus = aClassifier.State();
}
if (!RecadreOnPeriodic || (!IsUPer && !IsVPer))
- return Status;
- if (Status == TopAbs_IN || Status == TopAbs_ON)
- return Status;
+ return aStatus;
+ if (aStatus == TopAbs_IN || aStatus == TopAbs_ON)
+ return aStatus;
if (!urecadre)
{
u = uu;
if (v > Vmax || !IsVPer)
- return Status;
+ return aStatus;
}
} //for (;;)
}
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
//!
- //! Status will return 0 if OK else it will return the pivot index
+ //! theStatus will return 0 if OK else it will return the pivot index
//! of the matrix that was inverted to compute the multiplied
//! BSpline : the method used is interpolation at Schoenenberg
//! points of F(a(t))
- Standard_EXPORT static void FunctionReparameterise (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const Standard_Integer PolesDimension, Standard_Real& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, Standard_Real& NewPoles, Standard_Integer& Status);
+ Standard_EXPORT static void FunctionReparameterise (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const Standard_Integer PolesDimension, Standard_Real& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, Standard_Real& NewPoles, Standard_Integer& theStatus);
//! This function will compose a given Vectorial BSpline F(t)
//! defined by its BSplineDegree and BSplineFlatKnotsl,
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
//!
- //! Status will return 0 if OK else it will return the pivot index
+ //! theStatus will return 0 if OK else it will return the pivot index
//! of the matrix that was inverted to compute the multiplied
//! BSpline : the method used is interpolation at Schoenenberg
//! points of F(a(t))
- Standard_EXPORT static void FunctionReparameterise (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const TColStd_Array1OfReal& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, TColStd_Array1OfReal& NewPoles, Standard_Integer& Status);
+ Standard_EXPORT static void FunctionReparameterise (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const TColStd_Array1OfReal& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, TColStd_Array1OfReal& NewPoles, Standard_Integer& theStatus);
//! this will compose a given Vectorial BSpline F(t)
//! defined by its BSplineDegree and BSplineFlatKnotsl,
//! the caller's responsability to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
- //! Status will return 0 if OK else it will return the pivot index
+ //! theStatus will return 0 if OK else it will return the pivot index
//! of the matrix that was inverted to compute the multiplied
//! BSpline : the method used is interpolation at Schoenenberg
//! points of F(a(t))
- Standard_EXPORT static void FunctionReparameterise (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const TColgp_Array1OfPnt& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, TColgp_Array1OfPnt& NewPoles, Standard_Integer& Status);
+ Standard_EXPORT static void FunctionReparameterise (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const TColgp_Array1OfPnt& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, TColgp_Array1OfPnt& NewPoles, Standard_Integer& theStatus);
//! this will compose a given Vectorial BSpline F(t)
//! defined by its BSplineDegree and BSplineFlatKnotsl,
//! the caller's responsability to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
- //! Status will return 0 if OK else it will return the pivot index
+ //! theStatus will return 0 if OK else it will return the pivot index
//! of the matrix that was inverted to compute the multiplied
//! BSpline : the method used is interpolation at Schoenenberg
//! points of F(a(t))
- Standard_EXPORT static void FunctionReparameterise (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const TColgp_Array1OfPnt2d& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, TColgp_Array1OfPnt2d& NewPoles, Standard_Integer& Status);
+ Standard_EXPORT static void FunctionReparameterise (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const TColgp_Array1OfPnt2d& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, TColgp_Array1OfPnt2d& NewPoles, Standard_Integer& theStatus);
//! this will multiply a given Vectorial BSpline F(t)
//! defined by its BSplineDegree and BSplineFlatKnotsl,
//! the caller's responsability to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
- //! Status will return 0 if OK else it will return the pivot index
+ //! theStatus will return 0 if OK else it will return the pivot index
//! of the matrix that was inverted to compute the multiplied
//! BSpline : the method used is interpolation at Schoenenberg
//! points of a(t)*F(t)
- Standard_EXPORT static void FunctionMultiply (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const Standard_Integer PolesDimension, Standard_Real& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, Standard_Real& NewPoles, Standard_Integer& Status);
+ Standard_EXPORT static void FunctionMultiply (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const Standard_Integer PolesDimension, Standard_Real& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, Standard_Real& NewPoles, Standard_Integer& theStatus);
//! this will multiply a given Vectorial BSpline F(t)
//! defined by its BSplineDegree and BSplineFlatKnotsl,
//! the caller's responsability to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
- //! Status will return 0 if OK else it will return the pivot index
+ //! theStatus will return 0 if OK else it will return the pivot index
//! of the matrix that was inverted to compute the multiplied
//! BSpline : the method used is interpolation at Schoenenberg
//! points of a(t)*F(t)
- Standard_EXPORT static void FunctionMultiply (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const TColStd_Array1OfReal& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, TColStd_Array1OfReal& NewPoles, Standard_Integer& Status);
+ Standard_EXPORT static void FunctionMultiply (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const TColStd_Array1OfReal& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, TColStd_Array1OfReal& NewPoles, Standard_Integer& theStatus);
//! this will multiply a given Vectorial BSpline F(t)
//! defined by its BSplineDegree and BSplineFlatKnotsl,
//! the caller's responsability to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
- //! Status will return 0 if OK else it will return the pivot index
+ //! theStatus will return 0 if OK else it will return the pivot index
//! of the matrix that was inverted to compute the multiplied
//! BSpline : the method used is interpolation at Schoenenberg
//! points of a(t)*F(t)
- Standard_EXPORT static void FunctionMultiply (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const TColgp_Array1OfPnt2d& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, TColgp_Array1OfPnt2d& NewPoles, Standard_Integer& Status);
+ Standard_EXPORT static void FunctionMultiply (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const TColgp_Array1OfPnt2d& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, TColgp_Array1OfPnt2d& NewPoles, Standard_Integer& theStatus);
//! this will multiply a given Vectorial BSpline F(t)
//! defined by its BSplineDegree and BSplineFlatKnotsl,
//! the caller's responsability to insure that conditions
//! 1. and 2. above are satisfied : no check whatsoever
//! is made in this method
- //! Status will return 0 if OK else it will return the pivot index
+ //! theStatus will return 0 if OK else it will return the pivot index
//! of the matrix that was inverted to compute the multiplied
//! BSpline : the method used is interpolation at Schoenenberg
//! points of a(t)*F(t)
- Standard_EXPORT static void FunctionMultiply (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const TColgp_Array1OfPnt& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, TColgp_Array1OfPnt& NewPoles, Standard_Integer& Status);
+ Standard_EXPORT static void FunctionMultiply (const BSplCLib_EvaluatorFunction& Function, const Standard_Integer BSplineDegree, const TColStd_Array1OfReal& BSplineFlatKnots, const TColgp_Array1OfPnt& Poles, const TColStd_Array1OfReal& FlatKnots, const Standard_Integer NewDegree, TColgp_Array1OfPnt& NewPoles, Standard_Integer& theStatus);
//! Perform the De Boor algorithm to evaluate a point at
//! parameter <U>, with <Degree> and <Dimension>.
const TColStd_Array1OfReal & FlatKnots,
const Standard_Integer NewDegree,
Standard_Real & NewPoles,
- Standard_Integer & Status)
+ Standard_Integer & theStatus)
{
Standard_Integer ii,
jj,
result,
error_code);
if (error_code) {
- Status = 1 ;
+ theStatus = 1;
goto FINISH ;
}
contact_order_array,
PolesDimension,
array_of_new_poles[0],
- Status) ;
+ theStatus);
for (ii = 0 ; ii < num_new_poles * PolesDimension ; ii++) {
array_of_poles[ii] = array_of_new_poles[ii] ;
const TColStd_Array1OfReal & FlatKnots,
const Standard_Integer NewDegree,
Standard_Real & NewPoles,
- Standard_Integer & Status)
+ Standard_Integer & theStatus)
{
Standard_Integer ii,
// jj,
result,
error_code);
if (error_code) {
- Status = 1 ;
+ theStatus = 1;
goto FINISH ;
}
contact_order_array,
PolesDimension,
array_of_new_poles[0],
- Status) ;
+ theStatus);
for (ii = 0 ; ii < num_new_poles * PolesDimension ; ii++) {
array_of_poles[ii] = array_of_new_poles[ii] ;
const TColStd_Array1OfReal & FlatKnots,
const Standard_Integer NewDegree,
TColStd_Array1OfReal & NewPoles,
- Standard_Integer & Status)
+ Standard_Integer & theStatus)
{
Standard_Integer num_bspline_poles =
BSplineFlatKnots.Length() - BSplineDegree - 1 ;
FlatKnots,
NewDegree,
array_of_new_poles[0],
- Status) ;
+ theStatus);
}
//=======================================================================
const TColStd_Array1OfReal & FlatKnots,
const Standard_Integer NewDegree,
TColStd_Array1OfReal & NewPoles,
- Standard_Integer & Status)
+ Standard_Integer & theStatus)
{
Standard_Integer num_bspline_poles =
BSplineFlatKnots.Length() - BSplineDegree - 1 ;
FlatKnots,
NewDegree,
array_of_new_poles[0],
- Status) ;
+ theStatus);
}
//=======================================================================
const TColStd_Array1OfReal & FlatKnots,
const Standard_Integer NewDegree,
Array1OfPoints & NewPoles,
- Standard_Integer & Status)
+ Standard_Integer & theStatus)
{
Standard_Integer num_bspline_poles =
BSplineFlatKnots.Length() - BSplineDegree - 1 ;
FlatKnots,
NewDegree,
array_of_new_poles[0],
- Status) ;
+ theStatus);
}
//=======================================================================
const TColStd_Array1OfReal & FlatKnots,
const Standard_Integer NewDegree,
Array1OfPoints & NewPoles,
- Standard_Integer & Status)
+ Standard_Integer & theStatus)
{
Standard_Integer num_bspline_poles =
BSplineFlatKnots.Length() - BSplineDegree - 1 ;
FlatKnots,
NewDegree,
array_of_new_poles[0],
- Status) ;
+ theStatus);
}
const Standard_Integer VNewDegree,
TColgp_Array2OfPnt& NewNumerator,
TColStd_Array2OfReal& NewDenominator,
- Standard_Integer& Status)
+ Standard_Integer& theStatus)
{
Standard_Integer num_uparameters,
// ii,jj,kk,
VParameters,
NewNumerator,
NewDenominator,
- Status) ;
+ theStatus);
}
else {
throw Standard_ConstructionError();
//! ---Warning: it is the caller's responsability to
//! insure that conditions 1. and 2. above are satisfied
//! : no check whatsoever is made in this method --
- //! Status will return 0 if OK else it will return the
+ //! theStatus will return 0 if OK else it will return the
//! pivot index -- of the matrix that was inverted to
//! compute the multiplied -- BSpline : the method used
//! is interpolation at Schoenenberg -- points of
//! a(u,v)* N(u,v) and a(u,v) * D(u,v)
- //! Status will return 0 if OK else it will return the pivot index
+ //! theStatus will return 0 if OK else it will return the pivot index
//! of the matrix that was inverted to compute the multiplied
//! BSpline : the method used is interpolation at Schoenenberg
//! points of a(u,v)*F(u,v)
//! --
- Standard_EXPORT static void FunctionMultiply (const BSplSLib_EvaluatorFunction& Function, const Standard_Integer UBSplineDegree, const Standard_Integer VBSplineDegree, const TColStd_Array1OfReal& UBSplineKnots, const TColStd_Array1OfReal& VBSplineKnots, const TColStd_Array1OfInteger* UMults, const TColStd_Array1OfInteger* VMults, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& UFlatKnots, const TColStd_Array1OfReal& VFlatKnots, const Standard_Integer UNewDegree, const Standard_Integer VNewDegree, TColgp_Array2OfPnt& NewNumerator, TColStd_Array2OfReal& NewDenominator, Standard_Integer& Status);
+ Standard_EXPORT static void FunctionMultiply (const BSplSLib_EvaluatorFunction& Function, const Standard_Integer UBSplineDegree, const Standard_Integer VBSplineDegree, const TColStd_Array1OfReal& UBSplineKnots, const TColStd_Array1OfReal& VBSplineKnots, const TColStd_Array1OfInteger* UMults, const TColStd_Array1OfInteger* VMults, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, const TColStd_Array1OfReal& UFlatKnots, const TColStd_Array1OfReal& VFlatKnots, const Standard_Integer UNewDegree, const Standard_Integer VNewDegree, TColgp_Array2OfPnt& NewNumerator, TColStd_Array2OfReal& NewDenominator, Standard_Integer& theStatus);
void CDM_Application::EndOfUpdate
(const Handle(CDM_Document)& aDocument,
- const Standard_Boolean Status,
+ const Standard_Boolean theStatus,
const TCollection_ExtendedString& /*ErrorString*/)
{
TCollection_ExtendedString message;
- if (Status)
+ if (theStatus)
message="Updated:";
else
message="Error during updating:";
//! this method is called affter the update of a document.
//! By default, writes in MessageDriver().
- Standard_EXPORT virtual void EndOfUpdate (const Handle(CDM_Document)& aDocument, const Standard_Boolean Status, const TCollection_ExtendedString& ErrorString);
+ Standard_EXPORT virtual void EndOfUpdate (const Handle(CDM_Document)& aDocument, const Standard_Boolean theStatus, const TCollection_ExtendedString& ErrorString);
//! writes the string in the application MessagerDriver.
Standard_EXPORT void Write (const Standard_ExtString aString);
const gp_Vec& D1U,
const gp_Vec& D1V,
const Standard_Real SinTol,
-CSLib_DerivativeStatus& Status,
+CSLib_DerivativeStatus& theStatus,
gp_Dir& Normal
) {
gp_Vec D1UvD1V = D1U.Crossed(D1V);
if (D1UMag <= gp::Resolution() && D1VMag <= gp::Resolution()) {
- Status = D1IsNull;
+ theStatus = D1IsNull;
}
- else if (D1UMag <= gp::Resolution()) Status = D1uIsNull;
- else if (D1VMag <= gp::Resolution()) Status = D1vIsNull;
-// else if ((D1VMag / D1UMag) <= RealEpsilon()) Status = D1vD1uRatioIsNull;
-// else if ((D1UMag / D1VMag) <= RealEpsilon()) Status = D1uD1vRatioIsNull;
+ else if (D1UMag <= gp::Resolution()) theStatus = D1uIsNull;
+ else if (D1VMag <= gp::Resolution()) theStatus = D1vIsNull;
+// else if ((D1VMag / D1UMag) <= RealEpsilon()) theStatus = D1vD1uRatioIsNull;
+// else if ((D1UMag / D1VMag) <= RealEpsilon()) theStatus = D1uD1vRatioIsNull;
else {
Standard_Real Sin2 =
D1UvD1V.SquareMagnitude() / (D1UMag * D1VMag);
- if (Sin2 < (SinTol * SinTol)) { Status = D1uIsParallelD1v; }
- else { Normal = gp_Dir (D1UvD1V); Status = Done; }
+ if (Sin2 < (SinTol * SinTol)) { theStatus = D1uIsParallelD1v; }
+ else { Normal = gp_Dir (D1UvD1V); theStatus = Done; }
}
}
const gp_Vec& DUV,
const Standard_Real SinTol,
Standard_Boolean& Done,
-CSLib_NormalStatus& Status,
+CSLib_NormalStatus& theStatus,
gp_Dir& Normal
) {
if (LD1Nu <= RealEpsilon() && LD1Nv <= RealEpsilon()) {
- Status = D1NIsNull;
+ theStatus = D1NIsNull;
Done = Standard_False;
}
else if (LD1Nu < RealEpsilon()) {
- Status = D1NuIsNull;
+ theStatus = D1NuIsNull;
Done = Standard_True;
Normal = gp_Dir (D1Nv);
}
else if (LD1Nv < RealEpsilon()) {
- Status = D1NvIsNull;
+ theStatus = D1NvIsNull;
Done = Standard_True;
Normal = gp_Dir (D1Nu);
}
else if ((LD1Nv / LD1Nu) <= RealEpsilon()) {
- Status = D1NvNuRatioIsNull;
+ theStatus = D1NvNuRatioIsNull;
Done = Standard_False;
}
else if ((LD1Nu / LD1Nv) <= RealEpsilon()) {
- Status = D1NuNvRatioIsNull;
+ theStatus = D1NuNvRatioIsNull;
Done = Standard_False;
}
else {
Standard_Real Sin2 = D1NCross.SquareMagnitude() / (LD1Nu * LD1Nv);
if (Sin2 < (SinTol * SinTol)) {
- Status = D1NuIsParallelD1Nv;
+ theStatus = D1NuIsParallelD1Nv;
Done = Standard_True;
Normal = gp_Dir (D1Nu);
}
else {
- Status = InfinityOfSolutions;
+ theStatus = InfinityOfSolutions;
Done = Standard_False;
}
}
const gp_Vec& D1U,
const gp_Vec& D1V,
const Standard_Real MagTol,
-CSLib_NormalStatus& Status,
+CSLib_NormalStatus& theStatus,
gp_Dir& Normal
) {
// Function: Calculate the normal from tangents by u and by v.
if (NMag <= MagTol || D1UMag <= MagTol || D1VMag <= MagTol ) {
- Status = Singular;
+ theStatus = Singular;
// if (D1UMag <= MagTol || D1VMag <= MagTol && NMag > MagTol) MagTol = 2* NMag;
}
else
gp_Dir aD1U(D1U);
gp_Dir aD1V(D1V);
Normal = gp_Dir(aD1U.Crossed(aD1V));
- Status = Defined;
+ theStatus = Defined;
}
const Standard_Real Umax,
const Standard_Real Vmin,
const Standard_Real Vmax,
- CSLib_NormalStatus& Status,
+ CSLib_NormalStatus& theStatus,
gp_Dir& Normal,
Standard_Integer& OrderU,
Standard_Integer& OrderV)
// Standard_Integer i,l,Order=-1;
Standard_Integer i=0,Order=-1;
Standard_Boolean Trouve=Standard_False;
-// Status = Singular;
+// theStatus = Singular;
Standard_Real Norme;
gp_Vec D;
//Find k0 such that all derivatives N=dS/du ^ dS/dv are null
{
if(Order == 0)
{
- Status = Defined;
+ theStatus = Defined;
Normal=D.Normalized();
}
else
//Polynom is always negative
SP=-1;
if(SP==0)
- Status = InfinityOfSolutions;
+ theStatus = InfinityOfSolutions;
else
{
- Status = Defined;
+ theStatus = Defined;
Normal=SP*Vk0.Normalized();
}
}
else
{
- Status = Defined;
+ theStatus = Defined;
Normal=D.Normalized();
}
}
//! parallel the normal is undefined.
//! To check that D1U and D1V are colinear the sinus of the angle
//! between D1U and D1V is computed and compared with SinTol.
- //! The normal is computed if Status == Done else the Status gives the
+ //! The normal is computed if theStatus == Done else the theStatus gives the
//! reason why the computation has failed.
- Standard_EXPORT static void Normal (const gp_Vec& D1U, const gp_Vec& D1V, const Standard_Real SinTol, CSLib_DerivativeStatus& Status, gp_Dir& Normal);
+ Standard_EXPORT static void Normal (const gp_Vec& D1U, const gp_Vec& D1V, const Standard_Real SinTol, CSLib_DerivativeStatus& theStatus, gp_Dir& Normal);
//! If there is a singularity on the surface the previous method
//! order 2 (it means that we cannot omit Eps).
//! . if DNu Is not Null and DNv Is not Null Done = False, there are
//! an infinity of normals at the considered point on the surface.
- Standard_EXPORT static void Normal (const gp_Vec& D1U, const gp_Vec& D1V, const gp_Vec& D2U, const gp_Vec& D2V, const gp_Vec& D2UV, const Standard_Real SinTol, Standard_Boolean& Done, CSLib_NormalStatus& Status, gp_Dir& Normal);
+ Standard_EXPORT static void Normal (const gp_Vec& D1U, const gp_Vec& D1V, const gp_Vec& D2U, const gp_Vec& D2V, const gp_Vec& D2UV, const Standard_Real SinTol, Standard_Boolean& Done, CSLib_NormalStatus& theStatus, gp_Dir& Normal);
//! Computes the normal direction of a surface as the cross product
//! between D1U and D1V.
- Standard_EXPORT static void Normal (const gp_Vec& D1U, const gp_Vec& D1V, const Standard_Real MagTol, CSLib_NormalStatus& Status, gp_Dir& Normal);
+ Standard_EXPORT static void Normal (const gp_Vec& D1U, const gp_Vec& D1V, const Standard_Real MagTol, CSLib_NormalStatus& theStatus, gp_Dir& Normal);
//! find the first order k0 of deriviative of NUV
//! where: foreach order < k0 all the derivatives of NUV are
//! null all the derivatives of NUV corresponding to the order
//! k0 are collinear and have the same sens.
//! In this case, normal at U,V is unique.
- Standard_EXPORT static void Normal (const Standard_Integer MaxOrder, const TColgp_Array2OfVec& DerNUV, const Standard_Real MagTol, const Standard_Real U, const Standard_Real V, const Standard_Real Umin, const Standard_Real Umax, const Standard_Real Vmin, const Standard_Real Vmax, CSLib_NormalStatus& Status, gp_Dir& Normal, Standard_Integer& OrderU, Standard_Integer& OrderV);
+ Standard_EXPORT static void Normal (const Standard_Integer MaxOrder, const TColgp_Array2OfVec& DerNUV, const Standard_Real MagTol, const Standard_Real U, const Standard_Real V, const Standard_Real Umin, const Standard_Real Umax, const Standard_Real Vmin, const Standard_Real Vmax, CSLib_NormalStatus& theStatus, gp_Dir& Normal, Standard_Integer& OrderU, Standard_Integer& OrderV);
//! -- Computes the derivative of order Nu in the --
//! direction U and Nv in the direction V of the not --
#include <Standard_Real.hxx>
#include <Standard_Boolean.hxx>
#include <Standard_Integer.hxx>
-class TopoDS_Face;
+
class TopoDS_Edge;
class TopoDS_Vertex;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! This class contains the algorithm used to build
//! fillet on planar wire.
#include <GeomAbs_CurveType.hxx>
class TopoDS_Edge;
class ChFiDS_HElSpine;
-class gp_Pnt;
-class gp_Vec;
-class BRepAdaptor_Curve;
class gp_Lin;
class gp_Circ;
class TopoDS_Vertex;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ChFiDS_Spine;
DEFINE_STANDARD_HANDLE(ChFiDS_Spine, MMgt_TShared)
TCollection_AsciiString DNaming::GetEntry (const TopoDS_Shape& Shape,
const Handle(TDF_Data)& DF,
- Standard_Integer& Status)
+ Standard_Integer& theStatus)
{
- Status = 0;
+ theStatus = 0;
//Handle(TNaming_UsedShapes) US;
//DF->Root().FindAttribute(TNaming_UsedShapes::GetID(),US);
Standard_Integer Transdef;
TDF_Label Lab = TNaming_Tool::Label (DF->Root(), Shape,Transdef);
TCollection_AsciiString entry; TDF_Tool::Entry(Lab,entry);
- //Update Status;
+ //Update theStatus;
TNaming_Iterator it(Lab,DF->Transaction());
for (; it.More(); it.Next()) {
- Status++;
- if (Status == 2) break;
+ theStatus++;
+ if (theStatus == 2) break;
}
return entry;
}
Standard_EXPORT static void GetShape (const Standard_CString ShapeEntry, const Handle(TDF_Data)& Data, TopTools_ListOfShape& Shapes);
- //! Status = 0 Not found,
- //! Status = 1 One shape,
- //! Status = 2 More than one shape.
- Standard_EXPORT static TCollection_AsciiString GetEntry (const TopoDS_Shape& Shape, const Handle(TDF_Data)& Data, Standard_Integer& Status);
+ //! theStatus = 0 Not found,
+ //! theStatus = 1 One shape,
+ //! theStatus = 2 More than one shape.
+ Standard_EXPORT static TCollection_AsciiString GetEntry (const TopoDS_Shape& Shape, const Handle(TDF_Data)& Data, Standard_Integer& theStatus);
//! Loads the Shape to DF
Standard_EXPORT static void LoadImportedShape (const TDF_Label& theResultLabel, const TopoDS_Shape& theShape);
//di << 0;
return 0;
}
- Standard_Integer Status ;
- TCollection_AsciiString Name = DNaming::GetEntry(S,ND,Status);
- if (Status == 0) {
+ Standard_Integer aStatus = 0;
+ TCollection_AsciiString Name = DNaming::GetEntry (S, ND, aStatus);
+ if (aStatus == 0) {
di <<"E_NoName";
}
else {
di <<Name.ToCString();
- if (Status == 2) {
+ if (aStatus == 2) {
di <<"Several shapes have the same name\n";
}
}
di <<"E_NoName";
return 0;
}
- Standard_Integer Status ;
-
- TCollection_AsciiString Name = DNaming::GetEntry(S,ND,Status);
- if (Status == 0) {
+ Standard_Integer aStatus = 0;
+ TCollection_AsciiString Name = DNaming::GetEntry (S, ND, aStatus);
+ if (aStatus == 0) {
di <<"E_NoName";
}
else {
di <<Name.ToCString();
- if (Status == 2) {
+ if (aStatus == 2) {
di <<"Several shapes have the same name\n";
}
}
#include <TColgp_HArray1OfPnt2d.hxx>
#include <Standard_Boolean.hxx>
#include <math_Vector.hxx>
-class FairCurve_BattenLaw;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! Energy Criterium to minimize in Batten.
class FairCurve_EnergyOfBatten : public FairCurve_Energy
#include <TColgp_HArray1OfPnt2d.hxx>
#include <Standard_Boolean.hxx>
#include <math_Vector.hxx>
-class Standard_DomainError;
-class FairCurve_BattenLaw;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! Energy Criterium to minimize in MinimalVariationCurve.
class FairCurve_EnergyOfMVC : public FairCurve_Energy
#include <gce_ErrorType.hxx>
#include <Standard_Boolean.hxx>
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! This class implements the common services for
//! all classes of gce which report error.
#include <gce_ErrorType.hxx>
#include <Standard_Boolean.hxx>
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! This class implements the common services for
//! all classes of gce which report error.
Standard_Real tolerance=Precision::Confusion();
Standard_Integer resNbPoles,degree,
ii,jj,
- Status;
+ aStatus;
BS->Knots(BSKnots);
BS->Multiplicities(BSMults);
resFlatKnots,
degree,
resNumPoles,
- Status);
+ aStatus);
BSplCLib::FunctionMultiply(ev,
BS->Degree(),
BSFlatKnots,
resFlatKnots,
degree,
resDenPoles,
- Status);
+ aStatus);
// BSplCLib::FunctionMultiply(law_evaluator,
// BS->Degree(),
// BSFlatKnots,
// resFlatKnots,
// degree,
// resNumPoles,
-// Status);
+// aStatus);
// BSplCLib::FunctionMultiply(law_evaluator,
// BS->Degree(),
// BSFlatKnots,
// resFlatKnots,
// degree,
// resDenPoles,
-// Status);
+// aStatus);
for (ii=1;ii<=resNbPoles;ii++)
for(jj=1;jj<=2;jj++)
resPoles(ii).SetCoord(jj,resNumPoles(ii).Coord(jj)/resDenPoles(ii));
BSplCLib::KnotSequence(KnotC1,KnotC1Mults,FlatKnots);
TColgp_Array1OfPnt2d NewPoles(1,FlatKnots.Length()-(2*Curve1->Degree()+1));
- Standard_Integer Status;
+ Standard_Integer aStatus;
TColStd_Array1OfReal Curve1Weights(1,Curve1->NbPoles());
Curve1->Weights(Curve1Weights);
for (ii=1;ii<=Curve1->NbPoles();ii++)
FlatKnots,
aNewCurveDegree,
NewPoles,
- Status
+ aStatus
);
TColStd_Array1OfReal NewWeights(1,FlatKnots.Length()-(2*Curve1->Degree()+1));
BSplCLib::FunctionReparameterise(ev,
FlatKnots,
aNewCurveDegree,
NewWeights,
- Status
+ aStatus
);
// BSplCLib::FunctionReparameterise(reparameterise_evaluator,
// Curve1->Degree(),
// FlatKnots,
// 2*Curve1->Degree(),
// NewPoles,
-// Status
+// aStatus
// );
// TColStd_Array1OfReal NewWeights(1,FlatKnots.Length()-(2*Curve1->Degree()+1));
// BSplCLib::FunctionReparameterise(reparameterise_evaluator,
// FlatKnots,
// 2*Curve1->Degree(),
// NewWeights,
-// Status
+// aStatus
// );
for (ii=1;ii<=NewPoles.Length();ii++)
for (jj=1;jj<=2;jj++)
BSplCLib::KnotSequence(KnotC1,KnotC1Mults,FlatKnots);
TColgp_Array1OfPnt2d NewPoles(1, FlatKnots.Length() - (aNewCurveDegree + 1));
- Standard_Integer Status;
+ Standard_Integer aStatus;
TColStd_Array1OfReal Curve1Weights(1,Curve1->NbPoles());
Curve1->Weights(Curve1Weights);
for (ii=1;ii<=Curve1->NbPoles();ii++)
FlatKnots,
aNewCurveDegree,
NewPoles,
- Status
+ aStatus
);
TColStd_Array1OfReal NewWeights(1, FlatKnots.Length() - (aNewCurveDegree + 1));
// BSplCLib::FunctionReparameterise(reparameterise_evaluator,
FlatKnots,
aNewCurveDegree,
NewWeights,
- Status
+ aStatus
);
for (ii=1;ii<=NewPoles.Length();ii++) {
for (jj=1;jj<=2;jj++)
#include <TopAbs_Orientation.hxx>
#include <HatchGen_ErrorStatus.hxx>
-class Standard_NoSuchObject;
-class Standard_OutOfRange;
-class StdFail_NotDone;
-class Geom2dHatch_Intersector;
-class Geom2dHatch_Element;
-class Geom2dHatch_Hatching;
class HatchGen_PointOnHatching;
class HatchGen_Domain;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
+
class Geom2dHatch_Hatcher
{
public:
// Purpose : Sets the error status.
//=======================================================================
-void Geom2dHatch_Hatching::Status (const HatchGen_ErrorStatus Status)
+void Geom2dHatch_Hatching::Status (const HatchGen_ErrorStatus theStatus)
{
- myStatus = Status ;
+ myStatus = theStatus;
}
//=======================================================================
#include <HatchGen_Domains.hxx>
#include <Standard_Real.hxx>
#include <Standard_Integer.hxx>
-class Standard_OutOfRange;
-class Geom2dAdaptor_Curve;
-class HatchGen_PointOnHatching;
-class HatchGen_Domain;
-class gp_Pnt2d;
+class gp_Pnt2d;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class Geom2dHatch_Hatching
{
Standard_EXPORT Standard_Boolean IsDone() const;
//! Sets the error status.
- Standard_EXPORT void Status (const HatchGen_ErrorStatus Status);
+ Standard_EXPORT void Status (const HatchGen_ErrorStatus theStatus);
//! Returns the error status.
Standard_EXPORT HatchGen_ErrorStatus Status() const;
Standard_Real tolerance=Precision::PConfusion();
Standard_Integer resNbPoles,degree,
ii,jj,
- Status;
+ aStatus;
BS->Knots(BSKnots); //storage of the two BSpline
BS->Multiplicities(BSMults); //features
resFlatKnots,
degree,
resNumPoles,
- Status);
+ aStatus);
BSplCLib::FunctionMultiply(ev,
BS->Degree(),
resFlatKnots,
degree,
resDenPoles,
- Status);
+ aStatus);
for (ii=1;ii<=resNbPoles;ii++)
for(jj=1;jj<=3;jj++)
resPoles(ii).SetCoord(jj,resNumPoles(ii).Coord(jj)/resDenPoles(ii));
BSplCLib::KnotSequence(KnotC1,KnotC1Mults,FlatKnots);
TColgp_Array1OfPnt NewPoles(1,FlatKnots.Length()-(2*Curve1->Degree()+1));
- Standard_Integer Status;
+ Standard_Integer aStatus;
TColStd_Array1OfReal Curve1Weights(1,Curve1->NbPoles());
Curve1->Weights(Curve1Weights);
for (ii=1;ii<=Curve1->NbPoles();ii++)
FlatKnots,
2*Curve1->Degree(),
NewPoles,
- Status
+ aStatus
);
TColStd_Array1OfReal NewWeights(1,FlatKnots.Length()-(2*Curve1->Degree()+1));
// BSplCLib::FunctionReparameterise(reparameterise_evaluator,
FlatKnots,
2*Curve1->Degree(),
NewWeights,
- Status
+ aStatus
);
for (ii=1;ii<=NewPoles.Length();ii++)
for (jj=1;jj<=3;jj++)
BSplCLib::KnotSequence(KnotC1,KnotC1Mults,FlatKnots);
TColgp_Array1OfPnt NewPoles(1,FlatKnots.Length()-(2*Curve1->Degree()+1));
- Standard_Integer Status;
+ Standard_Integer aStatus;
TColStd_Array1OfReal Curve1Weights(1,Curve1->NbPoles());
Curve1->Weights(Curve1Weights);
for (ii=1;ii<=Curve1->NbPoles();ii++)
FlatKnots,
2*Curve1->Degree(),
NewPoles,
- Status
+ aStatus
);
TColStd_Array1OfReal NewWeights(1,FlatKnots.Length()-(2*Curve1->Degree()+1));
FlatKnots,
2*Curve1->Degree(),
NewWeights,
- Status
+ aStatus
);
for (ii=1;ii<=NewPoles.Length();ii++)
for (jj=1;jj<=3;jj++)
#include <Standard_ShortReal.hxx>
#include <Standard_Real.hxx>
class TopoDS_Edge;
-class HLRAlgo_EdgeStatus;
-class HLRBRep_Curve;
-
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class HLRBRep_EdgeData
{
gp_Pnt P;
gp_Dir Norma;
Standard_Boolean OK;
- CSLib_DerivativeStatus Status;
+ CSLib_DerivativeStatus aStatus;
CSLib_NormalStatus NStat;
myBSurf.D1(Nod1RValues.UV.X(), Nod1RValues.UV.Y(), P, D1U, D1V);
CSLib::Normal(D1U,D1V,Standard_Real(Precision::Angular()),
- Status,Norma);
- if (Status != CSLib_Done) {
+ aStatus,Norma);
+ if (aStatus != CSLib_Done) {
myBSurf.D2(Nod1RValues.UV.X(), Nod1RValues.UV.Y(), P, D1U, D1V, D2U, D2V, D2UV);
CSLib::Normal(D1U,D1V,D2U,D2V,D2UV,
Precision::Angular(),OK,NStat,Norma);
class Interface_InterfaceModel;
class TCollection_AsciiString;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class IGESSelect_SelectSubordinate;
DEFINE_STANDARD_HANDLE(IGESSelect_SelectSubordinate, IFSelect_SelectExtract)
//purpose :
//=======================================================================
Standard_Integer IntAna_IntQuadQuad::PreviousCurve (const Standard_Integer I,
- Standard_Boolean& Opposite) const
+ Standard_Boolean& theOpposite) const
{
if(HasPreviousCurve(I)) {
if(previouscurve[I-1]>0) {
- Opposite = Standard_False;
+ theOpposite = Standard_False;
return(previouscurve[I-1]);
}
else {
- Opposite = Standard_True;
+ theOpposite = Standard_True;
return( - previouscurve[I-1]);
}
}
//purpose :
//=======================================================================
Standard_Integer IntAna_IntQuadQuad::NextCurve (const Standard_Integer I,
- Standard_Boolean& Opposite) const
+ Standard_Boolean& theOpposite) const
{
if(HasNextCurve(I)) {
if(nextcurve[I]>0) {
- Opposite = Standard_False;
+ theOpposite = Standard_False;
return(nextcurve[I-1]);
}
else {
- Opposite = Standard_True;
+ theOpposite = Standard_True;
return( - nextcurve[I-1]);
}
}
//! If HasNextCurve(I) returns True, this function
//! returns the Index J of the curve which has a
- //! common bound with the curve I. If Opposite ==
+ //! common bound with the curve I. If theOpposite ==
//! True , then the last parameter of the curve I, and
//! the last parameter of the curve J give the same
//! point. Else the last parameter of the curve I and
//! the first parameter of the curve J are the same
//! point.
- Standard_EXPORT Standard_Integer NextCurve (const Standard_Integer I, Standard_Boolean& Opposite) const;
+ Standard_EXPORT Standard_Integer NextCurve (const Standard_Integer I, Standard_Boolean& theOpposite) const;
//! Returns True if the Curve I shares its first bound
//! with another curve.
//! if HasPreviousCurve(I) returns True, this function
//! returns the Index J of the curve which has a
- //! common bound with the curve I. If Opposite ==
+ //! common bound with the curve I. If theOpposite ==
//! True , then the first parameter of the curve I,
//! and the first parameter of the curve J give the
//! same point. Else the first parameter of the curve
//! I and the last parameter of the curve J are the
//! same point.
- Standard_EXPORT Standard_Integer PreviousCurve (const Standard_Integer I, Standard_Boolean& Opposite) const;
+ Standard_EXPORT Standard_Integer PreviousCurve (const Standard_Integer I, Standard_Boolean& theOpposite) const;
IntRes2d_Transition T1a,T1b,T2a,T2b;
IntRes2d_Position Pos1a,Pos1b,Pos2a,Pos2b;
- Standard_Boolean Opposite =
+ Standard_Boolean isOpposite =
((Circle1.Location().SquareDistance(Circle2.Location())) > (R1*R1+R2*R2)) ?
Standard_True : Standard_False;
for(i=0; i<NbSolTotal; i++)
{
- Standard_Real C2inf=(Opposite)? SolutionC2[i].Bsup : SolutionC2[i].Binf;
- Standard_Real C2sup=(Opposite)? SolutionC2[i].Binf : SolutionC2[i].Bsup;
+ Standard_Real C2inf = isOpposite ? SolutionC2[i].Bsup : SolutionC2[i].Binf;
+ Standard_Real C2sup = isOpposite ? SolutionC2[i].Binf : SolutionC2[i].Bsup;
Standard_Real C1tinf = SolutionC1[i].Binf, C2tinf = C2inf;
Standard_Real C1inf=NormalizeOnCircleDomain(C1tinf,DomainCirc1);
C2inf=NormalizeOnCircleDomain(C2tinf,DomainCirc2);
//--------------------------------------------------
- if(Opposite)
+ if (isOpposite)
{
if(nbsol!=3)
{
}
IntRes2d_IntersectionPoint NewPoint2(P1b,C1sup,PIpPI-C2sup,T1b,T2b,Standard_False);
- IntRes2d_IntersectionSegment NewSeg(NewPoint1,NewPoint2,
- (Opposite==Standard_True)? Standard_False : Standard_True,
- Standard_False);
+ IntRes2d_IntersectionSegment NewSeg (NewPoint1,NewPoint2, !isOpposite, Standard_False);
Append(NewSeg);
}
else
//--------------------------------------------------
- if(Opposite)
+ if (isOpposite)
{
if(C2inf<C2sup)
C2inf+=PIpPI;
}
IntRes2d_IntersectionPoint NewPoint2(P1b,C1sup,C2sup,T1b,T2b,Standard_False);
- IntRes2d_IntersectionSegment NewSeg(NewPoint1,NewPoint2,Opposite,Standard_False);
+ IntRes2d_IntersectionSegment NewSeg(NewPoint1,NewPoint2,isOpposite,Standard_False);
Append(NewSeg);
}
else
gp_Vec2d Tan2=L2.Direction();
Standard_Real aCosT1T2 = Tan1.Dot(Tan2);
- Standard_Boolean Opposite=(aCosT1T2 < 0.0)? Standard_True : Standard_False;
+ Standard_Boolean isOpposite = (aCosT1T2 < 0.0) ? Standard_True : Standard_False;
done=Standard_True;
Standard_Real U2inf,U2sup;
Standard_Real Res2inf,Res2sup;
- if(Opposite) { U2inf = U1pU2 -Res1sup; U2sup= U1pU2-Res1inf; }
- else { U2inf = Res1inf-U1mU2; U2sup= Res1sup-U1mU2; }
+ if (isOpposite) { U2inf = U1pU2 -Res1sup; U2sup= U1pU2-Res1inf; }
+ else { U2inf = Res1inf-U1mU2; U2sup= Res1sup-U1mU2; }
DomainIntersection(Domain2,U2inf,U2sup,Res2inf,Res2sup,Pos2a,Pos2b);
//-- Attention, les bornes Res1inf(sup) bougent donc il faut
//-- eventuellement recalculer les attributs
- if(Opposite) { Res1inf=U1pU2-Res2sup; Res1sup=U1pU2-Res2inf;
+ if(isOpposite) { Res1inf=U1pU2-Res2sup; Res1sup=U1pU2-Res2inf;
Standard_Real Tampon=Res2inf; Res2inf=Res2sup; Res2sup=Tampon;
IntRes2d_Position Pos=Pos2a; Pos2a=Pos2b; Pos2b=Pos;
}
T2a.SetValue(Standard_False,Pos2a,IntRes2d_Out);
}
else {
- T1a.SetValue(Standard_False,Pos1a,IntRes2d_Unknown,Opposite);
- T2a.SetValue(Standard_False,Pos2a,IntRes2d_Unknown,Opposite);
+ T1a.SetValue (Standard_False, Pos1a, IntRes2d_Unknown, isOpposite);
+ T2a.SetValue (Standard_False, Pos2a, IntRes2d_Unknown, isOpposite);
}
T2b.SetValue(Standard_False,Pos2b,IntRes2d_Out);
}
else {
- T1b.SetValue(Standard_False,Pos1b,IntRes2d_Unknown,Opposite);
- T2b.SetValue(Standard_False,Pos2b,IntRes2d_Unknown,Opposite);
+ T1b.SetValue (Standard_False, Pos1b, IntRes2d_Unknown, isOpposite);
+ T2b.SetValue (Standard_False, Pos2b, IntRes2d_Unknown, isOpposite);
}
gp_Pnt2d Ptdebut;
if(Pos1a==IntRes2d_Middle) {
Standard_Real t3;
- if(Opposite) {
+ if (isOpposite) {
t3 = (Pos2a == IntRes2d_Head)? Res2sup : Res2inf;
}
else {
Res2sup=ElCLib::Parameter(L2,Ptfin);
}
PtSeg2.SetValues(Ptfin,Res1sup,Res2sup,T1b,T2b,Standard_False);
- IntRes2d_IntersectionSegment Segment(PtSeg1,PtSeg2
- ,Opposite,Standard_False);
+ IntRes2d_IntersectionSegment Segment (PtSeg1, PtSeg2, isOpposite, Standard_False);
Append(Segment);
}
else { //-- Extremite(L1 ou L2) ------> Point Middle(L1 et L2)
T2b.SetValue(Standard_False,Pos2b,IntRes2d_Out);
}
else {
- T1b.SetValue(Standard_False,Pos1b,IntRes2d_Unknown,Opposite);
- T2b.SetValue(Standard_False,Pos2b,IntRes2d_Unknown,Opposite);
+ T1b.SetValue (Standard_False, Pos1b, IntRes2d_Unknown, isOpposite);
+ T2b.SetValue (Standard_False, Pos2b, IntRes2d_Unknown, isOpposite);
}
PtSeg2.SetValues(ElCLib::Value(U2,L2),U1,U2,T1b,T2b,Standard_False);
if((Abs(Res1inf-U1) >LongMiniSeg) && (Abs(Res2inf-U2) >LongMiniSeg)) {
- IntRes2d_IntersectionSegment Segment(PtSeg1,PtSeg2,Opposite,Standard_False);
+ IntRes2d_IntersectionSegment Segment (PtSeg1, PtSeg2, isOpposite, Standard_False);
Append(Segment);
}
else {
gp_Pnt2d Ptfin;
if(Pos1b==IntRes2d_Middle) {
Standard_Real t2;
- if(Opposite) {
+ if (isOpposite) {
t2 = (Pos2b == IntRes2d_Head)? Res2sup : Res2inf;
}
else {
T2b.SetValue(Standard_False,Pos2b,IntRes2d_Out);
}
else {
- T1b.SetValue(Standard_False,Pos1b,IntRes2d_Unknown,Opposite);
- T2b.SetValue(Standard_False,Pos2b,IntRes2d_Unknown,Opposite);
+ T1b.SetValue (Standard_False, Pos1b, IntRes2d_Unknown, isOpposite);
+ T2b.SetValue (Standard_False, Pos2b, IntRes2d_Unknown, isOpposite);
}
PtSeg2.SetValues(Ptfin,Res1sup,Res2sup,T1b,T2b,Standard_False);
Append(PtSeg2);
T2b.SetValue(Standard_False,Pos2b,IntRes2d_Out);
}
else {
- T1b.SetValue(Standard_False,Pos1b,IntRes2d_Unknown,Opposite);
- T2b.SetValue(Standard_False,Pos2b,IntRes2d_Unknown,Opposite);
+ T1b.SetValue (Standard_False, Pos1b, IntRes2d_Unknown, isOpposite);
+ T2b.SetValue (Standard_False, Pos2b, IntRes2d_Unknown, isOpposite);
}
PtSeg1.SetValues(ElCLib::Value(U2,L2),U1,U2,T1b,T2b,Standard_False);
Append(PtSeg1);
T2b.SetValue(Standard_False,Pos2b,IntRes2d_Out);
}
else {
- T1b.SetValue(Standard_False,Pos1b,IntRes2d_Unknown,Opposite);
- T2b.SetValue(Standard_False,Pos2b,IntRes2d_Unknown,Opposite);
+ T1b.SetValue (Standard_False, Pos1b, IntRes2d_Unknown, isOpposite);
+ T2b.SetValue (Standard_False, Pos2b, IntRes2d_Unknown, isOpposite);
}
//~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//~~ Ajustement des parametres et du point renvoye
||(Abs(U2-Res2sup)>LongMiniSeg)) {
//-- Modif du 1er Octobre 92 (Pour Composites)
- IntRes2d_IntersectionSegment Segment(PtSeg1,PtSeg2
- ,Opposite,Standard_False);
+ IntRes2d_IntersectionSegment Segment (PtSeg1, PtSeg2, isOpposite, Standard_False);
Append(Segment);
}
else {
//== 1 : L1 borne
if(Domain1.HasFirstPoint()) ResHasFirstPoint=1;
if(Domain1.HasLastPoint()) ResHasLastPoint=1;
- if(Opposite) {
+ if (isOpposite) {
if(Domain2.HasLastPoint()) ResHasFirstPoint+=2;
if(Domain2.HasFirstPoint()) ResHasLastPoint+=2;
}
}
if(ResHasFirstPoint==0 && ResHasLastPoint==0) {
//~~~~ Creation d un segment infini avec Opposite
- Append(IntRes2d_IntersectionSegment(Opposite));
+ Append (IntRes2d_IntersectionSegment (isOpposite));
}
else { //-- On obtient au pire une demi-droite
switch(ResHasFirstPoint) {
case 1:
ParamStart=Domain1.FirstParameter();
- ParamStart2=(Opposite)? (Org2SurL1-ParamStart)
- :(ParamStart-Org2SurL1);
+ ParamStart2 = isOpposite ? (Org2SurL1 - ParamStart) : (ParamStart - Org2SurL1);
break;
case 2:
- if(Opposite) {
+ if (isOpposite) {
ParamStart2=Domain2.LastParameter();
ParamStart=Org2SurL1 - ParamStart2;
}
}
break;
case 3:
- if(Opposite) {
+ if (isOpposite) {
ParamStart2=Domain2.LastParameter();
ParamStart=Org2SurL1 - ParamStart2;
if(ParamStart < Domain1.FirstParameter()) {
switch(ResHasLastPoint) {
case 1:
ParamEnd=Domain1.LastParameter();
- ParamEnd2=(Opposite)? (Org2SurL1-ParamEnd)
- :(ParamEnd-Org2SurL1);
+ ParamEnd2 = isOpposite ? (Org2SurL1 - ParamEnd) : (ParamEnd - Org2SurL1);
break;
case 2:
- if(Opposite) {
+ if (isOpposite) {
ParamEnd2=Domain2.FirstParameter();
ParamEnd=Org2SurL1 - ParamEnd2;
}
}
break;
case 3:
- if(Opposite) {
+ if (isOpposite) {
ParamEnd2=Domain2.FirstParameter();
ParamEnd=Org2SurL1 - ParamEnd2;
if(ParamEnd > Domain1.LastParameter()) {
IntRes2d_Position Pos1,Pos2;
Pos1=FindPositionLL(ParamStart,Domain1);
Pos2=FindPositionLL(ParamStart2,Domain2);
- Tinf.SetValue(Standard_True,Pos1,IntRes2d_Unknown,Opposite);
- Tsup.SetValue(Standard_True,Pos2,IntRes2d_Unknown,Opposite);
+ Tinf.SetValue (Standard_True, Pos1, IntRes2d_Unknown, isOpposite);
+ Tsup.SetValue (Standard_True, Pos2, IntRes2d_Unknown, isOpposite);
IntRes2d_IntersectionPoint P1(ElCLib::Value(ParamStart,L1)
,ParamStart,ParamStart2
,Tinf,Tsup,Standard_False);
//~~~ Le segment est assez long
Pos1=FindPositionLL(ParamEnd,Domain1);
Pos2=FindPositionLL(ParamEnd2,Domain2);
- Tinf.SetValue(Standard_True,Pos1,IntRes2d_Unknown,Opposite);
- Tsup.SetValue(Standard_True,Pos2,IntRes2d_Unknown,Opposite);
+ Tinf.SetValue (Standard_True, Pos1, IntRes2d_Unknown, isOpposite);
+ Tsup.SetValue (Standard_True, Pos2, IntRes2d_Unknown, isOpposite);
IntRes2d_IntersectionPoint P2(ElCLib::Value(ParamEnd,L1)
,ParamEnd,ParamEnd2
,Tinf,Tsup,Standard_False);
- IntRes2d_IntersectionSegment Seg(P1,P2,Opposite,Standard_False);
+ IntRes2d_IntersectionSegment Seg (P1, P2, isOpposite, Standard_False);
Append(Seg);
}
else { //~~~~ le segment est de longueur inferieure a Tol
//~~~ Creation de la demi droite |----------->
IntRes2d_Position Pos1=FindPositionLL(ParamStart,Domain1);
IntRes2d_Position Pos2=FindPositionLL(ParamStart2,Domain2);
- Tinf.SetValue(Standard_True,Pos1,IntRes2d_Unknown,Opposite);
- Tsup.SetValue(Standard_True,Pos2,IntRes2d_Unknown,Opposite);
+ Tinf.SetValue (Standard_True, Pos1, IntRes2d_Unknown, isOpposite);
+ Tsup.SetValue (Standard_True, Pos2, IntRes2d_Unknown, isOpposite);
IntRes2d_IntersectionPoint P(ElCLib::Value(ParamStart,L1)
,ParamStart,ParamStart2
,Tinf,Tsup,Standard_False);
- IntRes2d_IntersectionSegment Seg(P,Standard_True,Opposite,Standard_False);
+ IntRes2d_IntersectionSegment Seg (P, Standard_True, isOpposite, Standard_False);
Append(Seg);
}
}
else {
IntRes2d_Position Pos1=FindPositionLL(ParamEnd,Domain1);
IntRes2d_Position Pos2=FindPositionLL(ParamEnd2,Domain2);
- Tinf.SetValue(Standard_True,Pos1,IntRes2d_Unknown,Opposite);
- Tsup.SetValue(Standard_True,Pos2,IntRes2d_Unknown,Opposite);
+ Tinf.SetValue (Standard_True, Pos1, IntRes2d_Unknown, isOpposite);
+ Tsup.SetValue (Standard_True, Pos2, IntRes2d_Unknown, isOpposite);
IntRes2d_IntersectionPoint P2(ElCLib::Value(ParamEnd,L1)
,ParamEnd,ParamEnd2
,Tinf,Tsup,Standard_False);
- IntRes2d_IntersectionSegment Seg(P2,Standard_False,Opposite,Standard_False);
+ IntRes2d_IntersectionSegment Seg (P2, Standard_False, isOpposite, Standard_False);
Append(Seg);
//~~~ Creation de la demi droite <-----------|
}
ElCLib::CircleD1(SolutionCircle[0].Binf,CircleAxis,R,P1a,Tan1);
ElCLib::LineD1(SolutionLine[0].Binf,LineAxis,P2a,Tan2);
- Standard_Boolean Opposite=((Tan1.Dot(Tan2))<0.0)? Standard_True : Standard_False;
+ Standard_Boolean isOpposite = (Tan1.Dot (Tan2) < 0.0);
for(i=0; i<NbSolTotal; i++ ) {
//-- Fin 7 aout 97
- Standard_Real Linf=(Opposite)? SolutionLine[i].Bsup : SolutionLine[i].Binf;
- Standard_Real Lsup=(Opposite)? SolutionLine[i].Binf : SolutionLine[i].Bsup;
+ Standard_Real Linf = isOpposite ? SolutionLine[i].Bsup : SolutionLine[i].Binf;
+ Standard_Real Lsup = isOpposite ? SolutionLine[i].Binf : SolutionLine[i].Bsup;
//---------------------------------------------------------------
//-- Si les parametres sur le cercle sont en premier
|| (T1a.TransitionType() != T2a.TransitionType())) {
//-- Verifier egalement les transitions
- IntRes2d_IntersectionSegment NewSeg(NewPoint1,NewPoint2
- ,Opposite,ReversedParameters());
+ IntRes2d_IntersectionSegment NewSeg (NewPoint1, NewPoint2, isOpposite, ReversedParameters());
Append(NewSeg);
}
else {
Standard_Real v = _Puv.Y();
Standard_Real uu = u;
Standard_Real vv = v;
- TopAbs_State Status = TopAbs_UNKNOWN;
+ TopAbs_State aStatus = TopAbs_UNKNOWN;
Handle(BRepAdaptor_HSurface) surf = new BRepAdaptor_HSurface();
surf->ChangeSurface().Initialize( Face, Standard_False );
bUseClassifier = Standard_True;
}
else {
- Status = (dedans == 1) ? TopAbs_IN : TopAbs_OUT;
+ aStatus = (dedans == 1) ? TopAbs_IN : TopAbs_OUT;
}
} // if(TabOrien(1)!=-1) {
//compute state of the point using face classifier
//
BRepClass_FaceClassifier aClassifier;
aClassifier.Perform(Face,Puv,aFCTol);
- Status = aClassifier.State();
+ aStatus = aClassifier.State();
}
if (!RecadreOnPeriodic || (!IsUPer && !IsVPer))
- return Status;
+ return aStatus;
- if (Status == TopAbs_IN || Status == TopAbs_ON)
- return Status;
+ if (aStatus == TopAbs_IN || aStatus == TopAbs_ON)
+ return aStatus;
if (!urecadre){
u = uu;
u = uu;
if (v > Vmax || !IsVPer) {
- return Status;
+ return aStatus;
}
}
} //while (1)
const Standard_Boolean IsVPer = surf->IsVPeriodic();
const Standard_Real uperiod = IsUPer ? surf->UPeriod() : 0.0;
const Standard_Real vperiod = IsVPer ? surf->VPeriod() : 0.0;
- TopAbs_State Status = TopAbs_UNKNOWN;
+ TopAbs_State aStatus = TopAbs_UNKNOWN;
Standard_Boolean urecadre = Standard_False, vrecadre = Standard_False;
Standard_Integer dedans = 1;
}
}
if(dedans==0) {
- Status = TopAbs_ON;
+ aStatus = TopAbs_ON;
}
if(dedans == 1) {
- Status = TopAbs_IN;
+ aStatus = TopAbs_IN;
}
if(dedans == -1) {
- Status = TopAbs_OUT;
+ aStatus = TopAbs_OUT;
}
}
else { //-- TabOrien(1)=-1 Wrong Wire
BRepClass_FaceClassifier aClassifier;
aClassifier.Perform(Face,Puv,Tol);
- Status = aClassifier.State();
+ aStatus = aClassifier.State();
}
if (!RecadreOnPeriodic || (!IsUPer && !IsVPer))
- return Status;
- if (Status == TopAbs_IN || Status == TopAbs_ON)
- return Status;
+ return aStatus;
+ if (aStatus == TopAbs_IN || aStatus == TopAbs_ON)
+ return aStatus;
if (!urecadre)
{
u = uu;
if (v > Vmax || !IsVPer)
- return Status;
+ return aStatus;
}
} //for (;;)
}
Handle(IntWalk_TheIWLine) CurrentLine; // line under construction
Standard_Boolean Tgtend;
- IntWalk_StatusDeflection Status, StatusPrecedent;
+ IntWalk_StatusDeflection aStatus, StatusPrecedent;
Standard_Integer NbDivision;
// number of divisions of step for each section
}
}
}
- Status = TestDeflection(Func, Arrive, UVap, StatusPrecedent,
+ aStatus = TestDeflection(Func, Arrive, UVap, StatusPrecedent,
NbDivision,PasC,StepSign);
- StatusPrecedent = Status;
- if (Status == IntWalk_PasTropGrand) {
+ StatusPrecedent = aStatus;
+ if (aStatus == IntWalk_PasTropGrand) {
Arrive = Standard_False;
ArretAjout = Standard_False;
Tgtend = Standard_False; // jag 940615
else if (ArretAjout || Cadre) {
Arrive = Standard_True;
CurrentLine->AddStatusLast(Standard_False);
- //if (Status != IntWalk_ArretSurPointPrecedent)
+ //if (aStatus != IntWalk_ArretSurPointPrecedent)
CurrentLine->AddPoint(Psol);
//Remove <SaveN> from <seqAlone>
for (Standard_Integer iseq = 1; iseq <= seqAlone.Length(); iseq++)
seqAjout.Append(lines.Length()+1);
}
}
- else if (Status == IntWalk_ArretSurPointPrecedent) {
+ else if (aStatus == IntWalk_ArretSurPointPrecedent) {
if (CurrentLine->NbPoints() == 1) { //cancel the line
Arrive = Standard_False;
break;
}
else if (Arrive) {
if (CurrentLine->NbPoints() == 1 && // cancel the line
- (N == I || Status == IntWalk_PointConfondu) ) {
+ (N == I || aStatus == IntWalk_PointConfondu) ) {
// if N == I the main uv is probably lost
// or the point is a point of accumulation
// if point is confused the start data is bad
// if (etat1N < 11) { // passing point that is a stop
if (Abs(etat1N) < 11) { // passing point that is a stop
// modified by NIZHNY-MKK Thu Nov 2 15:12:11 2000.END
- if (Status == IntWalk_ArretSurPoint) {
+ if (aStatus == IntWalk_ArretSurPoint) {
CurrentLine->AddStatusLast(Standard_False);
Tgtend = Standard_True; // need check
}
// modified by NIZHNY-MKK Fri Oct 27 12:45:33 2000.END
}
}
- else if (Status == IntWalk_ArretSurPoint) {
+ else if (aStatus == IntWalk_ArretSurPoint) {
Arrive = Standard_True;
CurrentLine->AddStatusLast(Standard_False);
Tgtend = Standard_True;
seqAlone.Append(lines.Length() + 1);
seqAjout.Append(lines.Length() + 1);
}
- else if (Status == IntWalk_OK) {
+ else if (aStatus == IntWalk_OK) {
MakeWalkingPoint(2, UVap(1), UVap(2), Func, previousPoint);
previousd3d = Func.Direction3d();
previousd2d = Func.Direction2d();
CurrentLine->AddPoint(previousPoint);
}
- else if (Status == IntWalk_PointConfondu)
+ else if (aStatus == IntWalk_PointConfondu)
{
aNbIter --;
}
Standard_Integer StepSign;
- IntWalk_StatusDeflection Status = IntWalk_OK, StatusPrecedent;
+ IntWalk_StatusDeflection aStatus = IntWalk_OK, StatusPrecedent;
Standard_Integer NbDivision ; // number of divisions of step
// during calculation of 1 section
Standard_Real aScaleCoeff = 0.0;
// Avoid finite cycle which lead to stop computing iline.
- if (Status != IntWalk_PasTropGrand)
+ if (aStatus != IntWalk_PasTropGrand)
{
// Make linear extrapolation.
if ( Abs(uv[aCoordIdx - 1] - uvprev[aCoordIdx - 1]) > gp::Resolution())
Arrive = (wd2[I].etat == 12); // the line is open
}
}
- Status = TestDeflection(Func, Arrive,Uvap,StatusPrecedent,
+ aStatus = TestDeflection(Func, Arrive,Uvap,StatusPrecedent,
NbDivision,PasC,StepSign);
- StatusPrecedent = Status;
- if (Status == IntWalk_PasTropGrand) {// division of the step
+ StatusPrecedent = aStatus;
+ if (aStatus == IntWalk_PasTropGrand) {// division of the step
Arrive = Standard_False;
ArretAjout = Standard_False;
Tgtend = Standard_False; // jag 940616
if (Arrive) { // line s is open
CurrentLine->AddStatusLast(Standard_False);
- //if (Status != IntWalk_ArretSurPointPrecedent)
+ //if (aStatus != IntWalk_ArretSurPointPrecedent)
CurrentLine->AddPoint(Psol);
//Remove <SaveN> from <seqAlone> and, if it is first found point,
StepSign = -1;
StatusPrecedent = IntWalk_OK;
PasC = PasSav;
- if (Status == IntWalk_ArretSurPointPrecedent) {
+ if (aStatus == IntWalk_ArretSurPointPrecedent) {
CurrentLine->AddPoint(Psol);
OpenLine(0,Psol,Pnts1,Func,CurrentLine);
}
}
}
}
- else if ( Status == IntWalk_ArretSurPointPrecedent) {
+ else if (aStatus == IntWalk_ArretSurPointPrecedent) {
if (CurrentLine->NbPoints() == 1) { //cancel the line
Arrive = Standard_False;
RemoveTwoEndPoints(I);
AddPointInCurrentLine(N,PathPnt,CurrentLine);
}
}
- else if (Status == IntWalk_ArretSurPoint) {
+ else if (aStatus == IntWalk_ArretSurPoint) {
if (wd2[I].etat >12) { //line should become open
wd2[I].etat = 12; //declare it open
Tgtbeg = Standard_True;
}
}
}
- else if (Status == IntWalk_OK) {
+ else if (aStatus == IntWalk_OK) {
if (Ipass!=0) CurrentLine->AddIndexPassing(Ipass);
previousPoint.SetValue(Func.Point(),reversed,Uvap(1),Uvap(2));
previousd3d = Func.Direction3d();
previousd2d = Func.Direction2d();
CurrentLine->AddPoint(previousPoint);
}
- else if (Status == IntWalk_PointConfondu)
+ else if (aStatus == IntWalk_PointConfondu)
{
aNbIter --;
}
//11) calculate the step of advancement depending on the vector
//12) adjust the step depending on the previous steps
- IntWalk_StatusDeflection Status = IntWalk_OK;
+ IntWalk_StatusDeflection aStatus = IntWalk_OK;
//---------------------------------------------------------------------------------
//-- lbr le 4 Avril 95 : it is possible that the status returns points confused
//if ((++NbPointsConfondusConsecutifs < 10) && (Norme <= epsilon)) { // the square is already taken in the constructor
if ((Norme <= epsilon) && ((Duv <= aTol) || (StatusPrecedent != IntWalk_OK)))
{ // the square is already taken in the constructor
- Status = IntWalk_PointConfondu;
+ aStatus = IntWalk_PointConfondu;
if (StatusPrecedent == IntWalk_PasTropGrand) {
return IntWalk_ArretSurPointPrecedent;
}
if (Cosi*StepSign >= 0.) {// angle 3d <= pi/2 !!!!
const Standard_Real aDiv = previousd3d.SquareMagnitude()*Norme;
if(aDiv == 0)
- return Status;
+ return aStatus;
Cosi2 = Cosi * Cosi / aDiv;
}
if (Cosi2 < CosRef3D) { //angle 3d too great
Standard_Real StepU = Abs(Step*previousd2d.X()),
StepV = Abs(Step*previousd2d.Y());
if (StepU < tolerance(1) && StepV < tolerance(2))
- Status = IntWalk_ArretSurPointPrecedent;
+ aStatus = IntWalk_ArretSurPointPrecedent;
else
- Status = IntWalk_PasTropGrand;
- return Status;
+ aStatus = IntWalk_PasTropGrand;
+ return aStatus;
}
}
Standard_Real Cosi = StepSign * (Du * previousd2d.X() + Dv * previousd2d.Y());
- if (Cosi < 0 && Status == IntWalk_PointConfondu)
+ if (Cosi < 0 && aStatus == IntWalk_PointConfondu)
return IntWalk_ArretSurPointPrecedent; // leave as step back
// with confused point
//if during routing one has subdivided more than MaxDivision for each
//previous step, bug on the square; do nothing (experience U4)
- if ((NbDivision < MaxDivision) && (Status != IntWalk_PointConfondu) &&
+ if ((NbDivision < MaxDivision) && (aStatus != IntWalk_PointConfondu) &&
(StatusPrecedent!= IntWalk_PointConfondu))
{
Standard_Real Cosi2 = Cosi * Cosi / Duv;
StepV = Abs(Step*previousd2d.Y());
if (StepU < tolerance(1) && StepV < tolerance(2))
- Status = IntWalk_ArretSurPointPrecedent;
+ aStatus = IntWalk_ArretSurPointPrecedent;
else
- Status = IntWalk_PasTropGrand;
+ aStatus = IntWalk_PasTropGrand;
NbDivision = NbDivision + 1;
- return Status;
+ return aStatus;
}
Cosi = Corde * sp.Direction3d();
Standard_Real StepU = Abs(Step*previousd2d.X()),
StepV = Abs(Step*previousd2d.Y());
if (StepU < tolerance(1) && StepV < tolerance(2))
- Status = IntWalk_ArretSurPoint;
+ aStatus = IntWalk_ArretSurPoint;
else
- Status = IntWalk_PasTropGrand;
- return Status;
+ aStatus = IntWalk_PasTropGrand;
+ return aStatus;
}
Cosi = Du * sp.Direction2d().X() +
Dv * sp.Direction2d().Y();
Standard_Real StepU = Abs(Step*previousd2d.X()),
StepV = Abs(Step*previousd2d.Y());
if (StepU < tolerance(1) && StepV < tolerance(2))
- Status = IntWalk_ArretSurPointPrecedent;
+ aStatus = IntWalk_ArretSurPointPrecedent;
else
- Status = IntWalk_PasTropGrand;
- return Status;
+ aStatus = IntWalk_PasTropGrand;
+ return aStatus;
}
}
if (!Finished) {
- if (Status == IntWalk_PointConfondu)
+ if (aStatus == IntWalk_PointConfondu)
{
Standard_Real StepU = Min(Abs(1.5 * Du),pas*(UM-Um)),
StepV = Min(Abs(1.5 * Dv),pas*(VM-Vm));
StepV = Abs(Step*previousd2d.Y());
if (StepU < tolerance(1) && StepV < tolerance(2))
- Status = IntWalk_ArretSurPointPrecedent;
+ aStatus = IntWalk_ArretSurPointPrecedent;
else
- Status = IntWalk_PasTropGrand;
+ aStatus = IntWalk_PasTropGrand;
}
else
{
}
}
}
- return Status;
+ return aStatus;
}
-
-
-
-
AddAPoint(line,previousPoint);
//
- IntWalk_StatusDeflection Status = IntWalk_OK, aPrevStatus = IntWalk_OK;
+ IntWalk_StatusDeflection aStatus = IntWalk_OK, aPrevStatus = IntWalk_OK;
Standard_Boolean NoTestDeflection = Standard_False;
Standard_Real SvParam[4], f;
Standard_Integer LevelOfEmptyInmyIntersectionOn2S=0;
Arrive = Standard_False;
while(!Arrive) //010
{
- aPrevStatus = Status;
+ aPrevStatus = aStatus;
LevelOfIterWithoutAppend++;
if(LevelOfIterWithoutAppend>20)
anAbsParamDist[1] < ResoV1 &&
anAbsParamDist[2] < ResoU2 &&
anAbsParamDist[3] < ResoV2 &&
- Status != IntWalk_PasTropGrand)
+ aStatus != IntWalk_PasTropGrand)
{
isBadPoint = Standard_True;
aBestIso = IntImp_ConstIsoparametric((aBestIso + 1) % 4);
LevelOfEmptyInmyIntersectionOn2S=0;
if(LevelOfIterWithoutAppend < 10)
{
- Status = TestDeflection(ChoixIso);
+ aStatus = TestDeflection(ChoixIso);
}
else
{
//============================================================
if(LevelOfPointConfondu > 5)
{
- Status = IntWalk_ArretSurPoint;
+ aStatus = IntWalk_ArretSurPoint;
LevelOfPointConfondu = 0;
}
//
- if(Status==IntWalk_OK)
+ if(aStatus==IntWalk_OK)
{
NbPasOKConseq++;
if(NbPasOKConseq >= 5)
}
while(pastroppetit);
}
- }//Status==IntWalk_OK
+ }//aStatus==IntWalk_OK
else
NbPasOKConseq=0;
//
- switch(Status)//007
+ switch(aStatus)//007
{
case IntWalk_ArretSurPointPrecedent:
{
// JMB 30th December 1999.
// Some statement below should not be put in comment because they are useful.
// See grid CTO 909 A1 which infinitely loops
- if(Arrive==Standard_False && Status==IntWalk_ArretSurPoint)
+ if(Arrive==Standard_False && aStatus==IntWalk_ArretSurPoint)
{
Arrive=Standard_True;
#ifdef OCCT_DEBUG
}//pointisvalid
//====================================================
- if(Status == IntWalk_ArretSurPoint)
+ if (aStatus == IntWalk_ArretSurPoint)
{
RepartirOuDiviser(DejaReparti,ChoixIso,Arrive);
}
}//$$$ end framing on border (!close)
}//004 fin TestArret return Arrive = True
} // 006case IntWalk_ArretSurPoint: end Processing Status = OK or ArretSurPoint
- } //007 switch(Status)
+ } //007 switch(aStatus)
} //008 end processing point (TEST DEFLECTION)
} //009 end processing line (else if myIntersectionOn2S.IsDone())
} //010 end if first departure point allows marching while (!Arrive)
Standard_Boolean bStop = !myIntersectionOn2S.IsTangent();
Standard_Integer dIncKey = 1;
TColStd_Array1OfReal Param(1,4);
- IntWalk_StatusDeflection Status = IntWalk_OK;
+ IntWalk_StatusDeflection aStatus = IntWalk_OK;
Standard_Integer nbIterWithoutAppend = 0;
Standard_Integer nbEqualPoints = 0;
Standard_Integer parit = 0;
return bOutOfTangentZone;
}
- Status = TestDeflection(ChoixIso);
+ aStatus = TestDeflection(ChoixIso);
- if(Status == IntWalk_OK) {
+ if(aStatus == IntWalk_OK) {
for(uvit = 0; uvit < 4; uvit++) {
if(pasuv[uvit] < pasInit[uvit]) {
}
}
- switch(Status) {
+ switch(aStatus) {
case IntWalk_ArretSurPointPrecedent:
{
bStop = Standard_True;
}
if(!bExtendLine) {
- // if(Status == IntWalk_OK || Status == IntWalk_ArretSurPoint) {
- if(Status == IntWalk_OK) {
+ // if(aStatus == IntWalk_OK || aStatus == IntWalk_ArretSurPoint) {
+ if(aStatus == IntWalk_OK) {
bExtendLine = Standard_True;
if(aSeqOfNewPoint.Length() > 1) {
STATIC_BLOCAGE_SUR_PAS_TROP_GRAND=STATIC_PRECEDENT_INFLEXION=0;
}
- IntWalk_StatusDeflection Status = IntWalk_OK;
+ IntWalk_StatusDeflection aStatus = IntWalk_OK;
Standard_Real FlecheCourante , Ratio = 1.0;
// Caro1 and Caro2
pasuv[choixIso] = pasInit[choixIso] = 2*LocalResol;
}
////////////////////////////////////////
- Status = IntWalk_PointConfondu;
+ aStatus = IntWalk_PointConfondu;
}
//==================================================================================
//== N o t T o o G r e a t (angle in space UV) ==
//== C h a n g e o f s i d e ==
//==================================================================================
- if (Status != IntWalk_PointConfondu) {
+ if (aStatus != IntWalk_PointConfondu) {
if(Cosi1*Cosi1 < CosRef1*Duv1 || Cosi2*Cosi2 < CosRef2*Duv2) {
pasuv[0]*=0.5; pasuv[1]*=0.5; pasuv[2]*=0.5; pasuv[3]*=0.5;
if (pasuv[0]<ResoU1 && pasuv[1]<ResoV1 && pasuv[2]<ResoU2 && pasuv[3]<ResoV2) {
return IntWalk_PasTropGrand;
}
}
- if(Status == IntWalk_OK) {
+ if(aStatus == IntWalk_OK) {
STATIC_BLOCAGE_SUR_PAS_TROP_GRAND=0;
//-- Try to increase the step
}
- return Status;
+ return aStatus;
}
else { //-- CurrentVector > vector*0.5
if (FlecheCourante > fleche) { //-- Current step too Great
}
}
- if(Status != IntWalk_PointConfondu)
+ if(aStatus != IntWalk_PointConfondu)
{
//Here, aCosBetweenTangent >= 0.0 definitely.
if(aSinB2Max >= 0.0 && (aCosBetweenTangent <= 2.0 * aSinB2Max * aSinB2Max - 1.0))
{//Real deflection is greater or equal than tolconf
- Status = IntWalk_PasTropGrand;
+ aStatus = IntWalk_PasTropGrand;
}
else
{//Real deflection is less than tolconf
if((aSinB2Min < 0.0) || (aCosBetweenTangent >= 2.0 * aSinB2Min * aSinB2Min - 1.0))
{//Real deflection is less than tolconf/2.0
- Status = IntWalk_StepTooSmall;
+ aStatus = IntWalk_StepTooSmall;
}
}
- if(Status == IntWalk_PasTropGrand)
+ if(aStatus == IntWalk_PasTropGrand)
{
pasuv[0]*=0.5; pasuv[1]*=0.5; pasuv[2]*=0.5; pasuv[3]*=0.5;
- return Status;
+ return aStatus;
}
- if(Status == IntWalk_StepTooSmall)
+ if(aStatus == IntWalk_StepTooSmall)
{
pasuv[0] = Max(pasuv[0], AbsDu1);
pasuv[1] = Max(pasuv[1], AbsDv1);
pasInit[2] = Max(pasInit[2], AbsDu2);
pasInit[3] = Max(pasInit[3], AbsDv2);
- return Status;
+ return aStatus;
}
}
pasuv[2] = Max(myStepMin[2],Min(Min(Ratio*AbsDu2,pasuv[2]),pasInit[2]));
pasuv[3] = Max(myStepMin[3],Min(Min(Ratio*AbsDv2,pasuv[3]),pasInit[3]));
- if(Status == IntWalk_OK) STATIC_BLOCAGE_SUR_PAS_TROP_GRAND=0;
- return Status;
+ if(aStatus == IntWalk_OK) STATIC_BLOCAGE_SUR_PAS_TROP_GRAND=0;
+ return aStatus;
}
Standard_Boolean IntWalk_PWalking::
class TCollection_HAsciiString;
class Message_Messenger;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class Interface_Check;
DEFINE_STANDARD_HANDLE(Interface_Check, MMgt_TShared)
class Standard_Transient;
class Message_Messenger;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! Result of a Check operation (especially from InterfaceModel)
class Interface_CheckIterator
#include <Interface_BitMap.hxx>
#include <Interface_InterfaceModel.hxx>
-#include <TCollection_AsciiString.hxx>
+#include <TCollection_HAsciiString.hxx>
#include <TColStd_HArray1OfInteger.hxx>
#include <TColStd_HArray1OfListOfInteger.hxx>
#include <TColStd_HSequenceOfTransient.hxx>
-class Interface_InterfaceModel;
class Standard_DomainError;
class Interface_GeneralLib;
class Interface_Protocol;
class Interface_GTool;
class Standard_Transient;
-class Interface_BitMap;
class Interface_EntityIterator;
-class TCollection_HAsciiString;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! Gives basic data structure for operating and storing
//! graph results (usage is normally internal)
#include <stdio.h>
// exclude modern definitions and system-provided glext.h, should be defined before gl.h inclusion
-#define GL_GLEXT_LEGACY
-#define GLX_GLXEXT_LEGACY
+#ifndef GL_GLEXT_LEGACY
+ #define GL_GLEXT_LEGACY
+#endif
+#ifndef GLX_GLXEXT_LEGACY
+ #define GLX_GLXEXT_LEGACY
+#endif
#include <X11/Xlib.h>
#include <X11/Xutil.h>
#include <X11/Xatom.h>
#include <GL/glx.h>
-// workaround name conflicts with OCCT methods (in class TopoDS_Shape for example)
-#ifdef Convex
- #undef Convex
-#endif
-#ifdef Status
- #undef Status
-#endif
-#ifdef Opposite
- #undef Opposite
-#endif
-
#endif
#endif // __INTERFACE_GRAPHIC_HXX
const Standard_Real linTol,
const Standard_Integer Derivative,
Standard_Integer& Order,
- LProp_Status& Status)
+ LProp_Status& theStatus)
{
Standard_Real Tol = linTol * linTol;
gp_Vec V[2];
if(V[Derivative].SquareMagnitude() > Tol)
{
- Status = LProp_Defined;
+ theStatus = LProp_Defined;
return Standard_True;
}
}//if(cn >= Order)
else
{
- Status = LProp_Undefined;
+ theStatus = LProp_Undefined;
return Standard_False;
}
}
// status = UnDecided
// first try the standard computation of the normal.
- CSLib_DerivativeStatus Status;
- CSLib::Normal(myD1u, myD1v, myLinTol, Status, myNormal);
- if (Status == CSLib_Done )
+ CSLib_DerivativeStatus aStatus = CSLib_Done;
+ CSLib::Normal(myD1u, myD1v, myLinTol, aStatus, myNormal);
+ if (aStatus == CSLib_Done)
{
myNormalStatus = LProp_Computed;
return Standard_True;
gp_Dir Nor;
gp_Pnt P;
Standard_Real U, V;
- CSLib_DerivativeStatus Status;
+ CSLib_DerivativeStatus aStatus;
CSLib_NormalStatus NStat;
Standard_Real x, y, z;
Standard_Integer n1, n2, n3;
V = UVNodes(i).Y();
BS.D1(U,V,P,D1U,D1V);
- CSLib::Normal(D1U,D1V,Precision::Angular(),Status,Nor);
- if (Status != CSLib_Done) {
+ CSLib::Normal (D1U, D1V, Precision::Angular(), aStatus, Nor);
+ if (aStatus != CSLib_Done) {
BS.D2(U,V,P,D1U,D1V,D2U,D2V,D2UV);
CSLib::Normal(D1U,D1V,D2U,D2V,D2UV,Precision::Angular(),OK,NStat,Nor);
}
class TCollection_AsciiString;
class TCollection_ExtendedString;
+// resolve name collisions with WinAPI headers
+#ifdef AddPrinter
+ #undef AddPrinter
+#endif
class Message_Messenger;
DEFINE_STANDARD_HANDLE(Message_Messenger, MMgt_TShared)
#endif
#include <windows.h>
-#ifdef SetCurrentDirectory
-# undef SetCurrentDirectory /* undefine SetCurrentDirectory from <winbase.h> to correctly include <OSD_Process.hxx> */
-#endif
#include <OSD_Process.hxx>
#include <OSD_Path.hxx>
class Quantity_Date;
class OSD_Path;
+// undefine SetCurrentDirectory that can be #defined by previous inclusion of windows.h
+#ifdef SetCurrentDirectory
+# undef SetCurrentDirectory
+#endif
//! A set of system process tools
class OSD_Process
#endif
// exclude modern definitions and system-provided glext.h, should be defined before gl.h inclusion
-#define GL_GLEXT_LEGACY
-#define GLX_GLXEXT_LEGACY
+#ifndef GL_GLEXT_LEGACY
+ #define GL_GLEXT_LEGACY
+#endif
+#ifndef GLX_GLXEXT_LEGACY
+ #define GLX_GLXEXT_LEGACY
+#endif
// include main OpenGL header provided with system
#if defined(__APPLE__)
Standard_Real goodY = Draw::Atof(argv[4]);
Standard_Real goodZ = Draw::Atof(argv[5]);
Standard_Real percent = Draw::Atof(argv[6]);
- Standard_Boolean Status = Standard_False;
+ Standard_Boolean aStatus = Standard_False;
// Find the first vertex of the wire
BRepTools_WireExplorer wire_exp(myTopoDSWire);
deltaY = delta_percent(FirstEdgeY, goodY);
deltaZ = delta_percent(FirstEdgeZ, goodZ);
if (deltaX <= percent && deltaY <= percent && deltaZ <= percent) {
- Status = Standard_True;
+ aStatus = Standard_True;
}
}
}
}
di << "\n\nFirstEdge = " << FirstEdgeX <<" " << FirstEdgeY <<" " << FirstEdgeZ << "\n";
di << "deltaX = " << deltaX << " deltaY = " << deltaY << " deltaZ = " << deltaZ << "\n";
- if (Status) {
+ if (aStatus) {
di << argv[0] << " : OK\n";
} else {
di << argv[0] << " : ERROR\n";
// The test is based of occupying of all available virtual memory.
// Obviously it has no sense on 64-bit platforms.
- enum Status
+ enum AllocTestStatus
{
NotApplicable = 0x1,
OUMCatchOK = 0x2,
TCollection_AsciiString QADNaming::GetEntry (const TopoDS_Shape& Shape,
const Handle(TDF_Data)& DF,
- Standard_Integer& Status)
+ Standard_Integer& theStatus)
{
- Status = 0;
+ theStatus = 0;
//Handle(TNaming_UsedShapes) US;
//DF->Root().FindAttribute(TNaming_UsedShapes::GetID(),US);
Standard_Integer Transdef;
TDF_Label Lab = TNaming_Tool::Label (DF->Root(), Shape,Transdef);
TCollection_AsciiString entry; TDF_Tool::Entry(Lab,entry);
- //Update Status;
+ //Update theStatus;
TNaming_Iterator it(Lab,DF->Transaction());
for (; it.More(); it.Next()) {
- Status++;
- if (Status == 2) break;
+ theStatus++;
+ if (theStatus == 2) break;
}
return entry;
}
Standard_EXPORT static void GetShape (const Standard_CString ShapeEntry, const Handle(TDF_Data)& Data, TopTools_ListOfShape& Shapes);
- //! Status = 0 Not found,
- //! Status = 1 One shape,
- //! Status = 2 More than one shape.
- Standard_EXPORT static TCollection_AsciiString GetEntry (const TopoDS_Shape& Shape, const Handle(TDF_Data)& Data, Standard_Integer& Status);
+ //! theStatus = 0 Not found,
+ //! theStatus = 1 One shape,
+ //! theStatus = 2 More than one shape.
+ Standard_EXPORT static TCollection_AsciiString GetEntry (const TopoDS_Shape& Shape, const Handle(TDF_Data)& Data, Standard_Integer& theStatus);
//! returns label by first two arguments (df and entry string)
Standard_EXPORT static Standard_Boolean Entry (const Standard_Address theArguments, TDF_Label& theLabel);
di << 0;
return 0;
}
- Standard_Integer Status ;
- TCollection_AsciiString Name = QADNaming::GetEntry(S,ND,Status);
- if (Status == 0) {
+ Standard_Integer aStatus = 0;
+ TCollection_AsciiString Name = QADNaming::GetEntry (S, ND, aStatus);
+ if (aStatus == 0) {
di <<"E_NoName";
}
else {
di <<Name.ToCString();
- if (Status == 2) {
+ if (aStatus == 2) {
di <<"Several shapes have the same name\n";
}
}
di <<"E_NoName";
return 0;
}
- Standard_Integer Status ;
-
- TCollection_AsciiString Name = QADNaming::GetEntry(S,ND,Status);
- if (Status == 0) {
+ Standard_Integer aStatus = 0;
+ TCollection_AsciiString Name = QADNaming::GetEntry (S, ND, aStatus);
+ if (aStatus == 0) {
di <<"E_NoName";
}
else {
di <<Name.ToCString();
- if (Status == 2) {
+ if (aStatus == 2) {
di <<"Several shapes have the same name\n";
}
}
TCollection_AsciiString aFilePath(dir);
OSD_Path anOSDPath(aFilePath);
OSD_Directory Dir = anOSDPath;
- Standard_Boolean Status = Standard_True;
+ Standard_Boolean aStatus = Standard_True;
if ( !Dir.Exists() ) {
{
try {
Dir.Build(OSD_Protection(OSD_RX, OSD_RWXD, OSD_RX, OSD_RX));
}
catch (Standard_Failure) {
- Status = Standard_False;
+ aStatus = Standard_False;
}
}
- Status = Status && !Dir.Failed();
- if (!Status) {
+ aStatus = aStatus && !Dir.Failed();
+ if (!aStatus) {
if (myVerbose)
cout << "Resource Manager: Error opening or creating directory \"" << aFilePath
<< "\". Permission denied. Cannot save resources." << endl;
OSD_File File = anOSDPath;
OSD_Protection theProt;
- Status = Standard_True;
+ aStatus = Standard_True;
{
try {
OCC_CATCH_SIGNALS
File.Build(OSD_ReadWrite, theProt);
}
catch (Standard_Failure) {
- Status = Standard_False;
+ aStatus = Standard_False;
}
}
- Status = Status && !File.Failed();
- if (!Status) {
+ aStatus = aStatus && !File.Failed();
+ if (!aStatus) {
if (myVerbose)
cout << "Resource Manager: Error opening or creating file \"" << aFilePath
<< "\". Permission denied. Cannot save resources." << endl;
class SelectMgr_EntityOwner;
class SelectBasics_SensitiveEntity;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
typedef NCollection_DataMap<Handle(SelectMgr_SelectableObject), Handle(SelectMgr_SensitiveEntitySet) > SelectMgr_MapOfObjectSensitives;
typedef NCollection_DataMap<Handle(SelectMgr_SelectableObject), Handle(SelectMgr_SensitiveEntitySet) >::Iterator SelectMgr_MapOfObjectSensitivesIterator;
Standard_Boolean ContWire(Standard_Integer nbWire)
{ return myList.Contains(nbWire); }
- inline Standard_Boolean LastCheckStatus (const ShapeExtend_Status Status) const
- { return ShapeExtend::DecodeStatus ( myStatus, Status ); }
+ inline Standard_Boolean LastCheckStatus (const ShapeExtend_Status theStatus) const
+ { return ShapeExtend::DecodeStatus ( myStatus, theStatus ); }
Standard_Boolean Reject (const Bnd_Box& theBnd) const;
Standard_Boolean Accept (const Standard_Integer &);
class TopoDS_Edge;
class TopoDS_Compound;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! Analysis of the face size
class ShapeAnalysis_CheckSmallFace
class gp_Pnt;
class Adaptor3d_Curve;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! Tool for analyzing the edge.
//! Queries geometrical representations of the edge (3d curve, pcurve
class ShapeExtend_WireData;
class ShapeAnalysis_Surface;
class TopoDS_Wire;
-class TopoDS_Face;
class Geom_Surface;
class TopLoc_Location;
class ShapeAnalysis_WireOrder;
class TopoDS_Shape;
class TopoDS_Edge;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeAnalysis_Wire;
DEFINE_STANDARD_HANDLE(ShapeAnalysis_Wire, MMgt_TShared)
class gp_XYZ;
class gp_XY;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! This class is intended to control and, if possible, redefine
//! the order of a list of edges which define a wire
class TopoDS_Wire;
class gp_XYZ;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! Analyzes and records status of vertices in a Wire
//!
#include <ShapeExtend_Status.hxx>
class TopoDS_Shape;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeBuild_ReShape;
DEFINE_STANDARD_HANDLE(ShapeBuild_ReShape, BRepTools_ReShape)
//purpose :
//=======================================================================
- Standard_Boolean ShapeConstruct_ProjectCurveOnSurface::Status (const ShapeExtend_Status Status) const
+ Standard_Boolean ShapeConstruct_ProjectCurveOnSurface::Status (const ShapeExtend_Status theStatus) const
{
- return ShapeExtend::DecodeStatus (myStatus, Status);
+ return ShapeExtend::DecodeStatus (myStatus, theStatus);
}
//=======================================================================
class Geom_Surface;
class Geom_Curve;
class Geom2d_Curve;
-class gp_Pnt2d;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeConstruct_ProjectCurveOnSurface;
DEFINE_STANDARD_HANDLE(ShapeConstruct_ProjectCurveOnSurface, MMgt_TShared)
Standard_EXPORT Standard_Integer& AdjustOverDegenMode();
//! Returns the status of last Peform
- Standard_EXPORT Standard_Boolean Status (const ShapeExtend_Status Status) const;
+ Standard_EXPORT Standard_Boolean Status (const ShapeExtend_Status theStatus) const;
//! Computes the projection of 3d curve onto a surface using the
//! specialized algorithm. Returns False if projector fails,
#include <TopTools_SequenceOfShape.hxx>
class ShapeExtend_CompositeSurface;
class ShapeAnalysis_TransferParameters;
-class TopLoc_Location;
-class TopoDS_Face;
-class TopoDS_Shape;
class ShapeExtend_WireData;
class gp_Lin2d;
class ShapeFix_WireSegment;
class Geom_Surface;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeFix_ComposeShell;
DEFINE_STANDARD_HANDLE(ShapeFix_ComposeShell, ShapeFix_Root)
class ShapeAnalysis_Surface;
class ShapeBuild_ReShape;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
+
class ShapeFix_Edge;
DEFINE_STANDARD_HANDLE(ShapeFix_Edge, MMgt_TShared)
#include <ShapeExtend_Status.hxx>
class ShapeAnalysis_Surface;
class ShapeFix_Wire;
-class TopoDS_Face;
class Geom_Surface;
class ShapeExtend_BasicMsgRegistrator;
class TopoDS_Wire;
class ShapeExtend_WireData;
class TopoDS_Vertex;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeFix_Face;
DEFINE_STANDARD_HANDLE(ShapeFix_Face, ShapeFix_Root)
#include <Message_ProgressIndicator.hxx>
class ShapeFix_Solid;
-class TopoDS_Shape;
class Message_ProgressIndicator;
class ShapeFix_Shell;
class ShapeFix_Face;
class ShapeFix_Edge;
class ShapeExtend_BasicMsgRegistrator;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeFix_Shape;
DEFINE_STANDARD_HANDLE(ShapeFix_Shape, ShapeFix_Root)
#include <ShapeExtend_Status.hxx>
class ShapeFix_Face;
-class TopoDS_Shell;
-class TopoDS_Shape;
-class TopoDS_Compound;
class ShapeExtend_BasicMsgRegistrator;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
+
class ShapeFix_Shell;
DEFINE_STANDARD_HANDLE(ShapeFix_Shell, ShapeFix_Root)
class TopoDS_Solid;
class Message_ProgressIndicator;
class TopoDS_Shell;
-class TopoDS_Shape;
class ShapeExtend_BasicMsgRegistrator;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeFix_Solid;
DEFINE_STANDARD_HANDLE(ShapeFix_Solid, ShapeFix_Root)
#include <Standard_Type.hxx>
#include <TopoDS_Face.hxx>
-#include <TopoDS_Shape.hxx>
#include <Standard_Boolean.hxx>
#include <Standard_Integer.hxx>
#include <ShapeUpgrade_Tool.hxx>
#include <ShapeExtend_Status.hxx>
class ShapeUpgrade_SplitSurface;
class ShapeUpgrade_WireDivide;
-class TopoDS_Face;
-class TopoDS_Shape;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeUpgrade_FaceDivide;
DEFINE_STANDARD_HANDLE(ShapeUpgrade_FaceDivide, ShapeUpgrade_Tool)
#include <ShapeExtend_Status.hxx>
class ShapeUpgrade_SplitCurve3d;
class ShapeUpgrade_SplitCurve2d;
-class TopoDS_Edge;
-class TopoDS_Face;
class Geom_Curve;
class Geom2d_Curve;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeUpgrade_FixSmallCurves;
DEFINE_STANDARD_HANDLE(ShapeUpgrade_FixSmallCurves, ShapeUpgrade_Tool)
#include <Standard_Integer.hxx>
#include <ShapeUpgrade_Tool.hxx>
#include <ShapeExtend_Status.hxx>
-class TopoDS_Shape;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeUpgrade_RemoveInternalWires;
DEFINE_STANDARD_HANDLE(ShapeUpgrade_RemoveInternalWires, ShapeUpgrade_Tool)
class ShapeUpgrade_FaceDivide;
class ShapeBuild_ReShape;
class ShapeExtend_BasicMsgRegistrator;
-class TopoDS_Shape;
class Message_Msg;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! Divides a all faces in shell with given criteria Shell.
class ShapeUpgrade_ShapeDivide
#include <Standard_Boolean.hxx>
#include <ShapeExtend_Status.hxx>
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeUpgrade_SplitCurve;
DEFINE_STANDARD_HANDLE(ShapeUpgrade_SplitCurve, MMgt_TShared)
class Geom_Surface;
class ShapeExtend_CompositeSurface;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeUpgrade_SplitSurface;
DEFINE_STANDARD_HANDLE(ShapeUpgrade_SplitSurface, MMgt_TShared)
class ShapeUpgrade_EdgeDivide;
class ShapeAnalysis_TransferParameters;
class ShapeUpgrade_FixSmallCurves;
-class TopoDS_Wire;
-class TopoDS_Face;
class Geom_Surface;
class TopoDS_Edge;
class TopLoc_Location;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class ShapeUpgrade_WireDivide;
DEFINE_STANDARD_HANDLE(ShapeUpgrade_WireDivide, ShapeUpgrade_Tool)
class TCollection_HAsciiString;
class StepBasic_ApplicationContext;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class StepBasic_ApplicationProtocolDefinition;
DEFINE_STANDARD_HANDLE(StepBasic_ApplicationProtocolDefinition, MMgt_TShared)
class StepBasic_ApprovalStatus;
class TCollection_HAsciiString;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class StepBasic_Approval;
DEFINE_STANDARD_HANDLE(StepBasic_Approval, MMgt_TShared)
gp_Vec D2U,D2V,D2UV;
gp_Pnt P;
Standard_Real U, V;
- CSLib_DerivativeStatus Status;
+ CSLib_DerivativeStatus aStatus;
CSLib_NormalStatus NStat;
S.Initialize(aFace, Standard_False);
const TColgp_Array1OfPnt2d& UVNodes = T->UVNodes();
U = UVNodes(i).X();
V = UVNodes(i).Y();
S.D1(U,V,P,D1U,D1V);
- CSLib::Normal(D1U,D1V,Precision::Angular(),Status,Nor(i));
- if (Status != CSLib_Done) {
+ CSLib::Normal (D1U, D1V, Precision::Angular(), aStatus, Nor (i));
+ if (aStatus != CSLib_Done) {
S.D2(U,V,P,D1U,D1V,D2U,D2V,D2UV);
CSLib::Normal(D1U,D1V,D2U,D2V,D2UV,Precision::Angular(),OK,NStat,Nor(i));
}
U = UVNodes(UVNodes.Lower()).X();
V = UVNodes(UVNodes.Lower()).Y();
S.D1(U,V,P,D1U,D1V);
- CSLib::Normal(D1U,D1V,Precision::Angular(),Status,NPlane);
- if (Status != CSLib_Done) {
+ CSLib::Normal (D1U, D1V, Precision::Angular(), aStatus, NPlane);
+ if (aStatus != CSLib_Done) {
S.D2(U,V,P,D1U,D1V,D2U,D2V,D2UV);
CSLib::Normal(D1U,D1V,D2U,D2V,D2UV,Precision::Angular(),OK,NStat,NPlane);
}
for ( ;It.More() ; It.Next()) {
const TopoDS_Shape& OS = It.OldShape();
const TopoDS_Shape& NS = It.NewShape();
- TNaming_Evolution Status = It.Evolution();
+ TNaming_Evolution aStatus = It.Evolution();
// Modification_1 24.06.99 (szy)
TopoDS_Shape copOS, copNS;
- if(Status != TNaming_PRIMITIVE)
+ if(aStatus != TNaming_PRIMITIVE)
TNaming_CopyShape::CopyTool(OS, Tab->TransientTable(), copOS);
else copOS.Nullify();
- if(Status != TNaming_DELETE )
+ if(aStatus != TNaming_DELETE )
TNaming_CopyShape::CopyTool(NS, Tab->TransientTable(), copNS);
else copNS.Nullify();
- switch (Status) {
+ switch (aStatus) {
case TNaming_PRIMITIVE :
{
B.Generated(copNS);
class TopOpeBRep_Hctxff2d;
class TopOpeBRep_Hctxee2d;
class TopOpeBRep_EdgesIntersector;
-class IntRes2d_IntersectionPoint;
-class TopoDS_Vertex;
-class TopOpeBRepDS_Transition;
-class gp_Pnt;
-class gp_Pnt2d;
-
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class TopOpeBRep_Point2d
{
TopOpeBRepBuild_fctwes.cxx
TopOpeBRepBuild_ffsfs.cxx
TopOpeBRepBuild_ffwesk.cxx
-TopOpeBRepBuild_Fill.hxx
+TopOpeBRepBuild_Fill.pxx
TopOpeBRepBuild_FREGU.cxx
TopOpeBRepBuild_FuseFace.cxx
TopOpeBRepBuild_FuseFace.hxx
TopOpeBRepBuild_SplitEdge.hxx
TopOpeBRepBuild_SplitFace.hxx
TopOpeBRepBuild_SplitShapes.hxx
-TopOpeBRepBuild_SplitSolid.hxx
+TopOpeBRepBuild_SplitSolid.pxx
TopOpeBRepBuild_SREGU.cxx
TopOpeBRepBuild_Tools.cxx
TopOpeBRepBuild_Tools.hxx
static Standard_Integer STATIC_SOLIDINDEX = 0;
#include <TopOpeBRepBuild_SplitEdge.hxx>
#include <TopOpeBRepBuild_SplitFace.hxx>
-#include <TopOpeBRepBuild_SplitSolid.hxx>
+#include "TopOpeBRepBuild_SplitSolid.pxx"
#include <TopOpeBRepBuild_SplitShapes.hxx>
-#include <TopOpeBRepBuild_Fill.hxx>
+#include "TopOpeBRepBuild_Fill.pxx"
Standard_EXPORT TopOpeBRepBuild_Builder* GLOBAL_PBUILDER;
class TopOpeBRepDS_HDataStructure;
class Standard_NoSuchObject;
class TopOpeBRepBuild_HBuilder;
-class TopOpeBRepDS_BuildTool;
-class TopoDS_Shape;
class TopOpeBRepTool_ShapeExplorer;
class TopOpeBRepBuild_ShapeSet;
class TopOpeBRepBuild_EdgeBuilder;
class TopOpeBRepDS_SurfaceIterator;
class TopOpeBRepDS_CurveIterator;
class TopoDS_Vertex;
-class TopoDS_Edge;
class gp_Pnt;
-class TopoDS_Face;
-class TCollection_AsciiString;
+// resolve name collisions with X11 headers
+#ifdef FillSolid
+ #undef FillSolid
+#endif
//! The Builder algorithm constructs topological
//! objects from an existing topology and new
+++ /dev/null
-// Created on: 1993-06-14
-// Created by: Jean Yves LEBEY
-// Copyright (c) 1993-1999 Matra Datavision
-// Copyright (c) 1999-2014 OPEN CASCADE SAS
-//
-// This file is part of Open CASCADE Technology software library.
-//
-// This library is free software; you can redistribute it and/or modify it under
-// the terms of the GNU Lesser General Public License version 2.1 as published
-// by the Free Software Foundation, with special exception defined in the file
-// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
-// distribution for complete text of the license and disclaimer of any warranty.
-//
-// Alternatively, this file may be used under the terms of Open CASCADE
-// commercial license or contractual agreement.
-
-#ifndef _TopOpeBRepBuild_Fill_HeaderFile
-#define _TopOpeBRepBuild_Fill_HeaderFile
-
-//=======================================================================
-//function : FillShape
-//purpose :
-//=======================================================================
-void TopOpeBRepBuild_Builder::FillShape(const TopoDS_Shape& S1,
- const TopAbs_State ToBuild1,
- const TopTools_ListOfShape& LS2,
- const TopAbs_State ToBuild2,
- TopOpeBRepBuild_ShapeSet& aSet,
- const Standard_Boolean In_RevOri)
-{
- Standard_Boolean RevOri = In_RevOri;
- TopAbs_ShapeEnum t = S1.ShapeType();
- TopAbs_ShapeEnum t1=TopAbs_COMPOUND,t11=TopAbs_COMPOUND;
-
- if (t == TopAbs_FACE ) {
- t1 = TopAbs_WIRE;
- t11 = TopAbs_EDGE;
- }
- else if (t == TopAbs_SOLID || t == TopAbs_SHELL) {
- t1 = TopAbs_SHELL;
- t11 = TopAbs_FACE;
- }
-
- // if the shape S1 is a SameDomain one, get its orientation compared
- // with the shape taken as reference for all of the SameDomain shape of S1.
- Standard_Boolean hsd = myDataStructure->HasSameDomain(S1);
- if (hsd) {
- TopOpeBRepDS_Config ssc = myDataStructure->SameDomainOrientation(S1);
- if ( ssc == TopOpeBRepDS_DIFFORIENTED ) {
- RevOri = ! RevOri;
-#ifdef OCCT_DEBUG
-// Standard_Integer iFace = myDataStructure->Shape(S1);
-// cout<<endl<<"********** ";
-// cout<<"retournement d'orientation de ";TopAbs::Print(t,cout);
-// cout<<" "<<iFace<<endl;
-#endif
- }
- }
-
- // work on a FORWARD shape <aShape>
- TopoDS_Shape aShape = S1;
- myBuildTool.Orientation(aShape,TopAbs_FORWARD);
-
- TopoDS_Shape aSubShape;
- TopAbs_Orientation newori;
-
- // Explore the SubShapes of type <t1>
- for (TopOpeBRepTool_ShapeExplorer ex1(aShape,t1); ex1.More(); ex1.Next()) {
- aSubShape = ex1.Current();
-
- if ( ! myDataStructure->HasShape(aSubShape) ) {
- // SubShape is not in DS : classify it with shapes of LS2
- Standard_Boolean keep = KeepShape(aSubShape,LS2,ToBuild1);
- if (keep) {
- newori = Orient(myBuildTool.Orientation(aSubShape),RevOri);
- myBuildTool.Orientation(aSubShape,newori);
- aSet.AddShape(aSubShape);
- }
- }
- else {
- // SubShape has geometry : split the <t11> SubShapes of the SubShape
- TopOpeBRepTool_ShapeExplorer ex11(aSubShape,t11);
- SplitShapes(ex11,ToBuild1,ToBuild2,aSet,RevOri);
- }
- } // exploration ot SubShapes of type <t1> of shape <S1>
-
-} // FillShape
-
-
-//=======================================================================
-//function : FillFace
-//purpose :
-//=======================================================================
-void TopOpeBRepBuild_Builder::FillFace(const TopoDS_Shape& F1,
- const TopAbs_State ToBuild1,
- const TopTools_ListOfShape& LF2,
- const TopAbs_State ToBuild2,
- TopOpeBRepBuild_WireEdgeSet& WES,
- const Standard_Boolean RevOri)
-{
-#ifdef OCCT_DEBUG
- Standard_Boolean tSPF = TopOpeBRepBuild_GettraceSPF();
-// Standard_Integer iFace = myDataStructure->Shape(F1);
- if(tSPF){cout<<endl;}
- if(tSPF){GdumpSHASTA(F1,ToBuild1,"=-= FillFace ");}
-#endif
- myListOfFace = LF2;
- FillShape(F1,ToBuild1,LF2,ToBuild2,WES,RevOri);
- myListOfFace.Clear();
-} // FillFace
-
-
-//=======================================================================
-//function : FillSolid
-//purpose : load shells and faces from the solid in the ShellFaceSet <aSet>
-//=======================================================================
-void TopOpeBRepBuild_Builder::FillSolid(const TopoDS_Shape& S1,
- const TopAbs_State ToBuild1,
- const TopTools_ListOfShape& LS2,
- const TopAbs_State ToBuild2,
- TopOpeBRepBuild_ShapeSet& aSet,
- const Standard_Boolean RevOri)
-{
- FillShape(S1,ToBuild1,LS2,ToBuild2,aSet,RevOri);
-} // FillSolid
-
-
-//=======================================================================
-//function : FillVertexSet
-//purpose : private
-//=======================================================================
-void TopOpeBRepBuild_Builder::FillVertexSet(TopOpeBRepDS_PointIterator& IT,
- const TopAbs_State ToBuild,
- TopOpeBRepBuild_PaveSet& PVS) const
-{
- for (; IT.More(); IT.Next()) {
- FillVertexSetOnValue(IT,ToBuild,PVS);
- }
-}
-
-
-//=======================================================================
-//function : FillVertexSetOnValue
-//purpose : private
-//=======================================================================
-void TopOpeBRepBuild_Builder::FillVertexSetOnValue
-(const TopOpeBRepDS_PointIterator& IT,
- const TopAbs_State ToBuild,
- TopOpeBRepBuild_PaveSet& PVS) const
-{
- TopoDS_Shape V;
-
- // ind = index of new point or existing vertex
- Standard_Integer ind = IT.Current();
- Standard_Boolean ispoint = IT.IsPoint();
- //**!
- //if (ispoint) V = NewVertex(ind);
- if (ispoint && ind <= myDataStructure->NbPoints()) V = NewVertex(ind);
- //**!
- else V = myDataStructure->Shape(ind);
- Standard_Real par = IT.Parameter();
- TopAbs_Orientation ori = IT.Orientation(ToBuild);
-
- Standard_Boolean keep = Standard_True;
- // if (ori==TopAbs_EXTERNAL || ori==TopAbs_INTERNAL) keep = Standard_False;
-
- if ( keep ) {
- myBuildTool.Orientation(V,ori);
- Handle(TopOpeBRepBuild_Pave) PV = new TopOpeBRepBuild_Pave(V,par,Standard_False);
- PVS.Append(PV);
- }
-
-#ifdef OCCT_DEBUG
- const TopoDS_Edge& EDEB = PVS.Edge();
- Standard_Integer iE; Standard_Boolean tSPS = GtraceSPS(EDEB,iE);
- if (tSPS) {
- if (keep) cout<<"+"; else cout<<"-";
- if (ispoint) cout<<" PDS "; else cout<<" VDS ";
- cout<<ind<<" : "; GdumpORIPARPNT(ori,par,BRep_Tool::Pnt(TopoDS::Vertex(V)));
- cout<<endl;
- }
-#endif
-}
-
-//#ifndef _TopOpeBRepBuild_Fill_HeaderFile
-#endif
--- /dev/null
+// Created on: 1993-06-14
+// Created by: Jean Yves LEBEY
+// Copyright (c) 1993-1999 Matra Datavision
+// Copyright (c) 1999-2014 OPEN CASCADE SAS
+//
+// This file is part of Open CASCADE Technology software library.
+//
+// This library is free software; you can redistribute it and/or modify it under
+// the terms of the GNU Lesser General Public License version 2.1 as published
+// by the Free Software Foundation, with special exception defined in the file
+// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
+// distribution for complete text of the license and disclaimer of any warranty.
+//
+// Alternatively, this file may be used under the terms of Open CASCADE
+// commercial license or contractual agreement.
+
+#ifndef _TopOpeBRepBuild_Fill_HeaderFile
+#define _TopOpeBRepBuild_Fill_HeaderFile
+
+//=======================================================================
+//function : FillShape
+//purpose :
+//=======================================================================
+void TopOpeBRepBuild_Builder::FillShape(const TopoDS_Shape& S1,
+ const TopAbs_State ToBuild1,
+ const TopTools_ListOfShape& LS2,
+ const TopAbs_State ToBuild2,
+ TopOpeBRepBuild_ShapeSet& aSet,
+ const Standard_Boolean In_RevOri)
+{
+ Standard_Boolean RevOri = In_RevOri;
+ TopAbs_ShapeEnum t = S1.ShapeType();
+ TopAbs_ShapeEnum t1=TopAbs_COMPOUND,t11=TopAbs_COMPOUND;
+
+ if (t == TopAbs_FACE ) {
+ t1 = TopAbs_WIRE;
+ t11 = TopAbs_EDGE;
+ }
+ else if (t == TopAbs_SOLID || t == TopAbs_SHELL) {
+ t1 = TopAbs_SHELL;
+ t11 = TopAbs_FACE;
+ }
+
+ // if the shape S1 is a SameDomain one, get its orientation compared
+ // with the shape taken as reference for all of the SameDomain shape of S1.
+ Standard_Boolean hsd = myDataStructure->HasSameDomain(S1);
+ if (hsd) {
+ TopOpeBRepDS_Config ssc = myDataStructure->SameDomainOrientation(S1);
+ if ( ssc == TopOpeBRepDS_DIFFORIENTED ) {
+ RevOri = ! RevOri;
+#ifdef OCCT_DEBUG
+// Standard_Integer iFace = myDataStructure->Shape(S1);
+// cout<<endl<<"********** ";
+// cout<<"retournement d'orientation de ";TopAbs::Print(t,cout);
+// cout<<" "<<iFace<<endl;
+#endif
+ }
+ }
+
+ // work on a FORWARD shape <aShape>
+ TopoDS_Shape aShape = S1;
+ myBuildTool.Orientation(aShape,TopAbs_FORWARD);
+
+ TopoDS_Shape aSubShape;
+ TopAbs_Orientation newori;
+
+ // Explore the SubShapes of type <t1>
+ for (TopOpeBRepTool_ShapeExplorer ex1(aShape,t1); ex1.More(); ex1.Next()) {
+ aSubShape = ex1.Current();
+
+ if ( ! myDataStructure->HasShape(aSubShape) ) {
+ // SubShape is not in DS : classify it with shapes of LS2
+ Standard_Boolean keep = KeepShape(aSubShape,LS2,ToBuild1);
+ if (keep) {
+ newori = Orient(myBuildTool.Orientation(aSubShape),RevOri);
+ myBuildTool.Orientation(aSubShape,newori);
+ aSet.AddShape(aSubShape);
+ }
+ }
+ else {
+ // SubShape has geometry : split the <t11> SubShapes of the SubShape
+ TopOpeBRepTool_ShapeExplorer ex11(aSubShape,t11);
+ SplitShapes(ex11,ToBuild1,ToBuild2,aSet,RevOri);
+ }
+ } // exploration ot SubShapes of type <t1> of shape <S1>
+
+} // FillShape
+
+
+//=======================================================================
+//function : FillFace
+//purpose :
+//=======================================================================
+void TopOpeBRepBuild_Builder::FillFace(const TopoDS_Shape& F1,
+ const TopAbs_State ToBuild1,
+ const TopTools_ListOfShape& LF2,
+ const TopAbs_State ToBuild2,
+ TopOpeBRepBuild_WireEdgeSet& WES,
+ const Standard_Boolean RevOri)
+{
+#ifdef OCCT_DEBUG
+ Standard_Boolean tSPF = TopOpeBRepBuild_GettraceSPF();
+// Standard_Integer iFace = myDataStructure->Shape(F1);
+ if(tSPF){cout<<endl;}
+ if(tSPF){GdumpSHASTA(F1,ToBuild1,"=-= FillFace ");}
+#endif
+ myListOfFace = LF2;
+ FillShape(F1,ToBuild1,LF2,ToBuild2,WES,RevOri);
+ myListOfFace.Clear();
+} // FillFace
+
+
+//=======================================================================
+//function : FillSolid
+//purpose : load shells and faces from the solid in the ShellFaceSet <aSet>
+//=======================================================================
+void TopOpeBRepBuild_Builder::FillSolid(const TopoDS_Shape& S1,
+ const TopAbs_State ToBuild1,
+ const TopTools_ListOfShape& LS2,
+ const TopAbs_State ToBuild2,
+ TopOpeBRepBuild_ShapeSet& aSet,
+ const Standard_Boolean RevOri)
+{
+ FillShape(S1,ToBuild1,LS2,ToBuild2,aSet,RevOri);
+} // FillSolid
+
+
+//=======================================================================
+//function : FillVertexSet
+//purpose : private
+//=======================================================================
+void TopOpeBRepBuild_Builder::FillVertexSet(TopOpeBRepDS_PointIterator& IT,
+ const TopAbs_State ToBuild,
+ TopOpeBRepBuild_PaveSet& PVS) const
+{
+ for (; IT.More(); IT.Next()) {
+ FillVertexSetOnValue(IT,ToBuild,PVS);
+ }
+}
+
+
+//=======================================================================
+//function : FillVertexSetOnValue
+//purpose : private
+//=======================================================================
+void TopOpeBRepBuild_Builder::FillVertexSetOnValue
+(const TopOpeBRepDS_PointIterator& IT,
+ const TopAbs_State ToBuild,
+ TopOpeBRepBuild_PaveSet& PVS) const
+{
+ TopoDS_Shape V;
+
+ // ind = index of new point or existing vertex
+ Standard_Integer ind = IT.Current();
+ Standard_Boolean ispoint = IT.IsPoint();
+ //**!
+ //if (ispoint) V = NewVertex(ind);
+ if (ispoint && ind <= myDataStructure->NbPoints()) V = NewVertex(ind);
+ //**!
+ else V = myDataStructure->Shape(ind);
+ Standard_Real par = IT.Parameter();
+ TopAbs_Orientation ori = IT.Orientation(ToBuild);
+
+ Standard_Boolean keep = Standard_True;
+ // if (ori==TopAbs_EXTERNAL || ori==TopAbs_INTERNAL) keep = Standard_False;
+
+ if ( keep ) {
+ myBuildTool.Orientation(V,ori);
+ Handle(TopOpeBRepBuild_Pave) PV = new TopOpeBRepBuild_Pave(V,par,Standard_False);
+ PVS.Append(PV);
+ }
+
+#ifdef OCCT_DEBUG
+ const TopoDS_Edge& EDEB = PVS.Edge();
+ Standard_Integer iE; Standard_Boolean tSPS = GtraceSPS(EDEB,iE);
+ if (tSPS) {
+ if (keep) cout<<"+"; else cout<<"-";
+ if (ispoint) cout<<" PDS "; else cout<<" VDS ";
+ cout<<ind<<" : "; GdumpORIPARPNT(ori,par,BRep_Tool::Pnt(TopoDS::Vertex(V)));
+ cout<<endl;
+ }
+#endif
+}
+
+//#ifndef _TopOpeBRepBuild_Fill_HeaderFile
+#endif
+++ /dev/null
-// Created on: 1995-09-12
-// Created by: Jean Yves LEBEY
-// Copyright (c) 1995-1999 Matra Datavision
-// Copyright (c) 1999-2014 OPEN CASCADE SAS
-//
-// This file is part of Open CASCADE Technology software library.
-//
-// This library is free software; you can redistribute it and/or modify it under
-// the terms of the GNU Lesser General Public License version 2.1 as published
-// by the Free Software Foundation, with special exception defined in the file
-// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
-// distribution for complete text of the license and disclaimer of any warranty.
-//
-// Alternatively, this file may be used under the terms of Open CASCADE
-// commercial license or contractual agreement.
-
-#ifndef TopOpeBRepBuild_SplitSolid_INCLUDED
-#define TopOpeBRepBuild_SplitSolid_INCLUDED
-
-#include <TopOpeBRepBuild_ShellFaceSet.hxx>
-#include <TopOpeBRepBuild_SolidBuilder.hxx>
-#include <TopOpeBRepBuild_define.hxx>
-
-#ifdef OCCT_DEBUG
-#define DEBSHASET(sarg,meth,shaset,str) TCollection_AsciiString sarg((meth));(sarg)=(sarg)+(shaset).DEBNumber()+(str);
-Standard_EXPORT Standard_Boolean TopOpeBRepDS_GettraceSTRANGE();
-Standard_EXPORT void debsplitf(const Standard_Integer i);
-Standard_EXPORT void debspanc(const Standard_Integer i);
-//Standard_IMPORT extern Standard_Integer GLOBAL_iexF;
-Standard_IMPORT Standard_Integer GLOBAL_iexF;
-#endif
-
-//=======================================================================
-//function : SplitSolid
-//purpose :
-//=======================================================================
-
-void TopOpeBRepBuild_Builder::SplitSolid(const TopoDS_Shape& S1oriented,
- const TopAbs_State ToBuild1,
- const TopAbs_State ToBuild2)
-{
- //modified by IFV for treating shell
- Standard_Boolean tosplit = Standard_False;
- Standard_Boolean IsShell = (S1oriented.ShapeType() == TopAbs_SHELL);
- if(IsShell) {
- TopExp_Explorer ex;
- ex.Init(S1oriented, TopAbs_FACE);
- for (; ex.More(); ex.Next()) {
- const TopoDS_Shape& sh = ex.Current();
- tosplit = ToSplit(sh,ToBuild1);
- if(tosplit) break;
- }
- }
- else tosplit = ToSplit(S1oriented,ToBuild1);
-
- if ( ! tosplit ) return;
- // end IFV
-
- Standard_Boolean RevOri1 = Reverse(ToBuild1,ToBuild2);
- Standard_Boolean RevOri2 = Reverse(ToBuild2,ToBuild1);
- Standard_Boolean ConnectTo1 = Standard_True;
- Standard_Boolean ConnectTo2 = Standard_False;
-
- // work on a FORWARD solid <S1forward>
- TopoDS_Shape S1forward = S1oriented;
- myBuildTool.Orientation(S1forward,TopAbs_FORWARD);
-
- // build the list of solids to split : LS1, LS2
- TopTools_ListOfShape LS1,LS2;
- LS1.Append(S1forward);
- FindSameDomain(LS1,LS2);
- Standard_Integer n1 = LS1.Extent();
- Standard_Integer n2 = LS2.Extent();
-
- if (!n2) RevOri1 = Standard_False;
- if (!n1) RevOri2 = Standard_False;
-
- // Create a face set <FS> connected by edges
- // -----------------------------------------
- TopOpeBRepBuild_ShellFaceSet SFS;
-
-#ifdef OCCT_DEBUG
- Standard_Boolean tSPS = TopOpeBRepBuild_GettraceSPS();
-// Standard_Integer iSolid = myDataStructure->Shape(S1oriented);
- if (tSPS) {
- cout<<endl;
- GdumpSHASTA(S1oriented,ToBuild1,"___ SplitSolid ");
- GdumpSAMDOM(LS1, (char *) "1 : ");
- GdumpSAMDOM(LS2, (char *) "2 : ");
- }
- SFS.DEBNumber(GdumpSHASETindex());
-#endif
-
- STATIC_SOLIDINDEX = 1;
- TopTools_ListIteratorOfListOfShape itLS1;
- for (itLS1.Initialize(LS1); itLS1.More(); itLS1.Next()) {
- TopoDS_Shape Scur = itLS1.Value();
- FillSolid(Scur,ToBuild1,LS2,ToBuild2,SFS,RevOri1);
- }
-
- STATIC_SOLIDINDEX = 2;
- TopTools_ListIteratorOfListOfShape itLS2;
- for (itLS2.Initialize(LS2); itLS2.More(); itLS2.Next()) {
- TopoDS_Shape Scur = itLS2.Value();
- FillSolid(Scur,ToBuild2,LS1,ToBuild1,SFS,RevOri2);
- }
-
- // Add the intersection surfaces
- // -----------------------------
- if (myDataStructure->NbSurfaces() > 0) {
- TopOpeBRepDS_SurfaceIterator SSurfaces = myDataStructure->SolidSurfaces(S1forward);
- for (; SSurfaces.More(); SSurfaces.Next()) {
- Standard_Integer iS = SSurfaces.Current();
- const TopTools_ListOfShape& LnewF = NewFaces(iS);
- for (TopTools_ListIteratorOfListOfShape Iti(LnewF); Iti.More(); Iti.Next()) {
- TopoDS_Shape aFace = Iti.Value();
- TopAbs_Orientation ori = SSurfaces.Orientation(ToBuild1);
- myBuildTool.Orientation(aFace,ori);
-
-#ifdef OCCT_DEBUG
- if (tSPS){
- DEBSHASET(ss,"--- SplitSolid ",SFS," AddElement SFS+ face ");
- GdumpSHA(aFace,(Standard_Address)ss.ToCString());
- cout<<" ";TopAbs::Print(ToBuild1,cout)<<" : 1 face ";
- TopAbs::Print(ori,cout); cout<<endl;
- }
-#endif
- SFS.AddElement(aFace);
- }
- }
- }
-
- // Create a Solid Builder SOBU
- // -------------------------
- TopOpeBRepBuild_SolidBuilder SOBU(SFS);
-
- // Build the new solids on S1
- // --------------------------
- TopTools_ListOfShape& SolidList = ChangeMerged(S1oriented,ToBuild1);
- if(IsShell)
- MakeShells(SOBU,SolidList);
- else
- MakeSolids(SOBU,SolidList);
-
- // connect list of new solids <SolidList> as solids built on LS1 solids
- // --------------------------------------------------------------------
-
- for (itLS1.Initialize(LS1); itLS1.More(); itLS1.Next()) {
- TopoDS_Shape Scur = itLS1.Value();
- MarkSplit(Scur,ToBuild1);
- TopTools_ListOfShape& SL = ChangeSplit(Scur,ToBuild1);
- if ( ConnectTo1 ) SL = SolidList;
-
- }
-
- // connect list of new solids <SolidList> as solids built on LS2 solids
- // --------------------------------------------------------------------
- for (itLS2.Initialize(LS2); itLS2.More(); itLS2.Next()) {
- TopoDS_Shape Scur = itLS2.Value();
- MarkSplit(Scur,ToBuild2);
- TopTools_ListOfShape& SL = ChangeSplit(Scur,ToBuild2);
- if ( ConnectTo2 ) SL = SolidList;
- }
-
-} // SplitSolid
-
-//#ifndef TopOpeBRepBuild_SplitSolid_INCLUDED
-#endif
--- /dev/null
+// Created on: 1995-09-12
+// Created by: Jean Yves LEBEY
+// Copyright (c) 1995-1999 Matra Datavision
+// Copyright (c) 1999-2014 OPEN CASCADE SAS
+//
+// This file is part of Open CASCADE Technology software library.
+//
+// This library is free software; you can redistribute it and/or modify it under
+// the terms of the GNU Lesser General Public License version 2.1 as published
+// by the Free Software Foundation, with special exception defined in the file
+// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
+// distribution for complete text of the license and disclaimer of any warranty.
+//
+// Alternatively, this file may be used under the terms of Open CASCADE
+// commercial license or contractual agreement.
+
+#ifndef TopOpeBRepBuild_SplitSolid_INCLUDED
+#define TopOpeBRepBuild_SplitSolid_INCLUDED
+
+#include <TopOpeBRepBuild_ShellFaceSet.hxx>
+#include <TopOpeBRepBuild_SolidBuilder.hxx>
+#include <TopOpeBRepBuild_define.hxx>
+
+#ifdef OCCT_DEBUG
+#define DEBSHASET(sarg,meth,shaset,str) TCollection_AsciiString sarg((meth));(sarg)=(sarg)+(shaset).DEBNumber()+(str);
+Standard_EXPORT Standard_Boolean TopOpeBRepDS_GettraceSTRANGE();
+Standard_EXPORT void debsplitf(const Standard_Integer i);
+Standard_EXPORT void debspanc(const Standard_Integer i);
+//Standard_IMPORT extern Standard_Integer GLOBAL_iexF;
+Standard_IMPORT Standard_Integer GLOBAL_iexF;
+#endif
+
+//=======================================================================
+//function : SplitSolid
+//purpose :
+//=======================================================================
+
+void TopOpeBRepBuild_Builder::SplitSolid(const TopoDS_Shape& S1oriented,
+ const TopAbs_State ToBuild1,
+ const TopAbs_State ToBuild2)
+{
+ //modified by IFV for treating shell
+ Standard_Boolean tosplit = Standard_False;
+ Standard_Boolean IsShell = (S1oriented.ShapeType() == TopAbs_SHELL);
+ if(IsShell) {
+ TopExp_Explorer ex;
+ ex.Init(S1oriented, TopAbs_FACE);
+ for (; ex.More(); ex.Next()) {
+ const TopoDS_Shape& sh = ex.Current();
+ tosplit = ToSplit(sh,ToBuild1);
+ if(tosplit) break;
+ }
+ }
+ else tosplit = ToSplit(S1oriented,ToBuild1);
+
+ if ( ! tosplit ) return;
+ // end IFV
+
+ Standard_Boolean RevOri1 = Reverse(ToBuild1,ToBuild2);
+ Standard_Boolean RevOri2 = Reverse(ToBuild2,ToBuild1);
+ Standard_Boolean ConnectTo1 = Standard_True;
+ Standard_Boolean ConnectTo2 = Standard_False;
+
+ // work on a FORWARD solid <S1forward>
+ TopoDS_Shape S1forward = S1oriented;
+ myBuildTool.Orientation(S1forward,TopAbs_FORWARD);
+
+ // build the list of solids to split : LS1, LS2
+ TopTools_ListOfShape LS1,LS2;
+ LS1.Append(S1forward);
+ FindSameDomain(LS1,LS2);
+ Standard_Integer n1 = LS1.Extent();
+ Standard_Integer n2 = LS2.Extent();
+
+ if (!n2) RevOri1 = Standard_False;
+ if (!n1) RevOri2 = Standard_False;
+
+ // Create a face set <FS> connected by edges
+ // -----------------------------------------
+ TopOpeBRepBuild_ShellFaceSet SFS;
+
+#ifdef OCCT_DEBUG
+ Standard_Boolean tSPS = TopOpeBRepBuild_GettraceSPS();
+// Standard_Integer iSolid = myDataStructure->Shape(S1oriented);
+ if (tSPS) {
+ cout<<endl;
+ GdumpSHASTA(S1oriented,ToBuild1,"___ SplitSolid ");
+ GdumpSAMDOM(LS1, (char *) "1 : ");
+ GdumpSAMDOM(LS2, (char *) "2 : ");
+ }
+ SFS.DEBNumber(GdumpSHASETindex());
+#endif
+
+ STATIC_SOLIDINDEX = 1;
+ TopTools_ListIteratorOfListOfShape itLS1;
+ for (itLS1.Initialize(LS1); itLS1.More(); itLS1.Next()) {
+ TopoDS_Shape Scur = itLS1.Value();
+ FillSolid(Scur,ToBuild1,LS2,ToBuild2,SFS,RevOri1);
+ }
+
+ STATIC_SOLIDINDEX = 2;
+ TopTools_ListIteratorOfListOfShape itLS2;
+ for (itLS2.Initialize(LS2); itLS2.More(); itLS2.Next()) {
+ TopoDS_Shape Scur = itLS2.Value();
+ FillSolid(Scur,ToBuild2,LS1,ToBuild1,SFS,RevOri2);
+ }
+
+ // Add the intersection surfaces
+ // -----------------------------
+ if (myDataStructure->NbSurfaces() > 0) {
+ TopOpeBRepDS_SurfaceIterator SSurfaces = myDataStructure->SolidSurfaces(S1forward);
+ for (; SSurfaces.More(); SSurfaces.Next()) {
+ Standard_Integer iS = SSurfaces.Current();
+ const TopTools_ListOfShape& LnewF = NewFaces(iS);
+ for (TopTools_ListIteratorOfListOfShape Iti(LnewF); Iti.More(); Iti.Next()) {
+ TopoDS_Shape aFace = Iti.Value();
+ TopAbs_Orientation ori = SSurfaces.Orientation(ToBuild1);
+ myBuildTool.Orientation(aFace,ori);
+
+#ifdef OCCT_DEBUG
+ if (tSPS){
+ DEBSHASET(ss,"--- SplitSolid ",SFS," AddElement SFS+ face ");
+ GdumpSHA(aFace,(Standard_Address)ss.ToCString());
+ cout<<" ";TopAbs::Print(ToBuild1,cout)<<" : 1 face ";
+ TopAbs::Print(ori,cout); cout<<endl;
+ }
+#endif
+ SFS.AddElement(aFace);
+ }
+ }
+ }
+
+ // Create a Solid Builder SOBU
+ // -------------------------
+ TopOpeBRepBuild_SolidBuilder SOBU(SFS);
+
+ // Build the new solids on S1
+ // --------------------------
+ TopTools_ListOfShape& SolidList = ChangeMerged(S1oriented,ToBuild1);
+ if(IsShell)
+ MakeShells(SOBU,SolidList);
+ else
+ MakeSolids(SOBU,SolidList);
+
+ // connect list of new solids <SolidList> as solids built on LS1 solids
+ // --------------------------------------------------------------------
+
+ for (itLS1.Initialize(LS1); itLS1.More(); itLS1.Next()) {
+ TopoDS_Shape Scur = itLS1.Value();
+ MarkSplit(Scur,ToBuild1);
+ TopTools_ListOfShape& SL = ChangeSplit(Scur,ToBuild1);
+ if ( ConnectTo1 ) SL = SolidList;
+
+ }
+
+ // connect list of new solids <SolidList> as solids built on LS2 solids
+ // --------------------------------------------------------------------
+ for (itLS2.Initialize(LS2); itLS2.More(); itLS2.Next()) {
+ TopoDS_Shape Scur = itLS2.Value();
+ MarkSplit(Scur,ToBuild2);
+ TopTools_ListOfShape& SL = ChangeSplit(Scur,ToBuild2);
+ if ( ConnectTo2 ) SL = SolidList;
+ }
+
+} // SplitSolid
+
+//#ifndef TopOpeBRepBuild_SplitSolid_INCLUDED
+#endif
#include <TopAbs_ShapeEnum.hxx>
#include <Standard_Integer.hxx>
class TopoDS_TShape;
-class Standard_NullObject;
-class Standard_DomainError;
-class Standard_TypeMismatch;
-class TopLoc_Location;
+// resolve name collisions with X11 headers
+#ifdef Convex
+ #undef Convex
+#endif
//! Describes a shape which
//! - references an underlying shape with the potential
#include <MMgt_TShared.hxx>
#include <Standard_Boolean.hxx>
#include <TopAbs_ShapeEnum.hxx>
-class Standard_ConstructionError;
+
class TopoDS_Iterator;
class TopoDS_Builder;
+// resolve name collisions with X11 headers
+#ifdef Convex
+ #undef Convex
+#endif
class TopoDS_TShape;
DEFINE_STANDARD_HANDLE(TopoDS_TShape, MMgt_TShared)
class TopoDS_TVertex;
+
+// resolve name collisions with X11 headers
+#ifdef Convex
+ #undef Convex
+#endif
+
DEFINE_STANDARD_HANDLE(TopoDS_TVertex, TopoDS_TShape)
//! A Vertex is a topological point in two or three
class Interface_Check;
class Transfer_TransferFailure;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
class Transfer_Binder;
DEFINE_STANDARD_HANDLE(Transfer_Binder, MMgt_TShared)
class Standard_Transient;
class Interface_Check;
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! Defines an Iterator on the result of a Transfer
//! Available for Normal Results or not (Erroneous Transfer)
gp_Vec D2U,D2V,D2UV;
gp_Pnt P;
Standard_Real U, V;
- CSLib_DerivativeStatus Status;
+ CSLib_DerivativeStatus aStatus;
CSLib_NormalStatus NStat;
S.Initialize(aFace);
const TColgp_Array1OfPnt2d& UVNodes = T->UVNodes();
U = UVNodes(i).X();
V = UVNodes(i).Y();
S.D1(U,V,P,D1U,D1V);
- CSLib::Normal(D1U,D1V,Precision::Angular(),Status,Nor(i));
- if (Status != CSLib_Done) {
+ CSLib::Normal(D1U,D1V,Precision::Angular(),aStatus,Nor(i));
+ if (aStatus != CSLib_Done) {
S.D2(U,V,P,D1U,D1V,D2U,D2V,D2UV);
CSLib::Normal(D1U,D1V,D2U,D2V,D2UV,Precision::Angular(),OK,NStat,Nor(i));
}
#include <Standard_Mutex.hxx>
#include <VrmlData_DataMapOfShapeAppearance.hxx>
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
+
struct VrmlData_InBuffer;
/**
#include <gce_ErrorType.hxx>
#include <Standard_Boolean.hxx>
+// resolve name collisions with X11 headers
+#ifdef Status
+ #undef Status
+#endif
//! This class implements the common services for
//! all classes of gce which report error.
#include <math_SingleTab.hxx>
-class Standard_DimensionError;
-class Standard_DivideByZero;
-class Standard_RangeError;
-class math_Matrix;
+// resolve name collisions with X11 headers
+#ifdef Opposite
+ #undef Opposite
+#endif
//! This class implements the real IntegerVector abstract data type.
//! IntegerVectors can have an arbitrary range which must be define at
#include <Standard_Address.hxx>
#include <math_Vector.hxx>
#include <Standard_OStream.hxx>
-class Standard_DimensionError;
-class Standard_RangeError;
-class Standard_DivideByZero;
-class math_NotSquare;
-class math_SingularMatrix;
-class math_Vector;
+// resolve name collisions with X11 headers
+#ifdef Opposite
+ #undef Opposite
+#endif
//! This class implements the real matrix abstract data type.
//! Matrixes can have an arbitrary range which must be defined
#include <gp_XY.hxx>
#include <gp_XYZ.hxx>
-class Standard_DimensionError;
-class Standard_DivideByZero;
-class Standard_RangeError;
-class Standard_NullValue;
+// resolve name collisions with X11 headers
+#ifdef Opposite
+ #undef Opposite
+#endif
+
class math_Matrix;
//! This class implements the real vector abstract data type.
projects / occt-copy.git / commitdiff