myWire : Wire from TopoDS;
myPntAttach : Pnt from gp;
- haspos : Boolean from Standard;
end FixRelation;
const Handle(Geom_Plane)& aPlane,
const TopoDS_Wire& aWire)
:AIS_Relation(),
- myWire(aWire),
- haspos(Standard_False)
+ myWire(aWire)
{
myFShape = aShape;
myPlane = aPlane;
const gp_Pnt& aPosition,
const Standard_Real anArrowSize)
:AIS_Relation(),
- myWire(aWire),
- haspos(Standard_False)
+ myWire(aWire)
{
myFShape = aShape;
myPlane = aPlane;
//=======================================================================
AIS_FixRelation::AIS_FixRelation(const TopoDS_Shape& aShape,
- const Handle(Geom_Plane)& aPlane):
-haspos(Standard_False)
+ const Handle(Geom_Plane)& aPlane)
{
myFShape = aShape;
myPlane = aPlane;
const TopoDS_Shape& aShape,
const Handle(Geom_Plane)& aPlane,
const gp_Pnt& aPosition,
- const Standard_Real anArrowSize):
-haspos(Standard_False)
+ const Standard_Real anArrowSize)
{
myFShape = aShape;
myPlane = aPlane;
fields
myName : AsciiString from TCollection;
- mycuri : Integer from Standard;
-- SAV : OCC189 myresult : HArray1OfTransient from TColStd;
myresult : NListTransient from AIS;
myIterator : NListIteratorOfListTransient from AIS;
//=======================================================================
AIS_Selection::AIS_Selection(const Standard_CString aName) :
myName(TCollection_AsciiString(aName)),
-mycuri(0),
#if !defined USE_MAP && !defined OCC189
myresult(new TColStd_HArray1OfTransient(1,MaxSizeOfResult)),
#endif
// and conditions governing the rights and limitations under the License.
-#define OCC189 //SAV: 18/03/02 array was replaced with list.
-
-#define USE_MAP //san : 18/04/03 USE_MAP - additional datamap is used to speed up access
+//SAV: 18/03/02 array was replaced with list.
+//san : 18/04/03 USE_MAP - additional datamap is used to speed up access
//to certain owners in <myresult> list
-#if !defined( OCC189 ) && !defined( USE_MAP )
-#include <TColStd_HArray1OfTransient.hxx>
-#else
#include <TColStd_MapOfTransient.hxx>
#include <TColStd_MapIteratorOfMapOfTransient.hxx>
-#endif
-
-#if !defined( OCC189 ) && !defined( USE_MAP )
-inline const Handle(TColStd_HArray1OfTransient)& AIS_Selection::Objects() const
-#else
inline const AIS_NListTransient& AIS_Selection::Objects() const
-#endif
{
return myresult;
}
inline void AIS_Selection::Init()
{
-#if !defined( OCC189 ) && !defined( USE_MAP )
- mycuri=1;
-#else
myIterator = AIS_NListTransient::Iterator ( myresult );
-#endif
}
inline Standard_Boolean AIS_Selection::More() const
{
-#if !defined( OCC189 ) && !defined( USE_MAP )
- return (myresult.IsNull() ? Standard_False : (mycuri<=myNb));
-#else
return myIterator.More();
-#endif
}
-inline void AIS_Selection::Next () {
-#if !defined( OCC189 ) && !defined( USE_MAP )
- mycuri++;
-#else
+inline void AIS_Selection::Next ()
+{
myIterator.Next();
-#endif
}
inline const Handle(Standard_Transient)& AIS_Selection::Value() const
{
-#if !defined( OCC189 ) && !defined( USE_MAP )
- return myresult->Value(mycuri);
-#else
return myIterator.Value();
-#endif
}
inline Standard_Integer AIS_Selection::NbStored() const
{
-#if !defined( OCC189 ) && !defined( USE_MAP )
- return myNb;
-#else
return myresult.Extent();
-#endif
}
myDeflection : Real from Standard;
myAspect : AspectFillArea3d from Graphic3d;
mytexture : Texture2Dmanual from Graphic3d;
- Umin : Real from Standard;
- Umax : Real from Standard;
- Vmin : Real from Standard;
- Vmax : Real from Standard;
- dUmax : Real from Standard;
- dVmax : Real from Standard;
myModulate : Boolean from Standard;
end TexturedShape;
/* 0 = constraints of passage to limits (i.e. C0), */
/* 1 = C0 + constraintes of 1st derivatives (i.e. C1), */
/* 2 = C1 + constraintes of 2nd derivatives (i.e. C2). */
-/* NDGJAC: Degree of development in series to use for the calculation
+/* NDGJAC: Degree of development in series to use for the calculation */
/* in the base of Jacobi. */
/* CRVJAC: Table of coeff. of the curve of approximation in the */
/* base of Jacobi. */
/* =-1, warning, required tolerance can't be */
/* met with coefficients NFCLIM. */
/* = 1, order of constraints (IORDRE) is not within authorised values */
-/*
+
/* COMMONS USED : */
/* ------------------ */
/* DESCRIPTION/NOTES/LIMITATIONS : */
/* ----------------------------------- */
-/* The part of HERMIT(*,2*i+j) table where j=1 or 2 and i=0 to IORDRE,
+/* The part of HERMIT(*,2*i+j) table where j=1 or 2 and i=0 to IORDRE, */
/* contains the coefficients of the polynom of degree 2*IORDRE+1 */
/* such as ALL values in -1 and in +1 of this polynom and its */
/* derivatives till order of derivation IORDRE are NULL, */
/* ------------------ */
/* NDIMEN: Total dimension of the space (sum of dimensions */
/* of sub-spaces) */
-/* NBROOT: Nb of points of discretization of the iso, extremities not
+/* NBROOT: Nb of points of discretization of the iso, extremities not */
/* included. */
/* IORDRE: Order of constraint at the extremities of the boundary */
/* -1 = no constraints, */
/* 0 = constraints of passage of limits (i.e. C0), */
/* 1 = C0 + constraints of 1st derivatives (i.e. C1), */
/* 2 = C1 + constraints of 2nd derivatives (i.e. C2). */
-/* NDGJAC: Degree of development in series to be used for calculation in the
+/* NDGJAC: Degree of development in series to be used for calculation in the */
/* base of Jacobi. */
/* OUTPUT ARGUMENTS : */
/* ------------------- */
/* PATJAC: Table of coefficients of the polynom P(u,v) by approximation */
/* of F(u,v) WITH taking into account of constraints. */
-/* > *//*
+/* > */
/* > */
*/
/* NBPNTV: Nb of INTERNAL parameters of discretisation by V. */
/* This is also the nb of root of Legendre polynom where discretization is done. */
-/* VROOTL: Table of discretization parameters on (-1,1) by V.
+/* VROOTL: Table of discretization parameters on (-1,1) by V. */
/* IORDRU: Order of constraint imposed at the extremities of iso-V */
/* = 0, calculate the extremities of iso-V */
/* = 1, calculate, additionally, the 1st derivative in the direction of iso-V */
*/
/* NBPNTV: Nb of INTERNAL parameters of discretisation by V. */
/* This is also the nb of root of Legendre polynom where discretization is done. */
-/* VROOTL: Table of discretization parameters on (-1,1) by V.
+/* VROOTL: Table of discretization parameters on (-1,1) by V. */
/* IORDRV: Order of constraint imposed at the extremities of iso-V */
/* = 0, calculate the extremities of iso-V */
/* = 1, calculate, additionally, the 1st derivative in the direction of iso-V */
*/
/* NBPNTV: Nb of INTERNAL parameters of discretisation by V. */
/* This is also the nb of root of Legendre polynom where discretization is done. */
-/* VROOTL: Table of parameters of discretisation ON (-1,1) by V.
+/* VROOTL: Table of parameters of discretisation ON (-1,1) by V.*/
/* IORDRV: Order of constraint imposed at the extremities of iso-U */
/* = 0, calculate the extremities of iso-U */
/* L320: */
}
-/* ----- Contribution of calculated terms to the approximation error
+/* ----- Contribution of calculated terms to the approximation error */
/* for terms (I,J) with MINU <= I <= MAXU, MINV <= J <= MAXV. */
idim = 1;
/* L700: */
}
-/* ----- Contribution of calculated terms to the approximation error
+/* ----- Contribution of calculated terms to the approximation error */
/* for terms (I,J) with MINU <= I <= MAXU, MINV <= J <= MAXV */
idim = 1;
/* FUNCTION : */
/* ---------- */
/* Calculate the terms connected to degree NDUJAC by U of the polynomial approximation */
-/* of function F(u,v), starting from its discretisation
+/* of function F(u,v), starting from its discretisation */
/* on the roots of Legendre polynom of degree */
/* NBPNTU by U and NBPNTV by V. */
}
}
-/* ------- Add terms connected to the supplementary root (0.D0) ------
+/* ------- Add terms connected to the supplementary root (0.D0) ------ */
/* ----------- of Legendre polynom of uneven degree NBPNTU -----------
*/
/* --> Only even NDUJAC terms are modified as GSSUTB(0) = 0 */
/* FUNCTION : */
/* ---------- */
-/* Calculate the coefficients of polynomial approximation of F(u,v)
+/* Calculate the coefficients of polynomial approximation of F(u,v) */
/* of degree NDVJAC by V and of degree by U varying from MINDGU to MAXDGU.
*/
/* ------------------ */
/* NDVJAC: Degree of the polynom of approximation by V. */
-/* The representation in the orthogonal base starts from degre 0.
+/* The representation in the orthogonal base starts from degre 0. */
/* The polynomial base is the base of Jacobi of order -1 */
/* (Legendre), 0, 1 or 2 */
/* MINDGU: Degree minimum by U of coeff. to calculate. */
/* by Gauss method. It is reqired that NBPNTV = 30, 40, 50 or 61 and NDVJAC < NBPNTV. */
/* GSSVTB: Table of coefficients of integration by Gauss method */
/* by V for NDVJAC fixed: j varies from 0 to NBPNTV/2. */
-/* CHPAIR: Table of terms connected to degrees from MINDGU to MAXDGU by U to
+/* CHPAIR: Table of terms connected to degrees from MINDGU to MAXDGU by U to */
/* calculate the coeff. of approximation of EVEN degree NDVJAC by V. */
-/* CHIMPR: Table of terms connected to degrees from MINDGU to MAXDGU by U to
+/* CHIMPR: Table of terms connected to degrees from MINDGU to MAXDGU by U to */
/* calculate the coeff. of approximation of UNEVEN degree NDVJAC by V. */
/* OUTPUT ARGUMENTS : */
/* ERRMAX: Table of MAX errors (sub-space by sub-space) */
/* committed in the approximation of FONCNP by NBCRBE curves. */
/* ERRMOY: Table of AVERAGE errors (sub-space by sub-space) */
-/* committed in the approximation of FONCNP by NBCRBE curves.
+/* committed in the approximation of FONCNP by NBCRBE curves. */
/* IERCOD: Error code: */
/* -1 = ERRMAX > EPSAPR for at least one sub-space. */
/* (the resulting curves of at least mathematic degree NCFLIM-1 */
/* FUNCTION : */
/* ---------- */
/* Load the elements required for integration by */
-/* Gauss method to obtain the coefficients in the base of
+/* Gauss method to obtain the coefficients in the base of */
/* Legendre of the approximation by the least squares of a */
/* function. The elements are stored in commons MMAPGSS */
/* (case without constraint), MMAPGS0 (constraints C0), MMAPGS1 */
/* INPUT ARGUMENTS : */
/* ------------------ */
/* NDGJAC : Max degree of the polynom of approximation. */
-/* The representation in orthogonal base goes from degree
+/* The representation in orthogonal base goes from degree */
/* 0 to degree NDGJAC-2*(JORDRE+1). The polynomial base */
/* is the base of Jacobi of order -1 (Legendre), 0, 1 and 2 */
/* NBPNTS : Degree of the polynom of Legendre on the roots which of */
/* KEYWORDS : */
/* ----------- */
/* JACOBI, POLYGON, APPROXIMATION, ERROR. */
-/*
+/**/
/* INPUT ARGUMENTS : */
/* ------------------ */
/* NCOFMX : Max. degree of the curve. */
/* GNSTOC: Number of coefficients in the profile of matrix GMATRI */
/* GPOSIT: Table of positioning of terms of storage */
-/* GPOSIT(1,I) contains the number of terms-1 on the line I
+/* GPOSIT(1,I) contains the number of terms-1 on the line I */
/* in the profile of the matrix. */
/* GPOSIT(2,I) contains the index of storage of diagonal term*/
/* of line I */
/* GMATRI : Matrix of constraints in form of profile */
/* VECIN : Input vector */
/* DEBLIG : Line indexusing which the vector matrix is calculated */
-/*
+/**/
/* OUTPUT ARGUMENTS */
/* --------------------- */
/* VECOUT : VECTOR PRODUCT */
integer ndeg, i__, j, nd, ndgcrb, iptpnt, ibb;
-/* ***********************************************************************
+/* *********************************************************************** */
/* FUNCTION : */
/* ---------- */
/* DEMSCRIPTION/NOTES/LIMITATIONS : */
/* ----------------------------------- */
-/* INITIALISATION : profile , **VIA MPRFTX** at input in stream
+/* INITIALISATION : profile , **VIA MPRFTX** at input in stream */
/* loading of default values of the profile in MPRFTX at input */
/* in stream. They are preserved in local variables of MPRFTX */
/* DESCRIPTION/NOTES/LIMITATIONS : */
/* ----------------------------------- */
/* ATTENTION: The condition on NDEGRE ( 2 <= NDEGRE <= 61) is not */
-/* tested. The caller should make the test.
+/* tested. The caller should make the test. */
/* Name of the routine */
/* ---> The max number of coeff by u and v of PATOLD is 61 */
-/* ---> If NCOEFU < NCOFMX, the data is compressed by MMFMCA9 before
+/* ---> If NCOEFU < NCOFMX, the data is compressed by MMFMCA9 before */
/* limitation by v to get time during the execution */
/* of MMARC41 that follows (the square is processed as a curve of
*/
/* OUTPUT ARGUMENTS : */
/* ------------------- */
-/* TABLE2: Table of reals by two dimensions, containing the transposition
+/* TABLE2: Table of reals by two dimensions, containing the transposition */
/* of the rectangular table TABLE1. */
/* ISIZE2: Nb of useful elements of TABLE2 on the 1st dimension */
/* JSIZE2: Nb of useful elements of TABLE2 on the 2nd dimension */
/* between limits XD and XF . */
/* The function should be calculated for any value */
/* of the variable in the given interval.. */
-/* The method GAUSS-LEGENDRE is used.
+/* The method GAUSS-LEGENDRE is used. */
/* For explications refer to the book : */
/* Complements de mathematiques a l'usage des Ingenieurs de */
/* l'electrotechnique et des telecommunications. */
/* If you wish to calculate the integral with a given precision, */
/* loop on k varying from 1 to 10 and test the difference of 2
*/
-/* consecutive iterations. Stop the loop if this difference is less that
+/* consecutive iterations. Stop the loop if this difference is less that */
/* an epsilon value set to 10E-6 for example. */
/* If S1 and S2 are 2 successive iterations, test following this example :
*/
/* FUNCTION : */
/* ---------- */
-/* Used to STORE coefficients of Hermit interpolation polynoms
+/* Used to STORE coefficients of Hermit interpolation polynoms */
/* KEYWORDS : */
/* ----------- */
/* there is no choice : ORDRMX should be equal to the value */
/* of PARAMETER IORDMX of INCLUDE MMCMHER, or 2 for the moment */
-/* IORDRE (2) : Orders of constraints in each corresponding parameter DEBFIN(I)
+/* IORDRE (2) : Orders of constraints in each corresponding parameter DEBFIN(I) */
/* should be between -1 (no constraints) and ORDRMX. */
/* FUNCTION : */
/* ---------- */
-/* Serves to STORE the coefficients of Hermit interpolation polynoms
+/* Serves to STORE the coefficients of Hermit interpolation polynoms */
/* KEYWORDS : */
/* ----------- */
/* . Level of de debug = 3 */
-/*
+/**/
/* DECLARATIONS , CONTROL OF INPUT ARGUMENTS , INITIALIZATION */
/* ***********************************************************************
*/
/* FUNCTION : Length of an arc of curve on a given interval */
/* ---------- for a function the mathematic representation */
/* which of is a multidimensional polynom. */
-/* The polynom is a set of polynoms the coefficients which of are ranked
- /* in a table with 2 indices, each line relative to 1 polynom. */
+/* The polynom is a set of polynoms the coefficients which of are ranked */
+/* in a table with 2 indices, each line relative to 1 polynom. */
/* The polynom is defined by its coefficients ordered by increasing
* power of the variable. */
/* All polynoms have the same number of coefficients (and the same degree). */
/* NISTOC: NUMBER OF COEFFICIENTS IN THE PROFILE */
/* DIMMAT: NUMBER OF LINE OF THE SYMMETRIC SQUARE MATRIX */
/* APOSIT: TABLE OF POSITIONING OF STORAGE TERMS */
-/* APOSIT(1,I) CONTAINS THE NUMBER OF TERMES-1 ON LINE
+/* APOSIT(1,I) CONTAINS THE NUMBER OF TERMES-1 ON LINE */
/* I IN THE PROFILE OF THE MATRIX */
-/* APOSIT(2,I) CONTAINS THE INDEX OF STORAGE OF DIAGONAL TERM
+/* APOSIT(2,I) CONTAINS THE INDEX OF STORAGE OF DIAGONAL TERM */
/* OF LINE I */
/* GNSTOC: NOMBERS OF TERMS IN THE PROFILE OF THE MATRIX OF CONSTRAINTS */
/* MNSTOC: NOMBERS OF TERMS IN THE PROFILE OF THE MATRIX M= G H t(G) */
/* where H IS THE HESSIAN MATRIX AND G IS THE MATRIX OF CONSTRAINTS */
-/* MATSYH: TRIANGULAR INFERIOR PART OF THE HESSIAN MATRIX
+/* MATSYH: TRIANGULAR INFERIOR PART OF THE HESSIAN MATRIX */
/* IN FORM OF PROFILE */
/* MATSYG: MATRIX OF CONSTRAINTS IN FORM OF PROFILE */
/* VECSYH: VECTOR OF THE SECOND MEMBER ASSOCIATED TO MATSYH */
/* GPOSIT: TABLE OF POSITIONING OF THE MATRIX OF CONSTRAINTS */
/* GPOSIT(1,I) CONTAINS THE NUMBER OF TERMS OF LINE I */
/* WHICH ARE IN THE PROFILE */
-/* GPOSIT(2,I) CONTAINS THE INDEX OF STORAGE OF THE LAST TERM
+/* GPOSIT(2,I) CONTAINS THE INDEX OF STORAGE OF THE LAST TERM */
/* OF LINE I WHICH IS IN THE PROFILE */
/* GPOSIT(3,I) CONTAINS THE NUMBER OF COLUMN CORRESPONDING */
/* TO THE FIRST TERM OF LINE I WHICH IS IN THE PROFILE */
-/* MMPOSUI, MPOSIT: SAME STRUCTURE AS HPOSUI, BUT FOR MATRIX
+/* MMPOSUI, MPOSIT: SAME STRUCTURE AS HPOSUI, BUT FOR MATRIX */
/* M=G H t(G) */
}
goto L9999;
-/* ------If the absolute value of a pivot is smaller than --------
+/* ------If the absolute value of a pivot is smaller than -------- */
/* ---------- EPSPIV: return the code of error. ------------
*/
goto L1000;
-/* -------------- TEST IF TPARAM IS NOT A VALUE ---------
+/* -------------- TEST IF TPARAM IS NOT A VALUE --------- */
/* ------------------------OF TABLEV UP TO EPSIL ----------------------
*/
/* NLIGNE : NUMBER OF LINE OF THE MATRIX */
/* NCOLON : NOMBER OF COLUMN OF THE MATRIX */
/* GPOSIT: TABLE OF POSITIONING OF TERMS OF STORAGE */
-/* GPOSIT(1,I) CONTAINS THE NUMBER of TERMS-1 ON LINE
- I IN THE PROFILE OF THE MATRIX */
-/* GPOSIT(2,I) CONTAINS THE INDEX OF STORAGE OF THE DIAGONAL TERM
+/* GPOSIT(1,I) CONTAINS THE NUMBER of TERMS-1 ON LINE */
+/* I IN THE PROFILE OF THE MATRIX */
+/* GPOSIT(2,I) CONTAINS THE INDEX OF STORAGE OF THE DIAGONAL TERM*/
/* OF LINE I */
-/* GPOSIT(3,I) CONTAINS THE INDEX COLUMN OF THE FIRST TERM OF
+/* GPOSIT(3,I) CONTAINS THE INDEX COLUMN OF THE FIRST TERM OF */
/* PROFILE OF LINE I */
/* GNSTOC : NOMBER OF TERM IN THE PROFILE OF GMATRI */
/* GMATRI : MATRIX OF CONSTRAINTS IN FORM OF PROFILE */
/* OUTPUT ARGUMENTS : */
/* ------------------- */
-/* YCVMAX : Auxiliary table (max error on each dimension).
+/* YCVMAX : Auxiliary table (max error on each dimension). */
/* EPSTRC : Precision of the approximation. */
/* NCFNEW : Degree +1 of the resulting polynom. */
/* ----------------------------------- */
/* VECTOR and VECNRM can be identic. */
-/* The norm of vector is calculated and each component is divided by
+/* The norm of vector is calculated and each component is divided by */
/* this norm. After this it is checked if all componentes of the */
/* vector except for one cost 0 with machine precision. In */
/* this case the quasi-null components are set to 0.D0. */
/* to 40 directly (ATTENTION to overload - to avoid it, */
/* preview UROOTL and HILTAB dimensioned at least to 20). */
-/* The value of coefficients was calculated with quadruple precision
+/* The value of coefficients was calculated with quadruple precision */
/* by JJM with help of GD. */
/* Checking of roots was done by GD. */
/* CHL10N*4 : LIST OF POSSIBLE VALUES OF THE LOCALIZATION : */
/* 'FRA ','DEU ','ENG ', 'JIS ' */
-/* B) CHCOUR*4, CHPREC*4, CHSUIV*4 : CURRENT, PREVIOUS AND NEXT APPLICATION
+/* B) CHCOUR*4, CHPREC*4, CHSUIV*4 : CURRENT, PREVIOUS AND NEXT APPLICATION */
/* C) CHMODE*4 : CURRENT MODE (NOT USED) */
/* The idea is to minimize the number of calls */
/* to the routine of transfer of numeric zones, */
/* ---------- for the reason of performance. */
-/* ! buffer ! For this a table of NLONGR
+/* ! buffer ! For this a table of NLONGR */
/* !__________! DOUBLE PRECISIONs is reserved. This buffer is initialized by */
/* <----------> the instruction DATA. The overflow is accessed in a */
/* NLONGR*8 specific COMMON not by a routine as */
myColor: Color from Quantity is protected;
myTenthColor: Color from Quantity is protected;
myIsActive :Boolean from Standard;
- myIsDisplayed: Boolean from Standard;
myDrawMode: GridDrawMode from Aspect;
end Grid from Aspect;
* @param theAllocator
* allocator to manage the memory
*/
- /**
+ /*
BOPDS_InterfFF(const Handle(NCollection_BaseAllocator)& theAllocator)
:
BOPDS_Interf(theAllocator),
myCurves(myAllocator),
myPoints(myAllocator) {
};
+ */
//
/**
* Destructor
//=======================================================================
inline BOPDS_ShapeInfo::BOPDS_ShapeInfo(const Handle(NCollection_BaseAllocator)& theAllocator)
:
- mySubShapes(theAllocator),
myType(TopAbs_SHAPE),
+ mySubShapes(theAllocator),
myReference(-1),
myFlag(-1)
{
myLine : Line from BRepBlend;
myFunc : Address;
- mydimension : Integer;
myTolerance : Vector;
myPnt : Point from Blend;
myBary : Pnt from gp;
fields
myGTrsf : GTrsf from gp;
- myUseModif : Boolean from Standard;
myHist : Collect from BRepBuilderAPI;
end Transform;
BRepExtrema_DistShapeShape::BRepExtrema_DistShapeShape()
: myDistRef(0.),
- myDistValue(0.),
myIsDone(Standard_False),
myInnerSol(Standard_False),
myEps(Precision::Confusion()),
const Extrema_ExtFlag F,
const Extrema_ExtAlgo A)
: myDistRef(0.),
- myDistValue(0.),
myIsDone(Standard_False),
myInnerSol(Standard_False),
myEps(Precision::Confusion()),
const Extrema_ExtFlag F,
const Extrema_ExtAlgo A)
: myDistRef(0.),
- myDistValue(0.),
myIsDone(Standard_False),
myInnerSol(Standard_False),
myEps(theDeflection),
Standard_EXPORT void DistanceMapMap(const TopTools_IndexedMapOfShape& Map1,const TopTools_IndexedMapOfShape& Map2,const Bnd_SeqOfBox& LBox1,const Bnd_SeqOfBox& LBox2);
Standard_Real myDistRef;
- Standard_Real myDistValue;
Standard_Boolean myIsDone;
BRepExtrema_SeqOfSolution mySolutionsShape1;
BRepExtrema_SeqOfSolution mySolutionsShape2;
mySpine : Wire from TopoDS;
myCurves : SequenceOfCurve from TColGeom;
myBCurve : Curve from Geom;
- myStatusError : StatusError from BRepFeat;
end MakePipe;
XY from gp
- is Create (theDir : XY from gp; TheTol: Real from Standard)
+ is Create (theDir : XY from gp)
returns ComparatorOfVertexOfDelaun;
//purpose :
//=======================================================================
-BRepMesh_ComparatorOfVertexOfDelaun::BRepMesh_ComparatorOfVertexOfDelaun(const gp_XY& theDir,
- const Standard_Real theTol)
- : DirectionOfSort(theDir), Tolerance(theTol)
+BRepMesh_ComparatorOfVertexOfDelaun::BRepMesh_ComparatorOfVertexOfDelaun(const gp_XY& theDir)
+ : DirectionOfSort(theDir)
{}
//=======================================================================
void BRepMesh_Delaun::AddVertices( BRepMesh_Array1OfVertexOfDelaun& theVertices )
{
BRepMesh_HeapSortVertexOfDelaun::Sort( theVertices,
- BRepMesh_ComparatorOfVertexOfDelaun( SortingDirection, Precision ) );
+ BRepMesh_ComparatorOfVertexOfDelaun( SortingDirection ) );
Standard_Integer aLower = theVertices.Lower();
Standard_Integer anUpper = theVertices.Upper();
surf1 : HSurface from Adaptor3d;
surf2 : HSurface from Adaptor3d;
- dis1 : Real from Standard;
- dis2 : Real from Standard;
curv : HCurve from Adaptor3d;
csurf : HCurve2d from Adaptor2d;
choix : Integer from Standard;
myCol : Color from Draw;
myTyp : MarkerShape from Draw;
mySiz : Integer;
- myRSiz : Real;
- myIsRSiz : Boolean;
end Marker2D;
//=======================================================================
Draw_Marker2D::Draw_Marker2D(const gp_Pnt2d& P, const Draw_MarkerShape T,
- const Draw_Color& C, const Standard_Real RSize) :
- myPos(P), myCol(C), myTyp(T), myRSiz(RSize), myIsRSiz(Standard_True)
+ const Draw_Color& C, const Standard_Real /*RSize*/) :
+ myPos(P), myCol(C), myTyp(T)
{
}
//=======================================================================
Standard_Boolean Draw_Marker2D::PickReject(const Standard_Real,
- const Standard_Real,
- const Standard_Real) const
+ const Standard_Real,
+ const Standard_Real) const
{
return Standard_False;
}
-
aPrims->AddVertex(pOff.Translated(vec1.Added(vec2.Reversed())));
aPrims->AddVertex(pOff.Translated(vec1.Reversed().Added(vec2.Reversed())));
- //--------------------------------------------------------------------------------------
- //| MARKING OF THE SYMMETRY AXIS |
- //--------------------------------------------------------------------------------------
- // ____
- // \ / :Cursor
- // \/
- // /\
- // /__\
-
+ /*--------------------------------------------------------------------------------------
+ | MARKING OF THE SYMMETRY AXIS |
+ --------------------------------------------------------------------------------------
+ ____
+ \ / :Cursor
+ \/
+ /\
+ /__\
+*/
Standard_Real Dist = (aAxis.Distance(AttachmentPoint1)+aAxis.Distance(AttachmentPoint2))/75;
gp_Vec vs(aDirectionAxis);
gp_Vec vsym(vs.Divided(vs.Magnitude()).Multiplied(Dist).XYZ());
aPrims->AddVertex(pOff.Translated(vec1.Added(vec2.Reversed())));
aPrims->AddVertex(pOff.Translated(vec1.Reversed().Added(vec2.Reversed())));
- //--------------------------------------------------------------------------------------
- //| MARKING OF THE AXIS OF SYMMETRY |
- //--------------------------------------------------------------------------------------
- // ____
- // \ / :Cursor
- // \/
- // /\
- // /__\
-
+/*--------------------------------------------------------------------------------------
+ | MARKING OF THE AXIS OF SYMMETRY |
+ --------------------------------------------------------------------------------------
+ ____
+ \ / :Cursor
+ \/
+ /\
+ /__\
+*/
Standard_Real Dist = aAxis.Distance(Center1)/37;
gp_Dir aDirectionAxis = aAxis.Direction();
gp_Vec vs(aDirectionAxis);
aPrims->AddVertex(pOff.Translated(vec1.Added(vec2.Reversed())));
aPrims->AddVertex(pOff.Translated(vec1.Reversed().Added(vec2.Reversed())));
- //--------------------------------------------------------------------------------------
- //| MARKING OF THE AXIS OF SYMMETRY |
- //--------------------------------------------------------------------------------------
- // ____
- // \ / :Cursor
- // \/
- // /\
- // /__\
-
+ /*--------------------------------------------------------------------------------------
+ | MARKING OF THE AXIS OF SYMMETRY |
+ --------------------------------------------------------------------------------------
+ ____
+ \ / :Cursor
+ \/
+ /\
+ /__\
+ */
Standard_Real Dist = P1.Distance(P2)/75;
gp_Dir aDirectionAxis = aAxis.Direction();
gp_Vec vs(aDirectionAxis);
//
aTol=1.e-12;
//
- /*
+
if(fabs(A5) <= aTol) {
A5 = 0.;
}
myvinf : Real from Standard;
myvsup : Real from Standard;
mytolv : Real from Standard;
-
- myVRange : Real from Standard;
myF : FuncExtPS from Extrema;
myC : HCurve from Adaptor3d;
mynbext: Integer;
inverse: Boolean;
myC: Address from Standard;
- myu1: Real;
- myu2: Real;
myv1: Real;
myv2: Real;
mytolc1: Real;
mypoints2 : HArray2OfPnt from TColgp;
mytol1 : Real;
mytol2 : Real;
- myF : FuncExtCS from Extrema;
- myC : CurvePtr from Adaptor3d;
+ myF : FuncExtCS from Extrema;
myS : SurfacePtr from Adaptor3d;
end GenExtCS;
mypoints2 : HArray2OfPnt from TColgp;
mytol1 : Real;
mytol2 : Real;
- myF : FuncExtSS from Extrema;
- myS1 : SurfacePtr from Adaptor3d;
+ myF : FuncExtSS from Extrema;
myS2 : SurfacePtr from Adaptor3d;
end GenExtSS;
fields
myNbElements : Integer;
myDimension : Integer;
- myTolerance : Real;
myBase : Base from PLib;
myKnots : HArray1OfReal;
myDegree : Array1OfInteger;
//purpose :
//=======================================================================
FEmTool_Curve::FEmTool_Curve(const Standard_Integer Dimension,
- const Standard_Integer NbElements,
- const Handle(PLib_Base)& TheBase,
- const Standard_Real Tolerance) :
+ const Standard_Integer NbElements,
+ const Handle(PLib_Base)& TheBase,
+ const Standard_Real) :
myNbElements(NbElements), myDimension(Dimension),
- myTolerance(Tolerance),
myBase(TheBase), myDegree(1, myNbElements),
myCoeff(1, myDimension*myNbElements*(myBase->WorkDegree() + 1)),
myPoly(1, myDimension*myNbElements*(myBase->WorkDegree() + 1)),
fields
MyLengthSliding : Real;
OriginalSliding : Real;
- MyFreeSliding : Boolean;
MyBattenLaw : BattenLaw;
MyTension : DistributionOfTension;
MySagging : DistributionOfSagging;
const Standard_Real Angle2)
//=======================================================================
: FairCurve_Energy( Poles, ContrOrder1, ContrOrder2,
- FreeSliding, Angle1, Angle2),
+ FreeSliding, Angle1, Angle2),
MyLengthSliding(LengthSliding),
- OriginalSliding(LengthSliding),
- MyFreeSliding(FreeSliding),
+ OriginalSliding(LengthSliding),
MyBattenLaw(Law),
MyTension(BSplOrder, FlatKnots, Poles, 1, LengthSliding, Law, FreeSliding),
MySagging(BSplOrder, FlatKnots, Poles, 1, Law, FreeSliding)
fields
MyLengthSliding : Real;
OriginalSliding : Real;
- MyFreeSliding : Boolean;
MyBattenLaw : BattenLaw;
MyPhysicalRatio : Real;
MyTension : DistributionOfTension;
const Standard_Real Curvature2 )
//=====================================================================================
: FairCurve_Energy( Poles, ContrOrder1, ContrOrder2,
- FreeSliding, Angle1, Angle2,
- BSplOrder-1, Curvature1, Curvature2),
+ FreeSliding, Angle1, Angle2,
+ BSplOrder-1, Curvature1, Curvature2),
MyLengthSliding(LengthSliding),
- OriginalSliding(LengthSliding),
- MyFreeSliding(FreeSliding),
+ OriginalSliding(LengthSliding),
MyBattenLaw(Law),
MyPhysicalRatio(PhysicalRatio),
MyTension(BSplOrder, FlatKnots, Poles, 1, LengthSliding, Law, FreeSliding, Standard_True),
MySagging(BSplOrder, FlatKnots, Poles, 1, Law, FreeSliding),
- MyJerk( BSplOrder, FlatKnots, Poles, 1, Law, FreeSliding)
+ MyJerk( BSplOrder, FlatKnots, Poles, 1, Law, FreeSliding)
{
Standard_DomainError_Raise_if(PhysicalRatio < 0 || PhysicalRatio > 1,
- "FairCurve_EnergyOfMVC: PhysicalRatio error" );
+ "FairCurve_EnergyOfMVC: PhysicalRatio error" );
}
-- stores the number of points computed with the
-- requested Abscissa else stores the requested
-- number of points
- myAbscissa : Real;
myParams : HArray1OfReal from TColStd ;
-- the size of this array will be be bigger than myNbPoints
-- by one or two
#include <StdFail_NotDone.hxx>
#include <TColStd_HArray1OfReal.hxx>
-//#include <GCPnts_QuasiUniformAbscissa.hxx>
inline Standard_Boolean GCPnts_QuasiUniformAbscissa::IsDone () const
{
return myDone;
}
-//inline Standard_Real GCPnts_QuasiUniformAbscissa::Abscissa () const
-//{
-// StdFail_NotDone_Raise_if(!myDone,
-// "GCPnts_QuasiUniformAbscissa::Abscissa()");
-// return myAbscissa;
-//}
inline Standard_Integer GCPnts_QuasiUniformAbscissa::NbPoints () const
{
for(; i <= iEnd; i++){
Standard_Real kn = Knots(i);
if(A < kn)
- if(kn < B) VA(j++) = VB(k++) = kn; else break;
+ {
+ if(kn < B)
+ {
+ VA(j++) = VB(k++) = kn;
+ }
+ else
+ {
+ break;
+ }
+ }
}
VB(k) = B;
return k;
for(; i <= iEnd; i++){
Standard_Real kn = Knots(i);
if(A < kn)
- if(kn < B) VA(j++) = VB(k++) = kn; else break;
+ {
+ if(kn < B)
+ {
+ VA(j++) = VB(k++) = kn;
+ }
+ else
+ {
+ break;
+ }
+ }
}
VB(k) = B;
return k;
-- the cache
ucachespanlenght : Real ;
vcachespanlenght : Real ;
- -- Always 1. for the moment.
- ucachespanindex : Integer ;
- vcachespanindex : Integer ;
-- the span for which the cache is valid if
-- validcache is 1
validcache : Integer ;
myBary : Pnt from gp;
myRadius : Real;
- myMinW : Real;
maxang : Real;
minang : Real;
distmin : Real;
-- result curves of aproximation.
appdone : Boolean from Standard;
- tolapp3d : Real from Standard[4];
- tolappang : Real from Standard[4];
degree : Integer from Standard [2];
curvpol : HArray1OfPnt from TColgp [4];
tgtepol : HArray1OfPnt from TColgp [4];
-- the corners.
c : Pnt from gp [4];
- gap : Real from Standard [4];
-- the blending functions.
a : Function from Law [2];
myG1Error : Real from Standard;
myG2Error : Real from Standard;
myNbPtsOnCur : Integer from Standard;
- mySurfInitIsPlane : Boolean from Standard;
mySurfInitIsGive : Boolean from Standard;
myNbIter : Integer from Standard;
myProj : ExtPS from Extrema;
myTol2d : Real from Standard;
myTol3d : Real from Standard;
myTolAng : Real from Standard;
- myTolCurv : Real from Standard;
myTolU : Real from Standard;
myTolV : Real from Standard;
const Standard_Real Tol2d,
const Standard_Real Tol3d,
const Standard_Real TolAng,
- const Standard_Real TolCurv,
+ const Standard_Real ,
const Standard_Boolean Anisotropie
) :
myAnisotropie(Anisotropie),
myTol2d(Tol2d),
myTol3d(Tol3d),
myTolAng(TolAng),
-myTolCurv(TolCurv),
myNbBounds(0)
{ Standard_Integer NTCurve=TabCurve->Length();// Nombre de contraintes lineaires
myNbPtsOnCur = 0; // Debrayage du calcul du nombre de points
myTol2d(Tol2d),
myTol3d(Tol3d),
myTolAng(TolAng),
-myTolCurv(TolCurv),
myNbBounds(0)
{ if (myNbIter<1)
Standard_ConstructionError::Raise("GeomPlate : Number of iteration must be >= 1");
myTol2d(Tol2d),
myTol3d(Tol3d),
myTolAng(TolAng),
-myTolCurv(TolCurv),
myNbBounds(0)
{ if (myNbIter<1)
Standard_ConstructionError::Raise("GeomPlate : Number of iteration must be >= 1");
myEMap : IndexedMapOfShape from TopTools;
myFMap : IndexedMapOfShape from TopTools;
myAlgo : PolyAlgo from HLRAlgo;
- myHide : Integer from Standard;
myDebug : Boolean from Standard;
myAngle : Real from Standard;
myTolSta : Real from Standard;
fields
- thecnum : Integer; -- current entity number for recognize
thectyp : IGESType; -- its IGESType (for purpose of optimization)
thestar : HSequenceOfHAsciiString; -- start section
theparh : ParamSet; -- ParamSet reading global parameters
RestrictedInf : Boolean from Standard;
RestrictedSup : Boolean from Standard;
-
- LastZ : Real from Standard;
- LastDZ : Real from Standard;
-
firstbounded : Boolean from Standard;
lastbounded : Boolean from Standard;
quad1 : Quadric from IntSurf;
quad2 : Quadric from IntSurf;
deflectionmax : Real from Standard;
- pasuvmax : Real from Standard;
nbpointsmax : Integer from Standard;
type : Integer from Standard; -- 0: Constant Parameter
-- 1: Uniform Abscissa
quad1(Quad1),
quad2(Quad2),
deflectionmax(0.01),
- pasuvmax(0.05),
nbpointsmax(200),
type(0),
myTolParam(1.e-12),
IntPatch_ALineToWLine::IntPatch_ALineToWLine(const IntSurf_Quadric& Quad1,
const IntSurf_Quadric& Quad2,
const Standard_Real Deflection,
- const Standard_Real PasUVMax,
+ const Standard_Real ,
const Standard_Integer NbMaxPoints)
:
quad1(Quad1),
quad2(Quad2),
deflectionmax(Deflection),
- pasuvmax(PasUVMax),
nbpointsmax(NbMaxPoints),
myTolParam(1.e-12),
myTolOpenDomain(1.e-9),
empt : Boolean from Standard;
tgte : Boolean from Standard;
oppo : Boolean from Standard;
- reverse: Boolean from Standard;
spnt : SequenceOfPoint from IntPatch;
slin : SequenceOfLine from IntPatch;
solrst : TheSOnBounds from IntPatch;
done : Boolean from Standard;
empt : Boolean from Standard;
- Preci : Real from Standard;
- Fleche : Real from Standard;
- Pas : Real from Standard;
SLin : SequenceOfLine from IntPatch;
end PrmPrmIntersection;
myPar1 : Real from Standard;
myParallel : Boolean from Standard;
- myAllNullFlag : Boolean from Standard;
myRange : Range from IntTools;
fields
thenum0 : Integer; -- current data for access to parameters
- thenump0 : Integer;
therrload : Integer;
theparams : ParamSet; -- the general set of parameters
thenumpar : Array1OfInteger from TColStd; -- beginning of each one
thename : AsciiString;
thedef : AsciiString;
thelabel : AsciiString;
- thetype : ParamType from Interface;
theotyp : Type from Standard; -- for object
-
- thelims : Integer; -- status for integer/enum/real limits
- themaxlen : Integer;
- theintlow : Integer;
- theintup : Integer;
- therealow : Real;
- therealup : Real;
theunidef : AsciiString;
-
theenums : HArray1OfAsciiString from TColStd;
theeadds : DictionaryOfInteger;
-
- theinterp : ValueInterpret;
- thesatisf : ValueSatisfies;
thesatisn : AsciiString;
-
- theival : Integer;
thehval : HAsciiString from TCollection;
theoval : Transient;
myContC0 : Real from Standard;
myContC1 : Real from Standard;
myContC2 : Real from Standard;
- myContG0 : Real from Standard;
myContG1 : Real from Standard;
myContG2 : Real from Standard;
myCourbC1 : Real from Standard;
firstArcRight : Address from Standard;
secondArcRight : Address from Standard;
secondArcLeft : Address from Standard;
- firstParameter : Real;
- secondParameter : Real;
end Arc;
fields
myDeflection: Real;
- myNbNodes: Integer;
myNodes: Array1OfPnt2d from TColgp;
end Polygon2D;
mytype : TypeOfSensitivity;
myautointer : Boolean;
- myDetectedIndex : Integer from Standard;
+
end SensitiveFace;
const TColgp_Array1OfPnt& ThePoints,
const Select3D_TypeOfSensitivity aType):
Select3D_SensitivePoly(OwnerId, ThePoints),
-mytype (aType),
-myDetectedIndex(-1)
+mytype (aType)
{
AutoInitFlags(myautointer);
}
const Handle(TColgp_HArray1OfPnt)& ThePoints,
const Select3D_TypeOfSensitivity aType):
Select3D_SensitivePoly(OwnerId, ThePoints),
-mytype (aType),
-myDetectedIndex(-1)
+mytype (aType)
{
AutoInitFlags(myautointer);
}
---Purpose:returns <mymaxrect>
fields
- mymaxrect : Integer;
mysensitive : SensitiveEntitySequence from Select3D;
myDetectedIndex : Integer from Standard;
end SensitiveWire;
Select3D_SensitiveWire::
Select3D_SensitiveWire(const Handle(SelectBasics_EntityOwner)& OwnerId,
- const Standard_Integer MaxRect):
+ const Standard_Integer /*MaxRect*/):
Select3D_SensitiveEntity(OwnerId),
-mymaxrect(MaxRect),
myDetectedIndex(-1)
{}
mynew : MapOfInteger from TColStd;
myhimap : IndexedDataMapOfOwnerPrs;
- mynbpick : Integer;
mylastindex : Integer;
myManager : TransientManager from Visual3d;
end BRepHilighter;
Set (myclass; label: Label from TDF; string : ExtendedString from TCollection)
---Purpose: Creates (if does not exist) and sets the name in the name attribute.
- -- myEmpty becomes False
returns Name from TDataStd;
-- Returns the name contained in this name attribute.
---C++: return const &
- --SetEmpty(me: mutable);
- ---Purpose: Set myEmpty field
-
- --IsEmpty(me) returns Boolean from Standard;
-
---Category: TDF_Attribute methods
-- =====================
fields
myString : ExtendedString from TCollection; --To store name
- myEmpty : Boolean from Standard; --Is set to True if name isn't set
end Name;
//purpose : Empty Constructor
//=======================================================================
-TDataStd_Name::TDataStd_Name ()
- : myEmpty(Standard_True) { }
-
-//=======================================================================
-//function : Father
-//purpose :
-//=======================================================================
-// Standard_Boolean TDataStd_Name::Father (Handle(TDataStd_Name)& name) const
-// {
-// Handle(TDataStd_Name) father;
-// TDF_Label L = Label();
-// while (!L.IsRoot()) {
-// L = L.Father();
-// if (L.FindAttribute (TDataStd_Name::GetID(), father)) {
-// name = father;
-// return Standard_True;
-// }
-// }
-// return Standard_False;
-// }
+TDataStd_Name::TDataStd_Name () { }
//=======================================================================
//function : Set
//=======================================================================
void TDataStd_Name::Set (const TCollection_ExtendedString& S)
{
- // OCC2932 correction
if(myString == S) return;
Backup();
myString = S;
- //TCollection_ExtendedString tmpS(S);
- //tmpS.RemoveAll(':');
- //myString = tmpS;
- //myEmpty = Standard_False;
}
return myString;
}
-//=======================================================================
-//function : SetEmpty
-//purpose :
-//=======================================================================
-// void TDataStd_Name::SetEmpty()
-// {
-// Backup();
-// myEmpty = Standard_True;
-// myString.Clear();
-// }
-
-//=======================================================================
-//function : IsEmpty
-//purpose :
-//=======================================================================
-//Standard_Boolean TDataStd_Name::IsEmpty() const {return myEmpty;}
-
-
// TDF_Attribute methods
//=======================================================================
const Standard_GUID& TDataStd_Name::ID () const { return GetID(); }
-
-
//=======================================================================
//function : NewEmpty
//purpose :
myTDFAcces : Label from TDF;
myShape : Shape from TopoDS;
- myOneOnly : Boolean from Standard;
myDone : Boolean from Standard;
TNaming_Identifier::TNaming_Identifier(const TDF_Label& LabAcces,
const TopoDS_Shape& S,
const TopoDS_Shape& Context,
- const Standard_Boolean OneOnly)
-:myTDFAcces(LabAcces), myShape(S), myOneOnly(OneOnly),
+ const Standard_Boolean /*OneOnly*/)
+:myTDFAcces(LabAcces), myShape(S),
myDone(Standard_False),myIsFeature(Standard_False)
-
{
Init(Context);
}
TNaming_Identifier::TNaming_Identifier(const TDF_Label& LabAcces,
const TopoDS_Shape& S,
const Handle(TNaming_NamedShape)& ContextNS,
- const Standard_Boolean OneOnly)
-:myTDFAcces(LabAcces), myShape(S), myOneOnly(OneOnly),
+ const Standard_Boolean /*OneOnly*/)
+:myTDFAcces(LabAcces), myShape(S),
myDone(Standard_False),myIsFeature(Standard_False)
-
{
const TopoDS_Shape& aContext = TNaming_Tool::GetShape (ContextNS);
Init(aContext);
myEdge1 : Edge from TopoDS;
myCurve1 : Curve from Geom2dAdaptor;
- myCurveType1 : CurveType from GeomAbs;
myDomain1 : Domain from IntRes2d;
myEdge2 : Edge from TopoDS;
myCurve2 : Curve from Geom2dAdaptor;
- myCurveType2 : CurveType from GeomAbs;
myDomain2 : Domain from IntRes2d;
end Hctxee2d from TopOpeBRep;
if (apex) {
TopoDS_Vertex vf,vl; TopExp::Vertices(myEdge1,vf,vl);
gp_Pnt ptf = BRep_Tool::Pnt(vf); Standard_Real df = pt2.Distance(ptf);
- gp_Pnt ptl = BRep_Tool::Pnt(vl);
Standard_Real tolf = BRep_Tool::Tolerance(vf);
Standard_Boolean onf = (df < tolf);
TopoDS_Vertex v1 = onf ? vf : vl;
myEdge : Edge from TopoDS;
myVertices : ListOfPave from TopOpeBRepBuild;
myVerticesIt : ListIteratorOfListOfPave from TopOpeBRepBuild;
- myEdgeVertexIndex : Integer from Standard;
- myEdgeVertexCount : Integer from Standard;
myHasEqualParameters : Boolean from Standard;
myEqualParameters : Real from Standard;
fields
myFace:Face from TopoDS;
- myDEBVertexIndex:Integer;
-
+
end WireEdgeSet from TopOpeBRepBuild;
fields
- myHDS : HDataStructure from TopOpeBRepDS;
+ myHDS : HDataStructure from TopOpeBRepDS;
myMapSurfaceStatus : DataMapOfCheckStatus from TopOpeBRepDS;
- mySurfaceDone : Boolean from Standard;
myMapCurveStatus : DataMapOfCheckStatus from TopOpeBRepDS;
- myCurveDone : Boolean from Standard;
myMapPointStatus : DataMapOfCheckStatus from TopOpeBRepDS;
- myPointDone : Boolean from Standard;
myMapShapeStatus : DataMapOfCheckStatus from TopOpeBRepDS;
- myShapeDone : Boolean from Standard;
- myDone : Boolean from Standard;
-
+
end Check from TopOpeBRepDS;
//=======================================================================
TopOpeBRepDS_Check::TopOpeBRepDS_Check(const Handle(TopOpeBRepDS_HDataStructure)& HDS)
-: mySurfaceDone(Standard_False),
- myCurveDone(Standard_False),
- myPointDone(Standard_False),
- myShapeDone (Standard_False),
- myDone(Standard_False)
{
myHDS = HDS;
myMapSurfaceStatus.Clear();
//=======================================================================
TopOpeBRepDS_Check::TopOpeBRepDS_Check()
-: mySurfaceDone(Standard_False),
- myCurveDone(Standard_False),
- myPointDone(Standard_False),
- myShapeDone (Standard_False),
- myDone(Standard_False)
{
myMapSurfaceStatus.Clear();
myMapCurveStatus.Clear();
-- extension must be one of ".png",".bmp",".jpg",".gif".
-- Returns FALSE when the dump has failed
- Print (me; hPrnDC: Handle from Aspect = NULL;
+ Print (me; hPrnDC: Handle from Aspect = 0;
showDialog: Boolean = Standard_True;
showBackground : Boolean = Standard_True;
filename: CString = NULL;
// purpose or non-infringement. Please see the License for the specific terms
// and conditions governing the rights and limitations under the License.
-/***********************************************************************
+/***********************************************************************/
- FONCTION :
+/* FUNCTION :
----------
- File V3d_View_1.cxx :
+ File V3d_View_1.cxx : */
/*----------------------------------------------------------------------*/
#define FSR_DEBUG(arg)
// Uncomment the following code to have debug output to cout
-/* * /
+/*
static Standard_Boolean mydebug = Standard_False;
#undef FSR_DEBUG
#define FSR_DEBUG(arg) {if (mydebug) { cout << arg << endl; }}
-/* */
+*/
class MyDirFunction : public math_Function
{
fields
Done: Boolean;
-Singular: Boolean;
U: Matrix;
V: Matrix;
Diag: Vector;