//! 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.
//! 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
{
//! @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.
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();
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();
//! 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
/* 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 : */
/* ---------------- */
/* 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 */
/* ------------------------------ 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;
goto L9100;
}
-/* ---- Subract discretizations of polynoms of constraints
+/* ---- Subtract discretizations of polynoms of constraints
---- */
mma2cd3_(ndimen, nbpntu, &urootl[1], nbpntv, iordru, &sotbu1[1],
/* 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 */
/* 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. */
/* OUTPUT ARGUMENTS : */
/* ------------------- */
-/* PTCAUX : Auxilliary space. */
+/* PTCAUX : Auxiliary space. */
/* PTCCAN : The square in the canonic base (-1,1) */
/* COMMONS USED : */
/* ERRMAX : Precision of the approximation. */
/* IERCOD = 0, OK */
/* = 1, order of constraints (IORDRE) is not within the */
-/* autorized values. */
+/* authorized values. */
/* COMMONS USED : */
/* ---------------- */
/* 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 : */
/* ------------------- */
/* 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 : */
/* ---------------- */
*/
-/* Factorials (1 to 21) caculated on VAX in R*16 */
+/* Factorials (1 to 21) calculated on VAX in R*16 */
/* **********************************************************************
/* 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 */
/* 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 */
/* FUNCTION : */
/* ---------- */
-/* Reformating (and eventual compression/decompression) of curve */
+/* Reformatting (and eventual compression/decompression) of curve */
/* (ndim,.) by (.,ndim) and vice versa. */
/* KEYWORDS : */
/* OUTPUT ARGUMENTS : */
/* ------------------- */
-/* POLAUX : Auxilliary space. */
+/* POLAUX : Auxiliary space. */
/* CRVCAN : The curve in the canonic base [-1,1] */
/* COMMONS USED : */
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__) {
/* -------------------- */
/* 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 */
/* FUNCTION : */
/* ---------- */
/* Position on the polynoms of base hermit-Jacobi */
-/* and their succesive derivatives */
+/* and their successive derivatives */
/* KEYWORDS : */
/* ----------- */
*/
-/* static varaibles */
+/* static variables */
/* 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 */
/* ----------------------------------- */
/* 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 */
/* > */
/* **********************************************************************
*/
-/* Nome of the routine */
+/* Name of the routine */
/* Common MLGDRTL: */
/* 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 */
/* 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 + ... */
/* OUTPUT ARGUMENTS : */
/* ------------------- */
-/* MZSNORM : Value of the euclidian norm of vector VECTEU */
+/* MZSNORM : Value of the euclidean norm of vector VECTEU */
/* COMMONS USED : */
/* ---------------- */
/* FONCTION : */
/* ---------- */
-/* TABLE OF MANAGEMENT OF DYNAMIC MEMOTY ALLOCATIONS */
+/* TABLE OF MANAGEMENT OF DYNAMIC MEMORY ALLOCATIONS */
/* KEYWORDS : */
/* ----------- */
/* */
/* = 0 ==> OK */
/* = 1 ==> Allocation impossible */
-/* = -1 ==> Ofset > 2**31 - 1 */
+/* = -1 ==> Offset > 2**31 - 1 */
/* */
/* */
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
//=======================================================================
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())
{
}
//
- // Treatment intemediate
+ // Treatment intermediate
Standard_Real m1, aTolF, aTolE, aTol, aDist;
m1=IntTools_Tools::IntermediatePoint(f1, l1);
BOPTools_AlgoTools::PointOnEdge(aE1, m1, aP12);
//! 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,
//! 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,
//! 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,
//! 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,
//! 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,
//! 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,
//=======================================================================
//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)
public:
- //! Creates new unitialized tool.
+ //! Creates new uninitialized tool.
Standard_EXPORT BRepExtrema_ProximityDistTool();
//! Creates new tool for the given element sets.
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);
//=======================================================================
//function : BRepExtrema_ProximityValueTool
-//purpose : Creates new unitialized proximity tool
+//purpose : Creates new uninitialized proximity tool
//=======================================================================
BRepExtrema_ProximityValueTool::BRepExtrema_ProximityValueTool()
: myIsRefinementRequired1 (Standard_False),
//=======================================================================
//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
public:
- //! Creates new unitialized proximity tool.
+ //! Creates new uninitialized proximity tool.
Standard_EXPORT BRepExtrema_ProximityValueTool();
//! Creates new proximity tool for the given element sets.
//! 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.
// 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
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;
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 );
//! 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>.
//! \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
// 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,
}
else {
Standard_Real Ui = U0 + (Abscissa / myL) * (myUMax - myUMin) / 3.;
- // exercice : why 3 ?
+ // exercise : why 3 ?
Perform(Abscissa,U0,Ui,Resolution);
}
}
//=======================================================================
//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).
//=======================================================================
#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;
//! 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
{
//! 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);
//! 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;
//! 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;
#ifndef _GProp_ValueType_HeaderFile
#define _GProp_ValueType_HeaderFile
-//! Algorithmes :
+//! Algorithms:
enum GProp_ValueType
{
GProp_Mass,
//! 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
}
} // 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());
}
} // 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());
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
//! 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
{
//! 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.
//! 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);
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();
//! 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:
//! 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
{
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.
*
* 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:
{
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);
}
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,
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();
//! 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:
//! 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
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
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)) {
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);
//=======================================================================
// function : GetClosedShells
// purpose : Check if one shell is a part from other shell.
-// For case of compsolid when afew shells are created from
+// For case of compsolid when a few shells are created from
// the same set of faces.
//=======================================================================
static void GetClosedShells(TopTools_SequenceOfShape& Shells, TopTools_SequenceOfShape& aRemainShells)
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)) {
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()
return (identifiedItem.IsNull() ? 0 : identifiedItem->Length());
}
- //! Set fiels IdentifiedItem
+ //! Set field IdentifiedItem
inline void SetIdentifiedItem (const Handle(StepRepr_HArray1OfRepresentationItem)& theIdentifiedItem)
{
identifiedItem = theIdentifiedItem;
//! 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);
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);
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);
return *this;
}
- //! Returne true if this list is empty
+ //! Return true if this list is empty
Standard_Boolean IsEmpty() const
{
return myNode.IsNull();
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
}
//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;
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
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)
}
} //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++) ...
}
//=======================================================================
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);
//--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;
// 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.
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 :
#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
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,
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;
* 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&);
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,
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(); }
//! 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
projects / occt.git / commitdiff