mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-07 18:30:55 +03:00
0033778: Documentation - Fix various typos found in codebase
This commit is contained in:
luzpaz
GitHub
parent
9fcfec881c
commit
245febe036
src
AIS
AdvApp2Var
AdvApp2Var_ApproxAFunc2Var.cxxAdvApp2Var_ApproxAFunc2Var.hxxAdvApp2Var_ApproxF2var.cxxAdvApp2Var_MathBase.cxxAdvApp2Var_SysBase.cxx
AdvApprox
BOPAlgo
BOPTools
BRepExtrema
BRepExtrema_ProximityDistTool.cxxBRepExtrema_ProximityDistTool.hxxBRepExtrema_ProximityValueTool.cxxBRepExtrema_ProximityValueTool.hxxBRepExtrema_ShapeProximity.hxx
BRepTools
BSplSLib
BndLib
CPnts
ChFi3d
Convert
GProp
GeometryTest
Hermit
IGESGeom
IntAna
IntSurf
IntTools
NCollection
OpenGlTest
Poly
Quantity
ShapeAnalysis
ShapeAnalysis_CanonicalRecognition.cxxShapeAnalysis_CanonicalRecognition.hxxShapeAnalysis_FreeBounds.hxx
ShapeFix
StepAP242
StepFile
TopLoc
TopOpeBRepBuild
TopOpeBRepBuild_Builder.cxxTopOpeBRepBuild_Builder1.cxxTopOpeBRepBuild_Builder1_1.cxxTopOpeBRepBuild_KPart.cxxTopOpeBRepBuild_makefaces.cxx
TopOpeBRepDS
VrmlData
XSControl
@ -36,7 +36,7 @@
|
||||
//! The Datum groups together the construction elements such as lines, circles, points, trihedra, plane trihedra, planes and axes.
|
||||
//! The Relation is made up of constraints on one or more interactive shapes and the corresponding reference geometry.
|
||||
//! For example, you might want to constrain two edges in a parallel relation.
|
||||
//! This contraint is considered as an object in its own right, and is shown as a sensitive primitive.
|
||||
//! This constraint is considered as an object in its own right, and is shown as a sensitive primitive.
|
||||
//! This takes the graphic form of a perpendicular arrow marked with the || symbol and lying between the two edges.
|
||||
//! The Object type includes topological shapes, and connections between shapes.
|
||||
//! None, in order not to eliminate the object, tells the application to look further until it finds an object definition in its generation which is accepted.
|
||||
|
||||
@ -42,7 +42,7 @@ DEFINE_STANDARD_HANDLE(AIS_ExclusionFilter, SelectMgr_Filter)
|
||||
//! except those of the types and signatures stored
|
||||
//! in the filter framework
|
||||
//! - Exclusion flag off
|
||||
//! - the funciton IsOk answers true for all objects
|
||||
//! - the function IsOk answers true for all objects
|
||||
//! which have the same type and signature as the stored ones.
|
||||
class AIS_ExclusionFilter : public SelectMgr_Filter
|
||||
{
|
||||
|
||||
@ -40,7 +40,7 @@ public:
|
||||
//! @warning It binds this object with Graphic3d_ZLayerId_TopOSD layer.
|
||||
Standard_EXPORT AIS_RubberBand();
|
||||
|
||||
//! Consructs the rubber band with empty filling and defined line style.
|
||||
//! Constructs the rubber band with empty filling and defined line style.
|
||||
//! @param theLineColor [in] color of rubber band lines
|
||||
//! @param theType [in] type of rubber band lines
|
||||
//! @param theLineWidth [in] width of rubber band line. By default it is 1.
|
||||
|
||||
@ -363,7 +363,7 @@ void AdvApp2Var_ApproxAFunc2Var::ComputePatches(const AdvApprox_Cutting& UChoice
|
||||
throw Standard_ConstructionError("AdvApp2Var_ApproxAFunc2Var : Surface Discretisation Error");
|
||||
}
|
||||
|
||||
// calculate the number and the type of autorized cuts
|
||||
// calculate the number and the type of authorized cuts
|
||||
// depending on the max number of squares and the validity of next cuts.
|
||||
NbU = myResult.NbPatchInU();
|
||||
NbV = myResult.NbPatchInV();
|
||||
@ -457,7 +457,7 @@ void AdvApp2Var_ApproxAFunc2Var::ComputePatches(const AdvApprox_Cutting& UChoice
|
||||
throw Standard_ConstructionError("AdvApp2Var_ApproxAFunc2Var : Surface Discretisation Error");
|
||||
}
|
||||
|
||||
// calculate the number and type of autorized cuts
|
||||
// calculate the number and type of authorized cuts
|
||||
// depending on the max number of squares and the validity of next cuts
|
||||
NbU = myResult.NbPatchInU();
|
||||
NbV = myResult.NbPatchInV();
|
||||
|
||||
@ -42,13 +42,13 @@ class Geom_BSplineSurface;
|
||||
//! OneDTol, TwoDTol, ThreeDTol: The tolerance of approximation in each
|
||||
//! subspaces
|
||||
//! OneDTolFr, TwoDTolFr, ThreeDTolFr: The tolerance of approximation on
|
||||
//! the boundarys in each subspaces
|
||||
//! the boundaries in each subspaces
|
||||
//! [FirstInU, LastInU]: The Bounds in U of the Approximation
|
||||
//! [FirstInV, LastInV]: The Bounds in V of the Approximation
|
||||
//! FavorIso : Give preference to extract u-iso or v-iso on F(U,V)
|
||||
//! This can be useful to optimize the <Func> method
|
||||
//! ContInU, ContInV : Continuity waiting in u and v
|
||||
//! PrecisCode : Precision on approximation's error mesurement
|
||||
//! PrecisCode : Precision on approximation's error measurement
|
||||
//! 1 : Fast computation and average precision
|
||||
//! 2 : Average computation and good precision
|
||||
//! 3 : Slow computation and very good precision
|
||||
|
||||
@ -337,7 +337,7 @@ int mma1cdi_(integer *ndimen,
|
||||
/* HERMIT: Table of coeff. 2*(IORDRE+1) Hermite polynoms */
|
||||
/* of degree 2*IORDRE+1. */
|
||||
/* IERCOD: Error code, */
|
||||
/* = 0, Everythig is OK */
|
||||
/* = 0, Everything is OK */
|
||||
/* = 1, The value of IORDRE is out of (0,2) */
|
||||
/* COMMON USED : */
|
||||
/* ---------------- */
|
||||
@ -989,8 +989,8 @@ int mma1fer_(integer *,//ndimen,
|
||||
/* IORDRE: Order of constraint at the extremities of the border */
|
||||
/* -1 = no constraints, */
|
||||
/* 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). */
|
||||
/* 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 use for the calculation */
|
||||
/* in the base of Jacobi. */
|
||||
/* CRVJAC: Table of coeff. of the curve of approximation in the */
|
||||
@ -1131,7 +1131,7 @@ int mma1fer_(integer *,//ndimen,
|
||||
|
||||
/* ------------------------------ The end -------------------------------
|
||||
*/
|
||||
/* --> The order of constraints is not within autorized values. */
|
||||
/* --> The order of constraints is not within authorized values. */
|
||||
L9100:
|
||||
*iercod = 1;
|
||||
goto L9999;
|
||||
@ -3520,7 +3520,7 @@ int AdvApp2Var_ApproxF2var::mma2cdi_( integer *ndimen,
|
||||
goto L9100;
|
||||
}
|
||||
|
||||
/* ---- Subract discretizations of polynoms of constraints
|
||||
/* ---- Subtract discretizations of polynoms of constraints
|
||||
---- */
|
||||
|
||||
mma2cd3_(ndimen, nbpntu, &urootl[1], nbpntv, iordru, &sotbu1[1],
|
||||
@ -4919,7 +4919,7 @@ int mma2cfv_(integer *ndvjac,
|
||||
/* MAXDGU: Degree maximum by U of coeff. to calculate. */
|
||||
/* NBPNTV: Degree of the Legendre polynom on the roots which of */
|
||||
/* the coefficients of integration by V are calculated */
|
||||
/* by Gauss method. It is reqired that NBPNTV = 30, 40, 50 or 61 and NDVJAC < NBPNTV. */
|
||||
/* by Gauss method. It is required 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 */
|
||||
@ -7511,7 +7511,7 @@ int mmmapcoe_(integer *ndim,
|
||||
|
||||
/* FUNCTION : */
|
||||
/* ---------- */
|
||||
/* Calculate the coefficients of polinomial approximation curve */
|
||||
/* Calculate the coefficients of polynomial approximation curve */
|
||||
/* of degree NDGJAC by the method of smallest squares starting from */
|
||||
/* the discretization of function on the roots of Legendre polynom */
|
||||
/* of degree NBPNTS. */
|
||||
@ -8102,7 +8102,7 @@ int mmjacpt_(const integer *ndimen,
|
||||
|
||||
/* OUTPUT ARGUMENTS : */
|
||||
/* ------------------- */
|
||||
/* PTCAUX : Auxilliary space. */
|
||||
/* PTCAUX : Auxiliary space. */
|
||||
/* PTCCAN : The square in the canonic base (-1,1) */
|
||||
|
||||
/* COMMONS USED : */
|
||||
|
||||
@ -1229,7 +1229,7 @@ int AdvApp2Var_MathBase::mmaperx_(integer *ncofmx,
|
||||
/* ERRMAX : Precision of the approximation. */
|
||||
/* IERCOD = 0, OK */
|
||||
/* = 1, order of constraints (IORDRE) is not within the */
|
||||
/* autorized values. */
|
||||
/* authorized values. */
|
||||
/* COMMONS USED : */
|
||||
/* ---------------- */
|
||||
|
||||
@ -2281,7 +2281,7 @@ int AdvApp2Var_MathBase::mmcglc1_(integer *ndimax,
|
||||
/* length calculation. */
|
||||
/* TFINAL : Upper limit of the interval of integration for */
|
||||
/* length calculation. */
|
||||
/* EPSILN : REQIRED precision for length calculation. */
|
||||
/* EPSILN : REQUIRED precision for length calculation. */
|
||||
|
||||
/* OUTPUT ARGUMENTS : */
|
||||
/* ------------------- */
|
||||
@ -2677,14 +2677,14 @@ int AdvApp2Var_MathBase::mmcvctx_(integer *ndimen,
|
||||
/* 2 --> cas (0)+ (1) + " " 2nd derivatives. */
|
||||
/* etc... */
|
||||
/* CTRTES : Table of constraints. */
|
||||
/* CTRTES(*,1,*) = contraints at -1. */
|
||||
/* CTRTES(*,2,*) = contraints at 1. */
|
||||
/* CTRTES(*,1,*) = constraints at -1. */
|
||||
/* CTRTES(*,2,*) = constraints at 1. */
|
||||
|
||||
/* OUTPUT ARGUMENTS : */
|
||||
/* ------------------- */
|
||||
/* CRVRES : Resulting curve defined on (-1,1). */
|
||||
/* TABAUX : Auxilliary matrix. */
|
||||
/* XMATRI : Auxilliary matrix. */
|
||||
/* TABAUX : Auxiliary matrix. */
|
||||
/* XMATRI : Auxiliary matrix. */
|
||||
|
||||
/* COMMONS UTILISES : */
|
||||
/* ---------------- */
|
||||
@ -3560,7 +3560,7 @@ int AdvApp2Var_MathBase::mmdrvck_(integer *ncoeff,
|
||||
*/
|
||||
|
||||
|
||||
/* Factorials (1 to 21) caculated on VAX in R*16 */
|
||||
/* Factorials (1 to 21) calculated on VAX in R*16 */
|
||||
|
||||
|
||||
/* **********************************************************************
|
||||
@ -3845,7 +3845,7 @@ int mmexthi_(integer *ndegre,
|
||||
/* within the interval [0,1]. They are ranked for the degrees increasing from */
|
||||
/* 2 to 61. */
|
||||
/* HILTAB : Table of Legendre interpolators concerning ROOTAB. */
|
||||
/* The adressing is the same. */
|
||||
/* The addressing is the same. */
|
||||
/* HI0TAB : Table of Legendre interpolators for root x=0 */
|
||||
/* of polynoms of UNEVEN degree. */
|
||||
/* RTLTB0 : Table of Li(uk) where uk are the roots of */
|
||||
@ -3990,7 +3990,7 @@ int mmextrl_(integer *ndegre,
|
||||
/* within the interval [0,1]. They are ranked for the degrees increasing from */
|
||||
/* 2 to 61. */
|
||||
/* HILTAB : Table of Legendre interpolators concerning ROOTAB. */
|
||||
/* The adressing is the same. */
|
||||
/* The addressing is the same. */
|
||||
/* HI0TAB : Table of Legendre interpolators for root x=0 */
|
||||
/* of polynoms of UNEVEN degree. */
|
||||
/* RTLTB0 : Table of Li(uk) where uk are the roots of */
|
||||
@ -4610,7 +4610,7 @@ int AdvApp2Var_MathBase::mmfmcb5_(integer *isenmsc,
|
||||
|
||||
/* FUNCTION : */
|
||||
/* ---------- */
|
||||
/* Reformating (and eventual compression/decompression) of curve */
|
||||
/* Reformatting (and eventual compression/decompression) of curve */
|
||||
/* (ndim,.) by (.,ndim) and vice versa. */
|
||||
|
||||
/* KEYWORDS : */
|
||||
@ -6260,7 +6260,7 @@ L9999:
|
||||
|
||||
/* OUTPUT ARGUMENTS : */
|
||||
/* ------------------- */
|
||||
/* POLAUX : Auxilliary space. */
|
||||
/* POLAUX : Auxiliary space. */
|
||||
/* CRVCAN : The curve in the canonic base [-1,1] */
|
||||
|
||||
/* COMMONS USED : */
|
||||
@ -6297,7 +6297,7 @@ L9999:
|
||||
|
||||
i__1 = *ndim;
|
||||
for (nd = 1; nd <= i__1; ++nd) {
|
||||
/* Loading of the auxilliary table. */
|
||||
/* Loading of the auxiliary table. */
|
||||
ii = 0;
|
||||
i__2 = ndeg / 2;
|
||||
for (i__ = 0; i__ <= i__2; ++i__) {
|
||||
@ -6377,7 +6377,7 @@ int mmloncv_(integer *ndimax,
|
||||
/* -------------------- */
|
||||
|
||||
/* NDIMAX : Max number of lines of tables (max number of polynoms). */
|
||||
/* NDIMEN : Dimension of the polynom (Nomber of polynoms). */
|
||||
/* NDIMEN : Dimension of the polynom (Number of polynoms). */
|
||||
/* NCOEFF : Number of coefficients of the polynom (no limitation) */
|
||||
/* This is degree + 1 */
|
||||
/* COURBE : Coefficients of the polynom ordered by increasing power */
|
||||
@ -6606,7 +6606,7 @@ L9900:
|
||||
/* FUNCTION : */
|
||||
/* ---------- */
|
||||
/* Position on the polynoms of base hermit-Jacobi */
|
||||
/* and their succesive derivatives */
|
||||
/* and their successive derivatives */
|
||||
|
||||
/* KEYWORDS : */
|
||||
/* ----------- */
|
||||
@ -7160,7 +7160,7 @@ int mmpojac_(doublereal *tparam,
|
||||
*/
|
||||
|
||||
|
||||
/* static varaibles */
|
||||
/* static variables */
|
||||
|
||||
|
||||
|
||||
@ -7519,12 +7519,12 @@ L9999:
|
||||
|
||||
/* INPUT ARGUMENTS : */
|
||||
/* -------------------- */
|
||||
/* HDIMEN: NOMBER OF LINE (OR COLUMN) OF THE HESSIAN MATRIX */
|
||||
/* GDIMEN: NOMBER OF LINE OF THE MATRIX OF CONSTRAINTS */
|
||||
/* HNSTOC: NOMBErS OF TERMS IN THE PROFILE OF HESSIAN MATRIX
|
||||
/* HDIMEN: NUMBER OF LINE (OR COLUMN) OF THE HESSIAN MATRIX */
|
||||
/* GDIMEN: NUMBER OF LINE OF THE MATRIX OF CONSTRAINTS */
|
||||
/* HNSTOC: NUMBERS OF TERMS IN THE PROFILE OF HESSIAN MATRIX
|
||||
*/
|
||||
/* 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) */
|
||||
/* GNSTOC: NUMBERS OF TERMS IN THE PROFILE OF THE MATRIX OF CONSTRAINTS */
|
||||
/* MNSTOC: NUMBERS 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 */
|
||||
/* IN FORM OF PROFILE */
|
||||
@ -7896,7 +7896,7 @@ int mmrslss_(integer *,//mxcoef,
|
||||
/* ----------------------------------- */
|
||||
/* T */
|
||||
/* SS is the decomposition of choleski of a symmetric matrix */
|
||||
/* defined postive, that can result from routine MMCHOLE. */
|
||||
/* defined positive, that can result from routine MMCHOLE. */
|
||||
|
||||
/* For a full matrix it is possible to use MRSLMSC */
|
||||
|
||||
@ -8409,7 +8409,7 @@ L9999:
|
||||
/* > */
|
||||
/* **********************************************************************
|
||||
*/
|
||||
/* Nome of the routine */
|
||||
/* Name of the routine */
|
||||
|
||||
|
||||
/* Common MLGDRTL: */
|
||||
@ -8675,7 +8675,7 @@ int mmtmave_(integer *nligne,
|
||||
/* INPUT ARGUMENTS : */
|
||||
/* -------------------- */
|
||||
/* NLIGNE : NUMBER OF LINE OF THE MATRIX */
|
||||
/* NCOLON : NOMBER OF COLUMN OF THE MATRIX */
|
||||
/* NCOLON : NUMBER 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 */
|
||||
@ -11193,7 +11193,7 @@ L9900:
|
||||
|
||||
/* FUNCTION : */
|
||||
/* ---------- */
|
||||
/* SERVES to calculate the euclidian norm of a vector : */
|
||||
/* SERVES to calculate the euclidean norm of a vector : */
|
||||
/* ____________________________ */
|
||||
/* Z = V V(1)**2 + V(2)**2 + ... */
|
||||
|
||||
@ -11208,7 +11208,7 @@ L9900:
|
||||
|
||||
/* OUTPUT ARGUMENTS : */
|
||||
/* ------------------- */
|
||||
/* MZSNORM : Value of the euclidian norm of vector VECTEU */
|
||||
/* MZSNORM : Value of the euclidean norm of vector VECTEU */
|
||||
|
||||
/* COMMONS USED : */
|
||||
/* ---------------- */
|
||||
|
||||
@ -416,7 +416,7 @@ int AdvApp2Var_SysBase::macrchk_()
|
||||
|
||||
/* FONCTION : */
|
||||
/* ---------- */
|
||||
/* TABLE OF MANAGEMENT OF DYNAMIC MEMOTY ALLOCATIONS */
|
||||
/* TABLE OF MANAGEMENT OF DYNAMIC MEMORY ALLOCATIONS */
|
||||
|
||||
/* KEYWORDS : */
|
||||
/* ----------- */
|
||||
@ -2484,7 +2484,7 @@ int mcrfree_(integer *,//ibyte,
|
||||
/* */
|
||||
/* = 0 ==> OK */
|
||||
/* = 1 ==> Allocation impossible */
|
||||
/* = -1 ==> Ofset > 2**31 - 1 */
|
||||
/* = -1 ==> Offset > 2**31 - 1 */
|
||||
/* */
|
||||
|
||||
/* */
|
||||
|
||||
@ -32,7 +32,7 @@
|
||||
class PLib_JacobiPolynomial;
|
||||
|
||||
|
||||
//! Approximate a function on an intervall [First,Last]
|
||||
//! Approximate a function on an interval [First,Last]
|
||||
//! The result is a simple polynomial whose degree is as low as
|
||||
//! possible to satisfy the required tolerance and the
|
||||
//! maximum degree. The maximum error and the averrage error
|
||||
|
||||
@ -223,7 +223,7 @@ typedef NCollection_Vector<BOPAlgo_VFI> BOPAlgo_VectorOfVFI;
|
||||
//=======================================================================
|
||||
void BOPAlgo_Builder::FillImagesFaces(const Message_ProgressRange& theRange)
|
||||
{
|
||||
Message_ProgressScope aPS(theRange, "Filing spligs of faces", 10);
|
||||
Message_ProgressScope aPS(theRange, "Filling splits of faces", 10);
|
||||
BuildSplitFaces(aPS.Next(9));
|
||||
if (HasErrors())
|
||||
{
|
||||
|
||||
@ -1925,7 +1925,7 @@ Standard_Boolean BOPTools_AlgoTools::IsBlockInOnFace
|
||||
}
|
||||
//
|
||||
|
||||
// Treatment intemediate
|
||||
// Treatment intermediate
|
||||
Standard_Real m1, aTolF, aTolE, aTol, aDist;
|
||||
m1=IntTools_Tools::IntermediatePoint(f1, l1);
|
||||
BOPTools_AlgoTools::PointOnEdge(aE1, m1, aP12);
|
||||
|
||||
@ -182,7 +182,7 @@ public: //! @name Point/Edge/Face classification relatively solid
|
||||
//! Computes the 3-D state of the point thePoint
|
||||
//! toward solid theSolid.
|
||||
//! theTol - value of precision of computation
|
||||
//! theContext- cahed geometrical tools
|
||||
//! theContext- cached geometrical tools
|
||||
//! Returns 3-D state.
|
||||
Standard_EXPORT static TopAbs_State ComputeState(const gp_Pnt& thePoint,
|
||||
const TopoDS_Solid& theSolid,
|
||||
@ -192,7 +192,7 @@ public: //! @name Point/Edge/Face classification relatively solid
|
||||
//! Computes the 3-D state of the vertex theVertex
|
||||
//! toward solid theSolid.
|
||||
//! theTol - value of precision of computation
|
||||
//! theContext- cahed geometrical tools
|
||||
//! theContext- cached geometrical tools
|
||||
//! Returns 3-D state.
|
||||
Standard_EXPORT static TopAbs_State ComputeState(const TopoDS_Vertex& theVertex,
|
||||
const TopoDS_Solid& theSolid,
|
||||
@ -202,7 +202,7 @@ public: //! @name Point/Edge/Face classification relatively solid
|
||||
//! Computes the 3-D state of the edge theEdge
|
||||
//! toward solid theSolid.
|
||||
//! theTol - value of precision of computation
|
||||
//! theContext- cahed geometrical tools
|
||||
//! theContext- cached geometrical tools
|
||||
//! Returns 3-D state.
|
||||
Standard_EXPORT static TopAbs_State ComputeState(const TopoDS_Edge& theEdge,
|
||||
const TopoDS_Solid& theSolid,
|
||||
@ -213,7 +213,7 @@ public: //! @name Point/Edge/Face classification relatively solid
|
||||
//! toward solid theSolid.
|
||||
//! theTol - value of precision of computation
|
||||
//! theBounds - set of edges of <theSolid> to avoid
|
||||
//! theContext- cahed geometrical tools
|
||||
//! theContext- cached geometrical tools
|
||||
//! Returns 3-D state.
|
||||
Standard_EXPORT static TopAbs_State ComputeState(const TopoDS_Face& theFace,
|
||||
const TopoDS_Solid& theSolid,
|
||||
@ -224,7 +224,7 @@ public: //! @name Point/Edge/Face classification relatively solid
|
||||
//! Computes the 3-D state of the shape theShape
|
||||
//! toward solid theSolid.
|
||||
//! theTol - value of precision of computation
|
||||
//! theContext- cahed geometrical tools
|
||||
//! theContext- cached geometrical tools
|
||||
//! Returns 3-D state.
|
||||
Standard_EXPORT static TopAbs_State ComputeStateByOnePoint(const TopoDS_Shape& theShape,
|
||||
const TopoDS_Solid& theSolid,
|
||||
@ -274,7 +274,7 @@ public: //! @name Face classification relatively solid
|
||||
//! solid theSolid.
|
||||
//! theMEF - Map Edge/Faces for theSolid
|
||||
//! theTol - value of precision of computation
|
||||
//! theContext- cahed geometrical tools
|
||||
//! theContext- cached geometrical tools
|
||||
Standard_EXPORT static Standard_Boolean IsInternalFace(const TopoDS_Face& theFace,
|
||||
const TopoDS_Solid& theSolid,
|
||||
TopTools_IndexedDataMapOfShapeListOfShape& theMEF,
|
||||
|
||||
@ -95,7 +95,7 @@ void BRepExtrema_ProximityDistTool::LoadAdditionalPointsFirstSet (const BVH_Arra
|
||||
|
||||
//=======================================================================
|
||||
//function : goThroughtSet1
|
||||
//purpose : Goes throught vertices from the 1st set
|
||||
//purpose : Goes through vertices from the 1st set
|
||||
//=======================================================================
|
||||
void BRepExtrema_ProximityDistTool::goThroughtSet1 (const BVH_Array3d& theVertices1,
|
||||
const Standard_Boolean theIsAdditionalSet)
|
||||
|
||||
@ -88,7 +88,7 @@ public:
|
||||
|
||||
public:
|
||||
|
||||
//! Creates new unitialized tool.
|
||||
//! Creates new uninitialized tool.
|
||||
Standard_EXPORT BRepExtrema_ProximityDistTool();
|
||||
|
||||
//! Creates new tool for the given element sets.
|
||||
@ -169,7 +169,7 @@ protected:
|
||||
|
||||
private:
|
||||
|
||||
//! Goes throught vertices from the 1st set.
|
||||
//! Goes through vertices from the 1st set.
|
||||
void goThroughtSet1 (const BVH_Array3d& aVertices1,
|
||||
const Standard_Boolean theIsAdditionalSet);
|
||||
|
||||
|
||||
@ -27,7 +27,7 @@
|
||||
|
||||
//=======================================================================
|
||||
//function : BRepExtrema_ProximityValueTool
|
||||
//purpose : Creates new unitialized proximity tool
|
||||
//purpose : Creates new uninitialized proximity tool
|
||||
//=======================================================================
|
||||
BRepExtrema_ProximityValueTool::BRepExtrema_ProximityValueTool()
|
||||
: myIsRefinementRequired1 (Standard_False),
|
||||
@ -262,8 +262,8 @@ Standard_Boolean BRepExtrema_ProximityValueTool::getEdgeAdditionalVertices (
|
||||
//=======================================================================
|
||||
//function : doRecurTrgSplit
|
||||
//purpose : Splits the triangle into two ones recursively, halving the longest side
|
||||
// untill the area of the current triangle > input step
|
||||
//! @param theTrg points of the triangle to be splitted
|
||||
// until the area of the current triangle > input step
|
||||
//! @param theTrg points of the triangle to be split
|
||||
//! @param theEdgesStatus status of triangle edges - on the border or middle of the face
|
||||
//! @param theTol telerance used in search of coincidence points
|
||||
//! @param theStep minimum area of the resulting triangle
|
||||
|
||||
@ -90,7 +90,7 @@ class BRepExtrema_ProximityValueTool
|
||||
|
||||
public:
|
||||
|
||||
//! Creates new unitialized proximity tool.
|
||||
//! Creates new uninitialized proximity tool.
|
||||
Standard_EXPORT BRepExtrema_ProximityValueTool();
|
||||
|
||||
//! Creates new proximity tool for the given element sets.
|
||||
|
||||
@ -194,7 +194,7 @@ private:
|
||||
|
||||
//! Reference point of the proximity value on the 1st shape.
|
||||
gp_Pnt myProxPoint1;
|
||||
//! Reference point of the proximity value on the 2st shape.
|
||||
//! Reference point of the proximity value on the 2nd shape.
|
||||
gp_Pnt myProxPoint2;
|
||||
|
||||
//! Status of reference points of the proximity value.
|
||||
|
||||
@ -11,7 +11,7 @@
|
||||
// Alternatively, this file may be used under the terms of Open CASCADE
|
||||
// commercial license or contractual agreement.
|
||||
|
||||
// abv 28.04.99 S4137: ading method Apply for work on all types of shapes
|
||||
// abv 28.04.99 S4137: adding method Apply for work on all types of shapes
|
||||
// sln 29.11.01 Bug24: correction iteration through map in method 'Status'
|
||||
// sln 29.11.01 Bug22: correction of methods Replace and Value for case when mode myConsiderLocation is on
|
||||
|
||||
@ -362,7 +362,7 @@ TopoDS_Shape BRepTools_ReShape::Apply (const TopoDS_Shape& shape,
|
||||
if(st == TopAbs_VERTEX || st == TopAbs_SHAPE)
|
||||
return shape;
|
||||
// define allowed types of components
|
||||
//fix for SAMTECH bug OCC322 about abcense internal vertices after sewing.
|
||||
//fix for SAMTECH bug OCC322 about absent internal vertices after sewing.
|
||||
/*
|
||||
switch ( st ) {
|
||||
case TopAbs_COMPOUND: subt = TopAbs_SHAPE; break;
|
||||
@ -402,14 +402,14 @@ TopoDS_Shape BRepTools_ReShape::Apply (const TopoDS_Shape& shape,
|
||||
if ( isEmpty )
|
||||
isEmpty = Standard_False;
|
||||
locStatus |= EncodeStatus(3);//ShapeExtend::EncodeStatus ( ShapeExtend_DONE3 );
|
||||
if ( st == TopAbs_COMPOUND || newsh.ShapeType() == sh.ShapeType()) { //fix for SAMTECH bug OCC322 about abcense internal vertices after sewing.
|
||||
if ( st == TopAbs_COMPOUND || newsh.ShapeType() == sh.ShapeType()) { //fix for SAMTECH bug OCC322 about absent internal vertices after sewing.
|
||||
B.Add ( result, newsh );
|
||||
continue;
|
||||
}
|
||||
Standard_Integer nitems = 0;
|
||||
for ( TopoDS_Iterator subit(newsh); subit.More(); subit.Next(), nitems++ ) {
|
||||
const TopoDS_Shape& subsh = subit.Value();
|
||||
if ( subsh.ShapeType() == sh.ShapeType() ) B.Add ( result, subsh );//fix for SAMTECH bug OCC322 about abcense internal vertices after sewing.
|
||||
if ( subsh.ShapeType() == sh.ShapeType() ) B.Add ( result, subsh );//fix for SAMTECH bug OCC322 about absent internal vertices after sewing.
|
||||
else locStatus |= EncodeStatus(10);//ShapeExtend::EncodeStatus ( ShapeExtend_FAIL1 );
|
||||
}
|
||||
if ( ! nitems ) locStatus |= EncodeStatus(10);//ShapeExtend::EncodeStatus ( ShapeExtend_FAIL1 );
|
||||
|
||||
@ -72,7 +72,7 @@ public:
|
||||
//! Clears the content of the set.
|
||||
Standard_EXPORT virtual void Clear() Standard_OVERRIDE;
|
||||
|
||||
//! Stores the goemetry of <S>.
|
||||
//! Stores the geometry of <S>.
|
||||
Standard_EXPORT virtual void AddGeometry (const TopoDS_Shape& S) Standard_OVERRIDE;
|
||||
|
||||
//! Dumps the geometry of me on the stream <OS>.
|
||||
|
||||
@ -31,7 +31,7 @@ public:
|
||||
//! \param theDegreeU degree along the first parameter (U) of the surface
|
||||
//! \param thePeriodicU identify the surface is periodical along U axis
|
||||
//! \param theFlatKnotsU knots of the surface (with repetition) along U axis
|
||||
//! \param theDegreeV degree alogn the second parameter (V) of the surface
|
||||
//! \param theDegreeV degree along the second parameter (V) of the surface
|
||||
//! \param thePeriodicV identify the surface is periodical along V axis
|
||||
//! \param theFlatKnotsV knots of the surface (with repetition) along V axis
|
||||
//! \param theWeights array of weights of corresponding poles
|
||||
|
||||
@ -215,7 +215,7 @@ static void TreatInfinitePlane(const gp_Pln &aPlane,
|
||||
// theMinIdx - minimum poles index, that can be used.
|
||||
// theMaxIdx - maximum poles index, that can be used.
|
||||
// theShiftCoeff - shift between flatknots array and poles array.
|
||||
// This vaule should be equal to 1 in case of non periodic BSpline,
|
||||
// This value should be equal to 1 in case of non periodic BSpline,
|
||||
// and (degree + 1) - mults(the lowest index).
|
||||
|
||||
void ComputePolesIndexes(const TColStd_Array1OfReal &theKnots,
|
||||
|
||||
@ -451,7 +451,7 @@ void CPnts_AbscissaPoint::Perform(const Standard_Real Abscissa,
|
||||
}
|
||||
else {
|
||||
Standard_Real Ui = U0 + (Abscissa / myL) * (myUMax - myUMin) / 3.;
|
||||
// exercice : why 3 ?
|
||||
// exercise : why 3 ?
|
||||
Perform(Abscissa,U0,Ui,Resolution);
|
||||
}
|
||||
}
|
||||
|
||||
@ -157,7 +157,7 @@ static Standard_Boolean SearchFD(TopOpeBRepDS_DataStructure& DStr,
|
||||
|
||||
//=======================================================================
|
||||
//function : ToricCorner
|
||||
//purpose : Test if this is a paricular cas of a torus corner
|
||||
//purpose : Test if this is a particular case of a torus corner
|
||||
// (or spherical limited by isos).
|
||||
//=======================================================================
|
||||
|
||||
@ -601,7 +601,7 @@ void ChFi3d_FilBuilder::PerformThreeCorner(const Standard_Integer Jndex)
|
||||
#endif
|
||||
|
||||
// the contour to be fillet consists of straight lines uv in beginning and end
|
||||
// of two pcurves (only one if c1pointu) calculted as possible
|
||||
// of two pcurves (only one if c1pointu) calculated as possible
|
||||
// on piv and the opposite face.
|
||||
Handle(GeomFill_Boundary) Bdeb,Bfin,Bpiv,Bfac;
|
||||
Handle(Geom2d_Curve) PCurveOnFace;
|
||||
|
||||
@ -51,7 +51,7 @@
|
||||
//! TrueIntervals : the nth polynomial has to be mapped linearly to be
|
||||
//! defined on the following interval :
|
||||
//! myTrueIntervals->Value(n) and myTrueIntervals->Value(n+1)
|
||||
//! so that it represent adequatly the function with the
|
||||
//! so that it adequately represents the function with the
|
||||
//! required continuity
|
||||
class Convert_CompPolynomialToPoles
|
||||
{
|
||||
@ -85,7 +85,7 @@ public:
|
||||
//! TrueIntervals[2] = {-1, 1}
|
||||
Standard_EXPORT Convert_CompPolynomialToPoles(const Standard_Integer NumCurves, const Standard_Integer Continuity, const Standard_Integer Dimension, const Standard_Integer MaxDegree, const Handle(TColStd_HArray1OfInteger)& NumCoeffPerCurve, const Handle(TColStd_HArray1OfReal)& Coefficients, const Handle(TColStd_HArray2OfReal)& PolynomialIntervals, const Handle(TColStd_HArray1OfReal)& TrueIntervals);
|
||||
|
||||
//! To Convert sevral span with different order of Continuity.
|
||||
//! To Convert several span with different order of Continuity.
|
||||
//! Warning: The Length of Continuity have to be NumCurves-1
|
||||
Standard_EXPORT Convert_CompPolynomialToPoles(const Standard_Integer NumCurves, const Standard_Integer Dimension, const Standard_Integer MaxDegree, const TColStd_Array1OfInteger& Continuity, const TColStd_Array1OfInteger& NumCoeffPerCurve, const TColStd_Array1OfReal& Coefficients, const TColStd_Array2OfReal& PolynomialIntervals, const TColStd_Array1OfReal& TrueIntervals);
|
||||
|
||||
|
||||
@ -60,7 +60,7 @@ public:
|
||||
//! returns true if the geometric system has an axis of symmetry.
|
||||
//! For comparing moments relative tolerance 1.e-10 is used.
|
||||
//! Usually it is enough for objects, restricted by faces with
|
||||
//! analitycal geometry.
|
||||
//! analytical geometry.
|
||||
Standard_EXPORT Standard_Boolean HasSymmetryAxis() const;
|
||||
|
||||
|
||||
@ -73,7 +73,7 @@ public:
|
||||
//! returns true if the geometric system has a point of symmetry.
|
||||
//! For comparing moments relative tolerance 1.e-10 is used.
|
||||
//! Usually it is enough for objects, restricted by faces with
|
||||
//! analitycal geometry.
|
||||
//! analytical geometry.
|
||||
Standard_EXPORT Standard_Boolean HasSymmetryPoint() const;
|
||||
|
||||
|
||||
|
||||
@ -17,7 +17,7 @@
|
||||
#ifndef _GProp_ValueType_HeaderFile
|
||||
#define _GProp_ValueType_HeaderFile
|
||||
|
||||
//! Algorithmes :
|
||||
//! Algorithms:
|
||||
enum GProp_ValueType
|
||||
{
|
||||
GProp_Mass,
|
||||
|
||||
@ -48,7 +48,7 @@ public:
|
||||
//! defines surface commands.
|
||||
Standard_EXPORT static void SurfaceCommands (Draw_Interpretor& I);
|
||||
|
||||
//! defines cosntrained curves commands.
|
||||
//! defines constrained curves commands.
|
||||
Standard_EXPORT static void ConstraintCommands (Draw_Interpretor& I);
|
||||
|
||||
//! defines commands to test the GeomAPI
|
||||
|
||||
@ -287,7 +287,7 @@ static void PolyTest(const TColStd_Array1OfReal& Herm,
|
||||
}
|
||||
} // end of the loop
|
||||
|
||||
if (!SignDenom(Polesinit)) //invertion of the polynome sign
|
||||
if (!SignDenom(Polesinit)) //inversion of the polynome sign
|
||||
{
|
||||
for (index=0;index<=3;index++)
|
||||
Polesinit(index).SetCoord(0.0,-Polesinit(index).Y());
|
||||
@ -520,7 +520,7 @@ static void PolyTest(const TColStd_Array1OfReal& Herm,
|
||||
}
|
||||
} // end of the loop
|
||||
|
||||
if (!SignDenom(Polesinit)) // invertion of the polynome sign
|
||||
if (!SignDenom(Polesinit)) // inversion of the polynome sign
|
||||
{
|
||||
for (index=0;index<=3;index++)
|
||||
Polesinit(index).SetCoord(0.0,-Polesinit(index).Y());
|
||||
|
||||
@ -32,7 +32,7 @@ public:
|
||||
DEFINE_STANDARD_ALLOC
|
||||
|
||||
|
||||
//! Prepares dymanic data (Protocol, Modules) for this package
|
||||
//! Prepares dynamic data (Protocol, Modules) for this package
|
||||
Standard_EXPORT static void Init();
|
||||
|
||||
//! Returns the Protocol for this Package
|
||||
|
||||
@ -38,7 +38,7 @@ DEFINE_STANDARD_HANDLE(IGESGeom_Line, IGESData_IGESEntity)
|
||||
//! From IGES-5.3, two other Forms are admitted (same params) :
|
||||
//! 0 remains for standard limited line (the default)
|
||||
//! 1 for semi-infinite line (End is just a passing point)
|
||||
//! 2 for full infinite Line (both Start and End are abitrary)
|
||||
//! 2 for full infinite Line (both Start and End are arbitrary)
|
||||
class IGESGeom_Line : public IGESData_IGESEntity
|
||||
{
|
||||
|
||||
|
||||
@ -51,7 +51,7 @@ public:
|
||||
//! last parameter or at the first parameter of the domain.
|
||||
Standard_EXPORT Standard_Boolean IsOpen() const;
|
||||
|
||||
//! Returns the paramatric domain of the curve.
|
||||
//! Returns the parametric domain of the curve.
|
||||
Standard_EXPORT void Domain(Standard_Real& theFirst, Standard_Real& theLast) const;
|
||||
|
||||
//! Returns TRUE if the function is constant.
|
||||
|
||||
@ -44,11 +44,11 @@ public:
|
||||
//! it's the parameters which start the marching algorithm
|
||||
static void Value2d (const IntSurf_InteriorPoint& PStart, Standard_Real& U, Standard_Real& V);
|
||||
|
||||
//! returns the tangent at the intersectin in 3d space
|
||||
//! returns the tangent at the intersection in 3d space
|
||||
//! associated to <P>
|
||||
static gp_Vec Direction3d (const IntSurf_InteriorPoint& PStart);
|
||||
|
||||
//! returns the tangent at the intersectin in the
|
||||
//! returns the tangent at the intersection in the
|
||||
//! parametric space of the parametrized surface.This tangent
|
||||
//! is associated to the value2d
|
||||
static gp_Dir2d Direction2d (const IntSurf_InteriorPoint& PStart);
|
||||
|
||||
@ -844,7 +844,7 @@ Standard_Boolean IntTools_Context::IsVertexOnLine
|
||||
aFirst=aC3D->FirstParameter();
|
||||
aLast =aC3D->LastParameter();
|
||||
//
|
||||
// Checking extermities first
|
||||
// Checking extremities first
|
||||
// It is necessary to chose the closest bound to the point
|
||||
Standard_Boolean bFirstValid = Standard_False;
|
||||
Standard_Real aFirstDist = Precision::Infinite();
|
||||
|
||||
@ -72,7 +72,7 @@ public:
|
||||
//! Gets array, can be null
|
||||
void** GetArray() const { return myArray; }
|
||||
|
||||
//! Gets value by index, no acess validation
|
||||
//! Gets value by index, no access validation
|
||||
void* Value (const size_t theInd) const { return myArray[theInd]; }
|
||||
|
||||
public:
|
||||
|
||||
@ -26,10 +26,10 @@
|
||||
//! to the system.
|
||||
//!
|
||||
//! This allocator can also be created per each working thread
|
||||
//! hovewer it real multi-threading performance is dubious.
|
||||
//! however its real multi-threading performance is dubious.
|
||||
//!
|
||||
//! Notice that this also means that existing pointers will be broken
|
||||
//! and you shoould control that allocator is alive along all objects
|
||||
//! and you should control that allocator is alive along all objects
|
||||
//! allocated with him.
|
||||
class NCollection_WinHeapAllocator : public NCollection_BaseAllocator
|
||||
{
|
||||
|
||||
@ -23,7 +23,7 @@ public:
|
||||
|
||||
DEFINE_STANDARD_ALLOC
|
||||
|
||||
//! Adds Draw commands to the draw interpretor.
|
||||
//! Adds Draw commands to the draw interpreter.
|
||||
Standard_EXPORT static void Commands (Draw_Interpretor& theDI);
|
||||
|
||||
//! Plugin entry point function.
|
||||
|
||||
@ -50,7 +50,7 @@ DEFINE_STANDARD_HANDLE (Poly_CoherentTriangulation, Standard_Transient)
|
||||
*
|
||||
* This class is useful for algorithms that need to analyse and/or edit a triangulated mesh -- for example for mesh refining.
|
||||
* The connectivity model follows the idea that all Triangles in a mesh should have coherent orientation like on a surface of a solid body.
|
||||
* Connections between more than 2 triangles are not suppoorted.
|
||||
* Connections between more than 2 triangles are not supported.
|
||||
*
|
||||
* @section Poly_CoherentTriangulation Architecture
|
||||
* The data types used in this structure are:
|
||||
|
||||
@ -131,7 +131,7 @@ namespace
|
||||
{
|
||||
return false;
|
||||
}
|
||||
// std::all_of is not used due to VS2008 compilability limitation
|
||||
// std::all_of is not used due to VS2008 compatibility limitation
|
||||
return std::count_if (theString, theString + theLength, isHexDigit) == static_cast<std::ptrdiff_t> (theLength);
|
||||
}
|
||||
|
||||
|
||||
@ -825,7 +825,7 @@ Standard_Boolean ShapeAnalysis_CanonicalRecognition::GetSurfaceByLS(const TopoDS
|
||||
Standard_Real aRelDev = 0.2; //Customer can set parameters of sample surface
|
||||
// with relative precision about aRelDev.
|
||||
// For example, if radius of sample surface is R,
|
||||
// it means, that "exact" vaue is in interav
|
||||
// it means, that "exact" value is in interav
|
||||
//[R - aRelDev*R, R + aRelDev*R]. This interval is set
|
||||
// for R as boundary values for optimization algo.
|
||||
FillSolverData(theTarget, thePos, theParams,
|
||||
@ -878,7 +878,7 @@ Standard_Boolean ShapeAnalysis_CanonicalRecognition::GetSurfaceByLS(const TopoDS
|
||||
if (theTarget == GeomAbs_Cylinder || theTarget == GeomAbs_Cone)
|
||||
{
|
||||
//Set search direction for location to be perpendicular to axis to avoid
|
||||
//seaching along axis
|
||||
//searching along axis
|
||||
const gp_Dir aDir = thePos.Direction();
|
||||
gp_Pln aPln(thePos.Location(), aDir);
|
||||
gp_Dir aUDir = aPln.Position().XDirection();
|
||||
|
||||
@ -43,7 +43,7 @@ class Geom_Surface;
|
||||
|
||||
//! This class provides operators for analysis surfaces and curves of shapes
|
||||
//! in order to find out more simple geometry entities, which could replace
|
||||
//! existing complex (for exampe, BSpline) geometry objects with given tolerance.
|
||||
//! existing complex (for example, BSpline) geometry objects with given tolerance.
|
||||
class ShapeAnalysis_CanonicalRecognition
|
||||
{
|
||||
public:
|
||||
|
||||
@ -97,7 +97,7 @@ public:
|
||||
//! Returns compound of open wires out of free edges.
|
||||
const TopoDS_Compound& GetOpenWires() const;
|
||||
|
||||
//! Builds sequnce of <wires> out of sequence of not sorted
|
||||
//! Builds sequence of <wires> out of sequence of not sorted
|
||||
//! <edges>.
|
||||
//! Tries to build wires of maximum length. Building a wire is
|
||||
//! stopped when no edges can be connected to it at its head or
|
||||
@ -112,7 +112,7 @@ public:
|
||||
|
||||
Standard_EXPORT static void ConnectWiresToWires (Handle(TopTools_HSequenceOfShape)& iwires, const Standard_Real toler, const Standard_Boolean shared, Handle(TopTools_HSequenceOfShape)& owires);
|
||||
|
||||
//! Builds sequnce of <owires> out of sequence of not sorted
|
||||
//! Builds sequence of <owires> out of sequence of not sorted
|
||||
//! <iwires>.
|
||||
//! Tries to build wires of maximum length. Building a wire is
|
||||
//! stopped when no wires can be connected to it at its head or
|
||||
|
||||
@ -260,7 +260,7 @@ static Standard_Boolean GetShells(TopTools_SequenceOfShape& Lface,
|
||||
aMapFaceShells.Bind(F1,nshell);
|
||||
Lface.Remove(i);
|
||||
|
||||
// check if closed shell is obtained in multy connex mode and add to sequence of
|
||||
// check if closed shell is obtained in multi connex mode and add to sequence of
|
||||
// shells and new shell begin to construct.
|
||||
// (check is n*2)
|
||||
if(isMultiConnex && BRep_Tool::IsClosed (nshell)) {
|
||||
@ -300,7 +300,7 @@ static Standard_Boolean GetShells(TopTools_SequenceOfShape& Lface,
|
||||
numFace++;
|
||||
}
|
||||
if(numFace >1) {
|
||||
// close all closed shells in no multy connex mode
|
||||
// close all closed shells in no multi connex mode
|
||||
if(!isMultiConnex)
|
||||
nshell.Closed (BRep_Tool::IsClosed (nshell));
|
||||
aSeqShells.Append(nshell);
|
||||
|
||||
@ -67,7 +67,7 @@ Standard_Boolean ShapeFix_SplitTool::SplitEdge(const TopoDS_Edge& edge,
|
||||
sae.PCurve(edge,face,c2d,a,b,Standard_True );
|
||||
if( Abs(a-param)<tol2d || Abs(b-param)<tol2d )
|
||||
return Standard_False;
|
||||
// check distanse between edge and new vertex
|
||||
// check distance between edge and new vertex
|
||||
gp_Pnt P1;
|
||||
TopLoc_Location L;
|
||||
if(BRep_Tool::SameParameter(edge)) {
|
||||
|
||||
@ -85,11 +85,11 @@ public:
|
||||
Standard_EXPORT TopAbs_Orientation Orientation() const;
|
||||
|
||||
//! Returns first vertex of the first edge in the wire
|
||||
//! (no dependance on Orientation()).
|
||||
//! (no dependence on Orientation()).
|
||||
Standard_EXPORT TopoDS_Vertex FirstVertex() const;
|
||||
|
||||
//! Returns last vertex of the last edge in the wire
|
||||
//! (no dependance on Orientation()).
|
||||
//! (no dependence on Orientation()).
|
||||
Standard_EXPORT TopoDS_Vertex LastVertex() const;
|
||||
|
||||
//! Returns True if FirstVertex() == LastVertex()
|
||||
|
||||
@ -104,7 +104,7 @@ public:
|
||||
return (identifiedItem.IsNull() ? 0 : identifiedItem->Length());
|
||||
}
|
||||
|
||||
//! Set fiels IdentifiedItem
|
||||
//! Set field IdentifiedItem
|
||||
inline void SetIdentifiedItem (const Handle(StepRepr_HArray1OfRepresentationItem)& theIdentifiedItem)
|
||||
{
|
||||
identifiedItem = theIdentifiedItem;
|
||||
|
||||
@ -127,7 +127,7 @@ public:
|
||||
//! Destructor cleans allocated memory of all fields
|
||||
~StepFile_ReadData() { ClearRecorder(3); }
|
||||
|
||||
//! Preperes the text value for analysis.
|
||||
//! Prepares the text value for analysis.
|
||||
//! It is the main tool for transferring data from flex to bison
|
||||
//! If characters page is full, allocates a new page.
|
||||
void CreateNewText(const char* theNewText, int theLenText);
|
||||
|
||||
@ -622,7 +622,7 @@ goto find_rule; \
|
||||
|
||||
typedef step::parser::token token;
|
||||
|
||||
/* skl 31.01.2002 for OCC133(OCC96,97) - uncorrect
|
||||
/* skl 31.01.2002 for OCC133(OCC96,97) - incorrect
|
||||
long string in files Henri.stp and 401.stp*/
|
||||
#include <Standard_Failure.hxx>
|
||||
#define YY_FATAL_ERROR(msg) Standard_Failure::Raise(msg);
|
||||
|
||||
@ -61,7 +61,7 @@
|
||||
|
||||
typedef step::parser::token token;
|
||||
|
||||
/* skl 31.01.2002 for OCC133(OCC96,97) - uncorrect
|
||||
/* skl 31.01.2002 for OCC133(OCC96,97) - incorrect
|
||||
long string in files Henri.stp and 401.stp*/
|
||||
#include <Standard_Failure.hxx>
|
||||
#define YY_FATAL_ERROR(msg) Standard_Failure::Raise(msg);
|
||||
|
||||
@ -82,7 +82,7 @@ public:
|
||||
return *this;
|
||||
}
|
||||
|
||||
//! Returne true if this list is empty
|
||||
//! Return true if this list is empty
|
||||
Standard_Boolean IsEmpty() const
|
||||
{
|
||||
return myNode.IsNull();
|
||||
|
||||
@ -1587,7 +1587,7 @@ void TopOpeBRepBuild_Builder::FillShape(const TopoDS_Shape& S1,
|
||||
TopOpeBRepTool_ShapeExplorer ex11(aSubShape,t11);
|
||||
SplitShapes(ex11,ToBuild1,ToBuild2,aSet,RevOri);
|
||||
}
|
||||
} // exploration ot SubShapes of type <t1> of shape <S1>
|
||||
} // exploration of SubShapes of type <t1> of shape <S1>
|
||||
|
||||
} // FillShape
|
||||
|
||||
|
||||
@ -878,7 +878,7 @@ void TopOpeBRepBuild_Builder1::GFillEdgeSameDomWES(const TopoDS_Shape& EOR,
|
||||
}
|
||||
|
||||
//we should process all same domain edges (ON2D) in the code above
|
||||
//and we can not proceess edges with UNKNOWN state
|
||||
//and we can not process edges with UNKNOWN state
|
||||
if(aState == TopAbs_ON || aState == TopAbs_UNKNOWN)
|
||||
continue;
|
||||
|
||||
@ -1586,7 +1586,7 @@ Standard_Integer TopOpeBRepBuild_Builder1::TwoPiecesON (const TopTools_SequenceO
|
||||
if(!anAd1 || !anAd2)
|
||||
return 12;
|
||||
else
|
||||
return 10; //10 doesn't mean anything just to retutn something
|
||||
return 10; //10 doesn't mean anything just to return something
|
||||
}
|
||||
|
||||
// case c. No==Nt , To==Tt
|
||||
@ -1640,7 +1640,7 @@ Standard_Integer TopOpeBRepBuild_Builder1::TwoPiecesON (const TopTools_SequenceO
|
||||
if(!anAd1 || !anAd2)
|
||||
return 14;
|
||||
else
|
||||
return 10; //10 doesn't mean anything just to retutn something
|
||||
return 10; //10 doesn't mean anything just to return something
|
||||
}
|
||||
return 10;
|
||||
} // end of if (!anAd1 || !anAd2 || !aScPrFlag1 || !aScPrFlag2)
|
||||
|
||||
@ -497,7 +497,7 @@ void DumpMapOfShapeWithState (const Standard_Integer iP,
|
||||
}
|
||||
} //end of else {// Wire has an interferences
|
||||
} // next Wire
|
||||
} // next interferred Face ... for (i=1; i<=nF; i++) ...
|
||||
} // next interfered Face ... for (i=1; i<=nF; i++) ...
|
||||
}
|
||||
|
||||
//=======================================================================
|
||||
|
||||
@ -1027,8 +1027,8 @@ Standard_Integer TopOpeBRepBuild_Builder::KPiskoletge()
|
||||
Standard_Boolean se2ONouterw1 = ::sectionedgesON(myDataStructure,outerw2,mape1);
|
||||
if (!se2ONouterw1) return 0;
|
||||
|
||||
// NYI : <fi> interfers with faces of <Sj> on edges different from outerw's edges
|
||||
// ------------------------------------------------------------------------------
|
||||
// NYI : <fi> interferes with faces of <Sj> on edges different from outerw's edges
|
||||
// -------=-----------------------------------------------------------------------
|
||||
Standard_Boolean allI1onseouterw = ::allIonsectionedges(myDataStructure,f1,mape1,mape2);
|
||||
if (!allI1onseouterw) return 0;
|
||||
Standard_Boolean allI2onseouterw = ::allIonsectionedges(myDataStructure,f2,mape2,mape1);
|
||||
|
||||
@ -334,7 +334,7 @@ void TopOpeBRepBuild_Builder::GFABUMakeFaces(const TopoDS_Shape& FF,TopOpeBRepBu
|
||||
//--ofv:
|
||||
// Unfortunately, the function GFillONPartsWES2() from file TopOpeBRepBuild_BuilderON.cxx sets orientation of
|
||||
// some section edges as INTERNAL or EXTERNAL, but they should be FORWARD or REVERSED. It probably makes faces
|
||||
// without closed boundary, for example. So, we must check carefuly edges with orientation INTERNAL(EXTERNAL).
|
||||
// without closed boundary, for example. So, we must check carefully edges with orientation INTERNAL(EXTERNAL).
|
||||
// Bugs: 60936, 60937, 60938 (cut, fuse, common shapes)
|
||||
TopoDS_Compound CmpOfEdges;
|
||||
BRep_Builder BldCmpOfEdges;
|
||||
|
||||
@ -42,8 +42,8 @@ static void FUN_Raise()
|
||||
|
||||
// myIsVertex :
|
||||
// ------------
|
||||
// POINT :<Eref> interfers with <E> at a point
|
||||
// <Eref> interfers with <E> at a vertex V,
|
||||
// POINT :<Eref> interferes with <E> at a point
|
||||
// <Eref> interferes with <E> at a vertex V,
|
||||
// VERTEXonref : V is on shape of <Eref>
|
||||
// VERTEXonOO : V is on shape of <E>
|
||||
// VERTEXonOref : V is on 2 shapes.
|
||||
|
||||
@ -38,7 +38,7 @@ class TopOpeBRepDS_ShapeShapeInterference : public TopOpeBRepDS_Interference
|
||||
public:
|
||||
|
||||
|
||||
//! a shape interfers on shape <G> with shape <S>.
|
||||
//! a shape interferes on shape <G> with shape <S>.
|
||||
//! examples :
|
||||
//! create a ShapeShapeInterference describing :
|
||||
//! vertex V of edge E1 found on edge E2 :
|
||||
|
||||
@ -20,8 +20,8 @@
|
||||
#include <gp_XYZ.hxx>
|
||||
|
||||
/**
|
||||
* Inplementation of the Box node.
|
||||
* This node is defined by Size vector, assumong that the box center is located
|
||||
* Implementation of the Box node.
|
||||
* This node is defined by Size vector, assuming that the box center is located
|
||||
* in (0., 0., 0.) and that each corner is 0.5*|Size| distance from the center.
|
||||
*/
|
||||
class VrmlData_Box : public VrmlData_Geometry
|
||||
|
||||
@ -630,7 +630,7 @@ VrmlData_ErrorStatus VrmlData_ArrayVec3d::ReadArray
|
||||
if (OK(aStatus) && OK(aStatus, VrmlData_Scene::ReadLine(theBuffer))) {
|
||||
if (theBuffer.LinePtr[0] != '[') // opening bracket
|
||||
{
|
||||
// Handle case when brackets are ommited for single element of array
|
||||
// Handle case when brackets are omitted for single element of array
|
||||
gp_XYZ anXYZ;
|
||||
// Read three numbers (XYZ value)
|
||||
if (!OK(aStatus, Scene().ReadXYZ(theBuffer, anXYZ,
|
||||
|
||||
@ -871,7 +871,7 @@ VrmlData_ErrorStatus VrmlData_Scene::ReadArrIndex
|
||||
if (vecInt.Length() > 2)
|
||||
{
|
||||
// additional check for redundant point:
|
||||
// ignore last point which is a dublicate of first point
|
||||
// ignore last point which is a duplicate of first point
|
||||
if (anIntValue == vecInt[0])
|
||||
{
|
||||
continue;
|
||||
|
||||
@ -68,7 +68,7 @@ class VrmlData_Scene
|
||||
* in that node are matched with these directories.
|
||||
* The last (implicit) search directory is the current process directory
|
||||
* ("."). It takes effect if the list is empty or if there is no match with
|
||||
* exisiting directories.
|
||||
* existing directories.
|
||||
*/
|
||||
Standard_EXPORT void SetVrmlDir (const TCollection_ExtendedString&);
|
||||
|
||||
@ -205,7 +205,7 @@ class VrmlData_Scene
|
||||
ReadLine (VrmlData_InBuffer& theBuffer);
|
||||
|
||||
/**
|
||||
* Read a singel word from the input stream, delimited by whitespace.
|
||||
* Read a single word from the input stream, delimited by whitespace.
|
||||
*/
|
||||
Standard_EXPORT static VrmlData_ErrorStatus
|
||||
ReadWord (VrmlData_InBuffer& theBuffer,
|
||||
|
||||
@ -49,7 +49,7 @@ class VrmlData_Sphere : public VrmlData_Geometry
|
||||
inline Standard_Real Radius () const { return myRadius; }
|
||||
|
||||
/**
|
||||
* Set the spere radius
|
||||
* Set the sphere radius
|
||||
*/
|
||||
inline void SetRadius (const Standard_Real theRadius)
|
||||
{ myRadius = theRadius; SetModified(); }
|
||||
|
||||
@ -114,7 +114,7 @@ class XSControl_Controller : public Standard_Transient
|
||||
//! Read from field. Can be redefined
|
||||
Standard_EXPORT virtual Handle(Transfer_ActorOfFinderProcess) ActorWrite() const;
|
||||
|
||||
//! Sets mininum and maximum values for modetrans (write)
|
||||
//! Sets minimum and maximum values for modetrans (write)
|
||||
//! Erases formerly recorded bounds and values
|
||||
//! Actually only for shape
|
||||
//! Then, for each value a little help can be attached
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user