1
0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-04-05 18:16:23 +03:00

0033766: Documentation - Fix various typos found in codebase

This commit is contained in:
luzpaz 2024-07-15 11:57:52 -04:00 committed by GitHub
parent 76df27830b
commit d51eb087ab
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
94 changed files with 137 additions and 137 deletions
CMakeLists.txt
src
AdvApp2Var
Approx
BRepBlend
BRepBuilderAPI
BRepCheck
BRepFeat
BRepFill
BRepMesh
BRepOffset
BRepTools
BSplCLib
BSplSLib
Bisector
BlendFunc
CDM
Contap
GccAna
Geom
Geom2d
Geom2dConvert
Geom2dInt
GeomConvert
GeomPlate
Graphic3d
HLRBRep
IGESFile
IGESSolid
IGESToBRep
IntWalk
LocOpe
OSD
OpenGl
PCDM
PLib
QABugs
Quantity
RWStepKinematics
SelectMgr
ShapeAnalysis
ShapeUpgrade
StepData
StepToTopoDS
TDataStd
TObj
TopClass
V3d
XCAFDimTolObjects
XCAFDoc
XSControl
XSDRAWDE
math
tests/bugs/xde

@ -1255,7 +1255,7 @@ foreach (OCCT_TOOLKIT ${BUILD_TOOLKITS})
endforeach()
list (REMOVE_DUPLICATES OCCT_MODULES_ENABLED)
list (REMOVE_DUPLICATES OCCT_COMPILE_DEFINITIONS)
# these macros are defined for specific tookits, not globalwise
# these macros are defined for specific toolkits, not globalwise
list (REMOVE_ITEM OCCT_COMPILE_DEFINITIONS HAVE_OPENGL)
list (REMOVE_ITEM OCCT_COMPILE_DEFINITIONS HAVE_GLES2)

@ -33,7 +33,7 @@ static Standard_Boolean lesparam(const Standard_Integer iordre,
ndgjac += (9 - (iordre+1)); //iordre rescales the frequences upwards
ndgjac += (icodeo-1)*10;
}
// ---> Min Number of required pointss.
// ---> Min Number of required points.
if (ndgjac < 8) { nbpnts = 8; }
else if (ndgjac < 10) { nbpnts = 10; }
// else if (ndgjac < 15) { nbpnt = 15; } Bug Uneven number

@ -3680,7 +3680,7 @@ int AdvApp2Var_MathBase::mmeps1_(doublereal *epsilo)
/* equal to 1.D-9 */
/* KEYWORDS : */
/* ----------- */
/* ---------- */
/* MPRCSN,PRECISON,EPS1. */
/* INPUT ARGUMENTS : */

@ -2200,8 +2200,8 @@ int AdvApp2Var_SysBase::mcrdelt_(integer *iunit,
/* ---------- */
/* TABLE OF MANAGEMENT OF DYNAMIC ALLOCATIONS IN MEMORY */
/* KEYWORS : */
/* ----------- */
/* KEYWORDS : */
/* ---------- */
/* SYSTEM, MEMORY, ALLOCATION */
/* DEMSCRIPTION/NOTES/LIMITATIONS : */
@ -2867,7 +2867,7 @@ int AdvApp2Var_SysBase::mcrrqst_(integer *iunit,
/* . add size of the user zone */
/* . add 8 for alinement of start address of */
/* allocation on multiple of 8 so that to be able to */
/* set flags with Double Precision without other pb than alignement */
/* set flags with Double Precision without other pb than alignment */
/* . add 16 octets for two flags */
ibyte = izu + 24;

@ -196,7 +196,7 @@ Approx_CurvilinearParameter::Approx_CurvilinearParameter(const Handle(Adaptor3d_
std::cout<<"initialization time = "<<t_init<<std::endl;
std::cout<<"approximation time = "<<t_approx<<std::endl;
std::cout<<"total time for uparam computation = "<<t_uparam<<std::endl;
std::cout<<"number uparam calles = "<<uparam_count<<std::endl;
std::cout<<"number uparam calls = "<<uparam_count<<std::endl;
#endif
}
@ -357,7 +357,7 @@ Approx_CurvilinearParameter::Approx_CurvilinearParameter(const Handle(Adaptor2d_
std::cout<<"initialization time = "<<t_init<<std::endl;
std::cout<<"approximation time = "<<t_approx<<std::endl;
std::cout<<"total time for uparam computation = "<<t_uparam<<std::endl;
std::cout<<"number uparam calles = "<<uparam_count<<std::endl;
std::cout<<"number uparam calls = "<<uparam_count<<std::endl;
#endif
}
@ -530,7 +530,7 @@ Approx_CurvilinearParameter::Approx_CurvilinearParameter(const Handle(Adaptor2d_
std::cout<<"initialization time = "<<t_init<<std::endl;
std::cout<<"approximation time = "<<t_approx<<std::endl;
std::cout<<"total time for uparam computation = "<<t_uparam<<std::endl;
std::cout<<"number uparam calles = "<<uparam_count<<std::endl;
std::cout<<"number uparam calls = "<<uparam_count<<std::endl;
#endif
}

@ -128,7 +128,7 @@ void Approx_SweepApproximation::Perform(const Standard_Real First,
if (Num2DSS == 0) {TwoDTol.Nullify();}
else {
// for 2d define affinity using resolutions, to
// avoid homogenuous tolerance of approximation (u/v and 2d/3d)
// avoid homogeneous tolerance of approximation (u/v and 2d/3d)
Standard_Real res, tolu, tolv;
TwoDTol = new (TColStd_HArray1OfReal) (1, Num2DSS);
AAffin = new (Approx_HArray1OfGTrsf2d) (1, Num2DSS);

@ -70,7 +70,7 @@ static void FusionneIntervalles(const TColStd_Array1OfReal& I1,
//--- TABSOR is filled by parsing TABLE1 and TABLE2 simultaneously ---
//------------------ and removing multiple occurrencies ------------
//------------------ and removing multiple occurrences ------------
while ((ind1<=I1.Upper()) && (ind2<=I2.Upper())) {
v1 = I1(ind1);

@ -67,7 +67,7 @@ static void FusionneIntervalles(const TColStd_Array1OfReal& I1,
//--- TABSOR is filled by parsing TABLE1 and TABLE2 simultaneously ---
//------------------ and eliminating multiple occurrencies ------------
//------------------ and eliminating multiple occurrences ------------
while ((ind1<=I1.Upper()) && (ind2<=I2.Upper())) {
v1 = I1(ind1);

@ -4612,7 +4612,7 @@ void BRepBuilderAPI_Sewing::CreateSections(const TopoDS_Shape& section,
//gka - Convert to BSpline was commented because
//it is not necessary to create BSpline instead of Lines or cIrcles.
//Besides after conversion circles to BSpline
//it is necessary to recompute parameters of cutting because paramerization of created
//it is necessary to recompute parameters of cutting because parameterization of created
//BSpline curve differs from parametrization of circle.
// Convert pcurve to BSpline

@ -1086,7 +1086,7 @@ BRepCheck_Status BRepCheck_Wire::SelfIntersect(const TopoDS_Face& F,
if( Tr1.PositionOnCurve() == IntRes2d_Middle
|| Tr2.PositionOnCurve() == IntRes2d_Middle) {
//-- Checking of points with true tolerances (ie Tol in 3d)
//-- If the point of intersection is within the tolearnce of a vertex
//-- If the point of intersection is within the tolerance of a vertex
//-- this intersection is considered correct (no error)
Standard_Boolean localok = Standard_False;
Standard_Real f,l;

@ -48,13 +48,13 @@ public:
//! performed.
void Init (const TopoDS_Shape& S, const gp_Ax1& Axis);
//! Performs every holes of radius <Radius>. This
//! Performs every hole of radius <Radius>. This
//! command has the same effect as a cut operation
//! with an infinite cylinder defined by the given
//! axis and <Radius>.
Standard_EXPORT void Perform (const Standard_Real Radius);
//! Performs evry hole of radius <Radius> located
//! Performs every hole of radius <Radius> located
//! between PFrom and PTo on the given axis. If
//! <WithControl> is set to Standard_False no control
//! are done on the resulting shape after the
@ -69,7 +69,7 @@ public:
//! operation is performed.
Standard_EXPORT void PerformThruNext (const Standard_Real Radius, const Standard_Boolean WithControl = Standard_True);
//! Performs evry holes of radius <Radius> located
//! Performs every hole of radius <Radius> located
//! after the origin of the given axis. If
//! <WithControl> is set to Standard_False no control
//! are done on the resulting shape after the

@ -59,7 +59,7 @@ public:
//! Returns true if the approximation is not needed.
Standard_EXPORT Standard_Boolean IsParticularCase() const;
//! Returns the continuity betwwen the two faces
//! Returns the continuity between the two faces
//! seShape from GeomAbsparated by myBis.
Standard_EXPORT GeomAbs_Shape Continuity() const;

@ -117,7 +117,7 @@ public:
return CellFilter_Keep;
}
//! Checks indices for equlity.
//! Checks indices for equality.
static Standard_Boolean IsEqual(
const Standard_Integer theIndex,
const Standard_Integer theTargetIndex)

@ -141,7 +141,7 @@ public:
//! @return status of the check.
Standard_EXPORT NCollection_CellFilter_Action Inspect(const Standard_Integer theTargetIndex);
//! Checks indices for equlity.
//! Checks indices for equality.
static Standard_Boolean IsEqual(const Standard_Integer theIndex,
const Standard_Integer theTargetIndex)
{

@ -78,7 +78,7 @@ public:
const TopAbs_ShapeEnum theType,
TopTools_ListOfShape& theLSC);
//! Computes the Section betwwen <F1> and <F2> the
//! Computes the Section between <F1> and <F2> the
//! edges solution are stored in <LInt1> with the
//! orientation on <F1>, the sames edges are stored in
//! <Lint2> with the orientation on <F2>.

@ -24,7 +24,7 @@ class BRepTools_CopyModification : public BRepTools_Modification
{
public:
//! Constructor.
//! \param[in] theCopyGeom indicates that the geomtery (surfaces and curves) should be copied
//! \param[in] theCopyGeom indicates that the geometry (surfaces and curves) should be copied
//! \param[in] theCopyMesh indicates that the triangulation should be copied
Standard_EXPORT explicit BRepTools_CopyModification(const Standard_Boolean theCopyGeom = Standard_True,
const Standard_Boolean theCopyMesh = Standard_True);
@ -34,7 +34,7 @@ public:
//! - theSurf is the new geometry of the face,
//! - theLoc is its new location, and
//! - theTol is the new tolerance.
//! theRevWires, theRevFace are always set to false, because the orientaion is not changed.
//! theRevWires, theRevFace are always set to false, because the orientation is not changed.
Standard_EXPORT Standard_Boolean NewSurface(const TopoDS_Face& theFace,
Handle(Geom_Surface)& theSurf,
TopLoc_Location& theLoc,

@ -31,7 +31,7 @@ public:
Standard_EXPORT BRepTools_PurgeLocations();
//! Removes all locations correspodingly to criterium from theShape.
//! Removes all locations correspondingly to criterium from theShape.
Standard_EXPORT Standard_Boolean Perform(const TopoDS_Shape& theShape);
//! Returns shape with removed locations.

@ -1026,7 +1026,7 @@ void BSplCLib::BoorScheme(const Standard_Real U,
// They are alternatively written if the odd and even positions.
//
// The successives contents of the array are
// ***** means unitialised, l = Degree + Length
// ***** means uninitialised, l = Degree + Length
//
// P(0,0) ****** P(0,1) ...... P(0,l-1) ******** P(0,l)
// P(0,0) P(1,0) P(0,1) ...... P(0,l-1) P(1,l-1) P(0,l)

@ -160,7 +160,7 @@ public:
//!
//! Warnings :Index is used as input data to initialize the
//! searching function.
//! Warning: Knots have to be "withe repetitions"
//! Warning: Knots have to be "with repetitions"
Standard_EXPORT static void LocateParameter (const Standard_Integer Degree, const TColStd_Array1OfReal& Knots, const TColStd_Array1OfInteger& Mults, const Standard_Real U, const Standard_Boolean IsPeriodic, const Standard_Integer FromK1, const Standard_Integer ToK2, Standard_Integer& KnotIndex, Standard_Real& NewU);
//! Locates the parametric value U in the knots
@ -571,7 +571,7 @@ public:
//! knot : 1. 2.
//! mult : 3 2
//! @endcode
//! The multipicity of the first knot may also be reduced if the sum is still to big.
//! The multiplicity of the first knot may also be reduced if the sum is still too big.
//!
//! In the most common situations (periodic curve or curve with first
//! and last multiplicities equals to Degree+1) the knots are knot changes.
@ -1176,13 +1176,13 @@ public:
//! Perform the evaluation of the Taylor expansion
//! of the Bspline normalized between 0 and 1.
//! If rational computes the homogeneous Taylor expension
//! If rational computes the homogeneous Taylor expansion
//! for the numerator and stores it in CachePoles
Standard_EXPORT static void BuildCache (const Standard_Real U, const Standard_Real InverseOfSpanDomain, const Standard_Boolean PeriodicFlag, const Standard_Integer Degree, const TColStd_Array1OfReal& FlatKnots, const TColgp_Array1OfPnt& Poles, const TColStd_Array1OfReal* Weights, TColgp_Array1OfPnt& CachePoles, TColStd_Array1OfReal* CacheWeights);
//! Perform the evaluation of the Taylor expansion
//! of the Bspline normalized between 0 and 1.
//! If rational computes the homogeneous Taylor expension
//! If rational computes the homogeneous Taylor expansion
//! for the numerator and stores it in CachePoles
Standard_EXPORT static void BuildCache (const Standard_Real U, const Standard_Real InverseOfSpanDomain, const Standard_Boolean PeriodicFlag, const Standard_Integer Degree, const TColStd_Array1OfReal& FlatKnots, const TColgp_Array1OfPnt2d& Poles, const TColStd_Array1OfReal* Weights, TColgp_Array1OfPnt2d& CachePoles, TColStd_Array1OfReal* CacheWeights);

@ -64,7 +64,7 @@ struct BSplSLib_DataContainer
//=======================================================================
//function : RationalDerivative
//purpose : computes the rational derivatives when whe have the
//purpose : computes the rational derivatives when we have the
// the derivatives of the homogeneous numerator and the
// the derivatives of the denominator
//=======================================================================

@ -264,7 +264,7 @@ public:
//! Perform the evaluation of the Taylor expansion
//! of the Bspline normalized between 0 and 1.
//! If rational computes the homogeneous Taylor expension
//! If rational computes the homogeneous Taylor expansion
//! for the numerator and stores it in CachePoles
Standard_EXPORT static void BuildCache (const Standard_Real U, const Standard_Real V, const Standard_Real USpanDomain, const Standard_Real VSpanDomain, const Standard_Boolean UPeriodicFlag, const Standard_Boolean VPeriodicFlag, const Standard_Integer UDegree, const Standard_Integer VDegree, const Standard_Integer UIndex, const Standard_Integer VIndex, const TColStd_Array1OfReal& UFlatKnots, const TColStd_Array1OfReal& VFlatKnots, const TColgp_Array2OfPnt& Poles, const TColStd_Array2OfReal* Weights, TColgp_Array2OfPnt& CachePoles, TColStd_Array2OfReal* CacheWeights);

@ -113,7 +113,7 @@ private:
private:
Standard_Boolean myIsRational; //!< identifies the rationality of Bezier/B-spline surface
BSplCLib_CacheParams myParamsU, myParamsV; //!< cach parameters by U and V directions
BSplCLib_CacheParams myParamsU, myParamsV; //!< cache parameters by U and V directions
Handle(TColStd_HArray2OfReal) myPolesWeights; //!< array of poles and weights of calculated cache
// the array has following structure:
// x11 y11 z11 [w11] x12 y12 z12 [w12] ...

@ -91,7 +91,7 @@ public:
Standard_EXPORT Handle(Geom2d_Geometry) Copy() const Standard_OVERRIDE;
//! Transformation of a geometric object. This tansformation
//! Transformation of a geometric object. This transformation
//! can be a translation, a rotation, a symmetry, a scaling
//! or a complex transformation obtained by combination of
//! the previous elementaries transformations.

@ -35,7 +35,7 @@ DEFINE_STANDARD_HANDLE(Bisector_BisecPC, Bisector_Curve)
//! Provides the bisector between a point and a curve.
//! the curvature on the curve has to be monoton.
//! the point can't be on the curve exept at the extremities.
//! the point can't be on the curve except at the extremities.
class Bisector_BisecPC : public Bisector_Curve
{
@ -91,7 +91,7 @@ public:
Standard_EXPORT Handle(Geom2d_Geometry) Copy() const Standard_OVERRIDE;
//! Transformation of a geometric object. This tansformation
//! Transformation of a geometric object. This transformation
//! can be a translation, a rotation, a symmetry, a scaling
//! or a complex transformation obtained by combination of
//! the previous elementaries transformations.

@ -44,7 +44,7 @@ public:
//! C2 separates the elements C et D.
//! If B an C have the same geometry. <ComunElement>
//! Has to be True.
//! It Permits an optimiztion of the computation.
//! It Permits an optimization of the computation.
Standard_EXPORT Bisector_Inter(const Bisector_Bisec& C1, const IntRes2d_Domain& D1, const Bisector_Bisec& C2, const IntRes2d_Domain& D2, const Standard_Real TolConf, const Standard_Real Tol, const Standard_Boolean ComunElement);
//! Intersection between 2 curves.
@ -52,7 +52,7 @@ public:
//! C2 separates the elements C et D.
//! If B an C have the same geometry. <ComunElement>
//! Has to be True.
//! It Permits an optimiztion of the computation.
//! It Permits an optimization of the computation.
Standard_EXPORT void Perform (const Bisector_Bisec& C1, const IntRes2d_Domain& D1, const Bisector_Bisec& C2, const IntRes2d_Domain& D2, const Standard_Real TolConf, const Standard_Real Tol, const Standard_Boolean ComunElement);

@ -51,7 +51,7 @@ static void FusionneIntervalles(const TColStd_Array1OfReal& I1,
//--- TABSOR is filled by parsing TABLE1 and TABLE2 simultaneously ---
//------------------ by removing multiple occurrencies ------------
//------------------ by removing multiple occurrences ------------
while ((ind1<=I1.Upper()) && (ind2<=I2.Upper())) {
v1 = I1(ind1);

@ -51,7 +51,7 @@ public:
//! By default, writes in MessageDriver().
Standard_EXPORT virtual void BeginOfUpdate (const Handle(CDM_Document)& aDocument);
//! this method is called affter the update of a document.
//! this method is called after the update of a document.
//! By default, writes in MessageDriver().
Standard_EXPORT virtual void EndOfUpdate (const Handle(CDM_Document)& aDocument, const Standard_Boolean theStatus, const TCollection_ExtendedString& ErrorString);

@ -532,7 +532,7 @@ void CDM_Document::SetMetaData(const Handle(CDM_MetaData)& aMetaData)
aMetaData->SetDocument(this);
// Update the document refencing this MetaData:
// Update the document referencing this MetaData:
CDM_DataMapIteratorOfMetaDataLookUpTable it(Application()->MetaDataLookUpTable());
for(;it.More();it.Next()) {
const Handle(CDM_MetaData)& theMetaData=it.Value();

@ -79,7 +79,7 @@ public:
Standard_EXPORT const Handle(Adaptor2d_Curve2d)& Arc() const;
//! Set The Tansition of the line.
//! Set The Transition of the line.
Standard_EXPORT void SetTransitionOnS (const IntSurf_TypeTrans T);
//! returns IN if at the "left" of the line, the normale of the

@ -31,7 +31,7 @@ class math_Matrix;
//! This class describes the function on a parametric surface.
//! the form of the function is F(u,v) = 0 where u and v are
//! the parameteric coordinates of a point on the surface,
//! the parametric coordinates of a point on the surface,
//! to compute the contours of the surface.
class Contap_SurfFunction : public math_FunctionSetWithDerivatives
{

@ -185,7 +185,7 @@ public:
//! (2 circles).
//! If R1 is the radius of the first argument and Rsol the radius
//! of the solution and dist the distance between the two centers,
//! we concider the two circles are identical if R1+dist-Rsol is
//! we consider the two circles are identical if R1+dist-Rsol is
//! less than Tolerance.
//! False in the other cases.
//! Raises OutOfRange if Index is greater than the number
@ -196,7 +196,7 @@ public:
//! (2 circles).
//! If R2 is the radius of the second argument and Rsol the radius
//! of the solution and dist the distance between the two centers,
//! we concider the two circles are identical if R2+dist-Rsol is
//! we consider the two circles are identical if R2+dist-Rsol is
//! less than Tolerance.
//! False in the other cases.
//! Raises OutOfRange if Index is greater than the number

@ -36,14 +36,14 @@
// Creation of a circle tangent to Circle C1 and a straight line L2. +
// centered on a straight line. +
// We start by making difference between cases that we are going to +
// proceess separately. +
// In general case: +
// process separately. +
// In general case: +
// ==================== +
// We calculate bissectrices to C1 and L2 that give us +
// all possibles locations of centers of all circles tangent to C1 and L2+ +
// We intersect these bissectrices with straight line OnLine which gives +
// us points among which we'll choose the solutions. +
// The choices are made basing on Qualifiers of C1 and L2. +
// We calculate bissectrices to C1 and L2 that give us +
// all possible locations of centers of all circles tangent to C1 and L2 +
// We intersect these bissectrices with straight line OnLine which gives +
// us points among which we'll choose the solutions. +
// The choices are made basing on Qualifiers of C1 and L2. +
//=========================================================================
GccAna_Circ2d2TanOn::
GccAna_Circ2d2TanOn (const GccEnt_QualifiedCirc& Qualified1 ,

@ -774,7 +774,7 @@ public:
//! Creates a new object which is a copy of this BSpline curve.
Standard_EXPORT Handle(Geom_Geometry) Copy() const Standard_OVERRIDE;
//! Comapare two Bspline curve on identity;
//! Compare two Bspline curve on identity;
Standard_EXPORT Standard_Boolean IsEqual (const Handle(Geom_BSplineCurve)& theOther, const Standard_Real thePreci) const;
//! Dumps the content of me into the stream

@ -91,7 +91,7 @@ public:
Standard_EXPORT void Translate (const gp_Pnt& P1, const gp_Pnt& P2);
//! Transformation of a geometric object. This tansformation
//! Transformation of a geometric object. This transformation
//! can be a translation, a rotation, a symmetry, a scaling
//! or a complex transformation obtained by combination of
//! the previous elementaries transformations.

@ -83,7 +83,7 @@ public:
//! Translates a Geometry from the point P1 to the point P2.
Standard_EXPORT void Translate (const gp_Pnt2d& P1, const gp_Pnt2d& P2);
//! Transformation of a geometric object. This tansformation
//! Transformation of a geometric object. This transformation
//! can be a translation, a rotation, a symmetry, a scaling
//! or a complex transformation obtained by combination of
//! the previous elementaries transformations.

@ -249,7 +249,7 @@ Handle(Geom2d_TrimmedCurve) Geom2dConvert_ApproxArcsSegments::makeLine
// if the derivatives in the end points differ from the derivative line
// more than value of the specified continuity tolerance
// then a biarc should be build instead of a line.
// then a biarc should be built instead of a line.
const Standard_Real aContTolerance = ::Max(myAngleTolerance, 0.01);
if (absAngle[0] > aContTolerance || absAngle[1] > aContTolerance) {
//std::cout << "makeLine(): Line not built" << std::endl;
@ -257,7 +257,7 @@ Handle(Geom2d_TrimmedCurve) Geom2dConvert_ApproxArcsSegments::makeLine
}
} // end if (isCheck)
//bulding segment of line
//building segment of line
GCE2d_MakeSegment aMakeSeg (theFirst.Point(), theLast.Point());
if (aMakeSeg.IsDone()) {
Handle(Geom2d_TrimmedCurve) aCurve = aMakeSeg.Value();
@ -367,7 +367,7 @@ Standard_Boolean Geom2dConvert_ApproxArcsSegments::makeFreeform()
//=======================================================================
//function : getLinearParts
//purpose : method for geting inflection points
//purpose : method for getting inflection points
//=======================================================================
void Geom2dConvert_ApproxArcsSegments::getLinearParts (Geom2dConvert_SequenceOfPPoint& theSeqPar)
@ -730,7 +730,7 @@ Standard_Boolean Geom2dConvert_ApproxArcsSegments::checkCurve
if (aCurve.IsNull())
return Standard_False; // check fails on empty input
Standard_Boolean isUniformDone = !mySeqParams.IsEmpty();
//calcualtion sequence of the parameters or step by parameter.
//calculation sequence of the parameters or step by parameter.
Standard_Integer aNbPnts = (isUniformDone ? mySeqParams.Length() :MAXPOINTS);
Standard_Real aParamStep = (theLastParam - theFirstParam)/MAXPOINTS;

@ -45,7 +45,7 @@ public:
//! Append a curve in the BSpline
//! Return False if the curve is not G0 with the BSplineCurve.
//! Tolerance is used to check continuity and decrease
//! Multiplicty at the common Knot
//! Multiplicity at the common Knot
//! After is useful if BasisCurve is a closed curve .
Standard_EXPORT Standard_Boolean Add (const Handle(Geom2d_BoundedCurve)& NewCurve, const Standard_Real Tolerance, const Standard_Boolean After = Standard_False);

@ -44,11 +44,11 @@ public:
Standard_EXPORT Geom2dConvert_PPoint (const Standard_Real theParameter,
const Adaptor2d_Curve2d& theAdaptor);
//! Compute the distance betwwen two 2d points.
//! Compute the distance between two 2d points.
inline Standard_Real Dist (const Geom2dConvert_PPoint& theOth) const
{ return myPoint.Distance(theOth.myPoint); }
//! Query the parmeter value.
//! Query the parameter value.
inline Standard_Real Parameter () const { return myParameter; }
//! Query the point location.

@ -64,7 +64,7 @@ private:
//! : returns false for case when some points of polygon
//! : were replaced on line and exact point of intersection was not found
//! : for case when point of intersection was found
//! : during prelimanary search for line (case of bad paramerization of Bspline for example).
//! : during prelimanary search for line (case of bad parameterization of Bspline for example).
Standard_EXPORT Standard_Boolean findIntersect (const Adaptor2d_Curve2d& Curve1, const IntRes2d_Domain& Domain1, const Adaptor2d_Curve2d& Curve2, const IntRes2d_Domain& Domain2, const Standard_Real TolConf, const Standard_Real Tol, const Standard_Integer NbIter, const Standard_Real DeltaU, const Standard_Real DeltaV, const Geom2dInt_ThePolygon2dOfTheIntPCurvePCurveOfGInter& thePoly1, const Geom2dInt_ThePolygon2dOfTheIntPCurvePCurveOfGInter& thePoly2, const Standard_Boolean isFullRepresentation);
IntRes2d_Domain DomainOnCurve1;

@ -791,7 +791,7 @@ private:
First;
Standard_Real PreLast = 0.;
GeomAbs_Shape Cont;
gp_Vec Vec1,Vec2; //concecutive tangential vectors
gp_Vec Vec1,Vec2; //consecutive tangential vectors
gp_Pnt Pint;
Handle(Geom_BSplineCurve) Curve1,Curve2;
TColStd_Array1OfBoolean tabG1(0,nb_curve-2); //array of the G1 continuity at the intersections
@ -1019,7 +1019,7 @@ void GeomConvert::ConcatC1(TColGeom_Array1OfBSplineCurve& ArrayOfCurv
Standard_Real PreLast = 0.;
GeomAbs_Shape Cont;
gp_Vec Vec1,Vec2; //concecutive tangential vectors
gp_Vec Vec1,Vec2; //consecutive tangential vectors
gp_Pnt Pint;
Handle(Geom_BSplineCurve) Curve1,Curve2;
TColStd_Array1OfBoolean tabG1(0,nb_curve-2); //array of the G1 continuity at the intersections

@ -472,7 +472,7 @@ Handle(Geom_BSplineSurface) GeomConvert::SurfaceToBSplineSurface
gp_Torus Tr = TheElSurf->Torus();
//
// if isUClosed = true and U trim does not coinside with first period of torus,
// if isUClosed = true and U trim does not coincide with first period of torus,
// method CheckAndSegment shifts position of U seam boundary of surface.
// probably bug? So, for this case we must build not periodic surface.
Standard_Boolean isUFirstPeriod = !(UFirst < 0. || ULast > 2.*M_PI);

@ -94,7 +94,7 @@ public:
return myConvType;
}
//! Sets type of convertion
//! Sets type of conversion
void SetConvType(const GeomConvert_ConvType theConvType)
{
myConvType = theConvType;

@ -31,7 +31,7 @@
//! for use in math_BFGS algorithm.
//!
//! Parametrisation:
//! Cylinder is defined by its axis and radius. Axis is defined by 3 cartesian coordinats it location x0, y0, z0
//! Cylinder is defined by its axis and radius. Axis is defined by 3 cartesian coordinates at location x0, y0, z0
//! and direction, which is constant and set by user:
//! dir.x, dir.y, dir.z
//! The criteria is:

@ -230,9 +230,9 @@ Standard_Boolean GeomConvert_SurfToAnaSurf::GetCylByLS(const Handle(TColgp_HArra
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
//[R - aRelDev*R, R + aRelDev*R]. This intrrval is set
// for R as boundary values for dptimization algo.
// 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.
aStartPoint(1) = thePos.Location().X();
aStartPoint(2) = thePos.Location().Y();
@ -279,7 +279,7 @@ Standard_Boolean GeomConvert_SurfToAnaSurf::GetCylByLS(const Handle(TColgp_HArra
aDirMatrix(i, i) = 1.0;
//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();

@ -30,9 +30,9 @@ class Geom_Surface;
class Geom_SurfaceOfRevolution;
class Geom_Circle;
//! Converts a surface to the analitical form with given
//! Converts a surface to the analytical form with given
//! precision. Conversion is done only the surface is bspline
//! of bezier and this can be approximed by some analytical
//! of bezier and this can be approximated by some analytical
//! surface with that precision.
class GeomConvert_SurfToAnaSurf
{

@ -243,7 +243,7 @@ public:
Standard_EXPORT Handle(Geom_Geometry) Copy() const Standard_OVERRIDE;
//! Transformation of a geometric object. This tansformation
//! Transformation of a geometric object. This transformation
//! can be a translation, a rotation, a symmetry, a scaling
//! or a complex transformation obtained by combination of
//! the previous elementaries transformations.

@ -1428,7 +1428,7 @@ bool Graphic3d_Camera::FitMinMax (const Bnd_Box& theBox,
// but the axial scale is integrated into camera orientation matrix and the other
// option is to perform frustum plane adjustment algorithm in view camera space,
// which will lead to a number of additional world-view space conversions and
// loosing precision as well.
// losing precision as well.
const gp_Pnt aBndMin = theBox.CornerMin().XYZ().Multiplied (myAxialScale);
const gp_Pnt aBndMax = theBox.CornerMax().XYZ().Multiplied (myAxialScale);
if (aBndMax.IsEqual (aBndMin, RealEpsilon()))

@ -170,7 +170,7 @@ Standard_Boolean Graphic3d_CubeMapPacked::checkOrder (const NCollection_Array1<u
if (!anOrderIsValid)
{
throw Standard_Failure ("Ivalid order format in tiles of Graphic3d_CubeMapPacked");
throw Standard_Failure ("Invalid order format in tiles of Graphic3d_CubeMapPacked");
}
return anOrderIsValid;

@ -48,7 +48,7 @@ class Graphic3d_TransformPers;
//! 1) Non-modifiable, or unbounded, group ('black box').
//! Developers can repeat a sequence of
//! SetPrimitivesAspect() with AddPrimitiveArray() methods arbitrary number of times
//! to define arbitrary number of primitive "blocks" each having individual apect values.
//! to define arbitrary number of primitive "blocks" each having individual aspect values.
//! Any modification of such a group is forbidden, as aspects and primitives are mixed
//! in memory without any high-level logical structure, and any modification is very likely to result
//! in corruption of the group internal data.

@ -373,7 +373,7 @@ public:
}
//! Returns true if structure has mutable nature (content or location are be changed regularly).
//! Mutable structure will be managed in different way than static onces.
//! Mutable structure will be managed in different way than static ones.
Standard_Boolean IsMutable() const
{
return !myCStructure.IsNull()

@ -28,7 +28,7 @@ class Graphic3d_Texture1Dsegment;
DEFINE_STANDARD_HANDLE(Graphic3d_Texture1Dsegment, Graphic3d_Texture1D)
//! This class provides the implementation
//! of a 1D texture applyable along a segment.
//! of a 1D texture applicable along a segment.
//! You might use the SetSegment() method
//! to set the way the texture is "stretched" on facets.
class Graphic3d_Texture1Dsegment : public Graphic3d_Texture1D

@ -22,7 +22,7 @@
#include <Graphic3d_LevelOfTextureAnisotropy.hxx>
class TCollection_AsciiString;
//! This is an abstract class for managing texture applyable on polygons.
//! This is an abstract class for managing texture applicable on polygons.
class Graphic3d_TextureMap : public Graphic3d_TextureRoot
{
DEFINE_STANDARD_RTTIEXT(Graphic3d_TextureMap, Graphic3d_TextureRoot)

@ -66,7 +66,7 @@ private:
//! : returns false for case when some points of polygon
//! : were replaced on line and exact point of intersection was not found
//! : for case when point of intersection was found
//! : during prelimanary search for line (case of bad paramerization of Bspline for example).
//! : during prelimanary search for line (case of bad parameterization of Bspline for example).
Standard_EXPORT Standard_Boolean findIntersect (const Standard_Address& Curve1, const IntRes2d_Domain& Domain1, const Standard_Address& Curve2, const IntRes2d_Domain& Domain2, const Standard_Real TolConf, const Standard_Real Tol, const Standard_Integer NbIter, const Standard_Real DeltaU, const Standard_Real DeltaV, const HLRBRep_ThePolygon2dOfTheIntPCurvePCurveOfCInter& thePoly1, const HLRBRep_ThePolygon2dOfTheIntPCurvePCurveOfCInter& thePoly2, const Standard_Boolean isFullRepresentation);

@ -51,7 +51,7 @@ int iges_lire (FILE* lefic, int *numsec, char ligne[100], int modefnes)
else
{
/* PTV: 21.03.2002 it is necessary for files that have only `\r` but no `\n`
examle file is 919-001-T02-04-CP-VL.iges */
example file is 919-001-T02-04-CP-VL.iges */
while ( fgets ( ligne, 2, lefic ) && ( ligne[0] == '\r' || ligne[0] == '\n' ) )
{
}

@ -30,7 +30,7 @@ DEFINE_STANDARD_HANDLE(IGESSolid_SolidOfLinearExtrusion, IGESData_IGESEntity)
//! defines SolidOfLinearExtrusion, Type <164> Form Number <0>
//! in package IGESSolid
//! Solid of linear extrusion is defined by translatin an
//! Solid of linear extrusion is defined by translating an
//! area determined by a planar curve
class IGESSolid_SolidOfLinearExtrusion : public IGESData_IGESEntity
{

@ -21,7 +21,7 @@
//#60 rln 29.12.98 PRO17015
//:l3 abv 11.01.99: CATIA01.igs: using less values for checking short lines
//%11 pdn 12.01.98 CTS22023 correcting used tolerances
//sln 29.12.2001 OCC90 : Method checkBSplineCurve and varification before creation of bspline curves were added
//sln 29.12.2001 OCC90 : Method checkBSplineCurve and verification before creation of bspline curves were added
//=======================================================================
#include <ElCLib.hxx>
@ -80,7 +80,7 @@
//=======================================================================
//function : CheckBSplineCurve
//purpose : Check coincidede knots Check whether knots are in ascending
// order and difference between vaues of weights more than 1000.
// order and difference between values of weights more than 1000.
// Send corresponding messages. The function returns Standard_False
// if curve can not be created, Standard_True otherwise.
//=======================================================================
@ -89,7 +89,7 @@ static Standard_Boolean checkBSplineCurve(IGESToBRep_BasicCurve* t
TColStd_Array1OfReal& CKnots,
const TColStd_Array1OfReal& CWeights)
{
// check whether difference between vaues of weights more than 1000.
// check whether difference between values of weights more than 1000.
if(!theBSplineCurve->IsPolynomial()) {
Standard_Real aMinValue = CWeights.Value(CWeights.Lower());
Standard_Real aMaxValue = CWeights.Value(CWeights.Lower());

@ -22,7 +22,7 @@
//:p6 abv 26.02.99: improve messages after call to ConvertToPeriodic
//#75 rln 11.03.99: using message mechanism for periodic B-Spline
//S4181 pdn 15.04.99 implementing of reading IGES elementary surfaces.
//sln 29.12.2001 OCC90 : Method checkBSplineSurfaceStatus and varification of creation of bspline surfaces were added
//sln 29.12.2001 OCC90 : Method checkBSplineSurfaceStatus and verification of creation of bspline surfaces were added
//=======================================================================
#include <Geom_BSplineSurface.hxx>
@ -70,7 +70,7 @@
//=======================================================================
//function : CheckBSplineSurface
//purpose : Check coincidede knots. Check whether knots are in ascending
// order and difference between vaues of weights more than 1000.
// order and difference between values of weights more than 1000.
// Send corresponding messages. The function returns Standard_False
// if surface can not be created, Standard_True otherwise.
//=======================================================================
@ -80,7 +80,7 @@ static Standard_Boolean checkBSplineSurface(IGESToBRep_BasicSurface*
TColStd_Array1OfReal& SVKnots,
const TColStd_Array2OfReal& SWeights)
{
// check whether difference between vaues of weights more than 1000.
// check whether difference between values of weights more than 1000.
if(!theBSplineSurface->IsPolynomial()) {
Standard_Real aMinValue = SWeights.Value(SWeights.LowerRow(), SWeights.LowerCol());
Standard_Real aMaxValue = SWeights.Value(SWeights.LowerRow(), SWeights.LowerCol());

@ -20,7 +20,7 @@
//:q5 abv 19.03.99 unnecessary includes removed
//%14 03.03.99 pdn USA60022 do not insert lacking edge before fix missing seam
// pdn 10.03.99 S4135 Creating vertices using minimal tolerance.
//S4181 pdn 17.04.99 Inplementing of reading IGES elementary surfaces. Transform
//S4181 pdn 17.04.99 Implementing of reading IGES elementary surfaces. Transform
//pcurves using gp_Trsf2d that depends on type of pair (IGES surface, resulting
//CAS.CADE surface)
//szv#9:PRO19565:04Oct99 missing location for standalone vertices corrected

@ -301,7 +301,7 @@ void IntWalk_IWalking::ComputeOpenLine(const TColStd_SequenceOfReal& Umult,
Arrive = Standard_False;
break;
}
// necessairily N > 0 jag 940617
// necessarily N > 0 jag 940617
// point of stop given at input
PathPnt = Pnts1.Value(N);

@ -3493,7 +3493,7 @@ IntWalk_StatusDeflection IntWalk_PWalking::TestDeflection(const IntImp_ConstIso
Now, let substitute required deflection (tolconf or tolconf/2) to z. Then
it is necessary to check if e < z or if e > z.
In this case, it is enough to comapare Fs(e) and Fs(z).
In this case, it is enough to compare Fs(e) and Fs(z).
At that Fs(e) > 0 because sin(B/2) > 0 always.
Therefore, if Fs(z) < 0.0 then Fs(e) > Fs(z) ==> e < z definitely.

@ -43,7 +43,7 @@ public:
//! Empty constructor.
LocOpe_CSIntersector();
//! Creates and performs the intersection betwwen
//! Creates and performs the intersection between
//! <Ax1> and <S>.
LocOpe_CSIntersector(const TopoDS_Shape& S);

@ -43,11 +43,11 @@ public:
//! Empty constructor.
LocOpe_CurveShapeIntersector();
//! Creates and performs the intersection betwwen
//! Creates and performs the intersection between
//! <Ax1> and <S>.
LocOpe_CurveShapeIntersector(const gp_Ax1& Axis, const TopoDS_Shape& S);
//! Creates and performs yte intersection betwwen
//! Creates and performs yte intersection between
//! <C> and <S>.
LocOpe_CurveShapeIntersector(const gp_Circ& C, const TopoDS_Shape& S);

@ -41,7 +41,7 @@
//! application memory consumption!
//!
//! User should analyze all values in specific case to make correct decision
//! about memory (over)usage. This is also prefferred to use specialized
//! about memory (over)usage. This is also preferred to use specialized
//! tools to detect memory leaks.
//!
//! This also means that these values should not be used for intellectual

@ -38,7 +38,7 @@
//! class Functor
//! {
//! public:
//! void operator() ([proccesing instance]) const
//! void operator() ([processing instance]) const
//! {
//! //...
//! }

@ -358,11 +358,11 @@ protected: //! @name low-level redrawing sub-routines
protected: //! @name Rendering of GL graphics (with prepared drawing buffer).
//! Renders the graphical contents of the view into the preprepared shadowmap framebuffer.
//! Renders the graphical contents of the view into the prepared shadowmap framebuffer.
//! @param theShadowMap [in] the framebuffer for rendering shadowmap.
Standard_EXPORT virtual void renderShadowMap (const Handle(OpenGl_ShadowMap)& theShadowMap);
//! Renders the graphical contents of the view into the preprepared window or framebuffer.
//! Renders the graphical contents of the view into the prepared window or framebuffer.
//! @param theProjection [in] the projection that should be used for rendering.
//! @param theReadDrawFbo [in] the framebuffer for rendering graphics.
//! @param theOitAccumFbo [in] the framebuffer for accumulating color and coverage for OIT process.

@ -28,7 +28,7 @@ PCDM_SS_WriteFailure, //!< Attempt to write a file on disk failed
PCDM_SS_Failure, //!< A general error occurred (unexpected)
PCDM_SS_Doc_IsNull, //!< Attempt to save a null document
PCDM_SS_No_Obj, //!< Document has no objects to be saved
PCDM_SS_Info_Section_Error, //!< Error occured on writing of an information-section
PCDM_SS_Info_Section_Error, //!< Error occurred on writing of an information-section
PCDM_SS_UserBreak, //!< User interrupted the process of storage of the document on disk
PCDM_SS_UnrecognizedFormat //!< No storage driver exist for this document format
};

@ -511,7 +511,7 @@ void PLib::RationalDerivative(const Standard_Integer Degree,
//=======================================================================
//function : RationalDerivatives
//purpose : Uses Homogeneous Poles Derivatives and Deivatives of Weights
//purpose : Uses Homogeneous Poles Derivatives and Derivatives of Weights
//=======================================================================
void PLib::RationalDerivatives(const Standard_Integer DerivativeRequest,

@ -330,7 +330,7 @@ void PLib_JacobiPolynomial::D0123(const Standard_Integer NDeriv,
if (myTNorm.IsNull()) {
// Inizialization of myTNorm,myCofA,myCofB,myDenom
// Initialization of myTNorm,myCofA,myCofB,myDenom
myTNorm = new TColStd_HArray1OfReal(0,myDegree);
for (i=0; i<=myDegree; i++) {

@ -242,7 +242,7 @@ static Standard_Integer BUC60915_1(Draw_Interpretor& di, Standard_Integer argc,
}
Handle(AIS_InteractiveContext) context = ViewerTest::GetAISContext();
//The following dimesion code has problems regarding arrow_size. The desired effect is not produced.
//The following dimension code has problems regarding arrow_size. The desired effect is not produced.
/***************************************/
//First view
/***************************************/

@ -145,7 +145,7 @@ public:
//! Returns the value of the perceptual difference between this color
//! and @p theOther, computed using the CIEDE2000 formula.
//! The difference is in range [0, 100.], with 1 approximately corresponding
//! to the minimal percievable difference (usually difference 5 or greater is
//! to the minimal perceivable difference (usually difference 5 or greater is
//! needed for the difference to be recognizable in practice).
Standard_EXPORT Standard_Real DeltaE2000 (const Quantity_Color& theOther) const;

@ -1687,7 +1687,7 @@ void RWStepKinematics_RWActuatedKinPairAndOrderKinPair::WriteStep
(StepData_StepWriter& theSW,
const Handle(StepKinematics_ActuatedKinPairAndOrderKinPair)& theEnt) const
{
// --- Instance of plex componant BoundedCurve ---
// --- Instance of plex component BoundedCurve ---
theSW.StartEntity("(ACTUATED_KINEMATIC_PAIR");

@ -62,7 +62,7 @@ void RWStepKinematics_RWKinematicLinkRepresentationAssociation::ReadStep (const
StepRepr_RepresentationOrRepresentationReference aRepresentationRelationship_Rep2;
theData->ReadEntity (theNum, 4, "representation_relationship.rep2", theArch, aRepresentationRelationship_Rep2);
// Process only one type (Representaion)
// Process only one type (Representation)
if (aRepresentationRelationship_Rep1.CaseNumber() != 1 || aRepresentationRelationship_Rep1.CaseNumber() != 1)
return;

@ -233,7 +233,7 @@ void SelectMgr_RectangularFrustum::cacheVertexProjections (SelectMgr_Rectangular
// one another, only 2 vertices that belong to opposite faces can be projected
// to simplify calculations.
Standard_Integer aVertIdxs[6] = { LeftTopNear, LeftBottomNear, // opposite planes in height direction
LeftBottomNear, RightBottomNear, // opposite planes in width direcion
LeftBottomNear, RightBottomNear, // opposite planes in width direction
LeftBottomFar, RightBottomNear }; // opposite planes in depth direction
for (Standard_Integer aPlaneIdx = 0; aPlaneIdx < 5; aPlaneIdx += 2)
{

@ -826,8 +826,8 @@ Standard_Boolean ShapeAnalysis_CanonicalRecognition::GetSurfaceByLS(const TopoDS
// with relative precision about aRelDev.
// For example, if radius of sample surface is R,
// it means, that "exact" vaue is in interav
//[R - aRelDev*R, R + aRelDev*R]. This intrrval is set
// for R as boundary values for dptimization algo.
//[R - aRelDev*R, R + aRelDev*R]. This interval is set
// for R as boundary values for optimization algo.
FillSolverData(theTarget, thePos, theParams,
aStartPoint, aFBnd, aLBnd, aRelDev);

@ -38,7 +38,7 @@ public:
//! Empty constructor
Standard_EXPORT ShapeUpgrade_RemoveLocations();
//! Removes all location correspodingly to RemoveLevel.
//! Removes all location correspondingly to RemoveLevel.
Standard_EXPORT Standard_Boolean Remove (const TopoDS_Shape& theShape);
//! Returns shape with removed locations.

@ -182,7 +182,7 @@ public:
WriteMode_VertexMode WriteVertexMode = WriteMode_VertexMode_OneCompound; //<! Indicates which of free vertices writing mode is switch on
bool WriteSubshapeNames = false; //<! Indicates whether to write sub-shape names to 'Name' attributes of STEP Representation Items
bool WriteColor = true; //<! ColorMode is used to indicate write Colors or not
bool WriteNonmanifold = false; //<! Defines non-manifold topology writting
bool WriteNonmanifold = false; //<! Defines non-manifold topology writing
bool WriteName = true; //<! NameMode is used to indicate write Name or not
bool WriteLayer = true; //<! LayerMode is used to indicate write Layers or not
bool WriteProps = true; //<! PropsMode is used to indicate write Validation properties or not

@ -14,7 +14,7 @@
#include <StepData_Factors.hxx>
// ============================================================================
// Method : Consturctor
// Method : Constructor
// Purpose:
// ============================================================================
StepData_Factors::StepData_Factors()

@ -150,7 +150,7 @@ public:
//! same as above but accepts a CString (ex.: "..." directly)
Standard_EXPORT void SendComment (const Standard_CString text);
//! sets entity's StepType, opens brakets, starts param no to 0
//! sets entity's StepType, opens brackets, starts param no to 0
//! params are separated by comma
//! Remark : for a Multiple Type Entity (see Express ANDOR clause)
//! StartComplex must be called before sending components, then
@ -161,7 +161,7 @@ public:
Standard_EXPORT void StartEntity (const TCollection_AsciiString& atype);
//! sends the start of a complex entity, which is a simple open
//! bracket (without increasing braket level)
//! bracket (without increasing bracket level)
//! It must be called JUST AFTER SendEntity and BEFORE sending
//! components, each one begins by StartEntity
Standard_EXPORT void StartComplex();

@ -410,7 +410,7 @@ void StepToTopoDS_TranslateEdge::MakeFromCurve3D
if ( temp1 > preci || temp2 > preci ) {
// #25415: handling of special case found on some STEP files produced by FPX Expert 2013 (PCB design system):
// edge curve is line displaced from its true position but with correct direction;
// we can shift the line in this case so that it passes through vertices correcty
// we can shift the line in this case so that it passes through vertices correctly
if (Abs (temp1 - temp2) < preci && Abs (U2 - U1 - pnt1.Distance(pnt2)) < Precision::Confusion() &&
C1->IsKind(STANDARD_TYPE(Geom_Line)))
{

@ -207,7 +207,7 @@ Standard_Boolean TDataStd_TreeNode::InsertAfter (const Handle(TDataStd_TreeNode)
//=======================================================================
//function : Remove
//purpose : Removees the function from the function tree
//purpose : Removes the function from the function tree
//=======================================================================
Standard_Boolean TDataStd_TreeNode::Remove ()

@ -23,7 +23,7 @@
/**
* This class provides consistency check of the TObj model.
* It collects all inconsistencies in the status bits and prepaires
* It collects all inconsistencies in the status bits and prepares
* messages to be sent using SendStatusMessages (SendMessages) method.
* It supports also the fix mode, in which some inconsistencies are
* corrected.

@ -413,7 +413,7 @@ class TObj_Object : public Standard_Transient
public:
/**
* Method for updating object afrer restoring
* Method for updating object after restoring
*/
//! Performs updating the links and dependances of the object which are not

@ -66,7 +66,7 @@ class TObj_Partition : public TObj_Object
public:
/**
* Method for updating object afrer restoring
* Method for updating object after restoring
*/
//! Performs updating the links and dependencies of the object which are not

@ -24,7 +24,7 @@ class TObj_Model;
/**
* Attribute to store OCAF-based models in OCAF tree
* The persistency mechanism of the TObj_TModel allowes to save
* The persistency mechanism of the TObj_TModel allows to save
* and restore various types of models without recompilation of the schema
*/

@ -28,7 +28,7 @@ class TDF_Label;
/**
* Purpose: OCAF Attribute to storing objects (interfaces) of OCAF-based
* modelers in the OCAF tree.
* The persistency mechanism of the TObj_TObject allowes to save
* The persistency mechanism of the TObj_TObject allows to save
* and restore objects of various subtypes without recompilation of the schema
*/

@ -50,7 +50,7 @@ void TopClass_SolidClassifier::Perform(TheSolidExplorer& SolidExplorer,
gp_Lin L;
Standard_Real Par;
//-- We compute the intersection betwwen the line builded in the Solid Explorer
//-- We compute the intersection between the line builded in the Solid Explorer
//-- and the shape.
SolidExplorer.Segment(P,L,Par);

@ -394,7 +394,7 @@ public: //! @name grid management
//! Display grid echo at requested point in the view.
Standard_EXPORT void ShowGridEcho (const Handle(V3d_View)& theView, const Graphic3d_Vertex& thePoint);
//! Temporarly hide grid echo.
//! Temporarily hide grid echo.
Standard_EXPORT void HideGridEcho (const Handle(V3d_View)& theView);
public: //! @name deprecated methods

@ -211,14 +211,14 @@ public:
//! Returns True if the object has annotation plane.
Standard_Boolean HasPlane() const { return myHasPlane; }
//! Returns true, if connection point exists (for dimesional_size),
//! Returns true, if connection point exists (for dimensional_size),
//! if connection point for the first shape exists (for dimensional_location).
Standard_Boolean HasPoint() const { return myHasPoint1; }
// Returns true, if connection point for the second shape exists (for dimensional_location only).
Standard_Boolean HasPoint2() const { return myHasPoint2; }
//! Set connection point (for dimesional_size),
//! Set connection point (for dimensional_size),
//! Set connection point for the first shape (for dimensional_location).
void SetPoint(const gp_Pnt& thePnt) {
myPnt1 = thePnt;
@ -231,7 +231,7 @@ public:
myHasPoint2 = Standard_True;
}
//! Get connection point (for dimesional_size),
//! Get connection point (for dimensional_size),
//! Get connection point for the first shape (for dimensional_location).
gp_Pnt GetPoint() const {
return myPnt1;

@ -256,7 +256,7 @@ Standard_Integer XCAFDoc_AssemblyGraph::addNode(const TDF_Label& theLabel,
// =======================================================================
// function : Iterator constructor
// purpose : Iteration starts from the specifid node.
// purpose : Iteration starts from the specified node.
// =======================================================================
XCAFDoc_AssemblyGraph::Iterator::Iterator(const Handle(XCAFDoc_AssemblyGraph)& theGraph,

@ -520,7 +520,7 @@ static void rescaleDimensionRefLabels(const TDF_LabelSequence& theRefLabels,
if (!theBRepTrsf.IsDone())
{
Standard_SStream aSS;
aSS << "Dimmension PMI " << theEntryDimension << " is not scaled.";
aSS << "Dimension PMI " << theEntryDimension << " is not scaled.";
Message::SendWarning(aSS.str().c_str());
}
else

@ -105,7 +105,7 @@ void XSControl_WorkSession::SetController(const Handle(XSControl_Controller)& ct
ClearShareOut(Standard_False);
ClearFile();
// Set worksession parameters from teh controller
// Set worksession parameters from the controller
Handle(XSControl_WorkSession) aWorkSession(this);
myController->Customise (aWorkSession);

@ -387,19 +387,19 @@ void XSDRAWDE::Factory(Draw_Interpretor& theDI)
"\n\t\t: Dump special resource generated from global configuration."
"\n\t\t: '-path' - save resource configuration to the file"
"\n\t\t: '-recursive' - flag to generate a resource from providers. Default is On. Off disables other options"
"\n\t\t: '-format' - flag to generate a resource for choosen formats. If list is empty, generate it for all"
"\n\t\t: '-vendor' - flag to generate a resource for choosen vendors. If list is empty, generate it for all",
"\n\t\t: '-format' - flag to generate a resource for chosen formats. If list is empty, generate it for all"
"\n\t\t: '-vendor' - flag to generate a resource for chosen vendors. If list is empty, generate it for all",
__FILE__, DumpConfiguration, aGroup);
theDI.Add("LoadConfiguration",
"LoadConfiguration conf [-recursive {on|off}]\n"
"\n\t\t: 'conf' - path to the resouce file or string value in the special format"
"\n\t\t: 'conf' - path to the resource file or string value in the special format"
"\n\t\t: '-recursive' - flag to generate a resource for all providers. Default is true"
"\n\t\t: Configure global configuration according special resource",
__FILE__, LoadConfiguration, aGroup);
theDI.Add("CompareConfiguration",
"CompareConfiguration conf1 conf2\n"
"\n\t\t: 'conf1' - path to the first resouce file or string value in the special format"
"\n\t\t: 'conf2' - path to the second resouce file or string value in the special format"
"\n\t\t: 'conf1' - path to the first resource file or string value in the special format"
"\n\t\t: 'conf2' - path to the second resource file or string value in the special format"
"\n\t\t: Compare two configurations",
__FILE__, CompareConfiguration, aGroup);
theDI.Add("ReadFile",

@ -208,8 +208,8 @@ public:
Add(theRight);
}
//! Returns new vector as adding curent vector with the value "theRight".
//! An exception is raised if the vectors have not the same length.
//! Returns new vector as adding current vector with the value "theRight".
//! An exception is raised if the vectors do not have the same length.
//! An exception is raised if the lengths are not equal.
Standard_NODISCARD inline math_VectorBase Added(const math_VectorBase& theRight) const;

@ -6,7 +6,7 @@ puts "(case 2)"
puts "========================"
puts ""
##################################
## Big tolerance after "sewing" with tolearnce 0.5
## Big tolerance after "sewing" with tolerance 0.5
##################################
restore [locate_data_file OCC547.brep] a